4.7 Article

Ensemble strategies for population-based optimization algorithms - A survey

Journal

SWARM AND EVOLUTIONARY COMPUTATION
Volume 44, Issue -, Pages 695-711

Publisher

ELSEVIER
DOI: 10.1016/j.swevo.2018.08.015

Keywords

Ensemble of algorithms; No free lunch; Population-based optimization algorithms; Numerical optimization; Evolutionary algorithm; Swarm intelligence; Parameter/operator/strategy adaptation; Optimization algorithmic configuration adaptation; Hyper-heuristics; Island models; Adaptive operator selection; Multi-operator/multi-method approaches

Funding

  1. Basic Science Research Program through the National Research Foundation of Korea (NRF) - Ministry of Education, Science and Technology [NRF-2015R1C1A1A01055669]
  2. National Natural Science Foundation of China [61603404]
  3. Natural Science Foundation of Hunan Province [2017JJ3369]
  4. Research Foundation of National University of Defense Technology [ZK16-03-30]

Ask authors/readers for more resources

In population-based optimization algorithms (POAs), given an optimization problem, the quality of the solutions depends heavily on the selection of algorithms, strategies and associated parameter combinations, constraint handling method, local search method, surrogate model, niching method, etc. In the literature, there exist several alternatives corresponding to each aspect of configuring a population-based algorithm such as one-point/two-points/uniform crossover operators, toumament/ranking/stochastic uniform sampling selection methods, Gaussian/Levy/Cauchy mutation operators, clearing/crowding/sharing based niching algorithms, adaptive penalty/epsilon/superiority of feasible constraint handling approaches, associated parameter values and so on. In POA literature, No Free Lunch (NFL) theorem has been well-documented and therefore, to effectively solve a given optimization problem, an appropriate configuration is necessary. But, the trial and error approach for the appropriate configuration may be impractical because at different stages of evolution, the most appropriate configurations could be different depending on the characteristics of the current search region for a given problem. Recently, the concept of incorporating ensemble strategies into POAs has become popular so that the process of configuring an optimization algorithm can benefit from both the availability of diverse approaches at different stages and alleviate the computationally intensive offline tuning. In addition, algorithmic components of different advantages could support one another during the optimization process, such that the ensemble of them could potentially result in a versatile POA. This paper provides a survey on the use of ensemble strategies in POAs. In addition, we also provide an overview of similar methods in the literature such as hyper-heuristics, island models, adaptive operator selection, etc. and compare them with the ensemble strategies in the context of POAs.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available