Improved Shortest Path Algorithm for Restricted Searching Area
Xianzhong Zhou · Journal of Nanjing University of Science and Technology · 2009
Algorithmic efficiency of the shortest path searching is a problem which has brought wide attention and needs to be resolved urgently in many application fields.Based on the classical Dijkstra's shortest path algorithm,the optimization means is analyzed.A restricted rectangle searching area algorithm is proposed to reduce the searching area.In order to improve the running efficiency,variational ratio coefficients are used during path searching to adapt the characteristic of the road network path searching.The experiment on the prototype system shows that the algorithm presented here is highly effective and feasible.