An Enhanced Slime Mould Algorithm Based on Quasi-conjugate Search Mechanism

Abstract

Slime mould algorithm (SMA) is a novel meta-heuristic algorithm, which seeks the optimal solution by simulating the foraging behavior and morphological changes of slime moulds. However, when solving the global optimization problem, SMA has the problem of insufficient population diversity and single search direction, which leads to low convergence accuracy of the algorithm. This paper proposes an enhanced slime mould algorithm based on quasi-conjugate search mechanism (QCSMA). Specifically, a fitness-distance balanced regeneration mechanism is proposed to relax the selection pressure of the population and produce the potential virtual point for drawing individuals to be redistributed in other areas, enhancing the algorithm’s global search capability. Next, a quasi-conjugate search mechanism is proposed, which involves two key calculations. One is to utilize the fitness improvement as the reward feedback to estimate the gradient direction of the considered individual without relying on mathematical derivation information. Then, the previously mentioned direction is dynamically aggregated with the historical search direction to better guide the individual to converge to the region where the optimal solution is located. To validate the performance of the proposed algorithm, experiments are carried out on two function test sets, IEEE CEC2017 and IEEE CEC2021. In addition, QCSMA is compared with 23 other different algorithms. The experimental results show that the new algorithm exhibits competitive results compared to other algorithms, indicating that QCSMA has better optimization ability, stability, and convergence speed. To further verify the optimization performance of QCSMA in real applications, experiments are carried out in two engineering optimization problems, and the effectiveness of QCSMA is proved by the results.

Keywords

Metaheuristic algorithms / slime mould algorithm / fitness-distance balance / quasi-conjugate search mechanism / engineering optimization problems

References

[1] Aljarah I, Faris H, Mirjalili S. Optimizing connection weights in neural networks using the whale optimization algorithm. Soft Computing. 2018, 22(1): 1-15.

[2] Abdel-Basset M, Chang V, Mohamed R. HSMA_WOA: A hybrid novel slime mould algorithm with whale optimization algorithm for tackling the image segmentation problem of chest X-ray images. Applied Soft Computing. 2020, 95: 106642.

[3] Al-Betar M A, Awadallah M A, Zitar R Aet al. . Economic load dispatch using memetic sine cosine algorithm. Journal of Ambient Intelligence and Humanized Computing. 2023, 14(9): 11685-11713.

[4] Brest J, Maucec M S, Boskovic B. iL-SHADE: Improved L-SHADE algorithm for single objective realparameter optimization. 2016 IEEE Congress on Evolutionary Computation (CEC). 2016

[5] Brest J, Maucec M S, Boskovic B. Single objective real-parameter optimization: Algorithm jSO. 2017 IEEE Congress on Evolutionary Computation (CEC). 2017

[6] Cohn H. On the Borel-Cantelli lemma. Israel Journal of Mathematics. 1972, 12111-16.

[7] Chen J, Han P, Liu Yet al. . Scheduling independent tasks in cloud environment based on modified differential evolution. Concurrency and Computation: Practice and Experience. 2023, 35(13): e6256.

[8] Chen H, Wang Z, Jia Het al. . Hybrid slime mold and arithmetic optimization algorithm with random center learning and restart mutation. Biomimetics. 2023, 85396.

[9] Ch L K, Kamboj V K, Bath S K. Hybridizing slime mould algorithm with simulated annealing algorithm: a hybridized statistical approach for numerical and engineering design problems. Complex & Intelligent Systems. 2023, 921525-1582.

[10] Chauhan S, Vashishtha G. A synergy of an evolutionary algorithm with slime mould algorithm through series and parallel construction for improving global optimization and conventional design problem. Engineering Applications of Artificial Intelligence. 2023, 118: 105650.

[11] Chakraborty P, Nama S, Saha A K. A hybrid slime mould algorithm for global optimization. Multimedia Tools and Applications. 2023, 82(15): 22441-22467. T

[12] Dorigo M, Di C G. Ant colony optimization: a new meta-heuristic. Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406). 1999

[13] Dai M, Jiang Z. Multiprocessor fair scheduling based on an improved slime mold algorithm. Algorithms. 2023, 1610473.

[14] Deng L, Liu S. An enhanced slime mould algorithm based on adaptive grouping technique for global optimization. Expert Systems with Applications. 2023, 222: 119877.

