Accessibility and runtime between convex neutral networks

Authors:
Per Kristian Lehre;Pauline C. Haddow
Affiliations:
Department of Computer and Information Science, Norwegian University of Science and Technology;Department of Computer and Information Science, Norwegian University of Science and Technology
Venue:
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
Year:
2006

Citing 4
Cited 1

How neutral networks influence evolvability

Complexity
On the analysis of the (1+ 1) evolutionary algorithm

Theoretical Computer Science
On the Utility of Redundant Encodings in Mutation-Based Evolutionary Search

PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Evolutionary algorithms - how to cope with plateaus of constantfitness and when to reject strings of the same fitness

IEEE Transactions on Evolutionary Computation

Evolutionary dynamics on multiple scales: a quantitative analysis of the interplay between genotype, phenotype, and fitness in linear genetic programming

Genetic Programming and Evolvable Machines

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many important fitness functions in Evolutionary Computation (EC) have high degree of neutrality i.e. large regions of the search space with identical fitness. However, the impact of neutrality on the runtime of Evolutionary Algorithms (EAs) is not fully understood. This work analyses the impact of the accessibility between neutral networks on the runtime of a simple randomised search heuristic. The runtime analysis uses a connection between random walks on graphs and electrical resistive networks.