| 摘要 |
PROBLEM TO BE SOLVED: To retrieve an optimal travelling route of each movement body in a plurality of movement bodies.SOLUTION: A route optimization program is configured to make a computer execute: processing of letting the closest distance among a plurality of movement bodies and the longest hour to be taken for travelling upon travelling a plurality of points by the plurality of movement bodies be an output variable, letting a movement start point of each movement body, a movement direction thereof, and area information specifying an area where each movement body moves be an input variable, optimizing the input variable, and acquiring the output variable serving as an optimal solution; and processing of outputting a travelling route for each movement body calculated by using the input variable when the output variable is the optimal solution.SELECTED DRAWING: Figure 7 |
