Evolutionary computation: an overview
Thomas Bäck, Hans–Paul Schwefel · IEEE International Conference on Evolutionary Computation (ICEC) · 2002
We present an overview of the most important representatives of algorithms gleaned from natural evolution, so-called evolutionary algorithms. Evolution strategies, evolutionary programming, and genetic algorithms are summarized, with special emphasis on the principle of strategy parameter self-adaptation utilized by the first two algorithms to learn their own strategy parameters such as mutation variances and covariances. Some experimental results are presented which demonstrate the working principle and robustness of the self-adaptation methods used in evolution strategies and evolutionary programming. General principles of evolutionary algorithms are discussed, and we identify certain properties of natural evolution which might help to improve the problem solving capabilities of evolutionary algorithms even further.
Cited by 237 works. doi:10.1109/icec.1996.542329
Authors
References
- Genetic algorithms in search, optimization, and machine learning
- Adaptation in Natural and Artificial Systems
- Genetic Algorithms + Data Structures = Evolution Programs
- Evolutionary Algorithms in Theory and Practice
- Evolution and Optimum Seeking
- An Overview of Evolutionary Algorithms in Multiobjective Optimization
- Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution
- Artificial Intelligence through Simulated Evolution
- Genetic Algorithms + Data Structures = Evolution Programs
- Uniform crossover in genetic algorithms