| 基于蚁群算法的公交车最佳路径问题研究 |
| |
| 引用本文： | 黄敏. 基于蚁群算法的公交车最佳路径问题研究[J]. 琼州学院学报, 2009, 16(2): 13-15 |
| |
| 作者姓名： | 黄敏 |
| |
| 作者单位： | 海南大学信息科学技术学院,海南,海口,570228;琼州学院数学系,海南,三亚,572022 |
| |
| 摘 要： | 通过减少公交路线上的出行时间，可以提高城市公交出行者比例，从而使交通拥挤程度得到缓解。论文提出了一种基于蚁群算法的最佳路径选择问题的新模型。该模型在综合考虑交通因素的前提下。选择出用时最短的公交车最佳路径。研究及模拟实验结果表明，新的算法模型是可行的。
|
| 关 键 词： | 蚁群算法 交通拥挤 车流密度 最佳路径 |
On the Selection of Optimal Path for Bus which Based on Ant Colony Algorithm |
| |
| HUANG Min. On the Selection of Optimal Path for Bus which Based on Ant Colony Algorithm[J]. Journal of Qiongzhou University, 2009, 16(2): 13-15 |
| |
| Authors: | HUANG Min |
| |
| Affiliation: | 1.College of Information Science and Technology;Hainan University;Haikou Hainan 570228;2 Department of Mathematics;Qiongzhou University;Sanya Hainan 572022;Chian |
| |
| Abstract: | The proportion of city bus going out can be improved by reducing the time on the way of public transportation routes,thus the traffic congestion degree can be relieved.The paper presents a new mode for the selection of optimal path which based on ant colony algorithm.On the premise of making comprehensive consideration for the transportation factors,it selects the shortest bus optimal path.The result of the research and simulation experiment shows that the new mode is workable. |
| |
| Keywords: | ant colony algorithm traffic congestion traffic flow density optimal path |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
