公共自行车系统站间调度优化研究

Research of Optimal Scheduling Between Stations for Public Bicycle System School of Automobile and Traffic Engineering, Wuhan University of Science and Technology

国内多个城市开始推行公共自行车，但都存在借车难及还车难的问题，关键在于站点配车数不合理、站间调度不及时。运用运筹学中货郎担问题动态规划的解题思路，分两步求解站间调度路径：先收集自行车；再发放自行车，综合两步得到最优调度路径。通过建立简单数学模型并求解，证明货郎担问题解题思路可以用于解决公共自行车系统自行车调度优化。提供了一种站间调度优化的解决思路，真正实际应用还需解决数据挖掘和货郎担问题编程处理等问题。

Cities in China have begun the implementation of public bicycle system, with common problem of the inconvenience to borrow and return bicycles. The key reasons are： the number of bicycles assigned each site is unreasonable, the scheduling of bicycles between sites is not timely. The use of ＂ operational research＂ in solving traveling salesman problem dynamic programming ideas to solve two-step scheduling path between stations： at first collecting bicycles; then releasing bicycles, integrating two steps to obtain optimal scheduling path. Through the establishment of a simple mathematical model and solution, the solving ideas to traveling salesman problem can be used to solve the issue of public bicycle scheduling optimization. This paper just provides a solution thought to optimized scheduling between stations, short of in practical application to solve data mining and programming dealing with issues such as Traveling Salesman Problem.