Grammatical Evolution
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.
- Publication:
-
IEEE Transactions on Evolutionary Computation
- Pub Date:
- 2001
- DOI:
- Bibcode:
- 2001ITEC....5..349O
- Keywords:
-
- Automatic programming;
- Backus–Naur form;
- degenerate code;
- evolutionary algorithms;
- neutral networks