A Spatial Restricted Heuristic Algorithm of Shortest Path

The single-source shortest path problem based on the road network has many obvious geographic spatial characteristics. By designing the spatial data model of the road network and analyzing the geometric characteristic of the spatial trend of the path we form a spatial restricted function which can reduce the cost of searching the shortest path in the road network. The spatial restricted function is used in the heuristic algorithm as a kind of heuristic function. With this function the spatial restricted heuristic algorithm is designed and described. Experimental results show that: the cost of the spatial restricted heuristic algorithm is close to the heuristic A* algorithm, but it can obtain the optimal solution of the shortest path in real time by an iterative algorithm.