Optimal path algorithm of road network with traffic restriction

WANG Feng-yuan; PAN Fu-quan; ZHANG Li-xia; ZOU Xu-dong

Volume 5 Issue 1

Turn off MathJax

Article Contents

Article Navigation > Journal of Traffic and Transportation Engineering > 2005 > 5(1): 92-95

Next Previous

WANG Feng-yuan, PAN Fu-quan, ZHANG Li-xia, ZOU Xu-dong. Optimal path algorithm of road network with traffic restriction[J]. Journal of Traffic and Transportation Engineering, 2005, 5(1): 92-95.

Citation:

WANG Feng-yuan, PAN Fu-quan, ZHANG Li-xia, ZOU Xu-dong. Optimal path algorithm of road network with traffic restriction[J]. Journal of Traffic and Transportation Engineering, 2005, 5(1): 92-95.

WANG Feng-yuan, PAN Fu-quan, ZHANG Li-xia, ZOU Xu-dong. Optimal path algorithm of road network with traffic restriction[J]. Journal of Traffic and Transportation Engineering, 2005, 5(1): 92-95.

Citation:

WANG Feng-yuan, PAN Fu-quan, ZHANG Li-xia, ZOU Xu-dong. Optimal path algorithm of road network with traffic restriction[J]. Journal of Traffic and Transportation Engineering, 2005, 5(1): 92-95.

PDF( 314 KB)

Optimal path algorithm of road network with traffic restriction

1.
School of Automobile and Traffic Engineering, Qingdao Technological University, Qingdao 266033, China
2.
School of Energy and Power, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China

More Information

Author Bio:
WANG Feng-yuan(1963-), male, PhD, professor, 86-532-5071311, fy58wang@qtech.edu.cn
Received Date: 2004-07-17
Publish Date: 2005-03-25

Abstract

Abstract

Based on the principle of the shortest path algorithm in graphic theory, this paper described the optimal path solution in practical urban road network, which includes traffic control signal. The characteristics of road network with restricted routes were analyzed, the corresponding mathematic model was constructed to convert it into another road network with free routes. The relationship of road network joints was expressed, the traditional Dijkstra algorithm was optimized by dynamic adjacent node relation matrix and adjacent node weight matrix, the corresponding algorithm was constructed. A vehicle guidance system was developed with the optimized Dijkstra algorithm to find the optimal routes in the network. The results indicate that the system can reduce the computation nodes of road networks.
- traffic planning,
- road network,
- vehicle guidance system,
- optimal path algorithm,
- traffic restriction

FullText(HTML)

References(8)

References

[1]	LIU Can-qi. Shortest path including deday of each flow at intersection and its algorithm[J]. Journal of Tongji University, 2002, 30(1): 52-53. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-TJDZ200201010.htm
[2]	郑祖武. 现代城市交通[M]. 北京: 人民交通出版社, 1998.
[3]	ZHANG Chang-jian. A novel traffic monitoring and command automation system design[J]. Computer Engineering and Design, 2001, 22(3): 44-46. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-SJSJ200103011.htm
[4]	Dial R B. A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees[J]. Network, 1979, 25(3): 215-248.
[5]	Benjamin Zhan F. Three fastest shortest path algorithms on real road networks[J]. Journal of Geographic Information and Decision Analysis, 1995, 1(1): 69-82.
[6]	严尉敏, 吴伟民. 数据结构[M]. 北京: 清华大学出版社, 1997.
[7]	ZHANG Fei-zhou. Research on dispatching methods of public traffic vehicles in intelligent transport system[J]. China Journal of Highway and Transport, 2003, 16(2): 82-85. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-ZGGL200302020.htm
[8]	LI Jun. Vehicle visual scheduling system[J]. Journal of Traffic and Transportation Engineering, 2004, 4(1): 80-83. (in Chinese) cle/id/200401020