An improved representation for evolving programs

  • Authors:

  • M. S. Withall;C. J. Hinde;R. G. Stone

  • Affiliations:

  • Department of Computer Science, Loughborough University, Loughborough, Leics, England, UK LE11 3TU;Department of Computer Science, Loughborough University, Loughborough, Leics, England, UK LE11 3TU;Department of Computer Science, Loughborough University, Loughborough, Leics, England, UK LE11 3TU

  • Venue:
  • Genetic Programming and Evolvable Machines
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

A representation has been developed that addresses some of the issues with other Genetic Program representations while maintaining their advantages. This combines the easy reproduction of the linear representation with the inheritable characteristics of the tree representation by using fixed-length blocks of genes representing single program statements. This means that each block of genes will always map to the same statement in the parent and child unless it is mutated, irrespective of changes to the surrounding blocks. This method is compared to the variable length gene blocks used by other representations with a clear improvement in the similarity between parent and child. In addition, a set of list evaluation and manipulation functions was evolved as an application of the new Genetic Program components. These functions have the common feature that they all need to be 100% correct to be useful. Traditional Genetic Programming problems have mainly been optimization or approximation problems. The list results are good but do highlight the problem of scalability in that more complex functions lead to a dramatic increase in the required evolution time.