Ensemble strategies for population-based optimization algorithms - A survey

被引:199
|
作者
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
相关论文
共 50 条
  • [1] Ensemble of Population-Based Metaheuristic Algorithms
    Li, Hao
    Tang, Jun
    Pan, Qingtao
    Zhan, Jianjun
    Lao, Songyang
    CMC-COMPUTERS MATERIALS & CONTINUA, 2023, 76 (03): : 2835 - 2859
  • [2] Novel Population-based Algorithms for Reflectarray Optimization
    Zich, R. E.
    Niccolai, A.
    Ruello, M.
    Grimaccia, F.
    Mussetta, M.
    2014 INTERNATIONAL CONFERENCE ON ELECTROMAGNETICS IN ADVANCED APPLICATIONS (ICEAA), 2014, : 818 - 821
  • [3] Dissimilarity measures for population-based global optimization algorithms
    Andrea Cassioli
    Marco Locatelli
    Fabio Schoen
    Computational Optimization and Applications, 2010, 45 : 257 - 281
  • [4] Dissimilarity measures for population-based global optimization algorithms
    Cassioli, Andrea
    Locatelli, Marco
    Schoen, Fabio
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2010, 45 (02) : 257 - 281
  • [5] Majority voting for discrete population-based optimization algorithms
    Sedigheh Mahdavi
    Shahryar Rahnamayan
    Abbas Mahdavi
    Soft Computing, 2019, 23 : 1 - 18
  • [6] Simple population-based algorithms for solving optimization problems
    Baskar, Amaladosan
    RAIRO-OPERATIONS RESEARCH, 2024, 58 (01) : 253 - 280
  • [7] Majority voting for discrete population-based optimization algorithms
    Mahdavi, Sedigheh
    Rahnamayan, Shahryar
    Mahdavi, Abbas
    SOFT COMPUTING, 2019, 23 (01) : 1 - 18
  • [8] A partition-based convergence framework for population-based optimization algorithms
    Li, Xinxin
    Hua, Shuai
    Liu, Qunfeng
    Li, Yun
    INFORMATION SCIENCES, 2023, 627 : 169 - 188
  • [9] A Collective Intelligence Strategy for Enhancing Population-based Optimization Algorithms
    Bidgoli, Azam Asilian
    Rahnamayan, Shahryar
    2020 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2020,
  • [10] A comparative study of population-based optimization algorithms for turning operations
    Yildiz, Ali R.
    INFORMATION SCIENCES, 2012, 210 : 81 - 88