Resource-Limited Genetic Programming: The Dynamic Approach



Resource-Limited Genetic Programming is a bloat control technique that imposes a single limit on the total amount of resources available to the entire population, where resources are tree nodes or code lines. We elaborate on this recent concept, introducing a dynamic approach to managing the amount of resources available for each generation. Initially low, this amount is increased only if it results in better population fitness. We compare the dynamic approach to the static method where a constant amount of resources is available throughout the run, and with the most traditional usage of a depth limit at the individual level. The dynamic approach does not impair performance on the Symbolic Regression of the quartic polynomial, and achieves excellent results on the Santa Fe Artificial Ant problem, obtaining the same fitness with only a small percentage of the computational effort demanded by the other techniques.


genetic programming, bloat, limited resources


Genetic Programming


Genetic and Evolutionary Computation Conference (GECCO-2005), June 2005

Cited by

Year 2010 : 2 citations

 Whigham PA, Dick G (2010). Implicitly Controlling Bloat in Genetic Programming. IEEE Transactions on Evolutionary Computation, 14(2): 173--190.

 Costa EO, Pozo A, Vergilio SR (2010). A Genetic Programming Approach for Software Reliability Modeling. IEEE Transactions on Reliability, 59(1): 222--230.

Year 2009 : 2 citations

 Kouchakpour P, Zaknich A, Braunl T (2009). A survey and taxonomy of performance improvement of canonical genetic programming. Knowledge and Information Systems 21(1): 1-39.

 Seo K, Hyun S, Goodman ED (2009). Tree-structure-aware GP operators for automatic gait generation of quadruped robot. GECCO-2009, pp. 2155-2160.

Year 2008 : 5 citations

 Poli R, Langdon WB, McPhee NF (2008). A Field Guide to Genetic Programming. Published via and freely available at (With contributions by J.R. Koza).

 William E, Northern J (2008). Genetic Programming Lab (GPLab) Tool Set Version 3.0. In Proc 2008 IEEE Region 5 Conference, 1�6.

 Kuyucu T, Trefzer M, Greensted A, Miller J, Tyrrell A (2008). Fitness functions for the unconstrained evolution of digital circuits. In 9th IEEE World Congress on Computational Intelligence (WCCI 2008), 2589-2596.

 Kouchakpour P (2008). Population Variation in Canonical Tree-based Genetic Programming. PhD Thesis, School of Electrical, Electronic and Computer Engineering, University of Western Australia. Nedlands, Perth, Western Australia.

 Chu D, Rowe JE (2008). Crossover operators to control size growth in linear GP and variable length GAs. 2008 IEEE Congress on Evolutionary Computation, vols 1-8: 336-343.

Year 2007 : 1 citations

 Clifton M, Fang G (2007). Genetic Programming in Robot Exploration. In Proc 2007 IEEE International Conference on Mechatronics and Automation (ICMA 2007), 451"456.

Year 2006 : 4 citations

 Luke S, Panait L (2006). A Comparison of Bloat Control Methods for Genetic Programming. Evolutionary Computation 14(3): 309-344.

 Costa EO, Pozo A (2006). A (mu + lambda) GP Algorithm and its use for Regression Problems. In Proc 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI-2006), 10-17.

 Costa EO (2006). Proposta de um Algoritmo de Programacao Genetica Baseado em Estrategias Evolucionarias. MSc Thesis, Universidade Federal do Parana, Curitiba, Brasil.

 Costa EO, Pozo A (2006). A new approach to genetic programming based on evolution strategies. In Proc 2006 IEEE International Conference on Systems, Man, and Cybernetics, 4832-4837.