Bus travel transit path based on ant algorithm

LI Wen-yong; WANG Wei; CHEN Xue-wu

Volume 4 Issue 4

Turn off MathJax

Article Contents

Article Navigation > Journal of Traffic and Transportation Engineering > 2004 > 4(4): 102-105

Next Previous

LI Wen-yong, WANG Wei, CHEN Xue-wu. Bus travel transit path based on ant algorithm[J]. Journal of Traffic and Transportation Engineering, 2004, 4(4): 102-105.

Citation:

LI Wen-yong, WANG Wei, CHEN Xue-wu. Bus travel transit path based on ant algorithm[J]. Journal of Traffic and Transportation Engineering, 2004, 4(4): 102-105.

LI Wen-yong, WANG Wei, CHEN Xue-wu. Bus travel transit path based on ant algorithm[J]. Journal of Traffic and Transportation Engineering, 2004, 4(4): 102-105.

Citation:

LI Wen-yong, WANG Wei, CHEN Xue-wu. Bus travel transit path based on ant algorithm[J]. Journal of Traffic and Transportation Engineering, 2004, 4(4): 102-105.

PDF( 225 KB)

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
Received Date: 2004-02-05
Publish Date: 2004-12-25

Abstract

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

FullText(HTML)

References(8)

References

[1]	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]	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]	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]	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]	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