Font Size: a A A

Study On Demand Measurement And Scheduling Algorithm Of Public Bicycle

Posted on:2021-12-16Degree:MasterType:Thesis
Country:ChinaCandidate:C M WangFull Text:PDF
GTID:2492306734478964Subject:Software engineering
Abstract/Summary:PDF Full Text Request
Public bicycle as a new format of sharing economy,with the continuous expansion of the scale,effectively improved the "last mile" problem of urban transportation and provided convenience for people to travel.However,while cities are gradually promoting the construction of public bicycle systems,they are also accompanied by many problems.Among them,the most common and representative one is the problem of "difficult to rent or return a bike".When users arrive at the station to rent or return a car,they often encounter the problems of "no bike to borrow" and "no land to return".In order to solve this problem,this study will start from the two points of bicycle station delivery volume calculation and scheduling optimization between stations,hoping to establish a simulation model to determine the optimal initial delivery volume of the station to solve the problem of unbalanced demand.At the same time,on the basis of deriving the best delivery volume,a scheduling model for public bicycle stations is proposed,and an optimization algorithm is proposed to improve the scheduling efficiency.The main results of this article include:(1)Aiming at the problem of measuring the amount of public bicycles,this paper studies from the perspective of simulation.The management simulation software Arena is used to perform statistical analysis on the data of the research station.Based on Arena,the public bicycle operation model is constructed.Design simulation experiments,optimize the stations with unbalanced demand derived from the simulation results,and determine the best delivery amount for public bicycle stations.(2)Aiming at the construction of scheduling model,the vehicle routing problem(VRP)and its mathematical model are explored.The influencing factors of the scheduling model are analyzed and the constraints are established.The demand for public bicycle stations can be positive or negative.It is necessary to arrange a reasonable scheduling route,with the minimum number of vehicles and the shortest scheduling time as the goal to build a public bicycle scheduling model.(3)Aiming at the problem of public bicycle scheduling algorithm,the basic principles of ant colony algorithm are summarized,and several classic improved algorithms are briefly described.In view of the long search time of the ant colony algorithm and the insufficient pheromone update,combining the ant colony algorithm and the saving algorithm,the optimal solution obtained by the saving algorithm is used to initialize the initial pheromone of the ant colony algorithm.A three-layer pheromone update strategy is proposed,and the update method of the global pheromone is improved.(4)Instance verification.For public bicycle stations with unbalanced demand,the proposed model is used to perform scheduling experiments on the basis of known delivery volume of each station.The algorithm studied in this article is compared with the conventional ant colony algorithm and the algorithm studied by the predecessors,and the experimental comparative analysis is carried out to verify the effectiveness and feasibility of the improved algorithm.
Keywords/Search Tags:Vehicle Scheduling, Arena, Ant Colony Algorithm, Saving Algorithm
PDF Full Text Request
Related items