| 摘要 |
PROBLEM TO BE SOLVED: To simultaneously search round route of each divided area so as to approximately equal for the cost of round route in each divided area, when there are many round spots over a wide area, so that the spot is divided into a plurality of areas. SOLUTION: The searching system for searching the plurality of spots to round are divided into areas, the round route in each area are searched, wherein the number of division, and spot information are inputted, the area-dividing means 210 for dividing the are into the plurality of areas following to the spot allocation pattern, based on the number of divisions and prescribed factors, and the route cost predicting means 220 predicts the route cost in each area. If the predicted value is not within the prescribed region, the area-dividing means 210 redivides the area. The round route search means 150 calculates the evaluation value, based on the sum of route cost, corresponding to the rounding order, at obtaining of the optimum round route by using the gene algorithm; and if the evaluation value is better than the genes in the existing group, the round route is calculated, in addition to the gene group. COPYRIGHT: (C)2007,JPO&INPIT |
