Skip to main content
Log in

Problem Difficulty and Code Growth in Genetic Programming

  • Published:
Genetic Programming and Evolvable Machines Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:GENP.0000030194.98244.e3

Navigation