DocumentCode
2453658
Title
A developed Dijkstra algorithm and simulation of urban path search
Author
Yin Chao
Author_Institution
Sch. of Sci., Shandong Univ. of Technol., Zibo, China
fYear
2010
fDate
24-27 Aug. 2010
Firstpage
1164
Lastpage
1167
Abstract
A developed Dijkstra shortest path search algorithm is proposed through improving data structure, preprocessing to remove redundant vertices and setting the search region sequence. The average running time before and after improvement is compared and analyzed through the simulation tests. The results show that the developed Dijkstra shortest path search algorithm can improve storage efficiency and reduce meaningless operation, shorten the operation time and increase search space and time complexity.
Keywords
computational complexity; search problems; transportation; Dijkstra shortest path search algorithm; data structure; time complexity; urban path search; Algorithm design and analysis; Cities and towns; Complexity theory; Computational modeling; Data structures; Heuristic algorithms; Roads; Dijkstra algorithm; search region sequence; simulation; the shortest path;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Education (ICCSE), 2010 5th International Conference on
Conference_Location
Hefei
Print_ISBN
978-1-4244-6002-1
Type
conf
DOI
10.1109/ICCSE.2010.5593700
Filename
5593700
Link To Document