On the strength of size limits in linear genetic programming

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

Volumn 3103, Issue , 2004, Pages 593-604

  McPhee, Nicholas Freitag ^a   Jarvis, Alex ^a   Crane, Ellery Fussell ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GENETIC ALGORITHMS;

AVERAGE SIZE; EFFECT OF SIZES; LIMIT STRENGTH; LINEAR GENETIC PROGRAMMING; LINEAR STRUCTURES; SCHEMA THEORY; SEARCH SPACES; VARIABLE LENGTH;

GENETIC PROGRAMMING;

EID: 32444435471     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24855-2_68     Document Type: Article

References (19)

1. J. M. Daida, A. M. Hilss, D. J. Ward, and S. L. Long. Visualizing tree structures in genetic programming. In E. Cantú-Paz and et al, editors, Genetic and Evolutionary Computation - GECCO-2003, volume 2724 of LNCS, pages 1652-1664, Chicago, 12-16 July 2003. Springer-Verlag.
2. C. Gathercole and P. Ross. An adverse interaction between crossover and restricted tree depth in genetic programming. In J. R. Koza and et al, editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 291-296, Stanford University, CA, USA, 28-31 July 1996. MIT Press.
3. J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, 1992.
4. W. B. Langdon and R. Poli. Foundations of Genetic Programming. Springer, 2001.
5. 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.
6. S. Luke. Modification point depth and genome growth in genetic programming. Evolutionary Computation, 11(1):67-106, Spring 2003.
7. S. Luke and L. Panait. Lexicographic parsimony pressure. In W. B. Langdon and et al, editors, GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, pages 829-836, New York, 9-13 July 2002. Morgan Kaufmann Publishers.
8. N. F. McPhee and R. Poli. A schema theory analysis of the evolution of size in genetic programming with linear representations. In J. F. Miller and et al, editors, Genetic Programming, Proceedings of EuroGP'2001, volume 2038 of LNCS, pages 108-125, Lake Como, Italy, 18-20 April 2001. Springer-Verlag.
9. N. F. McPhee and R. Poli. Using schema theory to explore interactions of multiple operators. In W. B. Langdon and et al, editors, GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, pages 853-860, New York, 9-13 July 2002. Morgan Kaufmann Publishers.
10. N. F. McPhee, R. Poli, and J. E. Rowe. A schema theory analysis of mutation size biases in genetic programming with linear representations. In Proceedings of the 2001 Congress on Evolutionary Computation CEC2001, pages 1078-1085, COEX, World Trade Center, 159 Samseong-dong, Gangnam-gu, Seoul, Korea, 27-30 May 2001. IEEE Press.
11. M. O'Neill and C. Ryan. Grammatical evolution. IEEE Transaction on Evolutionary Computation, 5(4), 2001.
12. R. Poli. Exact schema theory for genetic programming and variable-length genetic algorithms with one-point crossover. Genetic Programming and Evolvable Machines, 2(2):123-163, June 2001.
13. R. Poli. A simple but theoretically-motivated method to control bloatin genetic programming. In C. Ryan and et al, editors, Proceedings of the Sixth European Conference on Genetic Programming (EuroGP-2003), volume 2610 of LNCS, pages 204-217, Essex, UK, 2003. Springer Verlag.
14. R. Poli and N. F. McPhee. Exact gp schema theory for headless chicken crossover and subtree mutation. In Proceedings of the 2001 Congress on Evolutionary Computation CEC2001, pages 1062-1069, COEX, World Trade Center, 159 Samseong-dong, Gangnam-gu, Seoul, Korea, 27-30 May 2001. IEEE Press.
15. R. Poli and N. F. McPhee. 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. In Genetic Programming, Proceedings of EuroGP 2001, LNCS, Milan, 18-20 Apr. 2001. Springer-Verlag.
16. R. Poli and N. F. McPhee. General schema theory for genetic programming with subtree-swapping crossover: Part 1. Evolutionary Computation, 11(1):53-66, Spring 2003.
17. J. E. Rowe and N. F. McPhee. The effects of crossover and mutation operators on variable length linear structures. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), San Francisco, California, USA, 7-11 July 2001. Morgan Kaufmann.
18. S. Silva and J. Almeida. Dynamic maximum tree depth. In E. Cantú-Paz and et al, editors, Genetic and Evolutionary Computation - GECCO-2003, volume 2724 of LNCS, pages 1776-1787, Chicago, 12-16 July 2003. Springer-Verlag.
19. T. Soule and J. A. Foster. Effects of code growth and parsimony pressure on populations in genetic programming. Evolutionary Computation, 6(4):293-309, Winter 1998.