Developed Dijkstra shortest path search algorithm and simulation

This paper presents an improved Dijkstra shortest path search algorithm. The algorithm considers the different types of weights, set the priority target search region, reduce the large number of meaningless operations, in order to improve search efficiency. We do some relevant testing based on the s...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	2010 International Conference On Computer Design and Applications Jg. 1; S. V1-116 - V1-119
Hauptverfasser:	Yin Chao, Wang Hongxia
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.06.2010
Schlagworte:	Algorithm design and analysis Computational modeling Computer networks Costs Dijkstra algorithm first search region Graph theory Road transportation shortest path Shortest path problem simulation Telecommunication traffic Testing Traffic control
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	This paper presents an improved Dijkstra shortest path search algorithm. The algorithm considers the different types of weights, set the priority target search region, reduce the large number of meaningless operations, in order to improve search efficiency. We do some relevant testing based on the shortest distance and shortest time through simulation. The simulation show that the improved Dijkstra shortest path search algorithm can reduce the computation time.
DOI:	10.1109/ICCDA.2010.5541129