Evolutionary Algorithms: The Role of Mutation and Recombination by William M. SpearsEvolutionary Algorithms: The Role of Mutation and Recombination by William M. Spears

Evolutionary Algorithms: The Role of Mutation and Recombination

byWilliam M. Spears

Paperback | December 15, 2010

Pricing and Purchase Info

$194.37 online 
$233.50 list price save 16%
Earn 972 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

Despite decades of work in evolutionary algorithms, there remains a lot of uncertainty as to when it is beneficial or detrimental to use recombination or mutation. This book provides a characterization of the roles that recombination and mutation play in evolutionary algorithms. It integrates prior theoretical work and introduces new theoretical techniques for studying evolutionary algorithms. An aggregation algorithm for Markov chains is introduced which is useful for studying not only evolutionary algorithms specifically, but also complex systems in general. Practical consequences of the theory are explored and a novel method for comparing search and optimization algorithms is introduced. A focus on discrete rather than real-valued representations allows the book to bridge multiple communities, including evolutionary biologists and population geneticists.
Title:Evolutionary Algorithms: The Role of Mutation and RecombinationFormat:PaperbackDimensions:222 pages, 23.5 × 15.5 × 1.73 inPublished:December 15, 2010Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3642086241

ISBN - 13:9783642086243

Look for similar items by category:

Reviews

Table of Contents

I. Setting the Stage.- 1. Introduction.- 2. Background.- II. Static Theoretical Analyses.- 3. A Survival Schema Theory for Recombination.- 4. A Construction Schema Theory for Recombination.- 5. Survival and Construction Schema Theory for Recombination.- 6. A Survival Schema Theory for Mutation.- 7. A Construction Schema Theory for Mutation.- 8. Schema Theory: Mutation versus Recombination.- 9. Other Static Characterizations of Mutation and Recombination.- III. Dynamic Theoretical Analyses.- 10. Dynamic Analyses of Mutation and Recombination.- 11. A Dynamic Model of Selection and Mutation.- 12. A Dynamic Model of Selection, Recombination, and Mutation.- 13. An Aggregation Algorithm for Markov Chains.- IV. Empirical Analyses.- 14. Empirical Validation.- V. Summary.- 15. Summary and Discussion.- Appendix: Formal Computations for Aggregation.- References.