| 摘要 |
PROBLEM TO BE SOLVED: To enable searching of an optimum path by setting a toll booth link for a toll booth on a toll road when searching a non-priority path of the toll road to add a specified weight to the cost of the toll booth link. SOLUTION: When a demand for searching a path is given from an operating section 3, a control part 1 reads the set state of priority or non-priority of a toll road of the operating section 3 and when the non-priority of the toll road is set, for example, 10 is set for the weight W to be added to a toll booth link. Then, a road map data containing a path searching section is read in from a map data memory medium 5 through a data reader 6 to search the optimum path between arbitrary two points set by the operating section 3. By this searching, a toll booth link is set anew for a toll booth of the toll road as mentioned above and the cost of the toll booth link is multiplied by the weight W 10 to determine the sum of the link costs. The path to minimize the sum of the link costs is defined as the optimum path to store the path searched into a RAM 13. |
