OPTIMUM ROUTE AND OPTIMUM CIRCULATION ROUTE SEARCHING METHOD

摘要

PROBLEM TO BE SOLVED: To search in a short time an optimum route through all designated via points with little calculation quantity.;SOLUTION: A prescribed number of routes (individuals), which are expressed in expanded genetic types, from a start S to a goal G are prepared as an initial individual group and by repeatedly applying a genetic algorithm to that individual group expressed with the expanded genetic types, the optimum route from the start through all designated via points A and B to the goal is searched. In this case, the weight is determined corresponding to the number of designated via the points included in the individual (route), and the inverse of a value multiplying the weight to a distance from the start of that individual to the goal is defined as the evaluation function of the genetic algorithm.;COPYRIGHT: (C)2000,JPO