Grammatical evolution

Michael O'Neill; Conor Ryan

doi:10.1109/4235.942529

Grammatical evolution

Michael O'Neill, Conor Ryan

Department of Computer Science & Information Systems

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	349-358
Number of pages	10
Journal	IEEE Transactions on Evolutionary Computation
Volume	5
Issue number	4
DOIs	https://doi.org/10.1109/4235.942529
Publication status	Published - Aug 2001

Keywords

Automatic programming
Backus-Naur form
Degenerate code
Evolutionary algorithms
Neutral networks

Access to Document

10.1109/4235.942529

Cite this

@article{a103552f27104c9ba75b5ad1f90a9410,

title = "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.",

keywords = "Automatic programming, Backus-Naur form, Degenerate code, Evolutionary algorithms, Neutral networks",

author = "Michael O'Neill and Conor Ryan",

year = "2001",

month = aug,

doi = "10.1109/4235.942529",

language = "English",

volume = "5",

pages = "349--358",

journal = "IEEE Transactions on Evolutionary Computation",

issn = "1089-778X",

number = "4",

}

TY - JOUR

T1 - Grammatical evolution

AU - O'Neill, Michael

AU - Ryan, Conor

PY - 2001/8

Y1 - 2001/8

N2 - 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.

AB - 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.

KW - Automatic programming

KW - Backus-Naur form

KW - Degenerate code

KW - Evolutionary algorithms

KW - Neutral networks

UR - http://www.scopus.com/inward/record.url?scp=0035415174&partnerID=8YFLogxK

U2 - 10.1109/4235.942529

DO - 10.1109/4235.942529

M3 - Article

AN - SCOPUS:0035415174

SN - 1089-778X

VL - 5

SP - 349

EP - 358

JO - IEEE Transactions on Evolutionary Computation

JF - IEEE Transactions on Evolutionary Computation

IS - 4

ER -

Grammatical evolution

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this