Exploration and exploitation in evolutionary algorithms
Top Cited Papers
- 1 June 2013
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 45 (3), 1-33
- https://doi.org/10.1145/2480741.2480752
Abstract
“Exploration and exploitation are the two cornerstones of problem solving by search.” For more than a decade, Eiben and Schippers' advocacy for balancing between these two antagonistic cornerstones still greatly influences the research directions of evolutionary algorithms (EAs) [1998]. This article revisits nearly 100 existing works and surveys how such works have answered the advocacy. The article introduces a fresh treatment that classifies and discusses existing work within three rational aspects: (1) what and how EA components contribute to exploration and exploitation; (2) when and how exploration and exploitation are controlled; and (3) how balance between exploration and exploitation is achieved. With a more comprehensive and systematic understanding of exploration and exploitation, more research in this direction may be motivated and refined.Keywords
This publication has 108 references indexed in Scilit:
- Parameter tuning for configuring and analyzing evolutionary algorithmsSwarm and Evolutionary Computation, 2011
- Replacement strategies to preserve useful diversity in steady-state genetic algorithmsInformation Sciences, 2008
- Genetic Algorithms with Memory- and Elitism-Based Immigrants in Dynamic EnvironmentsEvolutionary Computation, 2008
- A new adaptive genetic algorithm for fixed channel assignmentInformation Sciences, 2007
- Metaheuristics in combinatorial optimizationACM Computing Surveys, 2003
- On self-adaptive features in real-parameter evolutionary algorithmsIEEE Transactions on Evolutionary Computation, 2001
- An orthogonal genetic algorithm with quantization for global numerical optimizationIEEE Transactions on Evolutionary Computation, 2001
- Parameter control in evolutionary algorithmsIEEE Transactions on Evolutionary Computation, 1999
- Degree of population diversity - a perspective on premature convergence in genetic algorithms and its Markov chain analysisIEEE Transactions on Neural Networks, 1997
- Operator and parameter adaptation in genetic algorithmsSoft Computing, 1997