DocumentCode
3424197
Title
Developed Dijkstra shortest path search algorithm and simulation
Author
Yin Chao ; Wang Hongxia
Author_Institution
Sch. of Sci., Shandong Univ. of Technol., Zibo, China
Volume
1
fYear
2010
fDate
25-27 June 2010
Abstract
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.
Keywords
graph theory; search problems; Dijkstra shortest path search algorithm; priority target search region; relevant testing; Algorithm design and analysis; Computational modeling; Computer networks; Costs; Graph theory; Road transportation; Shortest path problem; Telecommunication traffic; Testing; Traffic control; Dijkstra algorithm; first search region; shortest path; simulation;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Design and Applications (ICCDA), 2010 International Conference on
Conference_Location
Qinhuangdao
Print_ISBN
978-1-4244-7164-5
Electronic_ISBN
978-1-4244-7164-5
Type
conf
DOI
10.1109/ICCDA.2010.5541129
Filename
5541129
Link To Document