Improvement of Dijkstra´s algorithm and its application in route planning

In order to improve the efficiency of road network route planning,many experts and scholars have conducted some studies, Dijkstra´s algorithm is a research hotspot. The Dijkstra´s algorithm has its own shortcomings when seeking an optimal path between two points, but it has irreplaceable advantages. Through the analysis of strengths and weaknesses of the classic Dijkstra´s algorithm, we can find that the main drawbacks can be summarized as two points: storage structure and searching area. Therefore, the paper has improved these two points, namely the improvement of data storage structure and the searching area of restricted algorithms. And its validity is obtained by analyzing the experimental results.