Title :
Netcrawling-optimal evolutionary search with neutral networks
Author_Institution :
Sch. of Cognitive & Comput. Sci., Sussex Univ., Brighton, UK
Abstract :
Several studies have demonstrated that in the presence of a high degree of selective neutrality, in particular on fitness landscapes featuring neutral networks, evolution is qualitatively different from that of the more common model of rugged/correlated fitness landscapes often (implicitly) assumed by GA researchers. We characterise evolutionary dynamics on fitness landscapes with neutral networks and argue that, if a certain correlation-like statistical property holds, the most efficient strategy for evolutionary search is not population-based, but rather a population-of-one netcrawler-a variety of hill-climber. We derive quantitative estimates for expected waiting times to discovery of fitter genotypes and discuss implications for evolutionary algorithm design, including a proposal for an adaptive variant of the netcrawler
Keywords :
evolutionary computation; search problems; correlation-like statistical property; evolutionary algorithm design; evolutionary dynamics; fitness landscapes; genotypes; hill-climber; neutral networks; optimal evolutionary search; population-of-one netcrawler; selective neutrality; Algorithm design and analysis; Cognitive robotics; Evolution (biology); Evolutionary computation; Genetic mutations; Hardware; Proposals; RNA; Robots; Testing;
Conference_Titel :
Evolutionary Computation, 2001. Proceedings of the 2001 Congress on
Conference_Location :
Seoul
Print_ISBN :
0-7803-6657-3
DOI :
10.1109/CEC.2001.934367