| 摘要 |
PROBLEM TO BE SOLVED: To save wasteful group searching and to process group searching in a short time by previously limiting a searching area from a start place and a destination. SOLUTION: Time range of route searching is limited from the start place O0 and the destination D0 . A straight line connecting the start place O0 and the destination D0 is set to be a base line, it is extended in the extending direction of the base line by (x) and a rectangle obtained by extending it in a vertical direction by (y) is set to be the range of searching as a simple method for limiting the area. Transfer nodes 1 and 3 become the objective nodes of searching since they are within the route searching area. Since transfer nodes 2 and 4 are out of the area, they become the nodes out of the object of searching. Then, all links connected to the transfer noes 2 and 4 become out of the object of group searching. When the long form of the Japanese archipelago is considered, the almost optimum solution can be obtained from the range if y=150 km and x=100 km are set. Thus, processing time depends on the position relation of the start place G0 and the destination D0 but it can be suppressed to not more than one of several quantity of former time. |
