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

作者: Nicholas Freitag McPhee , Riccardo Poli

DOI:

关键词:

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

参考文章(31)
Una-May O’Reilly, Riccardo Poli, W.B. Langdon, Analysis of Schema Variance and Short Term Extinction Likelihoods ,(2001)
Henri Waelbroeck, Christopher R. Stephens, Effective Degrees of Freedom in Genetic Algorithms and the Block Hypothesis. ICGA. pp. 34- 40 ,(1997)
Nicholas Freitag McPhee, Riccardo Poli, Jonathan E. Rowe, Markov chain models for GP and variable-length GAs with homologous crossover genetic and evolutionary computation conference. pp. 112- 119 ,(2001)
Riccardo Poli, Exact schema theorem and effective fitness for GP with one-point crossover genetic and evolutionary computation conference. pp. 469- 476 ,(2000)
Lee Altenberg, The Schema Theorem and Price's Theorem Foundations of Genetic Algorithms. ,vol. 3, pp. 23- 49 ,(1995) , 10.1016/B978-1-55860-356-1.50006-6
Una-May O'Reilly, Franz Oppacher, The Troubling Aspects of a Building Block Hypothesis for Genetic Programming Foundations of Genetic Algorithms. ,vol. 3, pp. 73- 88 ,(1995) , 10.1016/B978-1-55860-356-1.50008-X