The shortest path approximation algorithm for large scale road network

Node importance has significant influence on the calculation of shortest path of large-scale road network. A shortest path estimation method based on node importance is proposed in this paper that is suitable for large-scale network. This method integrates the criteria importance though intercrieria correlation (CRITIC) method with complex network theory, with a view to evaluate nodes importance. By combining the restriction strategy to realize network division, the effective simplification of large-scale road network and shortest path estimation are realized through the construction of hierarchical network. The results show that this method can be used to distribute the center nodes evenly, and make little difference in the size of the subnetwork. As the constraint parameter increases, the numbers of nodes and edges reduced gradually, and the query accuracy reached 1.026. Compared with single index and unlimited parameters methods, this paper significantly reduces the size of the network and obtains a high accuracy on the approximate calculation of the shortest path. These will provide a new way of thinking for approximate analysis of large-scale complex networks