DMCA
This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 1 The Automatic Acquisition, Evolution and Reuse of Modules in C
BibTeX
@MISC{Walker_thisarticle,
author = {James Alfred Walker and Julian Francis Miller},
title = {This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 1 The Automatic Acquisition, Evolution and Reuse of Modules in C},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract—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 fa-vorably 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. Index Terms—Automatically defined functions (ADFs), Carte-sian genetic programming (CGP), embedded Cartesian genetic programming (ECGP), genetic programming (GP), graph-based representations, modularity, module acquisition. I.
Keyphrases
automatic acquisition ieee transaction evolutionary computation future issue cartesian genetic programming various digital circuit problem gp method original nonmodular method evolved module module acquisition new modular method evolves solution new modular method performs symbolic regression problem index term genetic programming carte-sian genetic programming graph-based representation automatic module acquisition recognizable function lawnmower problem graph-based genetic programming hierarchical if-and-only-if problem new technique
