2006 年 126 巻 5 号 p. 654-660
Real-coded genetic algorithms (GAs) are effective methods for function optimization. Generally speaking, the major crossover methods used in real-coded GAs require a large execution time for calculating the fitness of many children at each crossover. Thus, a new crossover method is needed for searching such a large search space efficiently. A novel crossover method that generates children stepwise is proposed and applied to the conventional generation-alternation model. In experiments based on standard test functions and actual problems, the proposed model found an optimal solution 30-40% faster than did the conventional model.
J-STAGEがリニューアルされました! https://www.jstage.jst.go.jp/browse/-char/ja/