Galván-López, EdgarEdgarGalván-LópezPoli, RiccardoRiccardoPoliKattan, AhmedAhmedKattanO'Neill, MichaelMichaelO'NeillBrabazon, AnthonyAnthonyBrabazon2012-02-232012-02-232011 Sprin2011-03-02Evolving Systems1868-6478 (Print)1868-6486 (Online)http://hdl.handle.net/10197/3532Over 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.300421 bytesapplication/pdfenThe final publication is available at springerlink.comNeutralityPhenotypic mutation ratesProblem hardnessGenotype-Phenotype MappingsEvolutionary algorithmsGenetic algorithms--ResearchGenetic programming (Computer science)--ResearchJournal Article2314516310.1007/s12530-011-9030-5https://creativecommons.org/licenses/by-nc-sa/1.0/