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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	2010 International Conference On Computer Design and Applications Ročník 1; s. V1-116 - V1-119
Hlavní autoři:	Yin Chao, Wang Hongxia
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	IEEE 01.06.2010
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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