Springer, 2013. — 262 p.
The analysis of evolutionary algorithms is a lively and very active field of research. Many different and tremendously useful tools and methods for analyzing evolutionary algorithms have been and continue to be developed. In this book, an introduction to this field of research is presented that makes it accessible by introducing the most important and fundamental analytical methods, presenting them in a rigorous manner, including complete proofs, and demonstrating how they are applied by means of a number of instructive examples. This should enable anyone to enter this fascinating and fruitful field of research: people interested in further developing the theory of randomized search heuristics, practitioners in evolutionary computation who appreciate the importance of a solid theoretical foundation, and people who teach evolutionary computation and prefer solid and proven facts over rules of thumb. Since there is nothing more practical than a good theory, it is hoped that this book on analyzing evolutionary algorithms is seen as not merely a theoretical exercise but as a useful guide into practical evolutionary computation.