|
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 we belive the community needs to address.
|
|
Keyword(s):
|
Neutrality; Phenotypic mutation rates; Problem hardness; Genotype–phenotype mappings; Evolutionary algorithms |
Publication Date:
|
2011 |
|
Type:
|
Journal article |
|
Peer-Reviewed:
|
Yes |
|
Institution:
|
Maynooth University |
|
Citation(s):
|
Galván López, Edgar and Poli, Riccardo and Kattan, Ahmed and O'Neill, Michael and Brabazon, Anthony (2011) Neutrality in evolutionary algorithms... What do we know? Evolving Systems, 2 (3). pp. 145-163. ISSN 1868-6486 |
|
Publisher(s):
|
Springer |
|
File Format(s):
|
other |
|
Related Link(s):
|
http://mural.maynoothuniversity.ie/12337/1/Galvan_Neutrality_2011.pdf |
|
First Indexed:
2020-04-02 06:00:40 Last Updated:
2020-04-02 06:00:40 |
