| 摘要 |
PROBLEM TO BE SOLVED: To provide a method and device for searching a route, together with a recording medium in which a program for realizing it is recorded, for shortening the time required for searching a route. SOLUTION: A district on a map is divided into a plurality of searching sections, and corresponding to each of search sections, such candidate road as superhighway and federol road expected to be commonly used as well as a junction (entrance/exit point) to the candidate road are decided and stored in advance. When searching for a route, a candidate road corresponding to a search section including a start point S and that including an end point G as well as junctions c, b, and d to the candidate road are called, for obtaining a distance searching road network N comprising only a candidate route. By calculating cost, a main route L1 is obtained from a long-distance searching road network N. A normal route searching is performed with both ends (junction b and junction d) of the main route L1 and between the starting point S and the end point G, to obtain a recommended route L2. Thus, a long-distance route searching process is conducted more easily than conventionally. |