[15] Dong Y, Zhang S, Zhang Het al. . Chaotic evolution optimization: A novel metaheuristic algorithm inspired by chaotic dynamics. Chaos, Solitons & Fractals. 2025, 192116049.

[16] Espinoza-Vasquez A P, Galatro D, Gonzalez Yet al. . Modeling and optimization of the extraction of ylang-ylang essential oils using surrogate models from simulated data, coupled with covariance matrix adaptation evolution strategy. Journal of Food Engineering. 2023, 357111637.

[17] Edee K, Granet G, Bonnet P. Slime mold algorithm for topology optimization: Metagratings inverse design. Discover Applied Sciences. 2024, 6268.

[18] Gilbert J C, Nocedal J. Global convergence properties of conjugate gradient methods for optimization. SIAM Journal on Optimization. 1992, 2121-42.

[19] Gandomi A H. Interior search algorithm (ISA): A novel approach for global optimization. ISA Transactions. 2014, 5341168-1183.

[20] Guo A, Wang Y, Guo Let al. . An adaptive position-guided gravitational search algorithm for function optimization and image threshold segmentation. Engineering Applications of Artificial Intelligence. 2023, 121: 106040.

[21] Gao Y, Zhang J, Wang Yet al. . Love evolution algorithm: A stimulus-value-role theory-inspired evolutionary algorithm for global optimization. The Journal of Supercomputing. 2024, 80(9): 12346-12407.

[22] Ghasemi M, Zare M, Trojovský Pet al. . Optimization based on the smart behavior of plants with its engineering applications: Ivy algorithm. Knowledge-Based Systems. 2024, 295: 111850.

[23] Hauschild M, Pelikan M. An introduction and survey of estimation of distribution algorithms. Swarm and Evolutionary Computation. 2011, 13111-128.

[24] Hatamlou A. Black hole: A new heuristic optimization approach for data clustering. Information Sciences. 2013, 222: 175-184.

[25] Heidari A A, Mirjalili S, Faris Het al. . Harris hawks optimization: Algorithm and applications. Future Generation Computer Systems. 2019, 97: 849-872.

[26] Hadi A A, Mohamed A W, Jambi K M. Single-objective real-parameter optimization: Enhanced LSHADE-SPACMA algorithm. Heuristics for Optimization and Learning. 2021103-121.

[27] Hu J, Gui W, Heidari A Aet al. . Dispersed foraging slime mould algorithm: Continuous and binary variants for global optimization and wrapper-based feature selection. Knowledge-Based Systems. 2022, 237: 107761.

[28] Hashim F A, Mostafa R R, Hussien A Get al. . Fick’s law algorithm: A physical law-based algorithm for numerical optimization. Knowledge-Based Systems. 2023, 260110146.

[29] Hosseinzadeh M, Mohammed A H, Rahmani A Met al. . A secure routing approach based on league championship algorithm for wireless body sensor networks in healthcare. PLOS ONE. 2023, 18(10): e0290119.

[30] Kirkpatrick S, Gelatt C D, Vecchi M P. Optimization by Simulated Annealing. Science. 1983, 2204598671-680.

[31] Kennedy J, Eberhart R. Particle swarm optimization. Proceedings of ICNN’95-International Conference on Neural Networks. 1995

[32] Kashan A H. League championship algorithm: A new algorithm for numerical function optimization. 2009 International Conference of Soft Computing and Pattern Recognition. 2009

[33] Kong D, Kang Z, Jiang Cet al. . Reinforcement of bionic trabecular bone scaffolds for bone defect repair using the slime mould algorithm. Materials & Design. 2023, 233: 112184.

[34] Kuo R J, Li S-S. Applying particle swarm optimization algorithm-based collaborative filtering recommender system considering rating and review. Applied Soft Computing. 2023, 135110038.

[35] Khatri K A, Shah K B, Logeshwaran Jet al. . Genetic algorithm based techno-economic optimization of an isolated hybrid energy system. CRF. 2023, 3513e6256

[36] Liu Z-Z, Chu D-H, Song Cet al. . Social learning optimization (SLO) algorithm paradigm and its application in QoS-aware cloud service composition. Information Sciences. 2016, 326315-333.

[37] Li S, Chen H, Wang Met al. . Slime mould algorithm: A new method for stochastic optimization. Future Generation Computer Systems. 2020, 111: 300-323.

