Research and Improvement on Optimal Path Analysis Algorithm Based on Cost-Distance Grid

The optimal path analysis based on cost distance grid is another common path analysis method besides the network path analysis. How to improve the efficiency of generating cost distance grid is a major difficulty in this method and how to reduce the repeated calculation and comparison is the key challenge in improving the efficiency. Based on "Node/Link" model, this paper adopts the Dijkstra algorithm idea, and extends it to multiple source optimal path finding, presents an algorithm of only calculating the source cell\´s neighboring cells which influence the calculation of working accumulative cost distance. Besides, some optimized storage and sorting techniques are also introduced.