1. Introduction.- 2. Concepts for the Analysis of the ES.- 3. The Progress Rate of the (1 % MathType!MTEF!2!1!+- % feaagCart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn % hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr % 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9 % vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x % fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaaeaaaaaaaaa8 % qadaqadaWdaeaapeGaaGyma8aadaWfGaqaa8qacaGGSaaal8aabeqa % a8qacqGHRaWkaaGccqaH7oaBaiaawIcacaGLPaaaaaa!3C4E! $$\left( {1\mathop ,\limits^ + \lambda } \right)$$ ?)-ES on the Sphere Model.- 5. The Analysis of the (?, ?)-ES.- 6. The (?/?, ?) Strategies - or Why "Sex" May be Good.- 7. The (1, ?)-?-Self-Adaptation.- Appendices.- A. Integrals.- A.1 Definite Integrals of the Normal Distribution.- A.2 Indefinite Integrals of the Normal Distribution.- A.3 Some Integral Identities.- B. Approximations.- B.1 Frequently Used Taylor Expansions.- B.3 Cumulants, Moments, and Approximations.- B.3.1 Fundamental Relations.- B.3.2 The Weight Coefficients for the Density Approximation of a Standardized Random Variable.- B.4 Approximation of the Quantile Function.- C. The Normal Distribution.- C.3 Product Moments of Correlated Gaussian Mutations.- C.3.1 Fundamental Relations.- C.3.2 Derivation of the Product Moments.- D. (1, ?)-Progress Coefficients.- D.2 Table of Progress Coefficients of the (1, ?)-ES.- References.

The Theory of Evolution Strategies

From the Publisher: 
This book integrates two areas of computer science, namely data mining and evolutionary algorithms. Both these areas have become increasingly popular in the last few years, and their integration is currently an active research area. In general, data mining consists of extracting knowledge from data. In particular, in this book we emphasize the importance of discovering comprehensible, interesting knowledge, which is potentially useful for intelligent decision making.In a nutshell, the motivation for applying evolutionary algorithms to data mining is that evolutionary algorithms are robust search methods which perform a global search in the space of candidate solutions. In contrast, most rule induction methods perform a local, greedy search in the space of candidate rules. Intuitively, the global search of evolutionary algorithms can discover interesting rules and patterns that would be missed by the greedy search performed by most rule induction methods.

Special Issue on data mining and knowledge discovery with evolutionary algorithms

Evolutionary computation and structural design: A survey of the state-of-the-art

Genetic algorithms (GAs) have become popular as a means of solving hard combinatorial optimization problems. The first part of this chapter briefly traces their history, explains the basic concepts and discusses some of their theoretical aspects. It also references a number of sources for further research into their applications. The second part concentrates on the detailed implementation of a GA. It discusses the fundamentals of encoding a ‘genotype’ in different circumstances and describes the mechanics of population selection and management and the choice of genetic ‘operators’ for generating new populations. In closing, some specific guidelines for using GAs in practice are provided.

Genetic algorithms

Fitness landscapes have proven to be a valuable concept in evolutionary biology, combinatorial optimization, and the physics of disordered systems. A fitness landscape is a mapping from a configuration space into the real numbers. The configuration space is equipped with some notion of adjacency, nearness, distance, or accessibility. Landscape theory has emerged as an attempt to devise suitable mathematical structures for describing the ``static'' properties of landscapes as well as their influence on the dynamics of adaptation. In this review we focus on the connections of landscape theory with algebraic combinatorics and random graph theory, where exact results are available.

Combinatorial Landscapes

Despite decades of work in evolutionary algorithms, there remains an uncertainty as to the relative benefits and detriments of using recombination or mutation. This book provides a characterization of the roles that recombination and mutation play in evolutionary algorithms. It integrates important prior work and introduces new theoretical techniques for studying evolutionary algorithms. Consequences of the theory are explored and a novel method for comparing search and optimization algorithms is introduced. The focus allows the book to bridge multiple communities, including evolutionary biologists and population geneticists.

H. P. Spaink

Papers

Evolutionary Algorithms: The Role of Mutation and Recombination

Bee-Inspired Protocol Engineering