The Online Dispatch Strategy Of Public Bicycles With Piles Based On Limited Prevision Information

The scheduling optimization of public bicycles with piles is a hot issue of concern to the social and academic circles.The existing research often assumes that the number of public bicycles at each station is known before the dispatching vehicle departs and then obtains the solution of the optimal dispatch scheme by using the static optimization method.Or it is assumed that the number of public bicycles at each station is unknown before the dispatching vehicle departs.The stochastic optimization method is used to establish the dispatch optimization model and solve the optimal dispatch scheme.Therefore,in view of the fact that the information of the number of public bicycles at each station cannot be fully known before the departure of the vehicle,this paper intends to study the optimization problem of public bicycle dispatch with piles on limited prevision information.With the goal of minimizing the total cost(the sum of the vehicle driving cost and penalty cost),the theory and method of online problem and competition strategy are adopted to design the online dispatch strategy about the number of public bicycles at the next station predicted and the number of public bicycles at all stations at the current time predicted,which can provide references for operating enterprises to formulate dispatch strategies.The main work and innovative achievements are as follows.The online dispatch strategy based on the number of public bicycles with piles at the next station can be predicted is designed.In the situation where each station should be traversed once and the number of public bicycles at the next station predicted for dispatch vehicles,the online scheduling optimization problem is proposed.Then by adopting online method,the online dispatch model is established with the goal of minimizing the total cost(the combination of driving costs and penalty costs)as possible.Then a greedy strategy is designed,followed by analyzing the competition ratio of greedy strategy.Finally,an example is given to illustrate the greedy strategy.The online dispatch strategy based on the number of public bicycles with piles on all stations at the current time predicted is designed.In the situation where each station should be traversed once and the number of public bicycles on all stations at the current time predicted for dispatch vehicles,the online scheduling optimization problem is proposed.Then by adopting online method,the online dispatch model is established with the goal of minimizing the total cost(the combination of driving costs and penalty costs)as possible.Then a matching strategy is designed,followed by analyzing the competition ratio of matching strategy.Finally,an example is given to illustrate the matching strategy.The online dispatch strategies of public bicycles with piles designed in this paper can provide references for operating enterprises to formulate dispatch strategies.