Abstract
This paper investigates the relationship between code growth and problem difficulty in genetic programming. The symbolic regression problem domain is used to investigate this relationship using two different types of increased instance difficulty. Results are supported by a simplified model of genetic programming and show that increased difficulty induces higher selection pressure and less genetic diversity, which both contribute toward an increased rate of code growth.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gustafson, S., Ekárt, A., Burke, E. et al. Problem Difficulty and Code Growth in Genetic Programming. Genet Program Evolvable Mach 5, 271–290 (2004). https://doi.org/10.1023/B:GENP.0000030194.98244.e3
Issue Date:
DOI: https://doi.org/10.1023/B:GENP.0000030194.98244.e3