The Analysis And Research On Shortest Path Of Regional Road Network Based On Expenses

With the development of computer science and geographical information science, geographical information system has been used widely because of its strong spatial analysis function.Route analysis is one of the most general and basic function in GIS. Its key content is the optimum route analysis. In this paper, the main content is the application of optimum route analysis to the transportation. The whole framework is based on establishing model, studying algorithm and achieving system. The author analysises the difference between highway and city road transportation in detail, and finds an exact abstract model of road network. According to the network model of transportation, the total expense consists in oil consumption, road charge and depreciation. The author establishes an expense model of optimum route analysis. Traditional Dijkstra algorithm is a shortest path one. When the road network has much nodes, the classical Dijkstra algorithm occupies much memory and the computer has to process many invalid counts. Based on above shortcomings, an impoved algorithm is bought forward, which uses judgement language to avoid much invalid computation. Before computation, the computer will judge if the current node is connected with the above optimum node. If they are connected, the computer will go on to compute their distance. Otherwise, it will not. Finally, an overall scheme of"Inquiry system of shortest path of regional road network based on expenses"is brought forward. The author uses integration on MapInfo to achieve the system, and based on the real data some fouctions have been achieved.