Genetic programming and emergent intelligence
Advances in genetic programming
Foundations of genetic programming
Foundations of genetic programming
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
Complexity Compression and Evolution
Proceedings of the 6th International Conference on Genetic Algorithms
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
Introns in Nature and in Simulated Structure Evolution
Biocomputing and emergent computation: Proceedings of BCEC97
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
Hi-index | 0.00 |
Understanding how neutrality works in EC systems has drawn increasing attention. However, some researchers have found neutrality to be beneficial for the evolutionary process while others have found it either useless or worse. We believe there are various reasons for these contradictory results: (a) many studies have based their conclusions using crossover and mutation as main operators rather than using only mutation (Kimura's studies were done analysing only mutations) and, (b) studies often consider problems and representation with larger complexity. The aim of this paper is to analyse how neutral mutations tend to behave in GP and establish how important they are. For this purpose we introduce an approach which has two advantages: (a) it allows us to specify neutrality and, (b) this makes possible to understand how neutrality affects the evolutionary search process.