Code growth in genetic programming

  • Authors:
  • Terence Soule;James A. Foster;John Dickinson

  • Affiliations:
  • University of Idaho, Moscow, Idaho;University of Idaho, Moscow, Idaho;University of Idaho, Moscow, ID

  • Venue:
  • GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we examine how quickly the programs generated using genetic programming grow in size. We found that without a constraint mechanism the programs will grow indefinitely regardless of whether or not the growth acts to improve the programs' solutions. This growth is dominated by non-functional code. If the non-functional code is removed the growth is dominated by functional, but non-executed code. Two methods of controlling the growth: removing non-functional code, and selective pressure applied by penalizing longer programs, are compared. Only the later method appears to be effective in bounding the programs' size.