Options
Neutrality in evolutionary algorithms... what do we know?
Date Issued
2011-03-02
Date Available
2012-02-23T12:28:33Z
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.
Sponsorship
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
Subject – LCSH
Genetic algorithms--Research
Genetic programming (Computer science)--Research
Web versions
Language
English
Status of Item
Peer reviewed
ISSN
1868-6478 (Print)
1868-6486 (Online)
This item is made available under a Creative Commons License
File(s)
Loading...
Name
neutralityWhatDoWeknow_Galvan2011.pdf
Size
293.38 KB
Format
Adobe PDF
Checksum (MD5)
7b6504725f2d4dc74beda0d020d77df4
Owning collection
Mapped collections