| 摘要 |
<p>PURPOSE: To speed up the route simulation on a digital map and to improve a value added by using a highly precise Dijkstra's algorithm on the periphery of a starting point and main roads and using a high speed priority link method at a peripheral part where the number of links is large and branch roads. CONSTITUTION: A deliverer inputs a present position and delivery scheduled time to a delivery possible range decision supporting system against the roods and a main delivery place, which are displayed on a screen. Thus, a range which the deliverer can deliver within driving scheduled time is displayed and the main delivery possible place in an area is displayed. In such a case, a node data generation processing 110 takes the lengths of the links almost equal, and the link is divided when the deviation of the link is large so as to arrange it to the length of the other links. A stepwise arrival possible range calculation processing 150 realizes high speed and highly precise retrieval by combining the high speed search method and a highly precise retrieval method. Namely, the main roads are calculated by using the highly precise Dijkstra's algorithm and the branch roads except for the main roads are calculated by using the high speed priority link method.</p> |
