Simulation of the shortest path search based on improved Dijkstra algorithm
Chao Yin · Journal of Shandong University of Technology · 2010
The shortest path algorithm based on improved Dijkstra algorithm was proposed through setting high priority target search area,which can reduce the large number of meaningless operations and improve search efficiency.System simulation model is established taking Zibo traffic road map(local) as an example.Simulation is conducted using different weights of distance coefficient and congestion coefficient between two points,and the shortest path solutions are obtained based on different weights.Algorithm testing data before and after improvement were analyzed and compared.The results show that the actual average running time of improved Dijkstra algorithm is only less than 23% of the average running time of Dijkstra algorithm.