| 摘要 |
PROBLEM TO BE SOLVED: To shorten search time by having a road net correspond to a group and searching a path based on genetic algorism in which a path from present address to destination corresponds to chromosome of an individual. SOLUTION: A path guidance program 820 which has a path guidance function and a path data 830 are provided. Path search processing of the program 820 calculates linear distance L from current position to destination by accessing map data 33 and counts intersection in a circle which uses a linear line from present address to destination as a diameter to obtain intersection node N. It compares road density N/L with a predetermined threshold value P and searches a path based on Dijkstra method when road density is low. Moreover, it searches a path based on genetic algorism when road density is high. Path data 830 such as path candidate is variable-length data consisting of node row and begins from present address node which corresponds to present address 63 and ends by destination node which corresponds to destination 73. |
