The automatic acquisition, evolution and reuse of modules in Cartesian genetic programming
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.
genetic programming (gp) cartesian genetic programming (cgp) module acquisition modularity automatically defined functions (adfs) embedded cartesian genetic programming (ecgp) graph-based representations