Research on Urban Road Network Shortest Path Heuristic Algorithm
Huang De · Journal of Highway and Transportation Research and Development · 2006
With the development of geographic information science and the wide use of GIS software,there are more demand for network analyses.This paper introduces a new algorithm to get the shortest path between two points in urban road network,based on the geographic characteristic of the road network.The algorithm improved the searching way of Dijkstra's algorithm by making use of heuristic information to search along the most suitable path.It can greatly reduce the searching space,increase the searching speed and be of important practical significance.