Evolutionary Algorithms

The Role of Mutation and Recombination

William M. Spears (Autor)

Buch | Hardcover

XIV, 222 Seiten

2000
Springer Berlin (Verlag)
978-3-540-66950-0 (ISBN)

Artikel merken

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.

Summary from the 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

Erscheint lt. Verlag	15.6.2000
Reihe/Serie	Natural Computing Series
Zusatzinfo	XIV, 222 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	432 g
Themenwelt	Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik
Schlagworte	Algorithm analysis and problem complexity • algorithms • Evolution • Evolutionäre Algorithmen • evolutionary algorithm • evolutionary algorithms • Genetic algorithms • Graph • markov chains • Master Patient Index • Mutation • Optimization • Racter • recombination • Uncertainty
ISBN-10	3-540-66950-7 / 3540669507
ISBN-13	978-3-540-66950-0 / 9783540669500
Zustand	Neuware