Enhanced slime mould algorithm with multiple mutation strategy and restart mechanism for global optimization
Pages 5069 - 5083
Abstract
Slime mould algorithm (SMA) is a new metaheuristic algorithm proposed in 2020, which has attracted extensive attention from scholars. Similar to other optimization algorithms, SMA also has the drawbacks of slow convergence rate and being trapped in local optimum at times. Therefore, the enhanced SMA named as ESMA is presented in this paper for solving global optimization problems. Two effective methods composed of multiple mutation strategy (MMS) and restart mechanism (RM) are embedded into the original SMA. MMS is utilized to increase the population diversity, and the RM is used to avoid the local optimum. To verify the ESMA’s performance, twenty-three classical benchmark functions are employed, as well as three well-known engineering design problems, including welded beam design, pressure vessel design and speed reducer design. Several famous optimization algorithms are also chosen for comparison. Experimental results show that the ESMA outperforms other optimization algorithms in most of the test functions with faster convergence speed and higher solution accuracy, which indicates the merits of proposed ESMA. The results of Wilcoxon signed-rank test also reveal that ESMA is significant superior to other comparative optimization algorithms. Moreover, the results of three constrained engineering design problems demonstrate that ESMA is better than comparative algorithms.
References
[1]
Singh P., Dhiman G. and Kaur A., A quantum approach for time series data based on graph and Schrödinger equations methods, Modern Phys Lett A 33 (2018), 1850208.
[2]
Singh P., Dhiman G., Guo S., Maini R., Kaur H., Kaur A., Kaur H., Singh J. and Singh N., A hybrid fuzzy quantum time series and linear programming model: Special application on TAIEX index dataset, Modern Phys Lett A 34 (2019).
[3]
Dhiman G., ESA: a hybrid bio-inspired metaheuristic optimization approach for engineering problems, Eng Comput 3 (2019), 1–31.
[4]
Kouadri R., Musirin I., Slimani L., Bouktir T. and Othman M.M., Optimal Power Flow Control Variables using Slime Mould Algorithm for Generator Fuel Cost and Loss Minimization with Voltage Profile Enhancement Solution, Int J Eng Sci 8 (2020), 36–44.
[5]
Holland J.H., Genetic algorithms, Sc Am 267 (1992), 66–72.
[6]
Kumar M., Kulkarni A.J. and Satapathy S.C., Socio evolution & learning optimization algorithm: A socio-inspired optimization methodology, Future Gener Comp Sy 81 (2017), 252–272.
[7]
Rashedi E., Nezamabadi-Pour H. and Saryazdi S., Gsa: a gravitational search algorithm, Inform sciences 179 (2009), 2232–2248.
[8]
Li S., Chen H., Wang M., Heidari A.A. and Mirjalili S., Slime MouldAlgorithm: A new method for stochastic optimization, FutureGener Comput Syst 111 (2020), 300–323.
[9]
Kennedy J. and Eberhart R., Particle swarm optimization, In: IEEE International Conference on Neural Networks - Conference Proceedings (1995), 1942–1948.
[10]
Dorigo M., Maniezzo V. and Colorni A., Ant system: optimization by a colony 75 of cooperating agents, IEEE Trans Syst Man Cybern B 26 (1996), 29–41.
[11]
Mirjalili S. and Lewis A., The Whale Optimization Algorithm, Adv Eng Software 95 (2016), 51–67.
[12]
Mirjalili S., Mirjalili S.M. and Lewis A., Grey Wolf Optimizer, Adv Eng Software 69 (2014), 46–61.
[13]
Mirjalili S., Gandomi A.H., Mirjalili S.Z., Saremi S., Faris H. and Mirjalili S.M., Salp swarm algorithm: a bio-inspired optimizer for engineering design problems, Adv Eng Softw 114 (2017), 163–191.
[14]
Jia H., Peng X. and Lang C., Remora optimization algorithm, Expert Syst Appl 185 (2021), 115665.
[15]
Lin L. and Gen M., Auto-tuning strategy for evolutionary algorithms: Balancing between exploration and exploitation, Soft Comput 13 (2009), 157–168.
[16]
Mousavi Y., Alfi A. and Kucukdemiral I.B., Enhanced Fractional Chaotic Whale Optimization Algorithm for Parameter Identification of Isolated Wind-Diesel Power Systems, IEEE Access 8 (2020), 140862–140875.
[17]
Arora S. and Singh S., An improved butterfly optimization algorithm with chaos, J Intell Fuzzy Syst 32 (2017), 1079–1088.
[18]
Kohli M. and Arora S., Chaotic grey wolf optimization algorithm for constrained optimization problems, J Comput Des Eng 5 (2018), 458–472.
[19]
Onay F.K. and Aydemir S.B., Chaotic hunger games search optimization algorithm for global optimization and engineering problems, Math Comput Simulat 192 (2021), 514–536.
[20]
Wolpert D.H. and Macready W.G., No free lunch theorems for optimization, IEEE Trans Evol Comput 1 (1997), 67–82.
[21]
Ewees A.A., Abualiga L., Yousri D., Algamal Z.Y., Al-qaness M.A.A., Alilbrahim R. and Elaziz M.A., Improved Slime Mould Algorithm based on Firefly Algorithm for feature selection: A case study on QSAR model, Eng Comput 3 (2021).
[22]
Yang X.S., Nature-inspired metaheuristic algorithms, Luniver Press, London, (2010).
[23]
Cui Z., Hou X., Zhou H., Lian W. and Wu J., Modified Slime Mould Algorithm via Levy Flight, In: 13th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics, (2020).
[24]
Sun K., Jia H., Li Y. and Jiang Z., Hybrid improved slime mould algorithm with adaptive β hill climbing for numerical optimization, J Intell Fuzzy Syst 40 (2020), 1–13.
[25]
Houssein E.H., Mahdy M.A., Blondin M.J., Shebl D. and Mohamed W.M., Hybrid slime mould algorithm with adaptive guided differential evolution algorithm for combinatorial and global optimization problems, Expert Syst Appl 174 (2021), 114689.
[26]
Wang Y., Cai Z. and Zhang Q., Differential evolution with composite trial vector generation strategies and control parameters, IEEE T Evolut Comput 15 (2011), 55–66.
[27]
Cui L., Li G., Lin Q., Chen J. and Lu N., Adaptive differential evolution algorithm with novel mutation strategies in multiple sub-populations, Comput Oper Res 67 (2016), 155–173.
[28]
Li X., Ma S. and Hu J., Multi-search differential evolution algorithm, Appl Intell 47 (2017), 1–26.
[29]
Jia H., Lang C., Oliva D., Song W. and Peng X., Dynamic Harris Hawks Optimization with Mutation Mechanism for Satellite Image Segmentation, Remote Sens-basel 11 (2019), 1421.
[30]
Zhang H., Wang Z., Chen W., et al., Ensemble Mutation-driven Salp Swarm Algorithm with Restart Mechanism: Framework and Fundamental Analysis, Expert Syst Appl 165 (2020), 113897.
[31]
Molga M. and Smutnicki C., Test functions for optimization needs, (2005).
[32]
Mirjalili S., Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm, Knowl-Based Syst 89 (2015), 228–249.
[33]
Mirjalili S., Mirjalili S.M. and Hatamlou A., Multi-verse optimizer: a nature-inspired algorithm for global optimization, Neural Comput Appl 27 (2016), 495–513.
[34]
Li Y., Zhao Y. and Liu J., Dynamic sine cosine algorithm for large-scale global optimization problems, Expert Syst Appl 173 (2021), 114950.
[35]
Long W., Jiao J., Liang X., Cai S. and Xu M., A Random Opposition-Based Learning Grey Wolf Optimizer, In: IEEE Access 7 (2019), 113810–113825.
[36]
Demsar J., Statistical comparisons of classifiers over multiple data sets, J Mach Learn Res 7 (2006), 1–30.
[37]
Coello C.A.C., Use of a self-adaptive penalty approach for engineering optimization problems, Comput Ind 41 (2000), 113–127.
[38]
Abualigah L., Diabat A., Mirjalili S., Elaziz M.A. and Gandomi A.H., The Arithmetic Optimization Algorithm, Comput Methods in Appl Mech Engrg 376 (2021), 113609.
[39]
Mirjalili S., SCA: A Sine Cosine algorithm for solving optimization problems, Knowl Based Syst 96 (2016), 120–133.
[40]
Baykasoğlu A. and Akpinar S., Weighted superposition attraction (WSA): A swarm intelligence algorithm for optimization problems–part 2: Constrained optimization, Appl Soft Comput 37 (2015), 396–415.
[41]
Czerniak J.M., Zarzycki H. and Ewald D., AAO as a new strategy in modeling and simulation of constructional problems optimization, Simul Model Pract Th 76 (2017), 22–33.
Index Terms
- Enhanced slime mould algorithm with multiple mutation strategy and restart mechanism for global optimization
Index terms have been assigned to the content through auto-classification.
Recommendations
Adaptive differential evolution algorithm based on deeply-informed mutation strategy and restart mechanism
AbstractDifferential evolution is one of the most powerful stochastic real-parameter optimization algorithms currently, and its performance depends heavily on control parameters and mutation strategy. In recent years, methods to select favorable ...
A symbiosis of arithmetic optimizer with slime mould algorithm for improving global optimization and conventional design problem
AbstractAn arithmetic optimizer algorithm (AOA) is hybridized with slime mould algorithm (SMA) to address the issue of less internal memory and slow convergence at local minima which is termed as HAOASMA. Lens opposition-based learning strategy is also ...
RETRACTED ARTICLE: A hybrid slime mould algorithm for global optimization
AbstractThe local optima stagnation is a major issue with all meta-heuristic algorithms. In this paper, a hybrid slime mould algorithm (SMA) is proposed with the aid of quadratic approximation to address the aforesaid problem to expedite the explorative ...
Comments
Information & Contributors
Information
Published In
© 2022 – IOS Press. All rights reserved.
Publisher
IOS Press
Netherlands
Publication History
Published: 01 January 2022
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 28 Jan 2025