交通信息与安全2012，Vol.30Issue(4)：71-74,4.DOI:10.3963/j.issn 1674-4861.2012.04.016
基于蚁群算法的公共自行车站间调度优化
Optimal Dispatch between Stations for Public Bicycle Based on Ant Colony Algorithm
柳祖鹏 1李克平 2朱晓宏2
作者信息
- 1. 武汉科技大学汽车与交通工程学院 武汉430081
- 2. 同济大学交通运输工程学院 上海201804
- 折叠
摘要
Abstract
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.关键词
公共自行车系统/自行车调度/蚁群算法/旅行商问题Key words
public bicycle system/ bicycle dispatch/ ant colony algorithm/ traveling salesman problem分类
交通工程引用本文复制引用
柳祖鹏,李克平,朱晓宏..基于蚁群算法的公共自行车站间调度优化[J].交通信息与安全,2012,30(4):71-74,4.
