A simple but theoretically-motivated method to control bloat 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 204-217

  Poli, Riccardo ^a  

^a UNIVERSITY OF ESSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS;

AVERAGE LENGTH; EMPIRICAL VALIDATION; FITNESS LANDSCAPE; LENGTH CONSTRAINTS; SIMPLE METHOD; TEST PROBLEM; THEORETICAL FOUNDATIONS;

GENETIC PROGRAMMING;

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

References (31)

1. T. Blickle. Evolving compact solutions in genetic programming: A case study. In H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel, editors, Parallel Problem Solving From Nature IV. Proceedings of the International Conference on Evolutionary Computation, volume 1141 of LNCS, pages 564-573, Berlin, Germany, 22-26 Sept. 1996. Springer-Verlag.
2. T. Blickle and L. Thiele. Genetic programming and redundancy. In J. Hopf, editor, Genetic Algorithms within the Framework of Evolutionary Computation (Workshop at KI-94, Saarbrücken), pages 33-38, Im Stadtwald, Building 44, D-66123 Saarbrücken, Germany, 1994. Max-Planck-Institut für Informatik (MPI-I-94-241).
3. A. Ekart and S. Z. Nemeth. Selection based on the pareto nondomination criterion for controlling code growth in genetic programming. Genetic Programming and Evolvable Machines, 2(1):61-73, Mar. 2001.
4. C. Gathercole and P. Ross. An adverse interaction between crossover and restricted tree depth in genetic programming. In J. R. Koza, D. E. Goldberg, D. B. Fogel, and R. L. Riolo, editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 291-296, Stanford University, CA, USA, 28-31 July 1996. MIT Press.
5. D. C. Hooper, N. S. Rann, and S. R. Fuller. Recombinative hill-climbing: A stronger search method for 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 174-179, Stanford University, CA, USA, 13-16 July 1997. Morgan Kaufmann.
6. H. Iba, H. de Garis, and T. Sato. Genetic programming using a minimum description length principle. In K. E. Kinnear, Jr., editor, Advances in Genetic Programming, chapter 12, pages 265-284. MIT Press, 1994.
7. J. R. Koza. A genetic approach to the truck backer upper problem and the inter-twined spiral problem. In Proceedings of IJCNN International Joint Conference on Neural Networks, volume IV, pages 310-318. IEEE Press, 1992.
8. J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA, 1992.
9. W. B. Langdon. Scaling of program tree fitness spaces. Evolutionary Computation, 7(4):399-428, Winter 1999.
10. W. B. Langdon. Size fair and homologous tree genetic programming crossovers. In W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar. M. Jakiela, and R. E. Smith, editors, Proceedings of the Genetic and Evolutionary Computation Conference, volume 2, pages 1092-1097, Orlando, Florida, USA, 13-17 July 1999. Morgan Kaufmann.
11. W. B. Langdon. Quadratic bloat in genetic programming. 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 (GECCO-2000), pages 451-458, Las Vegas, Nevada, USA, 10-12 July 2000. Morgan Kaufmann.
12. W. B. Langdon. Size fair and homologous tree genetic programming crossovers. Genetic Programming and Evolvable Machines, 1(1/2):95-119, Apr. 2000.
13. W. B. Langdon and W. Banzhaf. Genetic programming bloat without semantics. In M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. Merelo, and H.-P. Schwefel, editors, Parallel Problem Solving from Nature - PPSN VI 6th International Conference, volume 1917 of LNCS, pages 201-210, Paris, France, 16-20 Sept. 2000. Springer Verlag.
14. W. B. Langdon and R. Poli. An analysis of the MAX problem 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 222-230, Stanford University, CA, USA, 13-16 July 1997. Morgan Kaufmann.
15. W. B. Langdon and R. Poli. Why ants are hard. 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 193-201, University of Wisconsin, Madison, Wisconsin, USA, 22-25 July 1998. Morgan Kaufmann.
16. W. B. Langdon and R. Poli. Foundations of Genetic Programming. Springer-Verlag, 2002.
17. 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.
18. 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.
19. 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.
20. 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.
21. P. Nordin, F. Francone, and W. Banzhaf. Explicitly defined introns and destructive crossover in genetic programming. In P. J. Angeline and K. E. Kinnear, Jr., editors. Advances in Genetic Programming 2, chapter 6, pages 111-134. MIT Press, Cambridge, MA, USA, 1996.
22. U.-M. O'Reilly and F. Oppacher. Hybridized crossover-based search techniques for program discovery. In Proceedings of the 1995 World Conference on Evolutionary Computation, volume 2, pages 573-578, Perth, Australia, 29 Nov. - 1 Dec. 1995. IEEE Press.
23. R. Poli. General schema theory for genetic programming with subtree-swapping crossover. In J. F. Miller, M. Tomassini, P. L. Lanzi, C. Ryan, A. G. B. Tettamanzi, and W. B. Langdon, editors. Genetic Programming, Proceedings of EuroGP'2001, volume 2038 of LNCS, pages 143-159, Lake Como, Italy, 18-20 Apr. 2001. Springer-Verlag.
24. K. Rodriguez-Vazquez, C. M. Fonseca, and P. J. Fleming. Multiobjective genetic programming: A nonlinear system identification application. In J. R. Koza, editor, Late Breaking Papers at the 1997 Genetic Programming Conference, pages 207-212, Stanford University, CA, USA, 13-16 July 1997. Stanford Bookstore.
25. 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.
26. T. Soule. Code Growth in Genetic Programming. PhD thesis, University of Idaho, Moscow, Idaho, USA, 15 May 1998.
27. T. Soule and J. A. Foster. Code size and depth flows 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 313-320, Stanford University, CA, USA, 13-16 July 1997. Morgan Kaufmann.
28. 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.
29. T. Soule and J. A. Foster. Removal bias: a new cause of code growth in tree based evolutionary programming. In 1998 IEEE International Conference on Evolutionary Computation, pages 781-186, Anchorage, Alaska, USA, 5-9 May 1998. IEEE Press.
30. 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, Sept. 2002.
31. B.-T. Zhang and H. Mühlenbein. Balancing accuracy and parsimony in genetic programming. Evolutionary Computation, 3(1):17-38, 1995.