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

Full description

Saved in:

Bibliographic Details
Published in:	2010 International Conference On Computer Design and Applications Vol. 1; pp. V1-116 - V1-119
Main Authors:	Yin Chao, Wang Hongxia
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.06.2010
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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