Genetic programming: a tutorial introduction

  • Authors:
  • Una-May O'Reilly

  • Affiliations:
  • Massachusetts Institute of Technology, Cambridge, MA, USA

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

Genetic programming emerged in the early 1990's as one of the most exciting new evolutionary algorithm paradigms. It has rapidly grown into a thriving area of research and application. While sharing the evolutionary inspired algorithm principles of a genetic algorithm, it differs by exploiting an executable genome.: genetic programming evolves a 'program' to solve a problem rather than a single solution. This tutorial introduces the basic genetic programming framework: It will explain how the powerful capability of genetic programming is derived from modular algorithmic components: executable representations - e.g. parse-tree, linear and graph-based variation operators that preserve syntax and explore a variable length, hierarchical solution space appropriately chosen programming functions fitness function specification