| 摘要 |
<p>PURPOSE:To automatically obtain the shortest route being efficient at the time of delivering plural pieces of baggage by providing a means for determining the shortest route for going the round of a house to which the baggage is to be delivered, and a means for displaying and outputting this shortest route. CONSTITUTION:A user inputs a full name of a person to whom baggage is to be delivered, from a keyboard of a map information input part 1, and this full name information is compared with a full name registered in a map information store part 3. In the case plural same full names exist, they are specified to one case by inputting additionally information of an address. By repeating this work, all houses to which delivery is to be executed are specified. Subsequently, a shortest route determining part 6 calculates a distance in the case these houses are connected with one piece of line, based on a position of each house, and road information stored in the map information store part 3. This distance is calculated with regard to delivery routes of all combinations, and the shortest route is selected. In such a way, the selected route is displayed on a shortest route display part 4, and a hard copy of the display contents is outputted to a shortest route output part 5.</p> |
