Double-layer-clustering differential evolution multimodal optimization by speciation and self-adaptive strategies

被引:48
作者
Liu, Qingxue [1 ,2 ,3 ]
Du, Shengzhi [3 ]
van Wyk, Barend Jacobus [4 ]
Sun, Yanxia [5 ]
机构
[1] Kunming Univ, Sch Mech & Elect Engn, Kunming 650214, Yunnan, Peoples R China
[2] Shandong Univ Sci & Technol, Coll Elect Engn & Automat, Qingdao 266590, Peoples R China
[3] Tshwane Univ Technol, Dept Elect Engn, ZA-0001 Pretoria, South Africa
[4] Nelson Mandela Univ, Fac Engn Built Environm & Technol, ZA-6031 Port Elizabeth, South Africa
[5] Univ Johannesburg, Dept Elect & Elect Engn Sci, ZA-2006 Johannesburg, South Africa
基金
新加坡国家研究基金会;
关键词
Differential evolution (DE); Multimodal optimization; Niching algorithm; Speciation; Self-adaptive strategy; PARTICLE SWARM MODEL; ALGORITHM; MUTATION;
D O I
10.1016/j.ins.2020.09.008
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Multimodal optimization aims to find and maintain as many global and local optima of a function as possible. Niching techniques based on multi-populations and clustering proved to be efficient for tackling multimodal optimization problems. The main focus of this work is to enhance the diversity of the population and improve the global search ability to locate more optima. A Double-Layer-Clustering Speciation Differential Evolution (DLCSDE) algorithm for multimodal optimization is proposed. We also show how the DLCSDE can be improved by integrating with a self-adaptive strategy to form the Self-adaptive DLCSDE (SDLCSDE). Based on speciation, first layer clustering divides the entire population into multiple subpopulations to locate global and local optima. The seeds from each species then form a sub-population to search globally during the second layer clustering to find peaks missed during the first layer clustering search process. To test the performance, both DLCSDE and SDLCSDE are compared with 17 state-of-art niching algorithms on 29 multi modal problems with different dimensions. The experiment results demonstrate that both the proposed algorithms outperform or perform comparably to the 17 niching algorithms on all the test functions. (C) 2020 Elsevier Inc. All rights reserved.
引用
收藏
页码:465 / 486
页数:22
相关论文
共 49 条
  • [1] Ackley D.H., 1987, GENETIC ALGORITHMS S, P170
  • [2] [Anonymous], 1995, THESIS
  • [3] [Anonymous], PARALLEL PROBLEM SOLVING FROM NATURE, 2
  • [4] A Sequential Niche Technique for Multimodal Function Optimization
    Beasley, David
    Bull, David R.
    Martin, Ralph R.
    [J]. EVOLUTIONARY COMPUTATION, 1993, 1 (02) : 101 - 125
  • [5] Bessaou M., 2000, PAR PROBL SOLV NAT P, P16
  • [6] Bird S, 2006, GECCO 2006: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, P3
  • [7] Inducing Niching Behavior in Differential Evolution Through Local Information Sharing
    Biswas, Subhodip
    Kundu, Souvik
    Das, Swagatam
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2015, 19 (02) : 246 - 263
  • [8] An Improved Parent-Centric Mutation with Normalized Neighborhoods for Inducing Niching Behavior in Differential Evolution
    Biswas, Subhodip
    Kundu, Souvik
    Das, Swagatam
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2014, 44 (10) : 1726 - 1737
  • [9] Self-adaptive differential evolution algorithm in constrained real-parameter optimization
    Brest, Janez
    Zumer, Viljem
    Maucec, Mirjam Sepesy
    [J]. 2006 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-6, 2006, : 215 - +
  • [10] De Jong K.A., 1975, ANAL BEHAV CLASS GEN