Neutrality in evolutionary algorithms... what do we know?
Files in This Item:
|neutralityWhatDoWeknow_Galvan2011.pdf||293.38 kB||Adobe PDF||Download|
|Title:||Neutrality in evolutionary algorithms... what do we know?||Authors:||Galván-López, Edgar
|Permanent link:||http://hdl.handle.net/10197/3532||Date:||2-Mar-2011||Abstract:||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.||Funding Details:||Science Foundation Ireland||Type of material:||Journal Article||Publisher:||Springer||Journal:||Evolving Systems||Volume:||2||Issue:||3||Start page:||145||End page:||163||Copyright (published version):||2011 Springer||Keywords:||Neutrality; Phenotypic mutation rates; Problem hardness; Genotype-Phenotype Mappings; Evolutionary algorithms||Subject LCSH:||Genetic algorithms--Research
Genetic programming (Computer science)--Research
|DOI:||10.1007/s12530-011-9030-5||Other versions:||http://dx.doi.org/10.1007/s12530-011-9030-5||Language:||en||Status of Item:||Peer reviewed|
|Appears in Collections:||Computer Science Research Collection|
CASL Research Collection
Show full item record
Page view(s) 50105
This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.