A self-adaptive hybridized differential evolution naked mole-rat algorithm for engineering optimization problems

被引:31
作者
Salgotra, Rohit [1 ]
Singh, Urvinder [1 ]
Singh, Gurdeep [1 ]
Mittal, Nitin [2 ]
Gandomi, Amir H. [3 ]
机构
[1] Thapar Inst Engn & Technol, Dept ECE, Patiala, Punjab, India
[2] Chandigarh Univ, Dept ECE, Mohali, India
[3] Univ Technol Sydney, Fac Engn & Informat Technol, Sydney, NSW 2007, Australia
关键词
Differential evolution; Naked mole-rat algorithm; Hybrid algorithms; Self-adaptivity; Numerical optimization; Engineering design problems; PARTICLE SWARM OPTIMIZATION; GENETIC ALGORITHM; DESIGN; EXPLORATION; ADAPTATION; SIMULATION; SEARCH;
D O I
10.1016/j.cma.2021.113916
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper presents a self-adaptive hybrid variant of differential evolution (DE) algorithm and naked mole-rat algorithm (NMRA), namely SaDN. The algorithm is altogether a new version, designed to overcome the local optima stagnation and poor exploration properties of DE and NMRA respectively. The new algorithm has been designed by incorporating DE into the worker phase of NMRA while keeping all the major parameters of both the algorithms intact. In order to make the algorithm self-adaptive, seven different mutation strategies have been explored for different parameters, and it was found that Levy based scaling factor and sigmoidal mating factor are the best parameters. Apart from these parameters, adaptive properties have been introduced to all other parameters so that no user-based initialization of parameters is required. For performance evaluation, the proposed SaDN is tested on CEC 2005, CEC 2014 and CEC 2019 benchmark problems and comparison is performed for variable population size and higher dimension sizes. From the experimental results, it has been found that the proposed SaDN performs better with respect to other major state-of-the-art algorithms from the literature. Apart from that, SaDN is subjected to three engineering design problems and compared with other algorithms. Numerical results demonstrate that SaDN shows better performance and is statistically significant in terms of Wilcoxon's rank-sum test, Freidman's test and computational complexity. The source code for the proposed algorithms is available at: https://github.com/rohitsalgotra. (C) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页数:37
相关论文
共 91 条
[1]   Fitness Dependent Optimizer: Inspired by the Bee Swarming Reproductive Process [J].
Abdullah, Jaza Mahmood ;
Rashid, Tarik Ahmed .
IEEE ACCESS, 2019, 7 :43473-43486
[2]   A socio-behavioural simulation model for engineering design optimization [J].
Akhtar, S ;
Tai, K ;
Ray, T .
ENGINEERING OPTIMIZATION, 2002, 34 (04) :341-354
[3]   PSOSA: An optimized particle swarm technique for solving the urban planning problem [J].
Al-Hassan, W. ;
Fayek, M. B. ;
Shaheen, S. I. .
2006 INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING & SYSTEMS, 2006, :401-+
[4]  
[Anonymous], 2008, COMPUT ENG SYST
[5]   A modified version of a T-Cell Algorithm for constrained optimization problems [J].
Aragon, Victoria S. ;
Esquivel, Susana C. ;
Coello Coello, Carlos A. .
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 2010, 84 (03) :351-378
[6]   A hybrid genetic algorithm for constrained optimization problems in mechanical engineering [J].
Bernardino, H. S. ;
Barbosa, H. J. C. ;
Lemonge, A. C. C. .
2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, :646-+
[7]   A New Hybrid AIS-GA for Constrained Optimization Problems in Mechanical Engineering [J].
Bernardino, H. S. ;
Barbosa, H. J. C. ;
Lemonge, A. C. C. ;
Fonseca, L. G. .
2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, :1455-+
[8]   A novel beta differential evolution algorithm-based fast multilevel thresholding for color image segmentation [J].
Bhandari, Ashish Kumar .
NEURAL COMPUTING & APPLICATIONS, 2020, 32 (09) :4583-4613
[9]  
Brest J, 2019, IEEE C EVOL COMPUTAT, P19, DOI [10.1109/cec.2019.8789904, 10.1109/CEC.2019.8789904]
[10]  
Coello C.A.C., 2001, Proc. ANNIE, V11, P177