• DocumentCode
    2726557
  • Title

    Theoretical comparisons of search dynamics of genetic algorithms and evolution strategies

  • Author

    Okabe, Tatsuya ; Jin, Yaochu ; Sendhoff, Bernhard

  • Author_Institution
    Wako Res. Center, Honda R&D Co., Ltd., Saitama
  • Volume
    1
  • fYear
    2005
  • fDate
    5-5 Sept. 2005
  • Firstpage
    382
  • Abstract
    Genetic algorithms (GAs) and evolution strategies (ESs) are two widely used evolutionary algorithms. The main differences between GAs and ESs lie in their representations and variation operators, which result in very different search dynamics. In this paper, we compare the search dynamics of GAs and ESs theoretically using a theoretical framework for analyzing the search dynamics of evolution strategies proposed in this paper and a framework for genetic algorithms we suggested in (2005). Based on the theoretical analysis, interesting aspects of the search dynamics of GAs and ESs for single objective optimization are revealed. As an extension, preliminary results on the search dynamics of GAs for multi-objective optimization are also presented
  • Keywords
    genetic algorithms; search problems; evolution strategies; evolutionary algorithms; genetic algorithms; multiobjective optimization; search dynamics; variation operators; Algorithm design and analysis; Dynamic programming; Electronic switching systems; Europe; Evolutionary computation; Gaussian distribution; Genetic algorithms; Genetic mutations; Genetic programming; Research and development;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Evolutionary Computation, 2005. The 2005 IEEE Congress on
  • Conference_Location
    Edinburgh, Scotland
  • Print_ISBN
    0-7803-9363-5
  • Type

    conf

  • DOI
    10.1109/CEC.2005.1554709
  • Filename
    1554709