About this book
Evolution strategies have more than 50 years of history in the field of evolutionary computation. Since the early 1990s, many algorithmic variations of evolution strategies have been developed, characterized by the fact that they use the so-called derandomization concept for strategy parameter adaptation. Most importantly, the covariance matrix adaptation strategy (CMA-ES) and its successors are the key representatives of this group of contemporary evolution strategies.
This book provides an overview of the key algorithm developments between 1990 and 2012, including brief descriptions of the algorithms, a unified pseudocode representation of each algorithm, and program code which is available for download. In addition, a taxonomy of these algorithms is provided to clarify similarities and differences as well as historical relationships between the various instances of evolution strategies. Moreover, due to the authors’ focus on industrial applications of nonlinear optimization, all algorithms are empirically compared on the so-called BBOB (Black-Box Optimization Benchmarking) test function suite, and ranked according to their performance. In contrast to classical academic comparisons, however, only a very small number of objective function evaluations is permitted. In particular, an extremely small number of evaluations, such as between one hundred and one thousand for high-dimensional functions, is considered. This is motivated by the fact that many industrial optimization tasks do not permit more than a few hundred evaluations. Our experiments suggest that evolution strategies are powerful nonlinear direct optimizers even for challenging industrial problems with a very small budget of function evaluations.
The book is suitable for academic and industrial researchers and practitioners.
- Book Title Contemporary Evolution Strategies
- Series Title Natural Computing Series
- Series Abbreviated Title Natural Computing Series
- DOI https://doi.org/10.1007/978-3-642-40137-4
- Copyright Information Springer-Verlag Berlin Heidelberg 2013
- Publisher Name Springer, Berlin, Heidelberg
- eBook Packages Computer Science Computer Science (R0)
- Hardcover ISBN 978-3-642-40136-7
- Softcover ISBN 978-3-662-51408-5
- eBook ISBN 978-3-642-40137-4
- Series ISSN 1619-7127
- Edition Number 1
- Number of Pages XIII, 90
- Number of Illustrations 2 b/w illustrations, 31 illustrations in colour
Algorithm Analysis and Problem Complexity
- Buy this book on publisher's site