@inproceedings{d42692b049044cf5a1a05e73c6072689,
title = "Evolving multi-line compilable c programs",
abstract = "We describe a Genetic Algorithm called Grammatical Evolution (GE) that can evolve complete programs in an arbitrary language using a variable length linear genome. 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. Expressions and programs of arbitrary complexity may be evolved using this system. Since first describing this system, GE has been applied to other problem domains, and during this time GE has undergone some evolution. This paper serves to report these changes, and also describes how we evolved multi-line C-code to solve a version of the Santa Fe Ant Trail. The results obtained are then compared to results produced by Genetic Programming, and it is found that GE outperforms GP on this problem.",
author = "Michael O{\textquoteright}neill and Conor Ryan",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 2nd European Workshop on Genetic Programming, EuroGP 1999 ; Conference date: 26-05-1999 Through 27-05-1999",
year = "1999",
doi = "10.1007/3-540-48885-5_7",
language = "English",
isbn = "3540658998",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "83--92",
editor = "Riccardo Poli and Peter Nordin and Langdon, {William B.} and Fogarty, {Terence C.}",
booktitle = "Genetic Programming - 2nd European Workshop, EuroGP 1999, Proceedings",
}