Multiple strategies improved spider wasp optimization for engineering optimization problem solving Authors: Jinxue Sui, Zifan Tian, Zuoxun Wang Published: 2024 ABSTRACT The Spider Wasp Optimization (SWO) algorithm is a swarm intelligence optimization technique inspired by the collective behaviors of social animals. This algorithm, designed to address optimization challenges, emulates the unique hunting, nesting, and mating behaviors of female spider wasps. It offers several advantages, including rapid search speed and high solution accuracy. However, when tackling complex optimization problems, it can encounter issues such as getting trapped in local optima, slow early convergence, and the need for manual adjustment of the “Trade-off Rate” (TR) parameter for different problems.To improve the performance and versatility of the SWO algorithm, a Multi-strategy Improved Spider Wasp Optimizer (MISWO) is proposed. Firstly, the Grey Wolf Algorithm is integrated into the initialization phase to enhance early convergence and improve the fitness of the initial population, thereby boosting the algorithm’s global optimization capabilities.Secondly, an adaptive step size operator and Gaussian mutation are introduced during the search phase to automatically adjust the search range at different optimization stages. This enhancement increases both the optimization accuracy and the algorithm’s ability to avoid local optima. The Trade-off Rate (TR) is dynamically selected to better accommodate a variety of problems. Finally, a dynamic lens imaging reverse learning strategy is employed to update optimal individuals, further improving the algorithm’s capacity to escape local optima. To validate the effectiveness of MISWO, it was tested on 23 benchmark functions and 7 engineering optimization problems, and compared with several state-of-the-art algorithms. Experimental results show that MISWO outperforms other algorithms in terms of optimization capability, stability, and adaptability across diverse problems. Introduction An optimization problem involves determining the best or a sufficiently good approximate solution from numerous possible options or parameter combinations, all under specific constraints. The core objective is to find the solution that maximizes or minimizes an objective function from a set of feasible solutions. In engineering applications, as the complexity and scale of problems continue to grow, traditional optimization methods, such as linear programming, steepest descent, conjugate gradient, and penalty function methods, have become inadequate for addressing complex problems or situations that require high-precision solutions. Traditional optimization algorithms often struggle with complex problems characterized by nonlinearity, multimodality, high dimensionality, and non-convexity. They tend to fall into local optima, with outcomes highly dependent on initial values. To overcome these challenges, many researchers have turned to biological, natural, and social phenomena for inspiration. By analyzing the key characteristics of these phenomena-such as cooperation, information sharing, and specialized behaviors-scholars have developed metaheuristic algorithms that simulate these dynamics, offering more robust solutions for complex optimization tasks. Metaheuristic algorithms have demonstrated significant potential in solving real-world problems and have been widely applied across various domains,including industry1,2, military3,4 , transportation and logistics5–8, and engineering9–12. Meta heuristic optimization algorithms can be mainly divided into four categories: evolutionary based algorithms, swarm intelligence based algorithms, human based algorithms, and physics and chemistry based algorithms Evolutionary algorithms mainly simulate the natural law of survival of the fittest to achieve overall population progress and ultimately solve for the optimal solution. To find the optimal solution to a problem by simulating mechanisms such as genetics, crossover, and mutation in biological evolution. The core idea of swarm intelligence based algorithms is to simulate the collective intelligence of biological populations in order to find the global optimal solution. In this algorithm, each population is regarded as a vivid biological population, and each individual in the population collaborates and cooperates with each other to perform tasks that are difficult to accomplish solely by individual strength. Algorithms based on human behavior mainly draw inspiration from various behavioral patterns in human daily life. These algorithms simulate various human behaviors such as teaching, socializing, learning, emotions, and management. Physics and chemistry based algorithms mainly come from physical rules and chemical reactions in the universe, such as lightning, water waves, sound, gravity, and chemical reactions. In recent years, metaheuristic algorithms have been applied and developed in multiple fields, and among the four types of algorithms, the swarm intelligence algorithm used to simulate biological populations has received the most attention and research from scholars. Due to the lack of the No Free Lunch theorem (NFL), it is known that for all possible optimization problems, no algorithm is superior to other algorithms in all problems. The design of optimization algorithms needs to be adjusted and optimized for specific problems, and there is no universal algorithm that can perform best in all situations. Constrained optimization problems in engineering design have become a key application area for intelligent optimization algorithms. These problems involve finding the optimal design solutions while satisfying multiple constraints related to technical, economic, and other factors. Yan et al.13 proposed a hybrid genetic algorithm that enhances the algorithm’s ability to escape local optima. Through validation on three practical engineering problems, the study demonstrated the algorithm’s strong convergence accuracy and robustness. Gong et al.14 introduced a multi-objective differential evolution algorithm for addressing engineering design problems and utilized it to solve four engineering design optimization problems. The results demonstrate the efficiency and applicability of the algorithm in multi-objective design optimization. Akay et al.15 proposed an artificial bee colony algorithm for large-scale problems and applied it to optimize five constrained engineering problems, showcasing its superiority in handling large-scale problems.Li et al.16proposed a moth flame algorithm based on the Levy-flight strategy to increase population diversity, enabling the algorithm to effectively escape local optima. The algorithm’s effectiveness was demonstrated in solving two constrained engineering design problems. Sayed et al.17 proposed a hybrid algorithm based on Moth Flame Optimization (MFO) and Simulated Annealing (SA), which was applied to four well-known constrained engineering problems. Experimental results demonstrate the superiority of the proposed algorithm. Furthermore, Chen et al.18 introduced Levy flight and chaotic local search into the Whale Optimization Algorithm, enhancing convergence speed and solution quality for three traditional engineering optimization problems. Rizk-Allah19 presented a multi-orthogonal search strategy combining sine-cosine algorithm with orthogonal search, improving convergence speed and stability. The algorithm was applied to four engineering design problems to study its performance. Yi et al.20 proposed a parallel chaotic local search-enhanced Harmony Search Algorithm for solving engineering design optimization problems. It was applied to constrained engineering design problems, proving its effectiveness. El-Shorb et al.21 combined genetic algorithm with firefly algorithm to prevent falling into local optima while balancing exploration/exploitation trends. The algorithm’s superiority was verified by solving seven engineering design problems. Pathak et al.22 introduced an upgraded Bat Algorithm with Cuckoo Search and Sugeno inertial weights to address the limitations of the Bat Algorithm in solving multi-dimensional engineering problems, such as being trapped in local minima and slow convergence. The proposed algorithm demonstrated higher optimization accuracy and faster convergence when solving seven well-known constrained engineering design problems. Spider Wasp Optimization (SWO), introduced by Mohamed Abdel Basset et al. in 2023, is inspired by the hunting, nesting, and mating behaviors of female spider wasps in nature. This algorithm boasts advantages such as fast search speed and high solution accuracy. With several unique update strategies, it is well-suited for a wide range of optimization problems requiring different levels of exploration and exploitation. Despite its strengths, SWO has some limitations, including low convergence accuracy, slow convergence speed, and a tendency to become trapped in local optima. To overcome these shortcomings, future research will focus on improving the algorithm’s adaptability and optimization capabilities. The enhanced SWO will be applied to address real-world problems across various fields. To better suit practical engineering applications and achieve faster convergence to optimal solutions, a Multi-strategy Improved Spider Wasp Optimization is proposed. To address the drawbacks of the original algorithm, such as slow convergence speed and low accuracy in the early stages, the Grey Wolf Algorithm23 s introduced during the initialization phase. This enhancement improves the convergence rate and fitness of the initial population, optimizing the starting state and providing a more advantageous beginning for the entire optimization process, thereby boosting the algorithm’s global optimization capability. Additionally, to overcome the inefficiency caused by randomly selecting the search range in the original algorithm, an adaptive step size operator24 is incorporated into the search phase. This operator automatically adjusts the search range of spider bees at different optimization stages, enhancing the efficiency and effectiveness of the search process. Simultaneously, Gaussian mutation is introduced to enhance the algorithm’s optimization accuracy and its ability to escape local optima. In the original algorithm, manually setting the trade-off rate (TR) parameter can result in significant variations in optimization outcomes for slightly different TR values. To address this issue, a dynamic selection of the trade-off rate (TR) is implemented, enabling a more flexible trade-off strategy throughout the algorithm’s execution. Finally, a dynamic lens imaging reverse learning strategy is introduced to adjust the parameters of lens imaging in response to reverse solution changes, providing a more accurate target position for the algorithm. This approach reduces the algorithm’s search blindness and significantly enhances optimization accuracy. The proposed algorithm is compared with several of the latest and most frequently cited optimization algorithms. Experimental evaluations on 23 complex benchmark test functions and 7 engineering optimization problems show that it outperforms other algorithms in terms of optimization capability, stability, and applicability to various problems. This demonstrates the algorithm’s excellent performance across a wide range of application fields and its effectiveness in handling complex and diverse problem scenarios. The main contributions of this paper can be summarized as follows: 1. A Multi-strategy Improved Spider Wasp Optimization algorithm is proposed, enhancing its applicability and development capabilities through the integration of wolf pack initialization, an adaptive step size operator, a dynamic trade-off rate, and a dynamic lens imaging reverse learning strategy. 2. The MISWO algorithm demonstrated superior performance compared to a selection of advanced optimization algorithms across 23 benchmark test functions. Statistical experimental results validate its effectiveness and superiority. 3. The algorithm successfully solved 7 engineering problems of varying complexity in real-life scenarios, confirming its practicality. Comparative analysis using data further illustrates the algorithm’s advancement over selected algorithms. In summary, this article is divided into the following parts. “Multi-strategy improved spider wasp optimization” enhances Spider Wasp Optimization by integrating multiple strategies to develop a Multi-strategy Improved Spider Wasp Optimization (MISWO) algorithm, and provides a detailed flow of the improved algorithm. “Simulation experiment and analysis” compares the performance of the MISWO algorithm with various advanced algorithms across 23 benchmark test functions and presents the test results. “Engineering optimization problems and analysis” presents seven engineering problems of varying complexity and uses the MISWO algorithm to solve them. Additionally, it includes experimental results from simulations of paired unmanned aerial vehicles navigating disaster-affected mountain maps of different complexities. “Conclusion” summarizes the findings of the article and proposes ideas for future improvements. Multi-strategy improved spider wasp optimization This section provides an overview of how the Grey Wolf algorithm is used to enhance the quality of the initial population. It also introduces dynamic inertia weights during the search, chase, and escape stages to dynamically adjust the trade-off rate (TR). Additionally, a reverse learning strategy for dynamic lens imaging is introduced to highlight its mechanisms. Initialization of the grey wolf algorithm population Grey wolves, belonging to the canidae family, are top predators and occupy the apex of the food chain. They typically live in packs of 5 to 12 individuals and have a highly structured social hierarchy. In 2014, Mirjalili et al. introduced a new swarm intelligence algorithm inspired by the behavioral characteristics of grey wolves: Grey Wolf Optimization (GWO). GWO mimics the predation behavior of grey wolf packs and achieves optimization through mechanisms of pack cooperation. GWO categorizes wolf packs into four levels based on priority: \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha$$\end{document}α, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta$$\end{document}β, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\delta$$\end{document}δ, and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\omega$$\end{document}ω, to carry out a series of activities including searching for prey, surrounding prey, and attacking prey. The \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha$$\end{document}α wolf is the leader of the wolf pack, mainly responsible for making decisions about hunting, sleeping time and place, food allocation, and other aspects of the group. The \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta$$\end{document}β wolf is mainly responsible for assisting the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha$$\end{document}α wolf in making decisions, issuing commands from the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha$$\end{document}α wolf to other members, and providing feedback on the execution status of other members to the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha$$\end{document}α wolf, playing a bridging role. When there is a vacancy in the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha$$\end{document}α wolf of the entire wolf pack, the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta$$\end{document}β wolf will take over the position of the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha$$\end{document}α wolf. The \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\delta$$\end{document}δ wolf follows the decision-making commands of the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha$$\end{document}α and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta$$\end{document}β wolves and is mainly responsible for reconnaissance, surveillance, and care. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha$$\end{document}α wolves and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta$$\end{document}β wolves with poor adaptability will also be downgraded to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\delta$$\end{document}δ wolves. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\omega$$\end{document}ω wolves are primarily responsible for maintaining the balance of relationships within their population. The formula for surrounding prey by the wolf pack after identifying it is given by:1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} & \begin{aligned} D=\left| C \cdot X_p(t)-X(t)\right| \end{aligned} \end{aligned}$$\end{document}D=C·Xp(t)-X(t)2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} & \begin{aligned} X(t+1)=X_p(t)-A \cdot D \end{aligned} \end{aligned}$$\end{document}X(t+1)=Xp(t)-A·DLet t represents the iteration number,\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$X_p(t)$$\end{document}Xp(t) denotes the information of the prey,Xp(t) and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$Xp(t+1)$$\end{document}Xp(t+1)represent the positions of the grey wolf before and after the update, respectively. D indicates the distance between the prey and the grey wolf.A and C are coefficients used to balance the algorithm’s exploration and exploitation capabilities. The formula is as follows:3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} & \left\{ \begin{array}{c} A=2 a r_1-a \\ C=2 * r_2 \end{array}\right. \end{aligned}$$\end{document}A=2ar1-aC=2∗r24\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} & a=2-\frac{2 t}{t_{\max }} \end{aligned}$$\end{document}a=2-2ttmax\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$r_1$$\end{document}r1 and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$r_2$$\end{document}r2 are random numbers between [0,1]. t represents the iteration number, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t_max$$\end{document}tmax denotes the maximum number of iterations. The wolf pack adjusts its positions under the leadership of the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha$$\end{document}α, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta$$\end{document}β, and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\delta$$\end{document}δ, wolves to attack the surrounded prey. As shown in Fig. 1:Figure 1Grey wolf packs attack surrounded prey. Grey wolf packs attack surrounded prey. In each iteration, the best value obtained is assigned to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha$$\end{document}α, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta$$\end{document}β, and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\delta$$\end{document}δ Ordinary wolves adjust their positions based on the positions of the leading wolves to complete the surrounding and hunting behaviors. The formula is as follows:5\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} & \left\{ \begin{array}{l} D_\alpha =\left| C_1 X_\alpha (t)-X(t)\right| \\ D_\beta =\left| C_1 X_\beta (t)-X(t)\right| \\ D_\delta =\left| C_1 X_\delta (t)-X(t)\right| \end{array}\right. \end{aligned}$$\end{document}Dα=C1Xα(t)-X(t)Dβ=C1Xβ(t)-X(t)Dδ=C1Xδ(t)-X(t)6\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} & \left\{ \begin{array}{l} X_1=X_\alpha (t)-A_1 D_\alpha \\ X_2=X_\beta (t)-A_1 D_\beta \\ X_3=X_\delta (t)-A_3 D_\delta \end{array}\right. \end{aligned}$$\end{document}X1=Xα(t)-A1DαX2=Xβ(t)-A1DβX3=Xδ(t)-A3Dδ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$D_\alpha , D_\beta$$\end{document}Dα,Dβ and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$D_\delta$$\end{document}Dδ respectively represent the distances between the alpha,beta,and delta wolves and other wolves, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$X_1, X_2, X_3$$\end{document}X1,X2,X3 denote the movement changes that occur in other wolves influenced by the alpha,beta,and delta wolves. In the initialization phase of SWO, each spider wasp represents a solution. A spider wasp individual with d dimensions can be represented as follows:7\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \overrightarrow{S W}=\left[ x_1, x_2, x_3, \ldots x_d\right] \end{aligned}$$\end{document}SW→=x1,x2,x3,…xdA population of size N is randomly generated within the search space [L, U] as follows:8\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \left[ \begin{array}{cccc} s w_{1,1} & s w_{1,2} & \ldots & s w_{1, d} \\ s w_{2,1} & s w_{2,2} & \ldots & s w_{2, d} \\ \vdots & \vdots & \vdots & \vdots \\ s w_{N, 1} & s w_{N, 2} & \ldots & s w_{N, d} \end{array}\right] \end{aligned}$$\end{document}sw1,1sw1,2…sw1,dsw2,1sw2,2…sw2,d⋮⋮⋮⋮swN,1swN,2…swN,dIn the search space, arbitrary solutions are randomly generated using the following formula.9\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \overrightarrow{S W}_{\textrm{i}}^t=\textbf{L}+\textbf{r} *(\textbf{H}-\textbf{L}) \end{aligned}$$\end{document}SW→it=L+r∗(H-L)Where t represents the generation index, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$i(i=1,2,3, \ldots , N)$$\end{document}i(i=1,2,3,…,N) represents the population index, and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textbf{r}$$\end{document}r is a vector of d dimensions containing numbers between 0 and 1. Due to the strong population diversity of the spider wasp optimization (SWO) algorithm, ensuring the search for the optimal solution, its convergence performance is often compromised. To address this limitation, a hybrid strategy leveraging the strong convergence capability of the gray wolf optimization (GWO) algorithm is proposed. This strategy aims to initialize the spider wasp population using the GWO algorithm, which results in a more concentrated initial population distribution and provides clearer optimization directions, thus accelerating the convergence speed of the algorithm. After generating a random population using Equation (27), the SWO algorithm undergoes population updating through the GWO algorithm to obtain a new spider wasp population.10\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} & \overrightarrow{S W_{\textrm{I}}}=\textbf{L}+\textbf{r} *(\textbf{H}-\textbf{L}) \end{aligned}$$\end{document}SWI→=L+r∗(H-L)11\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} & \overrightarrow{G_{\textrm{I}}}=F_l\left( \overrightarrow{S W_{\textrm{i}}}\right) \end{aligned}$$\end{document}GI→=FlSWi→\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\overrightarrow{S W_{\textrm{i}}}(i=1,2,3, \ldots , N)$$\end{document}SWi→(i=1,2,3,…,N) epresents the randomly generated initial population, and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$F_l$$\end{document}Fl denotes the iteration using the gray wolf algorithm for l times. This process results in the initial population of spider wasps. Adaptive step size operator and dynamic trade-off rate In the hunting behavior of the Spider Wasp Optimization (SWO) algorithm, two distinct step sizes are randomly employed to explore the solution space: a large-step search to maintain the population’s global search capability, and a small-step search to focus on exploring the vicinity of known solutions. Female wasps persistently explore the search space with a constant large step size in search of suitable spiders for their offspring. This behavior can be mathematically formulated as follows:12\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {\overrightarrow{S W_{\textrm{i}}}}^{t+1}={\overrightarrow{S W_{\textrm{i}}}}^t+\mu _1 *\left( {\overrightarrow{S W_a}}^t-{\overrightarrow{S W_b}}^t\right) \end{aligned}$$\end{document}SWi→t+1=SWi→t+μ1∗SWa→t-SWb→tWhere a and b are two randomly selected indices from the population. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mu _1$$\end{document}μ1 controls the direction of movement of the spider wasp. the formula is given by:13\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \mu _1=|r n| * r_1 \end{aligned}$$\end{document}μ1=|rn|∗r1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$r_1$$\end{document}r1 is a randomly generated number within the range [0,1], while rn represents a random number generated from a normal distribution. Additionally, a small step size is employed to explore the area surrounding the dropped spider. The formula is given by:14\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} {\overrightarrow{S W_i}}^{t+1}={\overrightarrow{S W_{\textrm{c}}}}^t+\mu _2 *\left( \textbf{L}+\textbf{r}_2 *(\textbf{H}-\textbf{L})\right) \end{aligned}$$\end{document}SWi→t+1=SWc→t+μ2∗L+r2∗(H-L)A randomly selected individual from the population, where C is the index of the randomly selected individual. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mu _2$$\end{document}μ2 is a random number generated by the following formula:15\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \mu _2=B * \cos (2 \pi l) \end{aligned}$$\end{document}μ2=B∗cos(2πl)l is a randomly generated number between 1 and -2. B is a random number generated by the following formula:16\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} B=\frac{1}{1+e^l} \end{aligned}$$\end{document}B=11+elThe spider wasp optimization (SWO) algorithm employs two randomly selected search methods to update the population. However, both methods utilize a fixed step size during exploration, which constrains the algorithm’s ability to swiftly identify high-quality solutions in the early stages and impacts its convergence accuracy in the later stages. To overcome this limitation, an adaptive step size operator, denoted as h, is introduced during the search phase. This operator ensures adequate global search capability in the early stages while improving convergence speed in the later stages. The formula for the adaptive step size operator is as follows:17\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} h=\left( e^{-\sqrt{\frac{t}{t_{\max }}}}\right) ^{20} \end{aligned}$$\end{document}h=e-ttmax20Where t represents the current iteration number, and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t_{\max }$$\end{document}tmax denotes the maximum iteration number of the algorithmAs individuals gradually approach the optimal solution region, the search space will shrink, which may cause the algorithm to become trapped in local optima. To mitigate this issue, Gaussian mutation is introduced. The Gaussian mutation strategy utilizes the Gaussian (normal) distribution to generate mutation vectors. This distribution has a higher probability of producing data points near the mean, with the likelihood decreasing as points deviate from the mean. This feature allows the algorithm to conduct a fine search in the vicinity of the current optimal solution, thus improving its local search capability. When the algorithm becomes trapped in a local optimum, Gaussian mutation can guide the algorithm to fine-tune the search within the local region, potentially enabling it to escape from the local optimum. The formulas for incorporating Gaussian mutation into the adaptive step size operator and the search phase are as follows:18\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \left\{ \begin{array}{c} \overrightarrow{S W}_{\textrm{i}}^{t+1}=\left( \overrightarrow{S W}_{\textrm{i}}^t+\mu _1 *\left( {\overrightarrow{S W_a}}^t-{\overrightarrow{S W_b}}^t\right) * h\right) +{ Gauss} \\ \overrightarrow{S W}_{\textrm{i}}^{t+1}=\left( \overrightarrow{S W}_{\textrm{c}}^t+\mu _2 *\left( \textbf{L}+\overrightarrow{r_2} *(\textbf{H}-\textbf{L})\right) * h\right) +{ Gauss} \end{array}\right. \end{aligned}$$\end{document}SW→it+1=SW→it+μ1∗SWa→t-SWb→t∗h+GaussSW→it+1=SW→ct+μ2∗L+r2→∗(H-L)∗h+GaussWhere Gauss refers to a random number sampled from a Gaussian distribution. The adaptive step size operator dynamically adjusts step sizes according to the iteration process, effectively balancing exploration and exploitation throughout the algorithm. In SWO, mating behavior is employed to generate spider wasp offspring, which represent potential solutions for the current generation. The offspring generation formula is as follows:19\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \overrightarrow{S W}_{\textrm{i}}^{t+1}= \text{ Crossover } \left( \textrm{SW}_{\textrm{i}}^{\textrm{t}}, \textrm{SW}_{\textrm{m}}^{\textrm{t}}, \textrm{CR}\right) \end{aligned}$$\end{document}SW→it+1=CrossoverSWit,SWmt,CR\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta$$\end{document}β and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta _1$$\end{document}β1 are two numbers generated randomly from a normal distribution, while\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\overrightarrow{v_1}$$\end{document}v1→and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\overrightarrow{v_2}$$\end{document}v2→ are generated using the following formulas.20\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \begin{aligned} \overrightarrow{v_1}=\left\{ \begin{array}{c} \textbf{x}_a-\textbf{x}_i f\left( \textbf{x}_a\right)b>c$$\end{document}a=i>b>c. The hybridization process generates offspring that inherit characteristics from their parents. The trade-off rate (TR) governs the balance between hunting and mating behaviors. The corresponding formula is as follows:21\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} \left\{ \begin{array}{c} F(H) \text{ or } F(N) \text{ rand }