A general coarse-graining framework for studying simultaneous inter-population constraints induced by evolutionary operations

The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evolutionary operations on populations of genotypes. This technique allows us to understand compositional changes induced by evolutionary operations in terms of constraints between populations. Deep insight into the population-level effect of some evolutionary operation is possible when multiple constraints can be derived for all pairs of pre and post operative populations; for each such pair of populations the constraints between them are then said to hold simultaneously. When selection is fitness proportional we show that any coarse-graining of the genotype set can be used to systematically derive single constraints between between all pairs of pre and post selection populations. Matters are not so simple in the case of variation. We develop an abstract condition called ambivalence and show that when a coarse-graining and a variation operation satisfy this condition then a systematic derivation of single constraints between all pairs of pre and post variation populations is possible. Finally we show that it is possible to use schema partitions to systematically derive simultaneous constraints for any combination of variation operations that are commonly used in GAs.

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

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

[3]  Michael D. Vose.  Infinite Population GA Tutorial , 2004 .

[4]  L. Altenberg.  The evolution of evolvability in genetic programming , 1994 .

[5]  A. Wright,et al.  Form Invariance and Implicit Parallelism , 2001, Evolutionary Computation.

[6]  John H. Holland,et al.  A Derived Markov Process for Modeling Reaction Networks , 2003, Evolutionary Computation.

[7]  Michael D. Vose,et al.  The simple genetic algorithm - foundations and theory , 1999, Complex adaptive systems.

[8]  D. E. Goldberg,et al.  Genetic Algorithms in Search, Optimization & Machine Learning , 1989 .

[9]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

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

[11]  Marc Toussaint.  The evolution of genetic representations and modular neural adaptation , 2004 .

[12]  Alden H. Wright,et al.  Implicit Parallelism , 2003, GECCO.

[13]  John H. Holland,et al.  Building Blocks, Cohort Genetic Algorithms, and Hyperplane-Defined Functions , 2000, Evolutionary Computation.

[14]  Christopher R. Stephens,et al.  Coarse-Graining in Genetic Algorithms: Some Issues and Examples , 2003, GECCO.

[15]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

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