Miller, J.F. and Smith, S.L. (2006) Redundancy and computational efficiency in Cartesian genetic programming. IEEE Transaction on Evolutionary Computation, 10 (2). pp. 167-174. ISSN 1089-778XFull text not available from this repository.
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.
|Institution:||The University of York|
|Academic Units:||The University of York > Electronics (York)|
|Depositing User:||York RAE Import|
|Date Deposited:||28 May 2009 15:36|
|Last Modified:||28 May 2009 15:36|