Analysis on Improved Dijkstra Algorithm in Intelligent Transportation System

Article Preview

Abstract:

Intelligent transportation system (ITS) is a complicated system, and selecting the shortest path is the core of the system. In order to ease traffic congestion of the city, through solving the shortest path, the key technology in realizing the function of ITS, and based on the analysis of traditional Dijkstra algorithm, the paper puts forward the improved algorithm. The new algorithm includes two parts, that is, preprocessing and real-time pruning research, and the effect of pruning totally depends on the division of specific diagram.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

877-881

Citation:

Online since:

August 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