Redundancy and computational efficiency in Cartesian genetic programming
Evolutionary Computation, IEEE Transactions on, (April 2006)DOI: 10.1109/TEVC.2006.871253
Abstract
The graph-based Cartesian genetic programming system has an unusual genotype representation with a number of advantageous properties. It has a form of redundancy whose role has received little attention in the published literature. The representation has genes that can be activated or deactivated by mutation operators during evolution. It has been demonstrated that this "junk" has a useful role and is very beneficial in evolutionary search. The results presented demonstrate the role of mutation and genotype length in the evolvability of the representation. It is found that the most evolvable representations occur when the genotype is extremely large and in which over 95\% of the genes are inactive.
