• DocumentCode
    2823651
  • Title

    Elitism Levels Traverse Mechanism for the derivation of upper bounds on unimodal functions

  • Author

    Ter-Sarkisov, Aram

  • Author_Institution
    Dept. of Comput. Sci., Massey Univ., Wellington, New Zealand
  • fYear
    2012
  • fDate
    10-15 June 2012
  • Firstpage
    1
  • Lastpage
    8
  • Abstract
    In this article we present an Elitism Levels Traverse Mechanism that we designed to find bounds on population-based Evolutionary Algorithms solving unimodal functions. We prove its efficiency theoretically and test it on OneMax function deriving bounds cμn log n-O(μn). This analysis can be generalized to any similar algorithm using variants of elitist selection and genetic operators that flip or swap only 1 bit in each string.
  • Keywords
    computational complexity; genetic algorithms; computational complexity; elitism levels traverse mechanism; elitist selection; genetic algorithm; genetic operator; onemax function; population-based evolutionary algorithm; unimodal function; Algorithm design and analysis; Equations; Evolutionary computation; Genetics; Optimization; Runtime; Upper bound; Computational complexity; Evolutionary computation; Genetic algorithms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Evolutionary Computation (CEC), 2012 IEEE Congress on
  • Conference_Location
    Brisbane, QLD
  • Print_ISBN
    978-1-4673-1510-4
  • Electronic_ISBN
    978-1-4673-1508-1
  • Type

    conf

  • DOI
    10.1109/CEC.2012.6256619
  • Filename
    6256619
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2823651