Analysis of Mixing in Genetic Algorithms: A Survey

Ensuring building-block (BB) mixing is critical to the success of genetic and evolutionary algorithms. There has been a growing interest in analyzing and understanding BB mixing and it is necessary to organize and categorize representative literature. This paper presents an exhaustive survey of studies on one or more aspects of mixing. In doing so, a classification of the literature based on the role of recombination operators assumed by those studies is developed. Such a classification not only highlights the significant results and unifies existing work, but also provides a foundation for future research in understanding mixing in genetic algorithms.

[1]  H. Geiringer.  On the Probability Theory of Linkage in Mendelian Heredity , 1944 .

[2]  H. Grüneberg,et al.  Introduction to quantitative genetics , 1960 .

[3]  Norman T. J. Bailey.  Introduction to the mathematical theory of genetic linkage. , 1961 .

[4]  M. G. Bulmer,et al.  Introduction to the mathematical theory of genetic linkage , 1962 .

[5]  John Daniel. Bagley,et al.  The behavior of adaptive systems which employ genetic and correlation algorithms : technical report , 1967 .

[6]  George R. Price,et al.  Selection and Covariance , 1970, Nature.

[7]  Daniel Raymond Frantz,et al.  Nonlinearities in genetic adaptive search. , 1972 .

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

[9]  Kenneth Alan De Jong,et al.  An analysis of the behavior of a class of genetic adaptive systems. , 1975 .

[10]  R. Elston.  The mathematical theory of quantitative genetics , 1982 .

[11]  James E. Baker,et al.  Adaptive Selection Methods for Genetic Algorithms , 1985, International Conference on Genetic Algorithms.

[12]  D. E. Goldberg,et al.  Simple Genetic Algorithms and the Minimal, Deceptive Problem , 1987 .

[13]  David E. Goldberg,et al.  An Analysis of Reproduction and Crossover in a Binary-Coded Genetic Algorithm , 1987, ICGA.

[14]  David E. Goldberg,et al.  Finite Markov Chain Analysis of Genetic Algorithms , 1987, ICGA.

[15]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[16]  F. B. Christiansen.  5. The Effect Of Population Subdivision On Multiple Loci Without Selection , 1989 .

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

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

[19]  David E. Goldberg,et al.  Genetic Algorithms and Walsh Functions: Part II, Deception and Its Analysis , 1989, Complex Syst..

[20]  Kalyanmoy Deb,et al.  Messy Genetic Algorithms: Motivation, Analysis, and First Results , 1989, Complex Syst..

[21]  Kenneth A. De Jong,et al.  An Analysis of Multi-Point Crossover , 1990, FOGA.

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

[23]  Larry J. Eshelman,et al.  The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination , 1990, FOGA.

[24]  Kalyanmoy Deb,et al.  A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.

[25]  Gunar E. Liepins,et al.  Punctuated Equilibria in Genetic Search , 1991, Complex Syst..

[26]  Kalyanmoy Deb,et al.  Genetic Algorithms, Noise, and the Sizing of Populations , 1992, Complex Syst..

[27]  Kalyanmoy Deb,et al.  Analyzing Deception in Trap Functions , 1992, FOGA.

[28]  Lashon B. Booker,et al.  Recombination Distributions for Genetic Algorithms , 1992, FOGA.

[29]  Heinz Mühlenbein,et al.  Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization , 1993, Evolutionary Computation.

[30]  Dirk Thierens,et al.  Toward a Better Understanding of Mixing in Genetic Algorithms , 1993 .

[31]  Dirk Thierens,et al.  Mixing in Genetic Algorithms , 1993, ICGA.

[32]  Lee Altenberg,et al.  The Schema Theorem and Price's Theorem , 1994, FOGA.

[33]  Yuval Rabani,et al.  Simulating quadratic dynamical systems is PSPACE-complete (preliminary version) , 1994, STOC '94.

[34]  Larry J. Eshelman,et al.  Productive Recombination and Propagating and Preserving Schemata , 1994, FOGA.

[35]  Prügel-Bennett,et al.  Analysis of genetic algorithms using statistical mechanics. , 1994, Physical review letters.

[36]  Adam Prügel-Bennett,et al.  A Statistical Mechanical Formulation of the Dynamics of Genetic Algorithms , 1994, Evolutionary Computing, AISB Workshop.

[37]  Yuval Rabani,et al.  A computational view of population genetics , 1995, STOC '95.

[38]  Michael S. Waterman,et al.  Genetic mapping and DNA sequencing , 1996 .

[39]  Dirk Thierens.  Dimensional Analysis of Allele-Wise Mixing Revisited , 1996, PPSN.

[40]  M. McPeek.  An Introduction to Recombination and Linkage Analysis , 1996 .

[41]  M. Rattray.  Modelling the dynamics of genetic algorithms using statistical mechanics , 1996 .

[42]  A. Prügel-Bennett,et al.  The dynamics of a genetic algorithm for simple random Ising systems , 1997 .

[43]  David E. Goldberg,et al.  The Race, the Hurdle, and the Sweet Spot , 1998 .

[44]  A. Sinclair,et al.  A computational view of population genetics , 1998 .

[45]  Soraya B. Rana.  The distributional biases of crossover operators , 1999 .

[46]  Christopher R. Stephens,et al.  Schemata Evolution and Building Blocks , 1999, Evolutionary Computation.

[47]  Dirk Thierens,et al.  Scalability Problems of Simple Genetic Algorithms , 1999, Evolutionary Computation.

[48]  Adam Prügel-Bennett,et al.  The Mixing Rate of Different Crossover Operators , 2000, FOGA.

[49]  Zbigniew Michalewicz,et al.  Evolutionary Computation 1 , 2018 .

[50]  William M. Spears,et al.  The Equilibrium and Transient Behavior of Mutation and Recombination , 2000, FOGA.

[51]  D. Goldberg,et al.  A practical schema theorem for genetic algorithm design and tuning , 2001 .

[52]  Pavel Pudlák.  Complexity Theory and Genetics: The Computational Power of Crossing Over , 2001, Inf. Comput..

[53]  Thomas D. LaToza,et al.  On the supply of building blocks , 2001 .

[54]  David E. Goldberg,et al.  The Design of Innovation: Lessons from and for Competent Genetic Algorithms , 2002 .

[55]  D. E. Goldberg,et al.  An analysis of a reordering operator on a GA-hard problem , 1990, Biological Cybernetics.

[56]  R. B. Robbins.  Some Applications of Mathematics to Breeding Problems III. , 1917, Genetics.