[38] Liu Y, Heidari A A, Ye Xet al. . Boosting slime mould algorithm for parameter identification of photovoltaic models. Energy. 2021, 234: 121164.

[39] McCall J. Genetic algorithms for modelling and optimisation. Journal of Computational and Applied Mathematics. 2005, 1841205-222.

[40] Mirjalili S, Mirjalili S M, Lewis A. Grey wolf optimizer. Advances in Engineering Software. 2014, 69: 46-61.

[41] Mirjalili S. SCA: A sine cosine algorithm for solving optimization problems. Knowledge-Based Systems. 2016, 96: 120-133.

[42] Mirjalili S, Lewis A. The whale optimization algorithm. Advances in Engineering Software. 2016, 95: 51-67.

[43] Mirjalili S, Gandomi A H, Mirjalili S Zet al. . Salp warm algorithm: A bio-inspired optimizer for engineering design problems. Advances in Engineering Software. 2017, 114: 163-191.

[44] Ma X, Li X, Zhang Qet al. . A survey on cooperative co-evolutionary algorithms. IEEE Transactions on Evolutionary Computation. 2019, 233421-441.

[45] Mohamed A K, Mohamed A W. Real-parameter unconstrained optimization based on enhanced AGDE algorithm. Machine Learning Paradigms: Theory and Application. 2019431450.

[46] Mohamed A W, Hadi A A, Jambi K M. Novel mutation strategy for enhancing SHADE and LSHADE algorithms for global numerical optimization. Swarm and Evolutionary Computation. 2019, 50: 100455.

[47] Mohamed A W, Hadi A A, Mohamed A Ket al. . Evaluating the performance of adaptive gainingsharing knowledge based algorithm on CEC 2020 benchmark problems. 2020 IEEE Congress on Evolutionary Computation (CEC). 2020

[48] Mirrashid M, Naderpour H. Incomprehensible but intelligible-in-time logics: Theory and optimization algorithm. Knowledge-Based Systems. 2023, 264110305.

[49] Nguyen T-T, Wang H-J, Dao T-Ket al. . An improved slime mold algorithm and its application for optimal operation of cascade hydropower stations. IEEE Access. 2020, 8226754-226772.

[50] Nadimi-Shahraki M H, Taghian S, Mirjalili S. An improved grey wolf optimizer for solving engineering problems. Expert Systems with Applications. 2021, 166: 113917.

[51] Naik M K, Panda R, Abraham A. Adaptive opposition slime mould algorithm. Soft Computing. 2021, 25(22): 14297-14313.

[52] Osher S, Wang B, Yin P, Luo X, Barekat F, Pham M, Lin A. Laplacian smoothing gradient descent. Research in the Mathematical Sciences. 2022, 9355.

[53] Pawar P J, Rao R V. Parameter optimization of machining processes using teaching-learning-based optimization algorithm. The International Journal of Advanced Manufacturing Technology. 2013, 675–8995-1006.

[54] Pan J, Guo Z, Wu Cet al. . Parameter optimization of the field-road trajectory segmentation model based on the chaos sensing slime mould algorithm. Soft Computing. 2024, 28(19): 11065-11132. 12

[55] Pan J, Wu C, Zhai W. A hybrid genetic slime mould algorithm for parameter optimization of field-road trajectory segmentation models. Information Processing in Agriculture. 2024, 11(4): 590-602. 65

[56] Qian Q, Deng Y, Sun Het al. . Enhanced beetle antennae search algorithm for complex and unbiased optimization. Soft Computing. 2022, 26(19): 10331-10369.

[57] Rashedi E, Nezamabadi-pour H, Saryazdi S. GSA: A gravitational search algorithm. Information Sciences. 2009, 179(13): 2232-2248.

[58] Rao R V, Savsani V J, Vakharia D P. Teaching–learning-based optimization: An optimization method for continuous non-linear large scale problems. Information Sciences. 2012, 183(1): 1-15.

[59] Ruder S (2016). An overview of gradient descent optimization algorithms. arXiv preprint arXiv 1609: 04747.

[60] Rizk-Allah R M, Hassanien A E, Song D. Chaos-opposition-enhanced slime mould algorithm for minimizing the cost of energy for the wind turbines on high-altitude sites. ISA Transactions. 2022, 121: 191-205.

[61] Solis F J, Wets R J-B. Minimization by Random Search Techniques. Mathematics of Operations Research. 1981, 6(1): 19-30.

