MURAL - Maynooth University Research Archive Library

    Neutrality in evolutionary algorithms... What do we know?

    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

    Download (446kB) | Preview

    Share your research

    Twitter Facebook LinkedIn GooglePlus Email more...

    Add this article to your Mendeley library


    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.

    Item Type: Article
    Keywords: Neutrality; Phenotypic mutation rates; Problem hardness; Genotype–phenotype mappings; Evolutionary algorithms;
    Academic Unit: Faculty of Science and Engineering > Computer Science
    Faculty of Science and Engineering > Research Institutes > Hamilton Institute
    Item ID: 12337
    Identification Number:
    Depositing User: Edgar Galvan
    Date Deposited: 31 Jan 2020 12:00
    Journal or Publication Title: Evolving Systems
    Publisher: Springer
    Refereed: Yes
    Use Licence: This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here

    Repository Staff Only(login required)

    View Item Item control page


    Downloads per month over past year

    Origin of downloads