Neutrality in fitness landscapes
Applied Mathematics and Computation
How neutral networks influence evolvability
Complexity
Through the Labyrinth Evolution Finds a Way: A Silicon Ridge
ICES '96 Proceedings of the First International Conference on Evolvable Systems: From Biology to Hardware
The Advantages of Landscape Neutrality in Digital Circuit Evolution
ICES '00 Proceedings of the Third International Conference on Evolvable Systems: From Biology to Hardware
Modeling Building-Block Interdependency
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Neutrality and the Evolvability of Boolean Function Landscape
EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
Smooth Operator? Understanding and Visualising Mutation Bias
ECAL '01 Proceedings of the 6th European Conference on Advances in Artificial Life
Redundant representations in evolutionary computation
Evolutionary Computation
Evolving encapsulated programs as shared grammars
Genetic Programming and Evolvable Machines
Representations for evolutionary algorithms
Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
Representations for evolutionary algorithms
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
IEEE Transactions on Evolutionary Computation
Population sizing for the redundant trivial voting mapping
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
On population size and neutrality: facilitating the evolution of evolvability
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
The effects of constant neutrality on performance and problem hardness in GP
EuroGP'08 Proceedings of the 11th European conference on Genetic programming
Representations for evolutionary algorithms
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
The role of degenerate robustness in the evolvability of multi-agent systems in dynamic environments
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Representations for evolutionary algorithms
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Accessibility and runtime between convex neutral networks
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
Representations for evolutionary algorithms
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Natural Computing: an international journal
Natural Computing: an international journal
Representations for evolutionary algorithms
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
A study of redundancy and neutrality in evolutionary optimization
Evolutionary Computation
Hi-index | 0.00 |
A number of recent works in the evolutionary computation field have suggested that introducing large amounts of genetic redundancy may increase the evolvability of a population in an evolutionary algorithm. These works have variously claimed that the reliability of the search, the final fitness achieved, the ability to cope with changing environments, and the robustness to high mutation rates, may all be improved by employing this strategy. In this paper we dispute some of these claims, arguing that adding random redundancy cannot be generally useful for optimization purposes. By way of example we report on experiments where a proposed neutral encoding scheme (based on random Boolean networks) is compared to a direct encoding in two mutation-only EAs, at various mutation rates. Our findings show that with the appropriate choice of per-bit mutation rate, the evolvability of populations using the direct encoding is no less than with the redundant one.