Theory of Evolutionary Computation

Recent Developments in Discrete Optimization
1. Auflage 2020
ISBN: 978-3-030-29416-8
Verlag: Springer International Publishing

Buch, Englisch, 506 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 797 g

Reihe: Natural Computing Series

This edited book reports on recent developments in the theory of evolutionary computation, or more generally the domain of randomized search heuristics. 

It starts with two chapters on mathematical methods that are often used in the analysis of randomized search heuristics, followed by three chapters on how to measure the complexity of a search heuristic: black-box complexity, a counterpart of classical complexity theory in black-box optimization; parameterized complexity, aimed at a more fine-grained view of the difficulty of problems; and the fixed-budget perspective, which answers the question of how good a solution will be after investing a certain computational budget. The book then describes theoretical results on three important questions in evolutionary computation: how to profit from changing the parameters during the run of an algorithm; how evolutionary algorithms cope with dynamically changing or stochastic environments; and how population diversity influencesperformance. Finally, the book looks at three algorithm classes that have only recently become the focus of theoretical work: estimation-of-distribution algorithms; artificial immune systems; and genetic programming.

Throughout the book the contributing authors try to develop an understanding for how these methods work, and why they are so successful in many applications. The book will be useful for students and researchers in theoretical computer science and evolutionary computing.

Zielgruppe

Research

Autoren/Hrsg.

Neumann, Frank

Doerr, Benjamin

Fachgebiete

• Wirtschaftswissenschaften Betriebswirtschaft Unternehmensforschung
• Mathematik | Informatik EDV | Informatik Informatik Theoretische Informatik
• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Angewandte Mathematik, Mathematische Modelle

Inhaltsverzeichnis

Probabilistic Tools for the Analysis of Randomized Optimization Heuristics.- Drift Analysis.- Complexity Theory for Discrete Black-Box Optimization Heuristics.- Parameterized Complexity Analysis of Randomized Search Heuristics.- Analysing Stochastic Search Heuristics Operating on a Fixed Budget.- Theory of Parameter Control for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices.- Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments.- The Benefits of Population Diversity in Evolutionary Algorithms: A Survey of Rigorous Runtime Analyses.- Theory of Estimation-of-Distribution Algorithms.- Theoretical Foundations of Immune-Inspired Randomized Search Heuristics for Optimization.- Computational Complexity Analysis of Genetic Programming.