Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/151703
Title: Ensemble strategies for population-based optimization algorithms – a survey
Authors: Wu, Guohua
Mallipeddi, Rammohan
Suganthan, Ponnuthurai Nagaratnam
Keywords: Engineering::Electrical and electronic engineering
Issue Date: 2019
Source: Wu, G., Mallipeddi, R. & Suganthan, P. N. (2019). Ensemble strategies for population-based optimization algorithms – a survey. Swarm and Evolutionary Computation, 44, 695-711. https://dx.doi.org/10.1016/j.swevo.2018.08.015
Journal: Swarm and Evolutionary Computation
Abstract: 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, tournament/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.
URI: https://hdl.handle.net/10356/151703
ISSN: 2210-6502
DOI: 10.1016/j.swevo.2018.08.015
Rights: © 2018 Elsevier B.V. All rights reserved.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:EEE Journal Articles

Page view(s)

43
Updated on Dec 3, 2021

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.