SpringerLink - Book Chapter

Evolving Multi-line Compilable C Programs

Book Series

Lecture Notes in Computer Science

Publisher

Springer Berlin / Heidelberg

ISSN

0302-9743 (Print) 1611-3349 (Online)

Volume

Volume 1598/1999

Book

Genetic Programming

DOI

10.1007/3-540-48885-5

1999

ISBN

978-3-540-65899-3

DOI

10.1007/3-540-48885-5_7

Page

651

Subject Collection

Computer Science

SpringerLink Date

Friday, January 01, 1999

Evolving Multi-line Compilable C Programs

Michael O’Neill⁵ and Conor Ryan⁵

(5)	Dept. Of Computer Science And Information Systems, University of Limerick, Ireland

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.

Michael O’Neill
Email: Michael.ONeill@ul.ie

Conor Ryan
Email: Conor.Ryan@ul.ie

Evolving Multi-line Compilable C Programs

Fulltext Preview (Small, Large)