公交出行路径蚂蚁算法

李文勇; 王炜; 陈学武

公交出行路径蚂蚁算法

1.
东南大学江苏省交通规划与管理重点实验室, 江苏南京 210096
2.
东南大学江苏省交通规划与管理重点实验室, 广西桂林 541004

基金项目:

国家“十五”科技攻关项目 2002BA404A04

详细信息

作者简介:
李文勇(1976-), 男, 河南南阳人, 桂林电子工业学院讲师, 东南大学博士研究生, 从事交通运输规划与管理研究

中图分类号: U491
计量
- 文章访问数: 379
- HTML全文浏览量: 128
- PDF下载量: 246
- 被引次数: 0
出版历程
- 收稿日期: 2004-02-05
- 刊出日期: 2004-12-25

Bus travel transit path based on ant algorithm

1.
Key Laboratory for Transportation Planning and Management of Jiangsu Province, Southeast University, Nanjing 210096, China
2.
Department of Electronic Machinery and Traffic Engineering, Guilin University of Electronic Technology, Guilin 541004, China

More Information

Author Bio:
LI Wen-yong(1976-), male, doctoral student, 86-25-83794213, gl_lwy@sohu.com

摘要

摘要: 结合公交乘客出行的特点, 基于Dijkstra算法站点查询的出行路径选择方法, 提出了基于蚂蚁算法的具有最少换乘次数的公交出行路径查询算法。算法利用了蚂蚁寻食出行路径选择的行为特点, 通过线路激素强度的更新机制, 实现了以换乘次数最少和公交出行站点最少的公交出行路径选择优化目标。算法实际查询结果与实际相符。
- 交通信息工程 /
- 公共交通 /
- 蚂蚁算法 /
- 换乘 /
- 路径选择
Abstract: Considering the character of bus passenger travel, a bus travel transit path query algorithm with the least transfer times was brought out, which was based on ant algorithm and Dijkstra algorithm of bus stops query. Using the path selection character of ant looking for food and the principle of refreshing bus-line's hormone intensity, the algorithm achieved the optimization goals of bus travel path selection, which were the least transfer times and bus stops. Application results show that this method can reflect the real situation.
- traffic information engineering /
- public transportation /
- ant algorithm /
- transit /
- route choice

HTML全文

图 1 蚂蚁觅食

Figure 1. Routes of ant looking for food

下载: 全尺寸图片幻灯片

图 2 公交出行线网

Figure 2. Line-net of bus travel

下载: 全尺寸图片幻灯片

图 3 公交问路系统

Figure 3. Bus route choice system

下载: 全尺寸图片幻灯片

参考文献(8)

[1]	王炜, 陈学武. 城市交通可持续发展战略研究[J]. 现代城市研究, 2004, 19(2): 23-25. https://www.cnki.com.cn/Article/CJFDTOTAL-XDCS200402004.htm WANG Wei, CHEN Xue-wu. Research on the sustainable strategy of urban traffic[J]. Modern Urban Research, 2004, 19(2): 23-25. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-XDCS200402004.htm
[2]	DorigoM, Gambardella LM. Ant colony system: a cooperative learning approach to the travelling salesman problem[J]. IEEE Transaction, 1997, 1(1): 53-66.
[3]	张纪会. 一种新的进化算法——蚁群算法[J]. 系统工程理论与实践, 1999, 19(3): 84-87. https://www.cnki.com.cn/Article/CJFDTOTAL-XTLL903.012.htm ZHANG Ji-hui. A new evolutionary algorithmant colony algorithm [J]. Systems Engineering Theory and Practice, 1999, 19(3): 84-87. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-XTLL903.012.htm
[4]	唐策善, 黄刘生. 数据结构[M]. 北京: 高等教育出版社, 2001.
[5]	杨新苗. 城市公交优先发展的关键技术研究[D]. 南京: 东南大学, 2001.
[6]	周正, 刘泽民. 智能蚂蚁算法及其在电信网动态路由优化中的应用[J]. 电信科学, 1998, 14(11): 10-13. https://www.cnki.com.cn/Article/CJFDTOTAL-DXKX811.002.htm ZHOUZheng, LIUZe-min. Intelligent ant algorithmwith applications in dynamic routing optimization of telecommunication networks[J]. Telecommunications Science, 1998, 14(11): 10-13. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-DXKX811.002.htm
[7]	林国辉, 马正新, 王勇前, 等. 基于蚂蚁算法的拥塞规避路由算法[J]. 清华大学学报(自然科学版), 2003, 43(1): 1-4. https://www.cnki.com.cn/Article/CJFDTOTAL-QHXB200301001.htm LINGuo-hui, MAZheng-xin, WANG Yong-qian, et al. Ant-based routing algorithmwith congestion avoidance[J]. Journal of Tsinghua University(Science and Technology), 2003, 43(1): 1-4. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-QHXB200301001.htm
[8]	李文勇, 戴命和. 桂林市公交问路系统设计[J]. 交通与计算机, 2004, 22(1): 102-105. https://www.cnki.com.cn/Article/CJFDTOTAL-JTJS200401031.htm LI Wen-yong, DAI Ming-he. The design of guilin public transportation guiding systems[J]. Computer and Communications, 2004, 22(1): 102-105. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-JTJS200401031.htm