Shortest Path Optimization Algorithm in Intelligent Transportation System

Article Preview

Abstract:

To ensure the smooth flow of urban traffic, through analysis of shortest path solution, the key technology to the realization of intelligent transportation system, and on the basis of traditional Dijkstra algorithm analysis, a new optimization algorithm is put forward.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1778-1782

Citation:

Online since:

June 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Dijkstra E. W. A Note on Two Problems in Connection with Graphs. Numerische Mathematik, 1959, 1: 269-71.

Google Scholar

[2] Floyd R. N. Algorithm 97 Shortest Path. Comm ACM, 1962, 5(6): 345.

Google Scholar

[3] Ramming, M. S. Network Knowledge and Route Choice. PhD, MIT, Cambridge, MA, Unpublished, 2002.

Google Scholar

[4] Yang Zhao-sheng. Introduction to Intelligent Transportation System. Beijing: China Communications Press, 2003.

Google Scholar

[5] Zhan F. B. Three Fastest Shortest Path Algorithms on Real Road Net-works: Data Structures and Procedures. JGIDA. 1998. 1(1): 69-82.

Google Scholar