Cartesian genetic programming

  • Authors:
  • Julian F. Miller;Simon L. Harding

  • Affiliations:
  • University of York, York, United Kingdom;Memorial University, St John's, NF, Canada

  • Venue:
  • Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Cartesian Genetic Programming is a form of genetic programming. It is increasing in popularity. It was developed by Julian Miller with Peter Thomson in 1997. In its classic form it uses a very simple integer based genetic representation of a program in the form of a directed graph. In a number of studies, it has been shown to be efficient in comparison with other GP techniques. Since then, the classical form of CGP has been enhanced in various ways by including automatically defined functions. Most recently, it has been developed by Julian Miller. Wolfgang Banzhaf and Simon Harding to include self-modification operators. This again has increased its efficiency. The tutorial will cover the basic technique, advanced developments and applications to a variety of problem domains.