Ensemble strategies for population-based optimization algorithms - A survey

被引:198
作者
Wu, Guohua [1 ]
Mallipeddi, Rammohan [2 ]
Suganthan, Ponnuthurai Nagaratnam [3 ]
机构
[1] Cent S Univ, Sch Traff & Transportat Engn, Changsha 410075, Hunan, Peoples R China
[2] Kyungpook Natl Univ, Sch Elect Engn, Taegu 702701, South Korea
[3] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore
基金
中国国家自然科学基金; 新加坡国家研究基金会;
关键词
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; PARTICLE SWARM OPTIMIZATION; DIFFERENTIAL EVOLUTION ALGORITHM; BIOGEOGRAPHY-BASED OPTIMIZATION; DYNAMIC MULTIARMED BANDITS; LOCAL SEARCH; MUTATION STRATEGIES; OPERATOR SELECTION; CONTROL PARAMETERS; HYPER-HEURISTICS; COLONY;
D O I
10.1016/j.swevo.2018.08.015
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:695 / 711
页数:17
相关论文
共 201 条
  • [1] Parallel population-based algorithm portfolios: An empirical study
    Akay, Rustu
    Basturk, Alper
    Kalinli, Adem
    Yao, Xin
    [J]. NEUROCOMPUTING, 2017, 247 : 115 - 125
  • [2] Multi-population differential evolution with balanced ensemble of mutation strategies for large-scale global optimization
    Ali, Mostafa Z.
    Awad, Noor H.
    Suganthan, Ponnuthurai N.
    [J]. APPLIED SOFT COMPUTING, 2015, 33 : 304 - 327
  • [3] [Anonymous], 2012, INT J PHOTO
  • [4] [Anonymous], P 9 ANN C GEN EV COM
  • [5] [Anonymous], 2012, P IEEE C EV COMP CEC, DOI DOI 10.1109/CEC.2012.6252930
  • [6] [Anonymous], 2014, SEARCH METHODOLOGIES, DOI DOI 10.1007/978-1-4614-6940-7
  • [7] Diversity Through Multiculturality: Assessing Migrant Choice Policies in an Island Model
    Araujo, Lourdes
    Julian Merelo, Juan
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2011, 15 (04) : 456 - 469
  • [8] Finite-time analysis of the multiarmed bandit problem
    Auer, P
    Cesa-Bianchi, N
    Fischer, P
    [J]. MACHINE LEARNING, 2002, 47 (2-3) : 235 - 256
  • [9] Awad NH, 2016, IEEE C EVOL COMPUTAT, P2958, DOI 10.1109/CEC.2016.7744163
  • [10] Back T., 1996, EVOLUTIONARY ALGORIT