The Comparison Of Optimization To Shortest Path Algorithm Based On GIS

The shortest path algorithm is often used in transportation, artificial intelligence, telecommunication and urban planning fields; we can save our time as well as improve the efficiency by utilizing this algorithm. The most of optimization on shortest path algorithm in GIS field is followed in computer science and graph theory fields without consideration the special features that GIS has, such as the coordinates, direction and so on. This research compared some of typical algorithm optimization and showed specific application condition based on the test in regarding the performance. In this process, a common data structure was designed that can be applied in the typical algorithm mentioned before.The researching on algorithm is a kind of work that needs both theory and practice. The research combined the features of GIS and the software system analysis, a flexible data structure was designed for the optimization to the shortest path algorithm. I choose a open source GIS data source for better show the process of the optimization. In this process, I write my own program to read the basic data from data source and calculate the network topology information that will be used in the algorithm.