Journal
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
Volume 5, Issue 4, Pages 349-358Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/4235.942529
Keywords
automatic programming; Backus-Naur form; degenerate code; evolutionary algorithms; neutral networks
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
