Exploiting synergies of multiple crossovers: initial studies

Genetic algorithms (GAS) are believed to exploit the synergy between diKerent traversals of the solution space that are afforded by crossover and mutation operators. While dozens of different crossovers are known, comparatively little attention has been devoted to improving performance by using multiple crossover operators within a given GA implementation. Here, we examine various aspects of combining different crossovers; we demonstrate that mixtures of crossovers can outperform any single crossover, and that choosing appropriate mixing proportions is critical for good performance. We conjecture that good crossover mixtures are characterized by “balance” in the crossovers’ respective influences in the population, and explore three adaptive strategies for mixing crossovers.

[1]  L. C. Stayton,et al.  On the effectiveness of crossover in simulated evolutionary optimization. , 1994, Bio Systems.

[2]  Andrew B. Kahng,et al.  A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

[3]  Larry J. Eshelman,et al.  Biases in the Crossover Landscape , 1989, ICGA.

[4]  F. Thomas Leighton,et al.  Complexity Issues in VLSI , 1983 .

[5]  Larry J. Eshelman,et al.  On Crossover as an Evolutionarily Viable Strategy , 1991, ICGA.

[6]  Andrew B. Kahng,et al.  Toward More Powerful Recombinations , 1995, ICGA.

[7]  Kenneth A. De Jong,et al.  An Analysis of the Interacting Roles of Population Size and Crossover in Genetic Algorithms , 1990, PPSN.

[8]  William M. Spears,et al.  Adapting Crossover in Evolutionary Algorithms , 1995, Evolutionary Programming.

[9]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[10]  William M. Spears,et al.  A Study of Crossover Operators in Genetic Programming , 1991, ISMIS.

[11]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

[12]  Byung Ro Moon,et al.  A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs , 1994, 31st Design Automation Conference.

[13]  J. David Schaffer,et al.  An Adaptive Crossover Distribution Mechanism for Genetic Algorithms , 1987, ICGA.

[14]  Terry Jones,et al.  Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms , 1995, ICGA.

[15]  Derek Smith,et al.  Bin Packing with Adaptive Search , 1985, ICGA.

[16]  Pinaki Mazumder,et al.  A genetic approach to standard cell placement using meta-genetic parameter optimization , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  Larry J. Eshelman,et al.  Crossover's Niche , 1993, ICGA.