Static and Dynamic Multimodal Optimization by Improved Covariance Matrix Self-Adaptation Evolution Strategy With Repelling Subpopulations

被引:19
作者
Ahrari, Ali [1 ]
Elsayed, Saber [1 ]
Sarker, Ruhul [1 ]
Essam, Daryl [1 ]
Coello, Carlos A. Coello [2 ,3 ]
机构
[1] Univ New South Wales, Sch Engn & Informat Technol, Canberra, ACT 2600, Australia
[2] CINVESTAV, IPN, Dept Computac, Mexico City 07360, DF, Mexico
[3] Ikerbasque, Basque Ctr Appl Math, Bilbao 48009, Spain
基金
澳大利亚研究理事会;
关键词
Covariance matrices; Sociology; Shape; Heuristic algorithms; Optimization methods; Measurement; Genetic algorithms; Continuous optimization; dynamic optimization; evolutionary algorithm; niching; SWARM OPTIMIZER;
D O I
10.1109/TEVC.2021.3117116
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The covariance matrix self-adaptation evolution strategy with repelling subpopulations (RS-CMSA-ES) is one of the most successful multimodal optimization (MMO) methods currently available. However, some of its components may become inefficient in certain situations. This study introduces the second variant of this method, called RS-CMSA-ESII. It improves the adaptation schemes for the normalized taboo distances of the archived solutions and the covariance matrix of the subpopulation, the termination criteria for the subpopulations, and the way in which the infeasible solutions are treated. It also improves the time complexity of RS-CMSA-ES by updating the initialization procedure of a subpopulation and developing a more accurate metric for determining critical taboo regions. The effects of these modifications are illustrated by designing controlled numerical simulations. RS-CMSA-ESII is then compared with the most successful and recent niching methods for MMO on a widely adopted test suite. The results obtained reveal the superiority of RS-CMSA-ESII over these methods, including the winners of the competition on niching methods for MMO in previous years. Besides, this study extends RS-CMSA-ESII to dynamic MMO and compares it with a few recently proposed methods on the modified moving peak benchmark functions.
引用
收藏
页码:527 / 541
页数:15
相关论文
共 52 条
[1]   A Novel Class of Test Problems for Performance Evaluation of Niching Methods [J].
Ahrari, Ali ;
Deb, Kalyanmoy .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2018, 22 (06) :909-919
[2]  
Ahrari A, 2017, EVOL COMPUT, V25, P439, DOI [10.1162/EVCO_a_00182, 10.1162/evco_a_00182]
[3]  
[Anonymous], 1995, THESIS CITESEER
[4]  
Azzouz R, 2017, ADAPT LEARN OPTIM, V20, P31, DOI 10.1007/978-3-319-42978-6_2
[5]  
Bandaru S, 2013, 2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), P95
[6]   Multimodal Optimization Using a Biobjective Differential Evolution Algorithm Enhanced With Mean Distance-Based Selection [J].
Basak, Aniruddha ;
Das, Swagatam ;
Tan, Kay Chen .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2013, 17 (05) :666-685
[7]  
Beyer HG, 2008, LECT NOTES COMPUT SC, V5199, P123, DOI 10.1007/978-3-540-87700-4_13
[8]   Inducing Niching Behavior in Differential Evolution Through Local Information Sharing [J].
Biswas, Subhodip ;
Kundu, Souvik ;
Das, Swagatam .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2015, 19 (02) :246-263
[9]   An Improved Parent-Centric Mutation with Normalized Neighborhoods for Inducing Niching Behavior in Differential Evolution [J].
Biswas, Subhodip ;
Kundu, Souvik ;
Das, Swagatam .
IEEE TRANSACTIONS ON CYBERNETICS, 2014, 44 (10) :1726-1737
[10]  
Blackwell T, 2004, LECT NOTES COMPUT SC, V3005, P489