[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/2001858.2001932acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
poster

Fecundity and selectivity in evolutionary computation

Published: 12 July 2011 Publication History

Abstract

The number of offspring produced by each parent---that is, the fecundity of reproducing individuals---varies among evolutionary computation methods and settings. In most prior work fecundity has been tied directly to selectivity, with higher selection pressure giving rise to higher fecundity among individuals selected to reproduce. In nature, however, there is a wider variety of strategies, with different organisms producing different numbers of offspring under the influence of a range of factors including not only selection pressure but also other factors such as environmental stability and competition within a niche. In this work we consider possible lessons that may be drawn from nature's approaches to these issues and applied to evolutionary computation systems. In particular, we consider ways in which fecundity can be dissociated from selectivity and situations in which it may be beneficial to do so. We present a simple modification to the standard evolutionary algorithm, called decimation, that permits high fecundity in conjunction with modest selection pressure and which could be used in various forms of evolutionary computation. We also present a simple example, showing that decimation can improve the problem-solving performance of a genetic algorithm when applied to a deceptive problem.

References

[1]
A. E. Eiben and J. E. Smith. Introduction to Evolutionary Computing. SpringerVerlag, 2003.
[2]
J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA, 1992.
[3]
R. H. MacArthur and E. O. Wilson. The theory of island biogeography. Princeton University Press, April 2001.

Cited By

View all
  • (2013)A multiset genetic algorithm for the optimization of deceptive problemsProceedings of the 15th annual conference on Genetic and evolutionary computation10.1145/2463372.2463471(813-820)Online publication date: 6-Jul-2013

Index Terms

  1. Fecundity and selectivity in evolutionary computation

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    GECCO '11: Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
    July 2011
    1548 pages
    ISBN:9781450306904
    DOI:10.1145/2001858

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 12 July 2011

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. deb's deceptive problem
    2. decimation
    3. fecundity
    4. selection
    5. truncation

    Qualifiers

    • Poster

    Conference

    GECCO '11
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 18 Dec 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2013)A multiset genetic algorithm for the optimization of deceptive problemsProceedings of the 15th annual conference on Genetic and evolutionary computation10.1145/2463372.2463471(813-820)Online publication date: 6-Jul-2013

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media