Nothing Special   »   [go: up one dir, main page]
Skip to main content

Advertisement

Springer Nature Link
Log in

A Multi-strategy Slime Mould Algorithm for Solving Global Optimization and Engineering Optimization Problems

  • Research Paper
  • Published:
Evolutionary Intelligence Aims and scope Submit manuscript

Abstract

Aiming at the problems of slow convergence, low accuracy, and easy to fall into local optimum of the slime mould algorithm (SMA), we propose an improved SMA (OJESMA). OJESMA improves the performance of the algorithm by combining strategies based on opposition-based learning, joint opposite selection, and equilibrium optimizer. First, we introduce an adversarial learning-opposition-based learning, in generating the initial population of slime molds. Second, we incorporate a joint inverse selection strategy, including selective leading opposition and dynamic opposite. Finally, we introduce the balanced candidate principle of the equilibrium optimizer algorithm into SMA, which enhances the algorithm's optimal search capability and anti-stagnation ability. We conducted optimization search experiments on 29 test functions from CEC2017 and 10 benchmark test functions from CEC2020, as well as nonparametric statistical analysis (Friedman and Wilcoxon). The experimental results and non-parametric test results show that OJESMA has better optimization accuracy, convergence performance, and stability. To further validate the effectiveness of the algorithm, we also performed optimization tests on six engineering problems and the variable index Muskingum. In summary, OJESMA demonstrates its practical value and advantages in solving various complex optimization problems with its excellent performance, providing new perspectives and methods for the development of optimization algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Data availability

All data included in this study are available upon request by contact with the corresponding author.

