A comparison of bloat control methods for genetic programming

Evolutionary Computation

Volumn 14, Issue 3, 2006, Pages 309-344

  Luke, Sean ^a   Panait, Liviu ^a  

^a Krasnow Institute for Advanced Study   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANIMAL; ANT; ARTICLE; BIOLOGICAL MODEL; COMPARATIVE STUDY; COMPUTER PROGRAM; PHYSIOLOGY; POPULATION DENSITY; POPULATION GENETICS; REGRESSION ANALYSIS; STATISTICAL MODEL; TREE;

ANIMALS; ANTS; GENETICS, POPULATION; LINEAR MODELS; MODELS, GENETIC; POPULATION DENSITY; REGRESSION ANALYSIS; SOFTWARE; TREES;

EID: 33750594458     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/evco.2006.14.3.309     Document Type: Article

References (46)

1. Angeline, P. J. (1996). Two self-adaptive crossover operators for genetic programming. In Angeline, P. J. and Kinnear, Jr., K. E., editors, Advances in Genetic Programming 2, pages 89-110. MIT Press, Cambridge, MA, USA.
2. Banzhaf, W., Nordin, P., Keller, R. E., and Francone, F. D. (1998). Genetic Programming -An Introduction; On the Automatic Evolution of Computer Programs and its Applications. Morgan Kaufmann.
3. Bassett, J. K. and De Jong, K. A. (2000). Evolving behaviors for cooperating agents. In International Syposium on Methodologies for Intelligent Systems, pages 157-165.
4. Belpaeme, T. (1999). Evolution of visual feature detectors. In Poli, R., Cagnoni, S., Voigt, H.-M., Fogarty, T., and Nordin, P., editors, Late Breaking Papers at EvoISAP'99: the First European Workshop on Evolutionary Computation in Image Analysis and Signal Processing, pages 1-10, Goteborg, Sweden.
5. Bleuler, S., Brack, M., Thiele, L., and Zitzler, E. (2001). Multiobjective genetic programming: reducing bloat using SPEA2. In Proceedings of the 2001 Congress on Evolutionary Computation CEC2001, pages 536-543, COEX, World Trade Center, 159 Samseongdong, Gangnam-gu, Seoul, Korea. IEEE Press.
6. Blickle, T. (1996). Theory of Evolutionary Algorithms and Application to System Synthesis. PhD thesis, Swiss Federal Institute of Technology, Zurich.
7. Burke, D. S., De Jong, K. A., Grefenstette, J. J., Ramsey, C. L., and Wu, A. S. (1998). Putting more genetics into genetic algorithms. Evolutionary Computation, 6(4):387-410.
8. Cavaretta, M. J. and Chellapilla, K. (1999). Data mining using genetic programming: The implications of parsimony on generalization error. In Angeline, P. J., Michalewicz, Z., Schoenauer, M., Yao, X., and Zalzala, A., editors, Proceedings of the Congress on Evolutionary Computation, volume 2, pages 1330-1337, Mayflower Hotel, Washington D.C., USA. IEEE Press.
9. de Jong, E. D. and Pollack, J. B. (2003). Multi-objective methods for tree size control. Genetic Programming and Evolvable Machines, 4(3):211-233.
10. Ekart, A. and Nemeth, S. Z. (2001). Selection based on the pareto nondomination criterion for controlling code growth in genetic programming. Genetic Programming and Evolvable Machines, 2(1):61-73.
11. Gathercole, C. and Ross, P. (1996). An adverse interaction between crossover and restricted tree depth in genetic programming. In Koza, J. R., Goldberg, D. E., Fogel, D. B., and Riolo, R. L., editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 291-296, Stanford University, CA, USA. MIT Press.
12. Gustafson, S., Ekart, A., Burke, E., and Kendall, G. (2004). Problem difficulty and code growth in genetic programming. Genetic Programming and Evolvable Machines, 5(3):271-290.
13. Haynes, T. (1998). Collective adaptation: The exchange of coding segments. Evolutionary Computation, 6(4):311-338.
14. Iba, H., de Garis, H., and Sato, T. (1994). Genetic programming using a minimum description length principle. In Kinnear, Jr., K. E., editor, Advances in Genetic Programming, chapter 12, pages 265-284. MIT Press.
15. Kalganova, T. and Miller, J. (1999). Evolving more efficient digital circuits by allowing circuit layout evolution and multi-objective fitness. In Stoica, A., Keymeulen, D., and Lohn, J., editors, Proceedings of the 1st NASA/DoD Workshop on Evolvable Hardware (EH'99), pages 54-63, Piscataway, NJ. IEEE.
16. Kennedy, C. J. and Giraud-Carrier, C. (1999). A depth controlling strategy for strongly typed evolutionary programming. In Banzhaf, W., Daida, J., Eiben, A. E., Garzon, M. H., Honavar, V., Jakiela, M., and Smith, R. E., editors, Proceedings of the Genetic and Evolutionary Computation Conference, volume 1, pages 879-885, Orlando, Florida, USA. Morgan Kaufmann.
17. Koza, J. R. (1992). Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA.
18. Langdon, W. B. and Poli, R. (1997a). An analysis of the MAX problem in genetic programming. In Koza, J. R., Deb, K., Dorigo, M., Fogel, D. B., Garzon, M., Iba, H., and Riolo, R. L., editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 222-230, Stanford University, CA, USA. Morgan Kaufmann.
19. Langdon, W. B. and Poli, R. (1997b). Fitness causes bloat. In Chawdhry, P. K., Roy, R., and Pant, R. K., editors, Soft Computing in Engineering Design and Manufacturing, pages 13-22. Springer-Verlag London.
20. Langdon, W. B. and Poli, R. (1998). Genetic programming bloat with dynamic fitness. In Banzhaf, W., Poli, R., Schoenauer, M., and Fogarty, T. C., editors, Proceedings of the First European Workshop on Genetic Programming, volume 1391 of LNCS, pages 96-112, Paris. Springer.
21. Langdon, W. B., Soule, T., Poli, R., and Foster, J. A. (1999). The evolution of size and shape. In Spector, L., Langdon, W. B., O'Reilly, U.-M., and Angeline, P. J., editors, Advances in Genetic Programming 3, pages 163-190. MIT Press, Cambridge, MA, USA.
22. Lucas, S. (1994). Structuring chromosomes for context-free grammar evolution. In Proceedings of the First IEEE Conference on Evolutionary Computation, pages 130-135. IEEE.
23. Luke, S. (2000). Issues in Scaling Genetic Programming: Breeding Strategies, Tree Generation, and Code Bloat. PhD thesis, Department of Computer Science, University of Maryland, A. V. Williams Building, University of Maryland, College Park, MD 20742 USA.
24. Luke, S. (2003). Modification point depth and genome growth in genetic programming. Evolutionary Computation, 11(1):67-106.
25. Luke, S. (2005). ECJ12: An EC and GP system in Java. http://cs.gmu.edu/ ~eclab/projects/ecj/.
26. Luke, S. and Panait, L. (2002a). Fighting bloat with nonparametric parsimony pressure. In Guervos, J. J. M., editor, Parallel Problem Solving from Nature (PPSN VII), pages 411-421. Springer.
27. Luke, S. and Panait, L. (2002b). Lexicographic parsimony pressure. In Langdon, W. B., Cantu-Paz, E., Mathias, K., Roy, R., Davis, D., Poli, R., Balakrishnan, K., Honavar, V., Rudolph, G., Wegener, J., Bull, L., Potter, M. A., Schultz, A. C., Miller, J. F., Burke, E., and Jonoska, N., editors, GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, pages 829-836. Morgan Kaufmann.
28. Martin, P. and Poli, R. (2002). Crossover operators for a hardware implementation of GP using FPGAs and Handel-C. In GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, pages 845-852, New York. Morgan Kaufmann Publishers.
29. Nedja, N., Abraham, A., and de Macedo Mourelle, L., editors (2006). Genetic Systems Programming. Springer.
30. Nordin, P. and Banzhaf, W. (1995). Complexity compression and evolution. In Eshelman, L., editor, Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), pages 310-317, Pittsburgh, PA, USA. Morgan Kaufmann.
31. Nordin, P., Francone, F., and Banzhaf, W. (1996). Explicitly defined introns and destructive crossover in genetic programming. In Angeline, P. J. and Kinnear, Jr., K. E., editors, Advances in Genetic Programming 2, pages 111-134. MIT Press, Cambridge, MA, USA.
32. Olsson, R. (1995). Inductive functional programming using incremental program transformation. Artificial Intelligence, 74(1):55-81.
33. Poli, R. (2003). A simple but theoretically-motivated method to control bloat in genetic programming. In Genetic Programming, Proceedings of EuroGP'2003, pages 204-217. Springer.
34. Ryan, C. (1994). Pygmies and civil servants. In Kinnear, Jr., K. E., editor, Advances in Genetic Programming, chapter 11, pages 243-263. MIT Press.
35. Silva, S. and Almeida, J. (2003). Dynamic maximum tree depth. In Genetic and Evolutionary Computation - GECCO-2003, pages 1776-1787, Chicago. Springer.
36. Silva, S. and Costa, E. (2004). Dynamic limits for bloat control: Variations on size and depth. In Genetic and Evolutionary Computation - GECCO-2004. Part 2, pages 666-677. Springer.
37. Silva, S. and Costa, E. (2005). Resource-limited genetic programming: the dynamic approach. In Beyer, H.-G. et al., editors, GECCO 2005: Proceedings of the 2005 conference on Genetic and evolutionary computation, volume 2, pages 1673-1680, Washington DC, USA. ACM Press.
38. Smith, P. W. H. and Harries, K. (1998). Code growth, explicitly defined introns, and alternative selection schemes. Evolutionary Computation, 6(4):339-360.
39. Smith, S. F. (1980). A Learning System Based on Genetic Adaptive Algorithms. PhD thesis, Computer Science Department, University of Pittsburgh.
40. Soule, T. and Foster, J. A. (1998a). Effects of code growth and parsimony pressure on populations in genetic programming. Evolutionary Computation, 6(4):293-309.
41. Soule, T. and Foster, J. A. (1998b). 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. IEEE Press.
42. Soule, T., Foster, J. A., and Dickinson, J. (1996). Code growth in genetic programming. In Koza, J. R., Goldberg, D. E., Fogel, D. B., and Riolo, R. L., editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 215-223, Stanford University, CA, USA. MIT Press.
43. Tackett, W. A. (1994). Recombination, Selection, and the Genetic Construction of Computer Programs. PhD thesis, University of Southern California, Department of Electrical Engineering Systems.
44. Wagner, N. and Michalewicz, Z. (2001). Genetic programming with efficient population control for financial time series prediction. In Goodman, E. D., editor, 2001 Genetic and Evolutionary Computation Conference Late Breaking Papers, pages 458-462, San Francisco, California, USA.
45. Wu, A., Schultz, A., and Agah, A. (1999). Evolving control for distributed micro air vehicles. In IEEE Computational Intelligence in Robotics and Automation Engineers Conference.
46. Zhang, B.-T. and Mühlenbein, H. (1995). Balancing accuracy and parsimony in genetic programming. Evolutionary Computation, 3(1):17-38.