Differential evolution with stage stratification method and dual balanced mutation strategy for real-parameter numerical optimization

被引:6
作者
Sun, Yu [1 ,3 ]
Yang, Guanxiong [1 ,2 ]
机构
[1] Guangxi Univ, Sch Comp & Elect Informat, Nanning 530004, Peoples R China
[2] Guangxi Univ, Educ Dept Guangxi Zhuang Autonomous Reg, Key Lab Parallel Distributed & Intelligent Comp, Nanning, Peoples R China
[3] Guangxi Univ, Guangxi Key Lab Multimedia Commun & Network Techno, Nanning 530004, Peoples R China
基金
中国国家自然科学基金;
关键词
Differential evolution; Stage stratification; Dual mutation; Balanced mutation; Real-parameter numerical optimization; ALGORITHM;
D O I
10.1016/j.eswa.2023.121774
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Traditional differential evolution (DE) algorithms have functional limitations in effectively addressing in-creasingly intricate numerical optimization problems. The key to responding to this challenge is to strike a suitable balance between exploration and exploitation. Exploration is used to find the global optimal solution, and exploitation is used to improve the accuracy of the global optimal solution. Therefore, this study introduces a novel differential evolution algorithm with a stage stratification method and a dual balanced mutation strategy framework, named SbmDE. To enhance the balance between convergence and diversity, the population is stratified into exploration and exploitation layers based on the size of the fitness value and evolutionary period. In the exploitation layer, a hybridization mutation is applied as the first mutation. A novel dual improved mutation operation is proposed and applied to the exploration layer. For the first mutation, the hybridization mutation is used in the same manner as for the exploitation layer. For the secondary mutation, two improved mutation strategies are proposed to alleviate premature convergence at the early stage of evolution and to enhance the local neighborhood search at a later stage, named DE/ranking-to-rand/1 and DE/best-current-dev/1. Experiments were conducted on the CEC2017 benchmark suite, which contains 29 single-objective real-parameter numerical optimization problems, to evaluate the performance of the proposed algorithm. Compared with 11 state-of-the-art algorithms, the results demonstrate the superiority of the proposed algorithm, which does not increase the time complexity. Additionally, based on the four engineering design problems, the proposed algorithm is fully competent in solving practical constrained optimization problems.
引用
收藏
页数:23
相关论文
共 50 条
[1]  
Awad N., 2016, PROBLEM DEFINITIONS, P1
[2]   Improving Differential Evolution through Bayesian Hyperparameter Optimization [J].
Biswas, Subhodip ;
Saha, Debanjan ;
De, Shuvodeep ;
Cobb, Adam D. ;
Das, Swagatam ;
Jalaian, Brian A. .
2021 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC 2021), 2021, :832-840
[3]   Self-adaptive Differential Evolution Algorithm with Population Size Reduction for Single Objective Bound-Constrained Optimization: Algorithm j21 [J].
Brest, Janez ;
Maucec, Mirjam Sepesy ;
Boskovic, Borko .
2021 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC 2021), 2021, :817-824
[4]  
Brest J, 2020, IEEE C EVOL COMPUTAT
[5]  
Brest J, 2019, IEEE C EVOL COMPUTAT, P19, DOI [10.1109/CEC.2019.8789904, 10.1109/cec.2019.8789904]
[6]  
Brest J, 2017, IEEE C EVOL COMPUTAT, P1311, DOI 10.1109/CEC.2017.7969456
[7]  
Brest J, 2016, IEEE C EVOL COMPUTAT, P1188, DOI 10.1109/CEC.2016.7743922
[8]   Differential Evolution with Distance-based Mutation-selection Applied to CEC 2021 Single Objective Numerical Optimisation [J].
Bujok, Petr ;
Kolenovsky, Patrik .
2021 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC 2021), 2021, :849-856
[9]   Differential evolution algorithm with fitness and diversity ranking-based mutation operator [J].
Cheng, Jianchao ;
Pan, Zhibin ;
Liang, Hao ;
Gao, Zhaoqi ;
Gao, Jinghuai .
SWARM AND EVOLUTIONARY COMPUTATION, 2021, 61
[10]   Differential evolution algorithm with dichotomy-based parameter space compression [J].
Cui, Laizhong ;
Li, Genghui ;
Zhu, Zexuan ;
Ming, Zhong ;
Wen, Zhenkun ;
Lu, Nan .
SOFT COMPUTING, 2019, 23 (11) :3643-3660