ME-CGP: Multi Expression Cartesian Genetic Programming

Cartesian Genetic Programming (CGP) is a form of Genetic Programming that uses directed graphs to represent programs. In this paper we propose a way of structuring a CGP algorithm to make use of the multiple phenotypes which are implicitly encoded in a genome string. We show that this leads to a large increase in efficiency compared with standard CGP where genomes are translated into only one phenotype. We call this method Multi Expression CGP (ME-CGP), based on Mihai Oltean´s work on Multi Expression Programming using linear GP.