Initiation of Evolutionary Algorithms

Adrian O'Connor, Junbin Gao, John Louis

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

    19 Downloads (Pure)

    Abstract

    Evolutionary Algorithms are a relatively recent introduction to the field of optimization [1], [2].  They are robust and able to solve problems that would otherwise be difficult or impossible to solve using calculus or other gadient based methods.  The termination criteria for evolutionary algorithms [4] are important considerations [3].  Knowing when an evolutionary algorithm has done all it can do, whether that be convergence to a solution, stalling, or deceleration, allows one to define rules that identify such situations and direct the algorithm to act accordingly.  Â
    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
    Pages73-78
    Number of pages6
    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 'Initiation of Evolutionary Algorithms'. Together they form a unique fingerprint.

    Cite this