The effects of supermajority on multi-parent crossover

Multi-parent crossover allows more than two parents participating in crossover. The increase of parents in crossover intensifies exploitation or exploration or both; however, the intensification is often unbalanced and consequently causes deterioration in performance. In this paper we propose the use of supermajority to address the issue of lopsided intensification on exploitation and exploration in multi-parent crossover. The proposed crossover, called biased occurrence-based scanning crossover (bOB), controls the tendency toward exploitation or exploration by the threshold in supermajority. Two adaptive strategies are developed to adjust the threshold of bOB. Experimental results indicate that bOB can achieve significant improvement on uniform crossover and occurrence- based scanning crossover in both solution quality and convergence speed. Precisely, the improvement in mean best fitness ranges from 4-89% on our test problems. The preferable results validate that bOB crossover can not only enhance the performance but also provide an effective way to control the exploitation and exploration in crossover.

[1]  S. Tsutsui,et al.  On the Effect of ulti-parents ecombination in Genetic Algorithms , 1998 .

[2]  Shigeyoshi Tsutsui,et al.  A study on the effect of multi-parent recombination in real coded genetic algorithms , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[3]  Thomas Bäck,et al.  An Overview of Evolutionary Algorithms for Parameter Optimization , 1993, Evolutionary Computation.

[4]  Shigenobu Kobayashi,et al.  Multi-Parental Extension of the Unimodal Normal Distribution Crossover for Real-Coded Genetic Algorithms , 2000 .

[5]  A. E. Eiben,et al.  Genetic algorithms with multi-parent recombination , 1994, PPSN.

[6]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[7]  A. E. Eiben,et al.  Diagonal Crossover in Genetic Algorithms for Numerical Optimization , 1997 .

[8]  Shigeyoshi Tsutsui,et al.  Multi-parent Recombination in Genetic Algorithms with Search Space Boundary Extension by Mirroring , 1998, PPSN.

[9]  A. E. Eiben,et al.  Orgy in the Computer: Multi-Parent Reproduction in Genetic Algorithms , 1995, ECAL.

[10]  Heinz Mühlenbein,et al.  The parallel genetic algorithm as function optimizer , 1991, Parallel Comput..

[11]  H. Muhlenbein,et al.  Gene pool recombination and utilization of covariances for the Breeder Genetic Algorithm , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[12]  Chuan-Kang Ting,et al.  On the Mean Convergence Time of Multi-parent Genetic Algorithms Without Selection , 2005, ECAL.

[13]  Hans-Paul Schwefel,et al.  Evolution and optimum seeking , 1995, Sixth-generation computer technology series.

[14]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[15]  A. E. Eiben,et al.  Multiparent recombination in evolutionary computing , 2002 .

[16]  Chuan-Kang Ting On the convergence of multi-parent genetic algorithms , 2005, 2005 IEEE Congress on Evolutionary Computation.

[17]  M. Yamamura,et al.  Multi-parent recombination with simplex crossover in real coded genetic algorithms , 1999 .