Study On Intelligent Scheduling Optimization Algorithm Of Public Bicycle System

As the development of economy and the acceleration of urbanization,the problem of road traffic becomes more and more serious.With the continuous development of urban economy,the accumulation of population and road traffic problems are becoming increasingly serious,this will lead to environmental pollution,traffic congestion and other issues become increasingly prominent,which seriously restricts the development of cities.In order to alleviate urban traffic congestion and reduce environmental pollution,as the increment of people's consciousness of environmental protection and the promotion of government,as the call of green travel slogan and the promotion of government,Public bicycle as a green means of transport,welcomed by the general public,it can solve the bus trip problem of "Last-Mile",share bus trip rate and alleviate the urban road traffic problems.However,in the operation of public bicycle,the problems of "no bicycle to rent" and "no place to return" caused by the tide trip of public bicycle has seriously affected the use of the public.In recent years,people pay more and more attention to green travel,therefore,the scheduling problem is imminent.Many domestic and overseas scholars have begun to study how to solve this problem,but their main work is the static scheduling problem,the actual application is not high.Because,in the scheduling process,people borrow the behavior of the bike is dynamic change,no regularity.Therefore,the study of dynamic scheduling has far-reaching significance.In this thesis,based on the analysis of the condition of public bicycle scheduling,this thesis clarifies the dispatching demand and introduces the regional scheduling model,Aiming at these problems in dynamic and static scheduling of public bicycle.Firstly,this paper studies the public bicycle static scheduling problem was divided into public bicycle dispatch area,and then construct the regional scheduling static model,is proposed for solving mixed static scheduling problem tabu genetic algorithm.In order to solve the scheduling region due to the large increase in the cost of scheduling problem based on K-means clustering,according to the user by the location information of the historical data and also bike rental stations,divided into dispatch area rental stations strong association,in order to reduce the cost in the process of static scheduling problem.Then,the experimental results show that the tabu search algorithm is superior to the genetic algorithmSecondly,on the basis of the static scheduling of public bicycles,this paper studies the dynamic scheduling algorithm of public bicycles,and proposes a variable neighborhood ant colony algorithm to solve the dynamic scheduling problem.In order to reduce the complexity of the dynamic scheduling of public bicycles,the paper proposes a dynamic scheduling algorithm of the time,a scheduling cycle T is divided into n time segments,a path selection at the end of time each time segment,in each time slice in consideration of user behavior also borrow bicycles on the rental site demand.By using this approach to solve the dynamic scheduling problem of public bicycle.Finally,it is proved that the convergence speed and the efficiency of the algorithm are better than other algorithms.