By the same authors

From the same journal

From the same journal

The Automatic Acquisition, Evolution and Re-use of Modules in Cartesian Genetic Programming

Research output: Contribution to journalArticlepeer-review



Publication details

JournalIEEE Transactions on Evolutionary Computation
DatePublished - 1 Aug 2008
Issue number4
Number of pages21
Pages (from-to)397-417
Original languageEnglish


This paper presents a generalization of the graph- based genetic programming (GP) technique known as Cartesian genetic programming (CGP). We have extended CGP by utilizing automatic module acquisition, evolution, and reuse. To benchmark the new technique, we have tested it on: various digital circuit problems, two symbolic regression problems, the lawnmower problem, and the hierarchical if-and-only-if problem. The results show the new modular method evolves solutions quicker than the original nonmodular method, and the speedup is more pronounced on larger problems. Also, the new modular method performs favorably when compared with other GP methods. Analysis of the evolved modules shows they often produce recognizable functions. Prospects for further improvements to the method are discussed.

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations