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...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Spears, William M. (VerfasserIn)
Format:	Elektronisch E-Book
Sprache:	English
Veröffentlicht:	Berlin, Heidelberg Springer Berlin Heidelberg 2000
Ausgabe:	1st ed. 2000
Schriftenreihe:	Natural Computing Series
Schlagworte:	Artificial Intelligence Mathematical Logic and Foundations Evolutionary Biology Algorithm Analysis and Problem Complexity Mathematics of Computing Computer Appl. in Life Sciences Artificial intelligence Mathematical logic Evolutionary biology Algorithms Computer science—Mathematics Bioinformatics  Computational biology  Evolutionärer Algorithmus
Online-Zugang:	UBY01 Volltext
Zusammenfassung:	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
Beschreibung:	1 Online-Ressource (XIV, 222 p)
ISBN:	9783662041994
DOI:	10.1007/978-3-662-04199-4