Method and device for searching shortest path of road network

Abstract

The invention discloses a method and device for searching the shortest path of a road network. The method comprises the following steps of dividing the road network into a plurality of sub-networks to generate the road network with a tree structure; calculating the shortest path between boundary nodes of the sub-networks at the same layer; inputting an enquiry point and a target point; according to the shortest path, implementing a dynamic programming algorithm to obtain the initial shortest path between the enquiry point and the target point; and supplementing the initial shortest path to obtain the complete shortest path between the enquiry point and the target point. According to the method, the road network is divided into the plurality of sub-networks so as to generate the road network with the tree structure, and the shortest distance between the boundary nodes of the sub-networks at the same layer is calculated, so that the shortest path between the enquiry point and the target point can be rapidly obtained when the enquiry point and the target point are input; the method and the device not only are high in efficiency, but also well meet the requirement of real-time property.

Description

technical field [0001] The invention relates to the technical field of map search, in particular to a shortest path search method and device for road networks. Background technique [0002] The shortest path problem is a classic algorithm problem in graph theory research, which aims to find the shortest path between two nodes in a graph (composed of nodes and paths). In related technologies, for example, the Dijkstra algorithm is a traditional solution, and its main feature is to expand outward layer by layer around the starting point until it reaches the end point. However, although the Dijkstra algorithm can obtain the optimal solution of the shortest path, it traverses and calculates too many nodes, which leads to low efficiency and cannot well meet the real-time requirements. Contents of the invention [0003] The present invention aims at solving one of the technical problems in the related art mentioned above at least to a certain extent. [0004] Therefore, an obj...

AI Technical Summary

Problems solved by technology

However, although the Dijkstra algorithm can obtain the optimal solution of the shortest path, there are too many nodes in the traversal calculation, which leads to low efficiency and cannot well meet the real-time requirements.

Images