Bookbot

Natural Computing Series: The Theory of Evolution Strategies

Więcej o książce

Evolutionary Algorithms, in particular Evolution Strategies, Genetic Algorithms, or Evolutionary Programming, have found wide acceptance as robust optimization algorithms in the last ten years. Compared with the broad propagation and the resulting practical prosperity in different scientific fields, the theory has not progressed as much. This monograph provides the framework and the first steps toward the theoretical analysis of Evolution Strategies (ES). The main emphasis is on understanding the functioning of these probabilistic optimization algorithms in real-valued search spaces by investigating the dynamical properties of some well-established ES algorithms. The book introduces the basic concepts of this analysis, such as progress rate, quality gain, and self-adaptation response, and describes how to calculate these quantities. Based on the analysis, functioning principles are derived, aiming at a qualitative understanding of why and how ES algorithms work.

Zakup książki

Natural Computing Series: The Theory of Evolution Strategies, Hans-Georg Beyer

Język
Rok wydania
2001
Oprawa
(twarda),
Stan książki
Dobry
Cena
112,99 zł

Metody płatności

Nikt jeszcze nie ocenił.Oceń

Tytuł
Natural Computing Series: The Theory of Evolution Strategies
Język
angielski
Wydawca
Springer
Rok wydania
2001
Oprawa
twarda
Liczba stron
380
ISBN10
3540672974
ISBN13
9783540672975
Seria
Opis
Evolutionary Algorithms, in particular Evolution Strategies, Genetic Algorithms, or Evolutionary Programming, have found wide acceptance as robust optimization algorithms in the last ten years. Compared with the broad propagation and the resulting practical prosperity in different scientific fields, the theory has not progressed as much. This monograph provides the framework and the first steps toward the theoretical analysis of Evolution Strategies (ES). The main emphasis is on understanding the functioning of these probabilistic optimization algorithms in real-valued search spaces by investigating the dynamical properties of some well-established ES algorithms. The book introduces the basic concepts of this analysis, such as progress rate, quality gain, and self-adaptation response, and describes how to calculate these quantities. Based on the analysis, functioning principles are derived, aiming at a qualitative understanding of why and how ES algorithms work.