The root causes of code growth in genetic programming

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

Volumn 2610, Issue , 2003, Pages 443-454

  Streeter, Matthew J ^a  

^a Genetic Programming Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); GENETIC ALGORITHMS;

CODE GROWTH; IMPROVING PERFORMANCE; ROOT CAUSE; SELECTION PROCEDURES; SIMPLE MODIFICATIONS;

GENETIC PROGRAMMING;

EID: 33750265349     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36599-0_42     Document Type: Article

References (14)

1. T. Blickle and L. Thiele. Genetic programming and redundancy. In J. Hopf (ed.), Genetic Algorithms Within the Framework of Evolutionary Computation, Max-Planck-Institut fur Informatik: Saarbrucken, Germany, 1994, p 33-38.
2. J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. Cambridge, MA: The MIT Press; 1992.
3. W. B. Langdon, T. Soule, R. Poli, and J. A. Foster. The evolution of size and shape. In Advances in Genetic Programming III, Cambridge, MA: The MIT Press, 1999, p 163-190.
4. W. B. Langdon. Size-fair and homologous tree genetic programming crossovers. Genetic Programming and Evolvable Machines, 1(1/2):95-119, 2000.
5. W. B. Langdon and R. Poli. Foundations of Genetic Programming. Springer-Verlag; 2002.
6. S. Luke. Issues in Scaling Genetic Programming: Breeding Strategies, Tree Generation, and Code Bloat. PhD thesis, University of Maryland, College Park, 2000.
7. S. Luke. Code growth is not caused by introns. In Late-Breaking Papers, Proceedings of GECCO 2000, 2000, p 228-235.
8. N. F. McPhee and J. D. Miller. Accurate replication in genetic programming. In L. J. Eshelman (ed.), Proc. Sixth Int. Conf. Genetic Algorithms, Morgan Kaufmann, 1995, p 303-309.
9. P. Nordin and W. Banzhaf. Complexity compression and evolution. In L. J. Eshelman (ed.), Prof. Sixth Int. Conf. Genetic Algorithms, Morgan Kaufmann, 1995, p 310-317.
10. P. Nordin and F. Francone. Explicitly defined introns and destructive crossover in genetic programming. In P. Angeline and K.E. Kinnear Jr (eds.), Advances in Genetic Programming II, Cambridge, MA: The MIT Press, 1996, p 111-134.
11. T. Soule. Code Growth in Genetic Programming, PhD thesis, University of Idaho, 1998.
12. T. Soule and J. A. Foster. Removal bias: a new cause of code growth in tree-based evolutionary programming. In ICEC 98: IEEE International Conf. on Evolutionary Computation, IEEE Press, 1998, p 781-786.
13. T. Soule and R. B. Heckendom. An analysis of the causes of code growth in genetic programming. Genetic Programming and Evolvable Machines, 3(3):283-309, 2002.
14. T. Yu and J. Miller. Finding needles in haystacks is not hard with neutrality. In Foster et al. (eds.), Proceedings of EuroGP'2002, Springer-Verlag, 2002, p 13-25.