Research on an Improved Algorithm for Shortest Path Searching in Urban Traffic Based on GIS

摘要

the shortest path problem is always a principal issue in the applications of GIS. After the analysis of the existing shortest path searching algorithms, and with a view to the actual state of the urban traffic, an improved adjacency matrix was presented, when a new improved shortest path searching algorithm based on GIS was proposed. Meanwhile, combining the present city traffic existent problem, a dynamic shortest weighted path searching algorithm in urban traffic was preliminary developed. All those can be referenced for scientific management in urban traffic.