Ruggedness and neutrality—the NKp family of fitness landscapes
ALIFE Proceedings of the sixth international conference on Artificial life
The Use of Neutral Genotype-Phenotype Mappings for Improved Evolutionary Search
BT Technology Journal
Neutral Networks and Evolvability with Complex Genotype-Phenotype Mapping
ECAL '01 Proceedings of the 6th European Conference on Advances in Artificial Life
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
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
Genotype-Phenotype-Mapping and Neutral Variation - A Case Study in Genetic Programming
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Fitness Distance Correlation And Problem Difficulty For Genetic Programming
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
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
Neutrality and self-adaptation
Natural Computing: an international journal
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
Fitness distance correlation in structural mutation genetic programming
EuroGP'03 Proceedings of the 6th European conference on Genetic programming
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
FOGA'07 Proceedings of the 9th international conference on Foundations of genetic algorithms
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
| Hi-index | 0.00 |
The effects of neutrality on evolutionary search have been considered in a number of interesting studies, the results of which, however, have been contradictory. We believe that this confusion is due to several reasons. In this paper, we shed some light on neutrality by addressing these problems. That is, we use the simplest possible definition of neutrality, we consider one of the simplest possible algorithms, we apply it to two problems (a unimodal landscape and a deceptive landscape), which we analyse using fitness distance correlation, performance statistics and, critically, tracking the full evolutionary path of individuals within their family tree.