Synopses & Reviews
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.
Synopsis
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.
Table of Contents
Glossary.-
Part I. Setting the Stage: Introduction.- Background.-
Part II. Static Theoretical Analyses: A Survival Schema Theory for Recombination.- A Construction Schema Theory for Recombination.- Survival and Construction Schema Theory for Recombination.- A Survival Schema Theory for Mutation.- A Construction Schema Theory for Mutation.- Schema Theory: Mutation versus Recombination.- Other Static Characterizations of Mutation and Recombination.-
Part III. Dynamic Theoretical Analyses: Dynamic Analyses of Mutation and Recombination.- A Dynamic Model of Selection and Mutation.- A Dynamic Model of Selection, Recombination and Mutation.- An Aggregation Algorithm for Markov Chains.-
Part IV. Empirical Analyses: Empirical Validation.-
Part V. Summary: Summary and Discussion.- Appendix: Formal Computations for the Aggregation Algorithm.- Bibliography.