DocumentCode
1747724
Title
On neutral networks and evolvability
Author
Ebner, Marc ; Langguth, Patrick ; Albert, Jürgen ; Shackleton, Mark ; Shipman, Rob
Author_Institution
Lehrstuhl fur Inf., Wurzburg Univ., Germany
Volume
1
fYear
2001
fDate
2001
Firstpage
1
Abstract
Evolutionary algorithms apply the processes of variation, reproduction and selection to look for an individual that is capable of solving the task in hand. In order to improve the evolvability of a population, we propose to copy important characteristics of nature´s search space. Desired characteristics for a genotype-phenotype mapping are described, and several highly redundant genotype-phenotype mappings are analyzed in the context of a population-based search. We show that evolvability is influenced by the existence of neutral networks in the genotype space. The extent of the neutral networks affects the interconnectivity of the search space and thereby affects evolvability. Species evolving on a non-redundant mapping reach a state of stasis after a few generations; in effect, evolution comes to a halt. However, species evolving on a genotype-phenotype mapping with extensive neutral networks are continuously able to find adaptive mutations and are able to locate higher optima. The existence of highly intertwined neutral networks increases the evolvability of a population
Keywords
evolutionary computation; redundancy; search problems; adaptive mutations; evolutionary algorithms; evolvability; genotype-phenotype mappings; interconnectivity; neutral networks; nonredundant mappings; optima; population-based search; redundant mappings; reproduction; search space; selection; stasis; variation; Evolutionary computation; Genetic mutations; Production; Space exploration; Space heating;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2001. Proceedings of the 2001 Congress on
Conference_Location
Seoul
Print_ISBN
0-7803-6657-3
Type
conf
DOI
10.1109/CEC.2001.934363
Filename
934363
Link To Document