The Science of Breeding and Its Application to the Breeder Genetic Algorithm (BGA)

The breeder genetic algorithm (BGA) models artificial selection as performed by human breeders. The science of breeding is based on advanced statistical methods. In this paper a connection between genetic algorithm theory and the science of breeding is made. We show how the response to selection equation and the concept of heritability can be applied to predict the behavior of the BGA. Selection, recombination, and mutation are analyzed within this framework. It is shown that recombination and mutation are complementary search operators. The theoretical results are obtained under the assumption of additive gene effects. For general fitness landscapes, regression techniques for estimating the heritability are used to analyze and control the BGA. The method of decomposing the genetic variance into an additive and a nonadditive part connects the case of additive fitness functions with the general case.

[1]  É. Verrier,et al.  Methods for predicting response to selection in small populations under additive genetic models: a review , 1991 .

[2]  Lashon B. Booker,et al.  Proceedings of the fourth international conference on Genetic algorithms , 1991 .

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

[4]  M. Kimura,et al.  An introduction to population genetics theory , 1971 .

[5]  Heinz Mühlenbein,et al.  Evolution in Time and Space - The Parallel Genetic Algorithm , 1990, FOGA.

[6]  F. N. David,et al.  LINEAR STATISTICAL INFERENCE AND ITS APPLICATION , 1967 .

[7]  C. Darwin.  The Origin of Species by Means of Natural Selection, Or, The Preservation of Favoured Races in the Struggle for Life , 1859 .

[8]  In Schoenauer,et al.  Parallel Problem Solving from Nature , 1990, Lecture Notes in Computer Science.

[9]  M. Kimura,et al.  The neutral theory of molecular evolution. , 1983, Scientific American.

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

[11]  Calyampudi R. Rao,et al.  Linear Statistical Inference and Its Applications. , 1975 .

[12]  Heinz Mühlenbein,et al.  How Genetic Algorithms Really Work: Mutation and Hillclimbing , 1992, PPSN.

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

[14]  Rosedith Sitgreaves Bowker.  Statistics, Second Edition , 1983 .

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

[16]  A. Gray,et al.  I. THE ORIGIN OF SPECIES BY MEANS OF NATURAL SELECTION , 1963 .

[17]  Heinz Mühlenbein,et al.  Analysis of Selection, Mutation and Recombination in Genetic Algorithms , 1995, Evolution and Biocomputation.

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

[19]  Heinz Mühlenbein,et al.  Estimating the Heritability by Decomposing the Genetic Variance , 1994, PPSN.

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

[21]  SchwefelHans-Paul,et al.  An overview of evolutionary algorithms for parameter optimization , 1993 .

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

[23]  Thomas Bäck,et al.  Optimal Mutation Rates in Genetic Search , 1993, ICGA.