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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2038, Issue , 2001, Pages 126-142

  Poli, Riccardo ^a   McPhee, Nicholas Freitag ^b  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS;

BINARY STRING; FITNESS FUNCTIONS; FIXED POINTS; LINEAR STRUCTURES; NON-ZERO PROBABILITY; SCHEMA THEOREMS; VARIABLE LENGTH;

GENETIC PROGRAMMING;

EID: 84937428414     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45355-5_11     Document Type: Conference Paper

References (14)

1. W. B. Langdon, T. Soule, R. Poli, and J. A. Foster. The evolution of size and shape. In L. Spector, W. B. Langdon, U.-M. O’Reilly, and P. J. Angeline, editors, Advances in Genetic Programming 3, chapter 8, pages 163-190.MIT Press, Cambridge, MA, USA, June 1999.
2. N. F. McPhee and J. D. Miller. Accurate replication in genetic programming. In L. Eshelman, editor, Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), pages 303-309, Pittsburgh, PA, USA, 15-19 July 1995.Morgan Kaufmann.
3. N. F. McPhee and R. Poli. A schema theory analysis of the evolution of size in genetic programming with linear representations. In Genetic Programming, Proceedings of EuroGP 2001, LNCS, Milan, 18-20 Apr 2001. Springer-Verlag.
4. P. Nordin and W. Banzhaf. Complexity compression and evolution. In L. Eshelman, editor, Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), pages 310-317, Pittsburgh, PA, USA, 15-19 July 1995. Morgan Kaufmann.
5. P. Nordin, F. Francone, and W. Banzhaf. Explicitly defined introns and destructive crossover in genetic programming. In J. P. Rosca, editor, Proceedings of the Workshop on Genetic Programming: From Theory to Real-World Applications, pages 6-22, Tahoe City, California, USA, 9 July 1995.
6. R. Poli. Exact schema theorem and effective fitness for GP with one-point crossover. In D. Whitley, D. Goldberg, E. Cantu-Paz, L. Spector, I. Parmee, and H.-G. Beyer, editors, Proceedings of the Genetic and Evolutionary Computation Conference, pages 469-476, Las Vegas, July 2000. Morgan Kaufmann.
7. R. Poli. Hyperschema theory for GP with one-point crossover, building blocks, and some new results in GA theory. In R. Poli, W. Banzhaf, and et al., editors, Genetic Programming, Proceedings of EuroGP 2000. Springer-Verlag, 15-16 Apr 2000.
8. R. Poli. General schema theory for genetic programming with subtree-swapping crossover. In Genetic Programming, Proceedings of EuroGP 2001, LNCS, Milan, 18-20 Apr 2001. Springer-Verlag.
9. R. Poli and W. B. Langdon. A new schema theory for genetic programming with one-point crossover and point mutation. In J. R. Koza, K. Deb, M. Dorigo, D. B. Fogel, M. Garzon, H. Iba, and R. L. Riolo, editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 278-285, Stanford University, CA, USA, 13-16 July 1997.Morgan Kaufmann.
10. R. Poli and W. B. Langdon. On the search properties of different crossover operators in genetic programming. In J. R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D. B. Fogel, M. H. Garzon, D. E. Goldberg, H. Iba, and R. Riolo, editors, Genetic Programming 1998: Proceedings of the Third Annual Conference, pages 293-301, University ofWisconsin, Madison, Wisconsin, USA, 22-25 July 1998.Morgan Kaufmann.
11. R. Poli and W. B. Langdon. Schema theory for genetic programming with one-point crossover and point mutation. Evolutionary Computation, 6(3):231-252, 1998.
12. R. Poli, W. B. Langdon, and U.-M. O’Reilly. Analysis of schema variance and short term extinction likelihoods. In J. R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D. B. Fogel, M. H. Garzon, D. E. Goldberg, H. Iba, and R. Riolo, editors, Genetic Programming 1998: Proceedings of the Third Annual Conference, pages 284-292, University ofWisconsin, Madison, Wisconsin, USA, 22-25 July 1998.Morgan Kaufmann.
13. J. P. Rosca. Analysis of complexity drift in genetic programming. In J. R. Koza, K. Deb, M. Dorigo, D. B. Fogel, M. Garzon, H. Iba, and R. L. Riolo, editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 286-294, Stanford University, CA, USA, 13-16 July 1997.Morgan Kaufmann.
14. J. E. Rowe and N. F. McPhee. The effects of crossover and mutation operators on variable length linear structures. Technical Report CSRP-01-7, University of Birmingham, School of Computer Science, January 2001.