Dynamic Mutation Strategy Selection in Differential Evolution Using Perturbed Adaptive Pursuit

被引:0
作者
Prathu Bajpai [1 ]
Ogbonnaya Anicho [2 ]
Atulya K. Nagar [2 ]
Jagdish Chand Bansal [1 ]
机构
[1] Department of Mathematics, South Asian University, Rajpur Road, Delhi, New Delhi
[2] Faculty of Science, Liverpool Hope University, Hope Park, Liverpool
关键词
68T05; 68T20; 68W50; 90C59; Adaptive pursuit strategy; Differential evolution; Evolutionary optimization; Meta-heuristics; Mutations;
D O I
10.1007/s42979-024-03062-2
中图分类号
学科分类号
摘要
Diverse mutant vectors play a significant role in the performance of the Differential Evolution (DE). A mutant vector is generated using a stochastic mathematical equation, known as mutation strategy. Many mutation strategies have been proposed in the literature. Utilizing multiple mutation strategies with the help of an adaptive operator selection (AOS) technique can improve the quality of the mutant vector. In this research, one popular AOS technique known as perturbation adaptive pursuit (PAP) is integrated with the DE algorithm for managing a pool of mutation strategies. A community-based reward criterion is proposed that rewards the cumulative performance of the whole population. The proposed approach is called ‘Dynamic Mutation Strategy Selection in Differential Evolution using Perturbed Adaptive Pursuit (dmss-DE-pap)’. The performance of dmss-DE-pap is evaluated over the 30D and 50D optimization problems of the CEC 2014 benchmark test suite. Results are competitive when compared with other state-of-the-art evolutionary algorithms and some recent DE variants. © The Author(s) 2024.
引用
收藏
相关论文
共 40 条
[1]  
Michalewicz Z., Dasgupta D., Le Riche R.G., Schoenauer M., Evolutionary algorithms for constrained engineering problems, Comput Ind Eng, 30, 4, pp. 851-870, (1996)
[2]  
Carvalho D.R., Freitas A.A., A hybrid decision tree/genetic algorithm method for data mining, Inf Sci, 163, 1-3, pp. 13-35, (2004)
[3]  
Gobeyn S., Mouton A.M., Cord A.F., Kaim A., Volk M., Goethals P.L., Evolutionary algorithms for species distribution modelling: a review in the context of machine learning, Ecol Model, 392, pp. 179-195, (2019)
[4]  
Simon D., Evolutionary optimization algorithms, (2013)
[5]  
Nocedal J., Wright S., Numerical optimization, (2006)
[6]  
Back T., Schwefel H.-P., An overview of evolutionary algorithms for parameter optimization, Evol Comput, 1, 1, pp. 1-23, (1993)
[7]  
Derrac J., Garcia S., Hui S., Suganthan P.N., Herrera F., Analyzing convergence performance of evolutionary algorithms: a statistical approach, Inf Sci, 289, pp. 41-58, (2014)
[8]  
Storn R., Price K., A simple and efficient heuristic for global optimization over continuous spaces, J Glob Optim, 11, pp. 341-359, (1997)
[9]  
Slowik A., Bialko M., Training of artificial neural networks using differential evolution algorithm, In: 2008 Conference on Human System Interactions, pp. 60-65, (2008)
[10]  
Onwubolu G., Davendra D., Scheduling flow shops using differential evolution algorithm, Eur J Oper Res, 171, 2, pp. 674-692, (2006)