| 摘要 |
PROBLEM TO BE SOLVED: To improve withdrawability from a local solution by a global search, while maintaining increase in the rate of approaching an optimum solution in a genetic algorithm. SOLUTION: A genetic algorithm execution device comprises a mutation probability determination means 22 for obtaining a congestion degree, showing the convergence state of a parent individual 21 and determining the mutation probability from the congestion degree, and a mutation processing means 23 for performing mutation processing to genetic information of the individual based on the mutation probability. When the individuals of the local solution become predominant in a population 20, the congestion degree increases, thereby the mutation probability and strengthening the broad area search function is increased. By the special mutation processing for dynamically controlling the mutation probability, it is made possible to improve the probability of reaching an optimum solution regardless of a local solution, while maintaining the effect of increasing the rate of approaching the optimum solution. COPYRIGHT: (C)2009,JPO&INPIT
|
