基于蚁群算法的公共自行车调度模型研究——以许昌市东城区为例

Optimization Model of Public Bicycle Scheduling in DongchengDistrict of Xuchang City based on Ant Colony Algorithm

蚁群算法在路径规划问题方面有着广泛的应用,以公共自行车调度车的行驶里程最短为目标,以调度车容量等为约束条件,利用蚁群算法对调度模型求解,得到了最短路径长度及调度方案.进而对于算法中的蚂蚁数量、信息素启发因子、期望启发因子进行了敏感性分析,结果表明,蚁群算法对于求解这一类调度问题是一个较为有效的算法,可以得到较为理想的结论.

Ant colony algorithm is widely used in path planning.Taking the shortest mileage of the public bicycle as the goal and the capacity of the scheduling vehicle as the constraints, the ant colony algorithm is used to solve the scheduling model, and the shortest path length and scheduling scheme are obtained.Then, the number of ants, pheromone heuristic factor and expected heuristic factor in the algorithm are analyzed.Finally, the results show that ant colony algorithm is a more suitable algorithm for solving this kind of scheduling problem, to get a more ideal conclusion.