| 摘要 |
<p>A route search method includes: a step in which a computer extracts, from map data, nodes and links included in a map area in which a departure point and a destination point are included; a step in which the computer calculates, for those links, link costs related to energy consumption or energy regeneration; a step in which the computer generates a first network by, for each of the nodes and each of the links extracted, generating a plurality of duplicates thereof; a step in which the computer generates a second network by adding first and second additional links to the first network; and a step in which the computer searches for a route from a duplicate of a node corresponding to the departure point to a duplicate of a node corresponding to the destination point, using the second network. The first additional links are links for which predetermined non negative link costs are set, and in each of which a node of an end point of a duplicate of each of the links is changed to a node of an end point of another duplicate of the each of the links. The second additional links are links for which predetermined non negative link costs are set, and each of which connects between duplicates of node corresponding to the destination point.</p> |
