Evolutionary Algorithms
@inproceedings{Corne2018EvolutionaryA,
title={Evolutionary Algorithms},
author={David W. Corne and Michael Adam Lones},
year={2018}
}Evolutionary algorithms (EAs) are population-based metaheuristics, originally inspired by aspects of natural evolution. Modern varieties incorporate a broad mixture of search mechanisms, and tend to blend inspiration from nature with pragmatic engineering concerns; however, all EAs essentially operate by maintaining a population of potential solutions and in some way artificially 'evolving' that population over time. Particularly well-known categories of EAs include genetic algorithms (GAs…
One Citation
Classifying Metaheuristics: Towards a unified multi-level classification system
- Business, Computer ScienceNatural Computing
- 2020
This paper provides the basis for a new comprehensive classification system for metaheuristics and presents a multi-level architecture and suitable criteria for the task of classifying meta heuristics.
References
SHOWING 1-10 OF 56 REFERENCES
Structured population genetic algorithms: a literature survey
- Computer ScienceArtificial Intelligence Review
- 2012
This paper surveys the major advances in GA, particularly in relation to the class of structured population GAs, where better exploration and exploitation of the search space is accomplished by controlling interactions among individuals in the population pool.
The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation
- Computer ScienceProceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406)
- 1999
It is argued that PAES may represent the simplest possible non-trivial algorithm capable of generating diverse solutions in the Pareto optimal set, and is intended as a good baseline approach against which more involved methods may be compared.
Differential Evolution: A Survey of the State-of-the-Art
- Computer ScienceIEEE Transactions on Evolutionary Computation
- 2011
A detailed review of the basic concepts of DE and a survey of its major variants, its application to multiobjective, constrained, large scale, and uncertain optimization problems, and the theoretical studies conducted on DE so far are presented.
Evolutionary dynamic optimization: A survey of the state of the art
- Computer ScienceSwarm Evol. Comput.
- 2012
A fast and elitist multiobjective genetic algorithm: NSGA-II
- Computer ScienceIEEE Trans. Evol. Comput.
- 2002
This paper suggests a non-dominated sorting-based MOEA, called NSGA-II (Non-dominated Sorting Genetic Algorithm II), which alleviates all of the above three difficulties, and modify the definition of dominance in order to solve constrained multi-objective problems efficiently.
Benchmark Functions for the CEC'2010 Special Session and Competition on Large-Scale
- Computer Science
- 2009
A suite of benchmark functions for large-scale numerical optimization of metaheuristic optimization algorithms and a systematic evaluation platform is provided for comparing the scalability of different EAs.
Multiobjective evolutionary algorithms: A survey of the state of the art
- Computer ScienceSwarm Evol. Comput.
- 2011
Large scale evolutionary optimization using cooperative coevolution
- Computer ScienceInf. Sci.
- 2008
Regarding the rankings of optimization heuristics based on artificially-constructed benchmark functions
- Computer ScienceInf. Sci.
- 2015
The Crowding Approach to Niching in Genetic Algorithms
- Computer ScienceEvolutionary Computation
- 2008
This article presents and analyzes the probabilistic crowding niching algorithm, an algorithmic and analytical framework which is applicable to a wide range of crowding algorithms, and provides novel results for deterministic crowding.