| 摘要 |
PROBLEM TO BE SOLVED: To prevent a route passing through a bypass of a short router length from becoming a recommending route. SOLUTION: In a searching processing device 9, first of all, a departure position and an objective position are set. Next, a searching part 13 successively searches a road link constituting a route up to the objective position from the departure position from map data. An operation part 14 reads out and accumulatively adds route costs of road links of respective routes, and finds its sum as an accumulative cost. Then, an attribute change judging part 15 judges whether or not an attribute of a road changes in respective connection nodes in the routes, and only when it changes, an adjusting cost is added to the accumulative cost by an adjusting part 16. A combination judging part 17 also investigates the whole road links connected to the respective nodes in the routes, and only when its combination is a predetermined combination, the adjusting cost is added to the accumulative cost by an adjusting part 18. Finally, a deciding part 19 decides a route on which an accumulative cost is minimum in among the whole routes as a recommending route. |
