Grammatical evolution

  • Authors:
  • M. O'Neill;C. Ryan

  • Affiliations:
  • Dept. of Comput. Sci. & Inf. Syst., Limerick Univ.;-

  • Venue:
  • IEEE Transactions on Evolutionary Computation
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present grammatical evolution, an evolutionary algorithm that can evolve complete programs in an arbitrary language using a variable-length binary string. The binary genome determines which production rules in a Backus-Naur form grammar definition are used in a genotype-to-phenotype mapping process to a program. We demonstrate how expressions and programs of arbitrary complexity may be evolved and compare its performance to genetic programming