Termination Criteria for Evolutionary Algorithms

Adrian O'Connor, Junbin Gao, John Louis

    Research output: Book chapter/Published conference paperConference paperpeer-review

    20 Downloads (Pure)

    Abstract

    This presentation addresses the issue of when to terminate an evolutionary algorithm.  It is presented in the context of parameter search in NLR.  Of necessity it discusses the topology of the SSE and the roles that Exploration & Exploitation take in the search for an optimal solution.Â
    Original languageEnglish
    Title of host publicationWORLDCOMP'09
    Subtitle of host publicationWorld Congress in Computer Science, Computer Engineering, and Applied Computing
    Place of PublicationUSA
    PublisherCSREA Press
    Pages35-42
    Number of pages8
    ISBN (Electronic)1601321066
    Publication statusPublished - 2009
    EventInternational Conference on Genetic and Evolutionary Methods (GEM) - Las Vegas Nevada, USA, New Zealand
    Duration: 13 Jul 200916 Jul 2009

    Conference

    ConferenceInternational Conference on Genetic and Evolutionary Methods (GEM)
    Country/TerritoryNew Zealand
    Period13/07/0916/07/09

    Fingerprint

    Dive into the research topics of 'Termination Criteria for Evolutionary Algorithms'. Together they form a unique fingerprint.

    Cite this