基于改进蚁群算法的城市公共自行车动态调度模型

Public Bicycle Dynamic Scheduling Model Based on Improved Ant Colony Algorithm

  • 摘要: 针对公共自行车系统运营中的借车难、还车难等问题,提出一种公共自行车分区动态调度方法.通过计算机仿真模拟站点间自行车调度,分析不合理、不及时等因素对调度产生的影响.以调度成本最小、转运量最大为目标,建立城市公共自行车分区调度模型,基于改进蚁群算法求解该模型最优调度路径.以丹阳市公共自行车站点数据为例,对模型进行验证,结果表明该算法可以求解得出最优调度回路,且准确性高、求解效率高.

     

    Abstract: According to the operation problem of public bicycle systems, this paper focuses on proposing a public bicycle partition scheduling method. Based on improved ant colony algorithm, a public bicycle partition scheduling model with lowest cost and biggest traffic volume was established. The bicycle scheduling between sites was simulated and the impact of different factors was analyzed. The data of Danyang public bicycle system was taken as an example to verify the improved ant colony algorithm model. The result proves that the algorithm can solve the optimal scheduling loop with a high accuracy and high solution efficiency.

     

/

返回文章
返回