Analyzing evolutionary algorithms. The computer science perspective. (Q610284)

``Analyzing evolutionary algorithms'' is a beautiful book that has a lot to offer to people with different backgrounds. It not only explains evolutionary algorithms and puts them into relationship with other randomized search algorithms, it also provides detailed information for specialists who want to understand in depth how, why, and when evolutionary algorithms work. Everything is explained from the first principles and readers who want to understand the details do get all the mathematical background and detailed proofs; readers who just want to get the big picture will find the book very informative, since it provides this as well. The different sections are clearly motivated and all provide a good intuitive summary. The book deals with standard aspects such as the No-Free-Lunch theorem but also advanced aspects such as cooperative coevolution. The techniques for the numerical analysis of algorithms and different aspects of them (such as crossover and mutation) are mainly based on probability estimates by looking at evolutionary algorithms as randomized algorithms. The book is complemented by an extended list of references and suggestions for further reading.