Driving route search method using hierarchical heuristic

摘要

The present invention relates to a method for searching a shortest path between a starting point and a destination in a network structure by converting network structure data stored in a disk into a directed graph, the method comprising: modeling road network data including a rotation limit as a directed graph for a path search; Limiting network data to be searched by hierarchical heuristic among the data of the network structure modeled in the step according to the search command specifying the destination and the destination; and creating a directed graph in the main memory through the step and performing the shortest path algorithm. It provides a driving route search method using a hierarchical heuristic, characterized in that it comprises the step of searching for a route from the starting point to the destination. According to the present invention, it is possible to reduce the amount of data read into the main memory and thus to efficiently search for a driving route in a shorter time.