Ruggedness and neutrality—the NKp family of fitness landscapes
ALIFE Proceedings of the sixth international conference on Artificial life
The theory of evolution strategies
The theory of evolution strategies
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms
Proceedings of the 6th International Conference on Genetic Algorithms
Fitness Distance Correlation and Ridge Functions
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Fitness Distance Correlation And Problem Difficulty For Genetic Programming
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Proceedings of the European Conference on Genetic Programming
Neutrality and the Evolvability of Boolean Function Landscape
EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
Finding Needles in Haystacks Is Not Hard with Neutrality
EuroGP '02 Proceedings of the 5th European Conference on Genetic Programming
Redundant representations in evolutionary computation
Evolutionary Computation
Finding needles in haystacks is harder with neutrality
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A Study of Fitness Distance Correlation as a Difficulty Measure in Genetic Programming
Evolutionary Computation
An empirical investigation of how and why neutrality affects evolutionary search
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Neutrality: a necessity for self-adaptation
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Fitness distance correlation in structural mutation genetic programming
EuroGP'03 Proceedings of the 6th European conference on Genetic programming
Some steps towards understanding how neutrality affects evolutionary search
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Parameter control in evolutionary algorithms
IEEE Transactions on Evolutionary Computation
A comparison of predictive measures of problem difficulty inevolutionary algorithms
IEEE Transactions on Evolutionary Computation
How and why a bit-wise neutrality with and without locality affects evolutionary search
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Using quotient graphs to model neutrality in evolutionary search
Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
IEEE Transactions on Evolutionary Computation
An Empirical Investigation of How Degree Neutrality Affects GP Search
MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
On the effects of locality in a permutation problem: the Sudoku puzzle
CIG'09 Proceedings of the 5th international conference on Computational Intelligence and Games
When to use bit-wise neutrality
Natural Computing: an international journal
The effects of constant neutrality on performance and problem hardness in GP
EuroGP'08 Proceedings of the 11th European conference on Genetic programming
Defining locality as a problem difficulty measure in genetic programming
Genetic Programming and Evolvable Machines
A study of redundancy and neutrality in evolutionary optimization
Evolutionary Computation
| Hi-index | 0.00 |
The effects of neutrality on evolutionary search are not fully understood. In this paper we make an effort to shed some light on how and why bit-wise neutrality - an important form of neutrality induced by a genotype-phenotype map where each phenotypic bit is obtained by transforming a group of genotypic bits via an encoding function - influences the behaviour of a mutation-based GA on functions of unitation. To do so we study how the fitness distance correlation (fdc) of landscapes changes under the effect of different (neutral) encodings. We also study how phenotypic mutation rates change as a function of the genotypic mutation rate for different encodings. This allows us to formulate simple explanations for why the behaviour of a GA changes so radically with different types of neutrality and mutation rates. Finally, we corroborate these conjectures with extensive empirical experimentation.