![Evolutionary Algorithms [electronic resource] : The Role of Mutation and Recombination /](/search/themes/bootstrap3/images/libros.png)
Evolutionary Algorithms [electronic resource] : The Role of Mutation and Recombination /
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.
| Main Authors: | , |
|---|---|
| Format: | Texto biblioteca |
| Language: | eng |
| Published: |
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,
2000
|
| Subjects: | Computer science., Algorithms., Computer science, Artificial intelligence., Bioinformatics., Computational biology., Evolutionary biology., Mathematical logic., Computer Science., Artificial Intelligence (incl. Robotics)., Mathematical Logic and Foundations., Evolutionary Biology., Algorithm Analysis and Problem Complexity., Mathematics of Computing., Computer Appl. in Life Sciences., |
| Online Access: | http://dx.doi.org/10.1007/978-3-662-04199-4 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|