The Use of Neutral Genotype-Phenotype Mappings for Improved Evolutionary Search
BT Technology Journal
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
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
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
Finding needles in haystacks is harder with neutrality
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Genetic programming using genotype-phenotype mapping from linear genomes into linear phenotypes
GECCO '96 Proceedings of the 1st annual conference on Genetic and 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
Towards understanding the effects of neutrality on the sudoku problem
Proceedings of the 9th annual conference on Genetic and evolutionary computation
IEEE Transactions on Evolutionary Computation
FOGA'07 Proceedings of the 9th international conference on Foundations of genetic algorithms
Robustness, evolvability, and accessibility in linear genetic programming
EuroGP'11 Proceedings of the 14th European conference on Genetic programming
Genetic Programming and Evolvable Machines
Robustness and evolvability of recombination in linear genetic programming
EuroGP'13 Proceedings of the 16th European conference on Genetic Programming
A study of redundancy and neutrality in evolutionary optimization
Evolutionary Computation
GP-induced and explicit bloating of the seeds in incremental GP improves evolutionary success
Genetic Programming and Evolvable Machines
Hi-index | 0.00 |
The effects of neutrality on evolutionary search have been considered in a number of studies, the results of which, however, have been contradictory. Some have found neutrality to be beneficial to aid evolution whereas others have argued that neutrality in the evolutionary process is useless. We believe that this confusion is due to several reasons: many studies have based their conclusions on performance statistics rather than a more in-depth analysis of population dynamics, studies often consider problems, representations and search algorithms that are relatively complex and so results represent the compositions of multiple effects, there is not a single definition of neutrality and different studies have added neutrality to problems in radically different ways. In this paper, we try to shed some light on neutrality by addressing these problems. That is, we use the simplest possible definition of neutrality (a neutral network of constant fitness, identically distributed in the whole search space), we consider one of the simplest possible algorithms (a mutation based, binary genetic algorithm) applied to two simple problems (a unimodal landscape and a deceptive landscape), and analyse both performance figures and, critically, population flows from and to the neutral network and the basins of attraction of the optima.