References

  1. Lin N, Fu L, Zhao L, Hawbani A, Tan Z, Al-Dubai A, Min G (2022) A novel nomad migration-inspired algorithm for global optimization. Comput Electr Eng 100:107862

    Google Scholar 

  2. Boussaid I, Lepagnot J, Siarry P (2013) A survey on optimization metaheuristics. Inf Sci 237:82–117

    MathSciNet  Google Scholar 

  3. Ding, C, & Zhu, G (2024). Improved optimal foraging algorithm for global optimization. Computing.

  4. Halim AH, Ismail I, Das S (2021) Performance assessment of the metaheuristic optimization algorithms: an exhaustive review. Artif Intell Rev 54:2323–2409

    Google Scholar 

  5. Hussain K, Mohd Salleh MN, Cheng S, Shi Y (2019) Metaheuristic research: a comprehensive survey. Artif Intell Rev 52:2191–2233

    Google Scholar 

  6. Wang J, Wang W-c, Chau K-w, Qiu L, Hu X-x, Zang H-f, Xu D-m (2024) An Improved Golden Jackal Optimization Algorithm Based on Multi-strategy Mixing for Solving Engineering Optimization Problems. J Bionic Eng 21:1092–1115

    Google Scholar 

  7. Whitley D (1994) A genetic algorithm tutorial. Stat Comput 4:65–85

    Google Scholar 

  8. Lambora, A, Gupta, K, & Chopra, K (2019). Genetic Algorithm- A Literature Review. 2019 International Conference on Machine Learning, Big Data, Cloud and Parallel Computing (COMITCon), 380–384.

  9. Neri F, Tirronen V (2010) Recent advances in differential evolution: a survey and experimental analysis. Artif Intell Rev 33:61–106

    Google Scholar 

  10. Wang W-c, Xu L, Chau K-w, Liu C-j, Ma Q, Xu D-m (2023) Cε-LDE: A lightweight variant of differential evolution algorithm with combined ε constrained method and Lévy flight for constrained optimization problems. Expert Syst Appl 211:118644

    Google Scholar 

  11. Kennedy, J, & Eberhart, R (1995). Particle swarm optimization. Proceedings of ICNN'95 - International Conference on Neural Networks, 4, 1942–1948 vol.1944.

  12. Yang, X-S (2014). Cuckoo Search and Firefly Algorithm: Overview and Analysis. Cuckoo Search and Firefly Algorithm: Theory and Applications, 1–26.

  13. Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1:28–39

    Google Scholar 

  14. Gandomi AH, Yang X-S, Alavi AH (2013) Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems. Engineering with Computers 29:17–35

    Google Scholar 

  15. Tanabe, R, & Fukunaga, AS (2014). Improving the search performance of SHADE using linear population size reduction. In 2014 IEEE Congress on Evolutionary Computation (CEC) (pp. 1658–1665).

  16. Mirjalili S, Mirjalili SM, Lewis A (2014) Grey Wolf Optimizer. Adv Eng Softw 69:46–61

    Google Scholar 

  17. Aala Kalananda, VKR, & Komanapalli, VLN (2024). Hybrid evolutionary grey wolf optimizer for constrained engineering problems and multi-unit production planning. Evolutionary Intelligence.

  18. Naruei I, Keynia F (2022) Wild horse optimizer: a new meta-heuristic algorithm for solving engineering optimization problems. Engineering with Computers 38:3025–3056

    Google Scholar 

  19. Karimzadeh Parizi M, Keynia F, khatibi Bardsiri, A, (2020) Woodpecker Mating Algorithm (WMA): a nature-inspired algorithm for solving optimization problems. International Journal of Nonlinear Analysis and Applications 11:137–157

    Google Scholar 

  20. Karimzadeh Parizi M, Keynia F, Khatibi Bardsiri A (2021) Woodpecker Mating Algorithm for Optimal Economic Load Dispatch in a Power System with Conventional Generators. International Journal of Industrial Electronics Control and Optimization 4:221–234

    Google Scholar 

  21. Karimzadeh Parizi M, Keynia F, Khatibi bardsiri, A, (2021) OWMA: An improved self-regulatory woodpecker mating algorithm using opposition-based learning and allocation of local memory for solving optimization problems. Journal of Intelligent & Fuzzy Systems 40:919–946

    Google Scholar 

  22. Yin S, Xiang Z (2024) Adaptive operator selection with dueling deep Q-network for evolutionary multi-objective optimization. Neurocomputing 581:127491

    Google Scholar 

  23. Gong J, Karimzadeh Parizi M (2022) GWMA: the parallel implementation of woodpecker mating algorithm on the GPU. J Chin Inst Eng 45:556–568

    Google Scholar 

  24. Parizi MK, Keynia F, Bardsiri AK (2021) HSCWMA: A New Hybrid SCA-WMA Algorithm for Solving Optimization Problems. Int J Inf Technol Decis Mak 20:775–808

    Google Scholar 

  25. Zhang J, Li H, Parizi MK (2022) HWMWOA: A Hybrid WMA–WOA Algorithm with Adaptive Cauchy Mutation for Global Optimization and Data Classification. Int J Inf Technol Decis Mak 22:1195–1252

    Google Scholar 

  26. Mirjalili S, Lewis A (2016) The Whale Optimization Algorithm. Adv Eng Softw 95:51–67

    Google Scholar 

  27. Gharehchopogh FS, Gholizadeh H (2019) A comprehensive survey: Whale Optimization Algorithm and its applications. SWARM AND EVOLUTIONARY COMPUTATION 48:1–24

    Google Scholar 

  28. Mirjalili S (2016) SCA: A Sine Cosine Algorithm for solving optimization problems. Knowl-Based Syst 96:120–133

    Google Scholar 

  29. Hafez AI, Zawbaa HM, Emary E, Hassanien AE (2016) Sine cosine optimization algorithm for feature selection. International Symposium on INnovations in Intelligent SysTems and Applications (INISTA) 2016:1–5

    Google Scholar 

  30. Johnson DS, Aragon CR, McGeoch LA, Schevon C (1991) Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning. Oper Res 39:378–406

    Google Scholar 

  31. Rashedi E, Nezamabadi-pour H, Saryazdi S (2009) GSA: A Gravitational Search Algorithm. Inf Sci 179:2232–2248

    Google Scholar 

  32. Zhong M, Wen J, Ma J, Cui H, Zhang Q, Parizi MK (2023) A hierarchical multi-leadership sine cosine algorithm to dissolving global optimization and data classification: The COVID-19 case study. Comput Biol Med 164:107212

    Google Scholar 

  33. Rao RV, Savsani VJ, Vakharia DP (2011) Teaching–learning-based optimization: A novel method for constrained mechanical design optimization problems. Comput Aided Des 43:303–315

    Google Scholar 

  34. Hayyolalam V, Pourhaji Kazem AA (2020) Black Widow Optimization Algorithm: A novel meta-heuristic approach for solving engineering optimization problems. Eng Appl Artif Intell 87:103249

    Google Scholar 

  35. Hu G, Du B, Wang X, Wei G (2022) An enhanced black widow optimization algorithm for feature selection. Knowl-Based Syst 235:107638

    Google Scholar 

  36. Wang L, Cao Q, Zhang Z, Mirjalili S, Zhao W (2022) Artificial rabbits optimization: A new bio-inspired meta-heuristic algorithm for solving engineering optimization problems. Eng Appl Artif Intell 114:105082

    Google Scholar 

  37. Li S, Chen H, Wang M, Heidari AA, Mirjalili S (2020) Slime mould algorithm: A new method for stochastic optimization. Futur Gener Comput Syst 111:300–323

    Google Scholar 

  38. Mostafa M, Rezk H, Aly M, Ahmed EM (2020) A new strategy based on slime mould algorithm to extract the optimal model parameters of solar PV panel. Sustainable Energy Technol Assess 42:100849

    Google Scholar 

  39. Ekinci, S, Izci, D, Zeynelgil, HL, & Orenc, S (2020). An Application of Slime Mould Algorithm for Optimizing Parameters of Power System Stabilizer. 2020 4th International Symposium on Multidisciplinary Studies and Innovative Technologies (ISMSIT), 1–5.

  40. Abdel-Basset M, Mohamed R, Chakrabortty RK, Ryan MJ, Mirjalili S (2021) An efficient binary slime mould algorithm integrated with a novel attacking-feeding strategy for feature selection. Comput Ind Eng 153:107078

    Google Scholar 

  41. Agarwal D, Bharti PS (2021) Implementing modified swarm intelligence algorithm based on Slime moulds for path planning and obstacle avoidance problem in mobile robots. Appl Soft Comput 107:107372

    Google Scholar 

  42. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by Simulated Annealing. Science 220:671–680

    MathSciNet  Google Scholar 

  43. Chen Z, Liu W (2020) An Efficient Parameter Adaptive Support Vector Regression Using K-Means Clustering and Chaotic Slime Mould Algorithm. IEEE Access 8:156851–156862

    Google Scholar 

  44. Örnek BN, Aydemir SB, Düzenli T, Özak B (2022) A novel version of slime mould algorithm for global optimization and real world engineering problems: Enhanced slime mould algorithm. Math Comput Simul 198:253–288

    MathSciNet  Google Scholar 

  45. Zhao J, Gao Z-M (2020) The hybridized Harris hawk optimization and slime mould algorithm. J Phys: Conf Ser 1682:012029

    Google Scholar 

  46. Heidari AA, Mirjalili S, Faris H, Aljarah I, Mafarja M, Chen H (2019) Harris hawks optimization: Algorithm and applications. Futur Gener Comput Syst 97:849–872

    Google Scholar 

  47. Z. -M, GAO, J, Z, Y. -R, HU, & Chen, HF (2019). The improved Harris hawk optimization algorithm with the Tent map. 2019 3rd International Conference on Electronic Information Technology and Computer Engineering (EITCE), 336–339.

  48. Wei Y, Zhou Y, Luo Q, Deng W (2021) Optimal reactive power dispatch using an improved slime mould algorithm. Energy Rep 7:8742–8759

    Google Scholar 

  49. Yin S, Luo Q, Zhou Y (2022) EOSMA: An Equilibrium Optimizer Slime Mould Algorithm for Engineering Design Problems. Arab J Sci Eng 47:10115–10146

    Google Scholar 

  50. Yin S, Luo Q, Zhou G, Zhou Y, Zhu B (2022) An equilibrium optimizer slime mould algorithm for inverse kinematics of the 7-DOF robotic manipulator. Sci Rep 12:9421

    Google Scholar 

  51. Yu C, Heidari AA, Xue X, Zhang L, Chen H, Chen W (2021) Boosting quantum rotation gate embedded slime mould algorithm. Expert Syst Appl 181:115082

    Google Scholar 

  52. Luo Q, Yin S, Zhou G, Meng W, Zhao Y, Zhou Y (2023) Multi-objective equilibrium optimizer slime mould algorithm and its application in solving engineering problems. Struct Multidiscip Optim 66:114

    Google Scholar 

  53. Yin S, Luo Q, Zhou Y (2023) IBMSMA: An Indicator-based Multi-swarm Slime Mould Algorithm for Multi-objective Truss Optimization Problems. J Bionic Eng 20:1333–1360

    Google Scholar 

  54. Naik MK, Panda R, Abraham A (2021) Adaptive opposition slime mould algorithm. Soft Comput 25:14297–14313

    Google Scholar 

  55. Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1:67–82

    Google Scholar 

  56. Arini FY, Chiewchanwattana S, Soomlek C, Sunat K (2022) Joint Opposite Selection (JOS): A premiere joint of selective leading opposition and dynamic opposite enhanced Harris’ hawks optimization for solving single-objective problems. Expert Syst Appl 188:116001

    Google Scholar 

  57. Faramarzi A, Heidarinejad M, Stephens B, Mirjalili S (2020) Equilibrium optimizer: A novel optimization algorithm. Knowl-Based Syst 191:105190

    Google Scholar 

  58. Mahdavi S, Rahnamayan S, Deb K (2018) Opposition based learning: A literature review. SWARM AND EVOLUTIONARY COMPUTATION 39:1–23

    Google Scholar 

  59. Xu Q, Wang L, Wang N, Hei X, Zhao L (2014) A review of opposition-based learning from 2005 to 2012. Eng Appl Artif Intell 29:1–12

    Google Scholar 

  60. Wang W-c, Xu L, Chau K-w, Zhao Y, Xu D-m (2022) An orthogonal opposition-based-learning Yin–Yang-pair optimization algorithm for engineering optimization. Engineering with Computers 38:1149–1183

    Google Scholar 

  61. Rahnamayan S, Tizhoosh HR, Salama MMA (2007) Quasi-oppositional Differential Evolution. IEEE Congress on Evolutionary Computation 2007:2229–2236

    Google Scholar 

  62. Dhargupta S, Ghosh M, Mirjalili S, Sarkar R (2020) Selective Opposition based Grey Wolf Optimization. Expert Syst Appl 151:113389

    Google Scholar 

  63. Xu Y, Yang Z, Li X, Kang H, Yang X (2020) Dynamic opposite learning enhanced teaching–learning-based optimization. Knowl-Based Syst 188:104966

    Google Scholar 

  64. Rahnamayan S, Tizhoosh HR, Salama MMA (2007) Opposition-Based Differential Evolution (ODE) with Variable Jumping Rate. IEEE Symposium on Foundations of Computational Intelligence 2007:81–88

    Google Scholar 

  65. Ergezer, M, Simon, D, & Du, D (2009). Oppositional biogeography-based optimization. 2009 IEEE International Conference on Systems, Man and Cybernetics, 1009–1014.

  66. Chen P, Zhou S, Zhang Q, Kasabov N (2022) A meta-inspired termite queen algorithm for global optimization and engineering design problems. Eng Appl Artif Intell 111:104805

    Google Scholar 

  67. Saha AK (2022) Multi-population-based adaptive sine cosine algorithm with modified mutualism strategy for global optimization. Knowl-Based Syst 251:109326

    Google Scholar 

  68. McCarthy GT (1938) The unit hydrograph and flood routing. proceedings of Conference of North Atlantic Division. US Army Corps of Engineers 1938:608–609

    Google Scholar 

  69. Easa SM (2015) Evaluation of nonlinear Muskingum model with continuous and discontinuous exponent parameters. KSCE J Civ Eng 19:2281–2290

    Google Scholar 

  70. Wang W-c, Tian W-c, Xu D-m, Chau K-w, Ma Q, Liu C-j (2023) Muskingum Models’ Development and their Parameter Estimation: A State-of-the-art Review. Water Resour Manage 37:3129–3150

    Google Scholar 

  71. Hu, G, Wang, J, Li, M, Hussien, AG, & Abbas, M (2023). EJS: Multi-Strategy Enhanced Jellyfish Search Algorithm for Engineering Applications. Mathematics, 11.

Download references

Funding

The special project for collaborative innovation of science and technology in 2021 (No: 202121206).

Author information

Authors and Affiliations

  1. College of Water Resources, North China University of Water Resources and Electric Power, Zhengzhou, 450046, China

    Wen-chuan Wang, Wen-hui Tao, Wei-can Tian & Hong-fei Zang

Authors
  1. Wen-chuan Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wen-hui Tao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wei-can Tian
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hong-fei Zang
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

Wen-chuan Wang: Conceptualization, Methodology, Data curation, Writing–original draft, Formal analysis. Wen-hui Tao: Methodology, Writing –original draft. Wei-can Tian: Writing – original draft. Hong-fei Zang: Formal analysis, Writing – original draft.

Corresponding author

Correspondence to Wen-chuan Wang.

Ethics declarations

Competing interests

The authors declare no competing interests.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, Wc., Tao, Wh., Tian, Wc. et al. A Multi-strategy Slime Mould Algorithm for Solving Global Optimization and Engineering Optimization Problems. Evol. Intel. 17, 3865–3889 (2024). https://doi.org/10.1007/s12065-024-00962-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12065-024-00962-3

Keywords

Search

Navigation