Institutions | About Us | Help | Gaeilge
rian logo


Mark
Go Back
Neutrality in evolutionary algorithms... what do we know?
Galván-López, Edgar; Poli, Riccardo; Kattan, Ahmed; O'Neill, Michael; Brabazon, Anthony
Over the last years, the effects of neutrality have attracted the attention of many researchers in the Evolutionary Algorithms (EAs) community. A mutation from one gene to another is considered as neutral if this modification does not affect the phenotype. This article provides a general overview on the work carried out on neutrality in EAs. Using as a framework the origin of neutrality and its study in different paradigms of EAs (e.g., Genetic Algorithms, Genetic Programming), we discuss the most significant works and findings on this topic. This work points towards open issues, which the community needs to address. Science Foundation Ireland ti, ke, ab, li - TS 02.12 12 month EMBARGO
Keyword(s): Neutrality; Phenotypic mutation rates; Problem hardness; Genotype-Phenotype Mappings; Evolutionary algorithms; Genetic algorithms--Research; Genetic programming (Computer science)--Research
Publication Date:
2012
Type: Journal article
Peer-Reviewed: Unknown
Language(s): English
Institution: University College Dublin
Publisher(s): Springer
File Format(s): other; application/pdf
First Indexed: 2012-08-25 05:15:48 Last Updated: 2018-10-11 15:58:02