<p><span>Evolutionary algorithms are successful biologically inspired meta-heuristics. Their success depends on adequate parameter settings. The question arises: how can evolutionary algorithms learn parameters automatically during the optimization? Evolution strategies gave an answer decades ago: s
Self-Adaptive Heuristics for Evolutionary Computation
โ Scribed by Oliver Kramer (auth.)
- Publisher
- Springer-Verlag Berlin Heidelberg
- Year
- 2008
- Tongue
- English
- Leaves
- 178
- Series
- Studies in Computational Intelligence 147
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
Evolutionary algorithms are successful biologically inspired meta-heuristics. Their success depends on adequate parameter settings. The question arises: how can evolutionary algorithms learn parameters automatically during the optimization? Evolution strategies gave an answer decades ago: self-adaptation. Their self-adaptive mutation control turned out to be exceptionally successful. But nevertheless self-adaptation has not achieved the attention it deserves.
This book introduces various types of self-adaptive parameters for evolutionary computation. Biased mutation for evolution strategies is useful for constrained search spaces. Self-adaptive inversion mutation accelerates the search on combinatorial TSP-like problems. After the analysis of self-adaptive crossover operators the book concentrates on premature convergence of self-adaptive mutation control at the constraint boundary. Besides extensive experiments, statistical tests and some theoretical investigations enrich the analysis of the proposed concepts.
โฆ Table of Contents
Front Matter....Pages -
Introduction....Pages 1-6
Front Matter....Pages 7-7
Evolutionary Algorithms....Pages 9-27
Self-Adaptation....Pages 29-47
Front Matter....Pages 49-49
Biased Mutation for Evolution Strategies....Pages 51-80
Self-Adaptive Inversion Mutation....Pages 81-95
Self-Adaptive Crossover....Pages 97-113
Front Matter....Pages 115-115
Constraint Handling Heuristics for Evolution Strategies....Pages 117-140
Front Matter....Pages 141-141
Summary and Conclusion....Pages 143-146
Front Matter....Pages 147-147
Continuous Benchmark Functions....Pages 149-158
Discrete Benchmark Functions....Pages 159-161
Back Matter....Pages -
โฆ Subjects
Appl.Mathematics/Computational Methods of Engineering; Artificial Intelligence (incl. Robotics)
๐ SIMILAR VOLUMES
<p>Prior to the early 1990s the term 'evolutionary computing' (EC) would have meant little to most practising engineers unless they had a particular interest in emerging computing technologies or were part of an organisation with significant in-house research activities. It was around this time that
Report from the Committee on Technologies for the Mining Industry, National Materials Advisory Board, Board on Earth Sciences and Resources, and the Committee on Earth Resources. Softcover.
<p>The book intends to cover various problematic aspects of emerging smart computing and self-adapting technologies comprising of machine learning, artificial intelligence, deep learning, robotics, cloud computing, fog computing, data mining algorithms, including emerging intelligent and smart appli
<p>Evolutionary Learning Algorithms for Neural Adaptive Control is an advanced textbook, which investigates how neural networks and genetic algorithms can be applied to difficult adaptive control problems which conventional results are either unable to solve , or for which they can not provide satis