| 摘要 |
PROBLEM TO BE SOLVED: To divide a large number of spots to be patrolled into a plurality of division groups, and to simultaneously search each division patrol path so that the costs of division patrol paths patrolling at each spot in each divided group can be made almost equal. SOLUTION: A spot division means 210 divides respective patrol object spots into division groups according to the number of division, and searches and stores all the shortest paths between two spots as the object of patrol, and a GA processing means 155 calculates the evaluation value of the patrol path at each spot in the division group as the sum of path costs by using a genetic algorithm, and when the evaluation value is more excellent than gene in an already existing group, adds it to the gene group, and advances the division patrol path search, and an SA processing means 211 exchanges the division group by selecting every arbitrary spot in the arbitrary plurality of division groups until a predetermined trial frequency is reached by a simulated annealing method, or until the best solution is not updated during the designated trail frequency, and evaluates the evaluation value searched by the GA processing means 155, and updates the best solution. COPYRIGHT: (C)2007,JPO&INPIT |
