Resource-limited genetic programming: The dynamic approach

GECCO 2005 - Genetic and Evolutionary Computation Conference

Volumn , Issue , 2005, Pages 1673-1680

  Silva, Sara ^a   Costa, Ernesto ^a  

^a UNIVERSITY OF COIMBRA   (Portugal)

Author keywords

Bloat; Code growth; Dynamic limits; Evolutionary computation; Genetic programming; Limited resources

Indexed keywords

COMPUTATION THEORY; EVOLUTIONARY ALGORITHMS; POLYNOMIALS; POPULATION STATISTICS; REGRESSION ANALYSIS; TREES (MATHEMATICS);

BLOAT; CODE GROWTH; DYNAMIC LIMITS; GENETIC PROGRAMMING; LIMITED RESOURCES;

MATHEMATICAL PROGRAMMING;

EID: 32444439235     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1068009.1068290     Document Type: Conference Paper

References (25)

1. W. Banzhaf, P. Nordin, R. E. Keller, and F. D. Francone. Genetic Programming - An Introduction. Morgan Kaufmann, San Francisco, 1998.
2. T. Soule and R. B. Heckendorn. An analysis of the causes of code growth in genetic programming. Genetic Programming and Evolvable Machines, 3:283-309, 2002.
3. S. Luke. Modification point depth and genome growth in genetic programming. Evolutionary Computation, 11(1):67-106, 2003.
4. M. Brameier and W. Banzhaf. Neutral variations cause bloat in linear GP. In C. Ryan, T. Soule, M. Keijzer et al., editors, EuroGP-2003, pages 286-296, Essex, UK, 2003. Springer.
5. M. J. Streeter The root causes of code growth in genetic programming In C. Ryan, T. Soule, M. Keijzer et al., editors, EuroGP-2003, pages 449-458, Essex, UK, 2003. Springer.
6. B.-T. Zhang and H. Mühlenbein Balancing accuracy and parsimony in genetic programming Evolutionary Computation, 3(1):17-38, 1995.
7. T. Soule and J. A. Foster. Effects of code growth and parsimony pressure on populations in genetic programming. Evolutionary Computation, 6(4):293-309, 1999.
8. S. Luke and L. Panait. Lexicographic parsimony pressure. In W. B. Langdon, E. Cantú-Paz, K. Mathias, et al., editors, GECCO-2002, pages 829-836, New York, NY, USA, 2002. Morgan Kaufman.
9. R. Poli. A simple but theoretically-motivated method to control bloat in genetic programming. In C. Ryan, T. Soule, M. Keijzer, et al., editors, EuroGP-2003, pages 204-217, Essex, UK, 2003. Springer.
10. L. Panait and S. Luke. Alternative bloat control methods. In K. Deb, R. Poli, W. Banzhaf, et al., editors, GECCO-2004, LNCS, pages 630-641, Seattle, WA, USA, 2004. Springer.
11. J. R. Koza. Genetic programming - on the programming of computers by means of natural selection. The MIT Press, Cambridge, Massachusetts, USA, 1992.
12. 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, et al., editors, GP'96, pages 291-296, Stanford University, California, USA, 1996. MIT Press.
13. W. B. Langdon, R. Poli. An analysis of the MAX problem in genetic programming. In J. R. Koza, K. Deb, M. Dorigo, et al., editors, GP'97, pages 222-230, San Francisco, California, USA, 1997. Morgan Kaufman
14. C. J. Kennedy and C. Giraud-Carrier. A depth controlling strategy for strongly typed evolutionary programming. In W. Banzhaf, J. Daida, A. E. Eiben, et al., editors, GECCO-1999, pages 1-6, Orlando, Florida, USA, 1999. Morgan Kaufman.
15. W. B. Langdon. Size fair and homologous tree crossovers for tree genetic programming. Genetic Programming and Evolvable Machines, 1:95-119, 2000.
16. S. Silva and J. S. Almeida. Dynamic maximum tree depth - a simple technique for avoiding bloat, in tree-based GP. In E. Cantú-Paz, J. A. Foster, K. Deb, et al., editors, GECCO-2003, LNCS, Chicago, IL, USA, 2003. Springer.
17. S. Silva and E. Costa. Dynamic limits for bloat control - variations on size and depth. In K. Deb, R. Poli, W. Banzhaf, et al., editors, GECCO-2004, LNCS, pages 666-677, Seattle, WA, USA, 2004. Springer.
18. N. Wagner and Z. Michalewicz. Genetic programming with efficient population control for financial time series prediction. In E. D. Goodman, editor, GECCO-2001 Late Breaking Papers, pages 458-462, San Francisco, CA, USA, 2001.
19. S. Silva, P. J. N. Silva, and E. Costa. Resource-limited genetic programming: Replacing tree depth limits. In B. Ribeiro, R. F. Albrecht, A. Dobnikar, et al., editors, ICANNGA-2005, pages 243-246, Coimbra, Portugal, 2005. Springer.
20. S. Luke, G. C. Balan, and L. Panait. Population implosion in genetic programming. In E. Cantú-Paz, J. A. Foster, K. Deb, et al., editors, GECCO-2003, LNCS, pages 1729-1739, Chicago, IL, USA, 2003. Springer.
21. F. Fernandez, L. Vanneschi, and M. Tomassini. The effect of plagues in genetic programming: A study of variable-size populations. In C. Ryan, T. Soule, M. Keijzer et al., editors, EuroGP-2003, pages 317-326, Essex, UK, 2003. Springer.
22. F. Fernandez, M. Tomassini, and L. Vanneschi. Saving computational effort in genetic programming by means of plagues. In R. Sarker, R. Reynolds, H. Abbass, et al., editors, CEC-2003, pages 2042-2049. IEEE Press, 2003.
23. M. Tomassini, L. Vanneschi, J. Cuendet, and F. Fernandez. A new technique for dynamic size populations in genetic programming. In CEC-2004, pages 486-493. IEEE Press, 2004.
24. S. Silva. GPLAB - a genetic programming toolbox for MATLAB, 2004. http://gplab.sourceforge.net
25. W. B. Langdon. The evolution of size in variable length representations. In 1998 IEEE International Conference on Evolutionary Computation, pages 633-638, Anchorage, Alaska, USA, 1998. IEEE Press.