基于蚁群算法的公共自行车站间调度优化  

Optimal Dispatch between Stations for Public Bicycle Based on Ant Colony Algorithm

作　　者：柳祖鹏[1,2] 李克平[2] 朱晓宏[1] 

机构地区：[1]武汉科技大学汽车与交通工程学院,武汉430081 [2]同济大学交通运输工程学院,上海201804

出　　处：《交通信息与安全》2012年第4期71-74,共4页Journal of Transport Information and Safety

摘　　要：公共自行车系统在实际运行中存在借车难、还车难等问题,站间自行车调度不合理、不及时是主要原因。根据自行车调度的实际情况,考虑公共自行车系统特殊的调度车容量约束和下一站点补给约束,建立公共自行车站间调度的数学模型。通过改进常规旅行商问题求解的蚁群算法,以满足自行车调度的约束条件。在Matlab中编程实现改进的蚁群算法,并以武汉市关山光谷片区的24个自行车站点为例,用改进的蚁群算法求解调度回路,结果表明该算法可以求解得到最优调度回路。There are some inconveniences to borrow and return bicycles during operation of public bicycle system.The key reasons are that the number of bicycles assigned each site is unreasonable,and the dispatch of bicycles between sites is not timely.According to actual situation of bicycle dispatch,and based on the special dispatch vehicle capacity constraints and next site supply constraints in public bicycle system,mathematical model of optimal dispatch between stations for public bicycle system is built.In order to meet the bicycle dispatch constraints,the ant colony algorithm for solving the conventional traveling salesman problem is improved.Programming in Matlab has improved ant colony algorithm.Taking 24 bicycle sites at Guanshan Optical Valley area,Hongshan District in Wuhan City as example,the dispatch loop is solved with improved ant colony algorithm.The results show that the algorithm can solve the optimal dispatch loop.

关 键 词：公共自行车系统 自行车调度 蚁群算法 旅行商问题 

分 类 号：U491.225[交通运输工程—交通运输规划与管理]