| 摘要 |
PROBLEM TO BE SOLVED: To obtain a means capable of quickly finding out a solution for a problem finding out the shortest route written by one stroke by a simple constitution by making a plan for minimizing or maximizing the value of a prepared object function. SOLUTION: A setting means 2 has a function for receiving a given problem to be a planning object and a function for receiving variables or constants necessary for planning. A planning means 1 is a means for preparing an optimum visit route, and prepares an object function expressing an item minimizing or maximizing the given problem and executes processing for making a plan for maximizing or minimizing the value of the object function. The sum of inter-node distances, the sum of inter-node moving time, or the like is applied as the object function. A storage means 3 stores problems applied through the setting means 2 and constants, conditions, etc., to be used for planning. A display means 4 displays a visit route obtained as a planned result. |
