• DocumentCode
    3561892
  • Title

    Continuous selection and self-adaptive evolution strategies

  • Author

    Runarsson, Thomas Philip ; Yao, Xin

  • Author_Institution
    Sci. Inst., Iceland Univ., Reykjavik, Iceland
  • Volume
    1
  • fYear
    2002
  • Firstpage
    279
  • Lastpage
    284
  • Abstract
    The intention of this work is to eliminate the need for a synchronous generation scheme in the (μ±λ) evolution strategy. It is motivated by the need for a more practical implementation of selection strategies on parallel machine architectures. This strategy is known as continuous or steady state selection. Continuous selection is known to reduce significantly the number of function evaluations needed to reach an optimum in evolutionary search. Evolution strategy theory is used to illustrate when continuous selection is more efficient than generational selection. The authors also consider how this gain in efficiency may influence the overall effectiveness of the evolution strategy. The implementation of continuous selection becomes problematic for algorithms using explicitly encoded self-adaptive strategy parameters. Self-adaption is therefore given special consideration. The discussion leads a new evolution strategy version
  • Keywords
    adaptive systems; evolutionary computation; search problems; algorithms; continuous selection; evolutionary search; explicitly encoded self-adaptive strategy parameters; function evaluations; optimum; parallel machine architectures; self-adaptive evolution strategies; steady state selection; Acceleration; Automatic testing; Computer science; Covariance matrix; Data structures; Evolutionary computation; Genetic mutations; Parallel machines; Steady-state; Synchronous generators;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Evolutionary Computation, 2002. CEC '02. Proceedings of the 2002 Congress on
  • Print_ISBN
    0-7803-7282-4
  • Type

    conf

  • DOI
    10.1109/CEC.2002.1006247
  • Filename
    1006247