Neutral genotype-phenotype mappings can be observed in
natural evolution and are often used in evolutionary
computation. In this article, important aspects of such
encodings are analysed.
First, it is shown that in the absence of external
control neutrality allows a variation of the search
distribution independent of phenotypic changes. In
particular, neutrality is necessary for
self-adaptation, which is used in a variety of
algorithms from all main paradigms of evolutionary
computation to increase efficiency.
Second, the average number of fitness evaluations
needed to find a desirable (e.g., optimally adapted)
genotype depending on the number of desirable genotypes
and the cardinality of the genotype space is derived.
It turns out that this number increases only marginally
when neutrality is added to an encoding presuming that
the fraction of desirable genotypes stays constant and
that the number of these genotypes is not too small.
%0 Journal Article
%1 Igel:2003:NC
%A Igel, Christian
%A Toussaint, Marc
%D 2003
%J Natural Computing
%K No-Free-Lunch algorithms, computation, evolutionary genetic genotype-phenotype mapping, neutrality, programming, redundancy, self-adaptation theorem,
%N 2
%P 117--132
%R doi:10.1023/A:1024906105255
%T Neutrality and Self-Adaptation
%U http://ipsapp009.kluweronline.com/content/getfile/5030/5/1/abstract.htm
%V 2
%X Neutral genotype-phenotype mappings can be observed in
natural evolution and are often used in evolutionary
computation. In this article, important aspects of such
encodings are analysed.
First, it is shown that in the absence of external
control neutrality allows a variation of the search
distribution independent of phenotypic changes. In
particular, neutrality is necessary for
self-adaptation, which is used in a variety of
algorithms from all main paradigms of evolutionary
computation to increase efficiency.
Second, the average number of fitness evaluations
needed to find a desirable (e.g., optimally adapted)
genotype depending on the number of desirable genotypes
and the cardinality of the genotype space is derived.
It turns out that this number increases only marginally
when neutrality is added to an encoding presuming that
the fraction of desirable genotypes stays constant and
that the number of these genotypes is not too small.
@article{Igel:2003:NC,
abstract = {Neutral genotype-phenotype mappings can be observed in
natural evolution and are often used in evolutionary
computation. In this article, important aspects of such
encodings are analysed.
First, it is shown that in the absence of external
control neutrality allows a variation of the search
distribution independent of phenotypic changes. In
particular, neutrality is necessary for
self-adaptation, which is used in a variety of
algorithms from all main paradigms of evolutionary
computation to increase efficiency.
Second, the average number of fitness evaluations
needed to find a desirable (e.g., optimally adapted)
genotype depending on the number of desirable genotypes
and the cardinality of the genotype space is derived.
It turns out that this number increases only marginally
when neutrality is added to an encoding presuming that
the fraction of desirable genotypes stays constant and
that the number of these genotypes is not too small.},
added-at = {2008-06-19T17:35:00.000+0200},
author = {Igel, Christian and Toussaint, Marc},
biburl = {https://www.bibsonomy.org/bibtex/2234691c3c93abc7396153fc853fea68a/brazovayeye},
doi = {doi:10.1023/A:1024906105255},
interhash = {8ac73a46636ad1806923ab745b2329a6},
intrahash = {234691c3c93abc7396153fc853fea68a},
journal = {Natural Computing},
keywords = {No-Free-Lunch algorithms, computation, evolutionary genetic genotype-phenotype mapping, neutrality, programming, redundancy, self-adaptation theorem,},
notes = {Article ID: 5126729},
number = 2,
pages = {117--132},
timestamp = {2008-06-19T17:42:07.000+0200},
title = {Neutrality and Self-Adaptation},
url = {http://ipsapp009.kluweronline.com/content/getfile/5030/5/1/abstract.htm},
volume = 2,
year = 2003
}