THEORY OF RANDOMIZED SEARCH HEURISTICS
Foundations and Recent Developments
edited by Anne Auger (INRIA, France)
&
Benjamin Doerr (Max-Planck-Institut für Informatik, Germany)
Table of Contents (127k)
Preface (93k)
Chapter 1: Analyzing Randomized Search Heuristics: Tools from Probability Theory (343k)
Randomized search heuristics such as evolutionary algorithms, genetic algorithms, evolution strategies, ant colony and particle swarm optimization turn out to be highly successful for optimization in practice. The theory of randomized search heuristics, which has been growing rapidly in the last five years, also attempts to explain the success of the methods in practical applications.
This book covers both classical results and the most recent theoretical developments in the field of randomized search heuristics such as runtime analysis, drift analysis and convergence. Each chapter provides an overview of a particular domain and gives insights into the proofs and proof techniques of more specialized areas. Open problems still remain widely in randomized search heuristics — being a relatively young and vast field. These problems and directions for future research are addressed and discussed in this book.
The book will be an essential source of reference for experts in the domain of randomized search heuristics and also for researchers who are involved or ready to embark in this field. As an advanced textbook, graduate students will benefit from the comprehensive coverage of topics
|