[62] Storn R, Price K. Differential evolution–a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization. 1997, 11(4): 341-359.

[63] Simionescu P A, Beale D, Dozier G V. Teeth-Number Synthesis of a Multispeed Planetary Transmission Using an Estimation of Distribution Algorithm. Journal of Mechanical Design. 2006, 128(1): 108-115.

[64] Son P V H, Khoi L N Q. Adaptive opposition slime mold algorithm for time-cost-quality-safety trade-off for construction projects. Asian Journal of Civil Engineering. 2023, 24(7): 1927-1942.

[65] Son P V H, Khoi L N Q. Optimization time-cost-quality-work continuity in construction management using mutation-crossover slime mold algorithm. Applied Soft Computing. 2023, 147: 110775.

[66] Sahu V S D M, Samal P, Panigrahi C K. Tyrannosaurus optimization algorithm: A new nature-inspired meta-heuristic algorithm for solving optimal control problems. e-Prime-Advances in Electrical Engineering, Electronics and Energy. 2023, 5100243.

[67] Sun B. A dimensionless model and ant colony optimization fusion temperature prediction in tunnel fires. Applied Soft Computing. 2023, 145110564.

[68] Son P V H, Khoi L N Q. Adaptive opposition slime mold algorithm for time-cost-quality-safety trade-off for construction projects. Asian Journal of Civil Engineering. 2023, 24(7): 1927-1942.

[69] Sowmya R, Premkumar M, Jangir P. Newton-Raphson-based optimizer: A new population-based metaheuristic algorithm for continuous optimization problems. Engineering Applications of Artificial Intelligence. 2024, 128: 107532.

[70] Tero A, Takagi S, Saigusa Tet al. . Rules for biologically inspired adaptive network Design. Science. 2010, 3275964439-442.

[71] Tanabe R, Fukunaga A S. Improving the search performance of SHADE using linear population size reduction. 2014 IEEE Congress on Evolutionary Computation (CEC). 2014

[72] Truong D N, Chou J S. Metaheuristic algorithm inspired by enterprise development for global optimization and structural engineering problems with frequency constraints. Engineering Structures. 2024, 318: 118679.

[73] Wolpert D H, Macready W G. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation. 1997, 1167-82.

[74] Wang H-J, Pan J-S, Nguyen T-Tet al. . Distribution network reconfiguration with distributed generation based on parallel slime mould algorithm. Energy. 2022, 244: 123011.

[75] Wang T-L, Chen L-Q, Gu S-Wet al. . CSSMA: A novel algorithm of slime mold optimzer for global optimization problems. PREPRINT (Version 1) available at Research Square. 2023

[76] Xiong W, Li D, Zhu Det al. . An enhanced slime mould algorithm combines multiple strategies. Axioms. 2023, 1210907.

[77] Yu V F, Susanto H, Jodiawan Pet al. . A simulated annealing algorithm for the vehicle routing problem with parcel lockers. IEEE Access. 2022, 1020764-20782.

[78] Yu T, Pan J, Qian N Aet al. . Improved slime mould algorithm by perfecting bionic-based mechanisms. International Journal of Bio-Inspired Computation. 2023, 2211-15.

[79] Yong Yu, Li, Liang, Ma, Yong Liu. Novel lichtenberg algorithm combining partition-oriented search and adaptive diffusion. Computer Engineering and Applications 59(4):77–88.

[80] Zheng J, Xie Y, Huang Xet al. . Balanced version of slime mold algorithm: A study on PEM fuel cell system parameters identification. Energy Reports. 2021, 7: 3199-3209.

[81] Zhong C, Li G, Meng Z. A hybrid teaching–learning slime mould algorithm for global optimization and reliability-based design optimization problems. Neural Computing and Applications. 2022, 34(19): 16617-16642.

[82] Zhou X, Chen Y, Wu Zet al. . Boosted local dimensional mutation and all-dimensional neighborhood slime mould algorithm for feature selection. Neurocomputing. 2023, 551126467.

[83] Zhang Y, Liu Y, Zhao Yet al. . Implementation of chaotic reverse slime mould algorithm based on the dandelion optimizer. Biomimetics. 2023, 86482.

RIGHTS & PERMISSIONS

Systems Engineering Society of China and Springer-Verlag GmbH Germany