Exact schema theory for GP and variable-length GAs with homologous crossover

In this paper we present a new exact schema theory for genetic programming and variable-length genetic algorithms which is applicable to the general class of homologous crossovers. These are a group of operators, including GP one-point crossover and GP uniform crossover, where the offspring are created preserving the position of the genetic material taken from the parents. The theory is based on the concepts of GP crossover masks and GP recombination distributions (both introduced here for the first time), as well as the notions of hyperschema and node reference systems introduced in other recent research. This theory generalises and refines previous work in GP and GA theory.

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

[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]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

[5]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

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

[7]  Darrell Whitley,et al.  A genetic algorithm tutorial , 1994, Statistics and Computing.

[8]  Una-May O'Reilly,et al.  The Troubling Aspects of a Building Block Hypothesis for Genetic Programming , 1994, FOGA.

[9]  L. Altenberg.  EMERGENT PHENOMENA IN GENETIC PROGRAMMING , 1994 .

[10]  Patrik D'haeseleer,et al.  Context preserving crossover in genetic programming , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[11]  David J. Montana,et al.  Strongly Typed Genetic Programming , 1995, Evolutionary Computation.

[12]  P.A. Whigham,et al.  A Schema Theorem for context-free grammars , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[13]  John R. Koza,et al.  Genetic programming 1997 : proceedings of the Second Annual Conference, July 13-16, 1997, Stanford University , 1997 .

[14]  ProgrammingJustinian P. RoscaComputer.  Analysis of Complexity Drift in Genetic , 1997 .

[15]  Christopher R. Stephens,et al.  Effective Degrees of Freedom in Genetic Algorithms and the Block Hypothesis , 1997, ICGA.

[16]  Riccardo Poli,et al.  Schema Theory for Genetic Programming with One-Point Crossover and Point Mutation , 1997, Evolutionary Computation.

[17]  B. W.,et al.  Size Fair and Homologous Tree Genetic Programming Crossovers , 1999 .

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

[19]  William B. Langdon,et al.  Size fair and homologous tree genetic programming crossovers , 1999 .

[20]  Riccardo Poli,et al.  Hyperschema Theory for GP with One-Point Crossover, Building Blocks, and Some New Results in GA Theory , 2000, EuroGP.

[21]  Riccardo Poli,et al.  Exact Schema Theorem and Effective Fitness for GP with One-Point Crossover , 2000, GECCO.

[22]  Riccardo Poli,et al.  A Schema Theory Analysis of the Evolution of Size in Genetic Programming with Linear Representations , 2001, EuroGP.

[23]  Riccardo Poli,et al.  On the Search Properties of Different Crossover Operators in Genetic Programming , 2001 .

[24]  Riccardo Poli,et al.  A schema theory analysis of mutation size biases in genetic programming with linear representations , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[25]  R. Poli,et al.  Markov chain models for GP and variable-length GAs with homologous crossover , 2001 .

[26]  W. Langdon,et al.  Analysis of Schema Variance and Short Term Extinction Likelihoods , 2001 .

[27]  Riccardo Poli,et al.  Exact Schema Theorems for GP with One-Point and Standard Crossover Operating on Linear Structures and Their Application to the Study of the Evolution of Size , 2001, EuroGP.

[28]  R. Poli,et al.  Exact GP schema theory for headless chicken crossover and subtree mutation , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[29]  Riccardo Poli,et al.  General Schema Theory for Genetic Programming with Subtree-Swapping Crossover , 2001, EuroGP.

[30]  Riccardo Poli,et al.  General Schema Theory for Genetic Programming with Subtree-Swapping Crossover: Part I , 2003, Evolutionary Computation.