In most Genetic Programming (GP) approaches, the space of genotypes, that is the search space, is identical to the space of phenotypes, that is the solution space. Developmental approaches, like Developmental Genetic Programming (DGP), distinguish between genotypes and phenotypes and use a genotype-phenotype mapping prior to fitness evaluation of a phenotype. To perform this mapping, DGP uses a genetic code, that is, a mapping from genotype components to phenotype components. The genotype-phenotype mapping is critical for the performance of the underlying search process which is why adapting the mapping to a given problem is of interest. Previous work shows, on an easy synthetic problem, the feasibility of code evolution to the effect of a problem-specific self-adaptation of the mapping. The present empirical work delivers a demonstration of this effect on a hard synthetic problem, showing the real-world potential of code evolution which increases the occurrence of relevant phenotypic components and reduces the occurrence of components that represent noise.
[1]
Genetic,et al.
GECCO-99 : proceedings of the Genetic and Evolutionary Computation Conference : a joint meeting of the Eighth International Conference on Genetic Algorithms (ICGA-99) and the Fourth Annual Genetic Programming Conference (GP-99), July 13-17, 1999, Orlando, Florida
,
1999
.
[2]
John R. Koza,et al.
Genetic programming - on the programming of computers by means of natural selection
,
1993,
Complex adaptive systems.
[3]
Peter Nordin,et al.
Genetic programming - An Introduction: On the Automatic Evolution of Computer Programs and Its Applications
,
1998
.
[4]
Michael O'Neill,et al.
Crossover in Grammatical Evolution: A Smooth Operator?
,
2000,
EuroGP.
[5]
W. Banzhaf,et al.
Genetic programming using genotype-phenotype mapping from linear genomes into linear phenotypes
,
1996
.