Modiﬁed Sand Cat Swarm Optimization Algorithm for Solving Constrained Engineering Optimization Problems

: The sand cat swarm optimization algorithm (SCSO) is a recently proposed metaheuristic optimization algorithm. It stimulates the hunting behavior of the sand cat, which attacks or searches for prey according to the sound frequency; each sand cat aims to catch better prey. Therefore, the sand cat will search for a better location to catch better prey. In the SCSO algorithm, each sand cat will gradually approach its prey, which makes the algorithm a strong exploitation ability. However, in the later stage of the SCSO algorithm, each sand cat is prone to fall into the local optimum, making it unable to ﬁnd a better position. In order to improve the mobility of the sand cat and the exploration ability of the algorithm. In this paper, a modiﬁed sand cat swarm optimization (MSCSO) algorithm is proposed. The MSCSO algorithm adds a wandering strategy. When attacking or searching for prey, the sand cat will walk to ﬁnd a better position. The MSCSO algorithm with a wandering strategy enhances the mobility of the sand cat and makes the algorithm have stronger global exploration ability. After that, the lens opposition-based learning strategy is added to enhance the global property of the algorithm so that the algorithm can converge faster. To evaluate the optimization effect of the MSCSO algorithm, we used 23 standard benchmark functions and CEC2014 benchmark functions to evaluate the optimization performance of the MSCSO algorithm. In the experiment, we analyzed the data statistics, convergence curve, Wilcoxon rank sum test, and box graph. Experiments show that the MSCSO algorithm with a walking strategy and a lens position-based learning strategy had a stronger exploration ability. Finally, the MSCSO algorithm was used to test seven engineering problems, which also veriﬁed the engineering practicability of the proposed algorithm.


Introduction
With the development of science and technology, there are many difficulties in describing and dealing with complex problems. Among these problems, the solution cannot be described in detail. And with the change in application scenarios, the solutions are always different. Meta-heuristic algorithms (MAs) are constructed based on intuition or experience. The optimization problem solved in an acceptable computing time or space provides a feasible solution. This feasible solution cannot be predicted in advance. Many engineering optimization problems often need the optimal solution in the complex and colossal search space. Because of the complexity, nonlinearity, constraints, and modeling  The Sand Cat Swarm Optimization (SCSO) [26] is a meta-heuristic optimization algorithm proposed in 2022. It is based on the idea of a swarm algorithm. The SCSO algorithm simulates the hunting behavior of the sand cat. Each sand cat is sensitive to sound fre- quency. According to the sound frequency of the prey, the sand cat will choose to attack or search for prey. In hunting, the sand cat will keep close to its prey. This will cause the sand cat to fall into the local optimum in the later stage, reducing the optimization performance of the algorithm. Li et al. proposed a sand cat swarm optimization algorithm based on stochastic variation and elite collaboration (SE-SCSO) [27]. The SE-SCSO algorithm adds a randomly changing elite cooperation strategy, which enables the algorithm to break away from the local extremum, and improves the algorithm's optimization seeking accuracy and convergence speed. Jovanovic et al. proposed feature selection by an improved sand cat swarm optimizer for intrusion detection [28]. They use extreme machine learning to test the improved sand cat optimization algorithm (HSCSO). The HSCSO algorithm has achieved good results in feature selection. The SCSO algorithm has insufficient convergence ability and quickly falls into the local optimum. This paper proposes a modified sand cat swarm optimization algorithm (MSCSO) for the above problem. Each sand cat has added different wandering strategies when hunting in order to find a better position. When attacking prey, the sand cat will walk according to the Levy flight walking (LFW) strategy. When searching for prey, the sand cat uses the triangle walking (TW) strategy to wander. Sand cats judge the distance between themselves and their prey and then use a Roulette Wheel selection algorithm to choose the direction of walking, and finally obtain a new position according to the trigonometric function calculation principle. Each sand cat searches for a better location through its walk strategy, which enhances the mobility of the algorithm and makes the MSCSO algorithm have a stronger global exploration ability. After that, the global exploration capability of the MSCSO algorithm is further enhanced by lens opposition-based learning (LOBL).

Related Work
Through these two strategies, the global capability of the MSCSO algorithm is enhanced and the MSCSO algorithm can converge better. In the experimental part, we used 23 standard and CEC2014 benchmark functions to verify the optimization effect of the MSCSO algorithm, and the tables, convergence curves, box charts, and Wilcoxon rank sum tests of benchmark test functions were analyzed. Finally, in order to verify the engineering practicability of the MSCSO algorithm, we selected six engineering problems to test the optimization performance of the MSCSO algorithm. The results illustrate that the MSCSO algorithm also performs well in solving optimization problems.
The main contributions of this paper are as follows: • The original SCSO algorithm is improved by the wandering strategy and the optimization performance of the original SCSO algorithm is enhanced. • When searching for prey, the triangle walk (TW) strategy is added to expand the search scope of the SCSO algorithm and improve the global exploration ability of the algorithm. • When attacking prey, the Levy flight walk (LFW) strategy is added to enable the sand cat to walk around the prey, so that the sand cat can find a better position and improve the optimization performance of the algorithm. • Adding lens opposition-based learning (LOBL) to the MSCSO algorithm enhances the global exploration ability of the algorithm • The MSCSO algorithm is tested and compared with the other eight algorithms, which proves that the MSCSO algorithm has a better optimization effect.
The structure of this article is as follows: The second part introduces the Restated Work. The third part briefly introduces the SCSO algorithm. The fourth part describes the improvement strategy of the MSCSO algorithm. The fifth and sixth parts give the experimental results of the MSCSO algorithm on benchmark functions and engineering problems. Finally, a summary is made in the seventh part.

Related Work
Meta-heuristic algorithms (MAs) are the improvement of the heuristic algorithm, which is the combination of a random algorithm and a local search algorithm. They mainly solve the optimal solution by simulating nature and human intelligence. The core of MAs is to balance the exploration and development capabilities of algorithms. MAs are widely used in various optimization fields because of their simplicity, easy implementation, and high accuracy of solution [29].
However, according to the NFL theorem [30], no MAs can solve all optimization problems. For this reason, improving the known MAs to better solve different optimization problems has become the research direction of many scholars. Many scholars have conceived many good methods [31]. For the defects of different algorithms, many scholars have proposed excellent solutions. For example, Mohammad H. Nadimi-Shahraki et al. proposed a multi-trial vector-based differential evolution algorithm (MTDE). The MTDE is distinguished by introducing an adaptive movement step designed based on a new multi-trial vector approach (MTV), which combines different search strategies in the form of trial vector producers (TVPs). The article uses the MTV method in the MTDE algorithm through three TVPs and verifies that the MTDE algorithm is more effective in dealing with different complex problems [32]. The Salp Swarm Algorithm (SSA) [33] simulated the foraging behavior of the salp swarm. Each salp will follow the best Salp for foraging. The algorithm has high convergence and coverage, and can approximate the optimal solution for the population. However, being too close to the optimal solution leads to the decline of the exploration ability of the SSA, which makes the algorithm difficult to converge in the later period. Hongliang Zhang et al. proposed the ensemble mutation-driven salp swarm algorithm with a restart mechanism (CMSRSSSA). The algorithm adds an ensemble mutation strategy. In this strategy, they adopt mutation schemes based on DE rand local mutation methods in Adaptive CoDE [34]. The exploration ability of the SSA was enhanced by strengthening the communication between different salps. Secondly, a restart mechanism is added, which enables individuals trapped in the local optimum to jump out of the local optimum to obtain a better position. These two mechanisms greatly improve the exploration ability of the SSA algorithm [35] The GWO algorithm lacks population diversity, and it is difficult to balance the exploitation and exploration, leading to premature convergence of the algorithm. Mohammad H. Nadimi Shahraki et al. proposed an improved Grey Wolf Optimizer (I-GWO). The I-GWO algorithm benefits from a new movement strategy named a dimension learning-based hanging (DLH) search strategy inherited from the individual hanging behavior of wolves in nature. The I-GWO algorithm uses the DLH strategy to build a domain for each gray wolf so that neighboring gray wolves can share information. This strategy balances the ability of the GWO algorithm exploration and exploitation and enhances the diversity of the population [36]. The idea of the Remora Optimization Algorithm (ROA) is that remora depends on powerful marine organisms to forage. Different organisms forage in different situations with novel content but lack autonomy. Zheng et al. proposed an autonomous foraging mechanism [37]. Remora not only depends on powerful marine organisms to find food but also can find food independently, which is more in line with biological characteristics and has achieved good optimization results. Mohammad H. Nadimi-Shahraki proposed a multi-trial vector-based moth-flame optimization (MTV-MFO) algorithm. In the algorithm, the MFO movement strategy is substituted by the multi-trial vector (MTV) approach to using a combination of different movement strategies, each of which is adjusted to accomplish a particular behavior. The MTV-MFO algorithm uses three different search strategies to improve the global search ability, maintain the balance between exploration and exploitation, and prevent the original MFO from premature convergence in the optimization process [38].

Initialize Population
Each sand cat is a 1 × dim array in the dim dimension optimization problem. It represents the solution to the problem, as shown in Figure 2. In a set of variable values (Pos 1 , Pos 2 , . . . , Pos dim ), each Pos must lie between the lower and upper boundary. In the initialization algorithm, an initialization matrix is created according to the size of the problem (N × dim). In addition, the corresponding solution will be output in each iteration. The current solution will be replaced if the next output value is better. If no better solution is found in the next iteration, the solution of this iteration will not be stored.
Each sand cat is a 1 × dim array in the dim dimension optimization problem. It represents the solution to the problem, as shown in Figure 2. In a set of variable values (Pos1, Pos2, ..., Posdim), each Pos must lie between the lower and upper boundary. In the initialization algorithm, an initialization matrix is created according to the size of the problem (N × dim). In addition, the corresponding solution will be output in each iteration. The current solution will be replaced if the next output value is better. If no better solution is found in the next iteration, the solution of this iteration will not be stored.  Figure 2. Population initialization diagram.

Search for Prey (Exploration Stage)
The position of each sand cat is expressed as Posi. The SCSO algorithm benefits from the hearing ability of sand cats in low-frequency detection. Each sand cat can sense the low frequency below 2 kHz. Therefore, in mathematical modeling, the sensitivity rG is defined by Formula (1), so that the sensitivity range of the dune cat is 2 to 0 kHz. In addition, the parameter R is obtained according to Formula (2), and the algorithm exploration and exploitation ability is controlled.
where SM is 2, t is the current iteration number, and T is the maximum iteration number. Each sand cat will randomly find a new location within the sensitivity range when searching for prey. This is more conducive to the exploration and exploitation of algorithms. To avoid falling into the local optimum, each sand cat's sensitivity range (r) is different. As shown in Formula (3).
where rG is used for the guidance parameter r.
Each sand cat will search for the position of prey according to the optimal candidate position (Posbc), current position (Posc(t)), and its sensitivity range (r). The specific Formula is shown in (4).

Attack Prey (Exploitation Stage)
The distance (Posrnd) between the sand cat and prey is shown by Formula (5) to simulate the process of the sand cat attacking prey. Assume that the sensitivity range of the sand cat is a circle, and the direction of movement uses the Roulette Wheel selection algorithm to select a random angle (α). Since the random angle selected is between 0° and 360°,

Search for Prey (Exploration Stage)
The position of each sand cat is expressed as Pos i . The SCSO algorithm benefits from the hearing ability of sand cats in low-frequency detection. Each sand cat can sense the low frequency below 2 kHz. Therefore, in mathematical modeling, the sensitivity r G is defined by Formula (1), so that the sensitivity range of the dune cat is 2 to 0 kHz. In addition, the parameter R is obtained according to Formula (2), and the algorithm exploration and exploitation ability is controlled.
where S M is 2, t is the current iteration number, and T is the maximum iteration number. Each sand cat will randomly find a new location within the sensitivity range when searching for prey. This is more conducive to the exploration and exploitation of algorithms. To avoid falling into the local optimum, each sand cat's sensitivity range (r) is different. As shown in Formula (3).
where r G is used for the guidance parameter r. Each sand cat will search for the position of prey according to the optimal candidate position (Pos bc ), current position (Pos c (t)), and its sensitivity range (r). The specific Formula is shown in (4).

Attack Prey (Exploitation Stage)
The distance (Pos rnd ) between the sand cat and prey is shown by Formula (5) to simulate the process of the sand cat attacking prey. Assume that the sensitivity range of the sand cat is a circle, and the direction of movement uses the Roulette Wheel selection algorithm to select a random angle (α). Since the random angle selected is between 0 • and 360 • , its value is between −1 and 1. In this way, each sand cat can move in different circumferential directions in the search space, as shown in Figure 3. Then, the prey is attacked according to Formula (6). In this way, the dune cat can approach the hunting position faster. its value is between −1 and 1. In this way, each sand cat can move in different circumferential directions in the search space, as shown in Figure 3. Then, the prey is attacked according to Formula (6). In this way, the dune cat can approach the hunting position faster.

Implementation of the SCSO Algorithm
The SCSO algorithm regulates the exploration and exploitation of the algorithm by controlling the adaptive parameters rG and R. Formula (1), and shows that rG decreases linearly from 2 to 0 during iteration. Therefore, the parameter R is a random value of [−4, 4]. The sand cat will attack prey when R is less than or equal to 1. Otherwise, the sand cat will search for prey, as shown in Formula (7).
Formula (7) shows the location update of each sand cat during the exploration and exploitation stage. When R ≤ 1, the sand cat will attack its prey. Otherwise, the task of the sand cat is to find new prey in the global area. The pseudo-code is shown in Algorithm 1.

Algorithm 1. Sand Cat Swarm Optimization Algorithm Pseudo-Code
Initialize the population Calculate the fitness function based on the objective function Initialize the r, rG, and R While (t ≤ maximum iteration) For each search agent Obtain a random angle based on the Roulette Wheel Selection (0° ≤ α ≤ 360°) If (abs(R) > 1) Update the search agent position based on Formula (4) Else Update the search agent position based on Formula (6) End T = t + 1 End

Implementation of the SCSO Algorithm
The SCSO algorithm regulates the exploration and exploitation of the algorithm by controlling the adaptive parameters r G and R. Formula (1), and shows that r G decreases linearly from 2 to 0 during iteration. Therefore, the parameter R is a random value of [−4, 4]. The sand cat will attack prey when R is less than or equal to 1. Otherwise, the sand cat will search for prey, as shown in Formula (7).
Formula (7) shows the location update of each sand cat during the exploration and exploitation stage. When R ≤ 1, the sand cat will attack its prey. Otherwise, the task of the sand cat is to find new prey in the global area. The pseudo-code is shown in Algorithm 1.

Algorithm 1. Sand Cat Swarm Optimization Algorithm Pseudo-Code
Initialize the population Calculate the fitness function based on the objective function Initialize the r, r G , and R While (t ≤ maximum iteration) For each search agent Obtain a random angle based on the Roulette Wheel Selection (0 • ≤ α ≤ 360 • ) If (abs(R) > 1) Update the search agent position based on Formula (4) Else Update the search agent position based on Formula (6) End The triangle walk strategy is for the sand cats to walk around as they approach their prey. First, obtain the distance L 1 between the sand cat and its prey. Then, obtain the step size range L 2 of the sand cat. Then, define the sand cat's walking direction (β) according to Formula (10). L 1 and L 2 are shown in Formulas (8) and (9). After that, calculate the distance P between the position obtained by swimming and the prey by Formula (11). See Figure 4a for details. Finally, the position of the sand cat is obtained by Formula (12).
Among them, Pos new is the position obtained through the walking strategy.
size range L2 of the sand cat. Then, define the sand cat's walking direction (β) accord to Formula (10). L1 and L2 are shown in Formulas (8) and (9). After that, calculate the d tance P between the position obtained by swimming and the prey by Formula (11). Figure 4a for details. Finally, the position of the sand cat is obtained by Formula (12).

Levy Flight Walk Strategy
When attacking prey, the sand cat is very close to its prey. Levy flight is a very ef tive mathematical method for providing random factors. Levy flight can provide a wa ing method that conforms to Levy distribution. However, sometimes the step length Levy's flight is too long. In order to better conform to the behavior of sand cats attack prey, the constant C = 0.35 is multiplied in Levy flight. This allows the sand cat to walk close to its prey as possible, as shown in Figure 4b

Lens Opposition-Based Learning
The main idea of lens opposition-based learning comes from the principle of con lens imaging. The search range is expanded by generating a reverse position based on

Levy Flight Walk Strategy
When attacking prey, the sand cat is very close to its prey. Levy flight is a very effective mathematical method for providing random factors. Levy flight can provide a walking method that conforms to Levy distribution. However, sometimes the step length of Levy's flight is too long. In order to better conform to the behavior of sand cats attacking prey, the constant C = 0.35 is multiplied in Levy flight. This allows the sand cat to walk as close to its prey as possible, as shown in Figure 4b. Levy's flight walking strategy is shown in Formula (13).

Lens Opposition-Based Learning
The main idea of lens opposition-based learning comes from the principle of convex lens imaging. The search range is expanded by generating a reverse position based on the current coordinates [39], which can be seen in Figure 5. In two-dimensional coordinates, the search range of the x-axis is (a, b) and the y-axis represents a convex lens. Suppose that the projection of object A on the x-axis is x and the height is h. Through lens imaging, the image on the other side is A*, A* is projected on the x-axis as x*, and the height is h*. Through the above analysis, we can calculate the reverse projection x* of x. current coordinates [39], which can be seen in Figure 5. In two-dimensional coordinates, the search range of the x-axis is (a, b) and the y-axis represents a convex lens. Suppose that the projection of object A on the x-axis is x and the height is h. Through lens imaging, the image on the other side is A*, A* is projected on the x-axis as x*, and the height is h*. Through the above analysis, we can calculate the reverse projection x* of x. In Figure 5, x takes o as the base point to obtain its corresponding reverse point x*, which can be obtained from the lens imaging principle.
Let k = h/h* to obtain the Formula (15) based on lens opposition-based learning.
where xj is the individual's position in the jth dimension and xj* is the inverse solution of xj. aj and bj are the maximum and minimum boundaries of dimension j in the search space.

Implementation of the MSCSO Algorithm
Initialization: In the initialization phase, initialize the population size N, dimension dim, iteration number T, and initialize the population as shown in Formula (16).
where ubj is the upper bound of individual i in the j dimension, lbj is the lower bound of individual i in the j dimension, and rand is a random number of [0, 1]. Search for prey: The hunting behavior of the sand cat is affected by the parameter R. When |R| is greater than 1, it means that the prey is far away. At this time, the sand cat will search for prey according to the sensitivity range, as shown in Formula (4).
Triangle walk strategy (TW): While the sand cat is searching for its prey, it can not only search for its prey according to sensitivity range. Through the triangular walk strategy, the sand cat can choose the walking angle to randomly obtain new positions. The update is shown in Formula (12).
Attack prey: When the parameter |R| is less than or equal to 1, this means that the sand cat is attacking its prey. Sand cats attack through the Roulette Wheel Selection algorithm by selecting angles and sensitivity range (r). As shown in Formula (6) Levy flight walk strategy (LFW): In the stage of attacking prey, the sand cat is close to the optimal solution, which tends to lead to the population concentrating on the local optimal solution and being unable to find a better solution. Therefore, the levy flight can provide a walking method that conforms to levy distribution and make the sand cat more mobile. The specific implementation is shown in Formula (13).
Lens Opposition-Based Learning (LOBL): In order to further enhance the exploration ability of the MSCSO algorithm, lens opposition-based learning is added to further enhance the global exploration ability of the algorithm when updating the location. As shown in Formula (15).
Update population position: The location is updated by comparing fitness values. When the fitness value obtained from the update is better, the original individual will be In Figure 5, x takes o as the base point to obtain its corresponding reverse point x*, which can be obtained from the lens imaging principle.
Let k = h/h* to obtain the Formula (15) based on lens opposition-based learning.
where x j is the individual's position in the jth dimension and x j * is the inverse solution of x j . a j and b j are the maximum and minimum boundaries of dimension j in the search space.

Implementation of the MSCSO Algorithm
Initialization: In the initialization phase, initialize the population size N, dimension dim, iteration number T, and initialize the population as shown in Formula (16).
where ub j is the upper bound of individual i in the j dimension, lb j is the lower bound of individual i in the j dimension, and rand is a random number of [0, 1]. Search for prey: The hunting behavior of the sand cat is affected by the parameter R. When |R| is greater than 1, it means that the prey is far away. At this time, the sand cat will search for prey according to the sensitivity range, as shown in Formula (4).
Triangle walk strategy (TW): While the sand cat is searching for its prey, it can not only search for its prey according to sensitivity range. Through the triangular walk strategy, the sand cat can choose the walking angle to randomly obtain new positions. The update is shown in Formula (12).
Attack prey: When the parameter |R| is less than or equal to 1, this means that the sand cat is attacking its prey. Sand cats attack through the Roulette Wheel Selection algorithm by selecting angles and sensitivity range (r). As shown in Formula (6) Levy flight walk strategy (LFW): In the stage of attacking prey, the sand cat is close to the optimal solution, which tends to lead to the population concentrating on the local optimal solution and being unable to find a better solution. Therefore, the levy flight can provide a walking method that conforms to levy distribution and make the sand cat more mobile. The specific implementation is shown in Formula (13).
Lens Opposition-Based Learning (LOBL): In order to further enhance the exploration ability of the MSCSO algorithm, lens opposition-based learning is added to further enhance the global exploration ability of the algorithm when updating the location. As shown in Formula (15).
Update population position: The location is updated by comparing fitness values. When the fitness value obtained from the update is better, the original individual will be replaced. On the contrary, the fitness value of the original individual is better than that of the newly acquired individual, and the original individual will be retained.
The pseudo-code of the MSCSO algorithm such as Algorithm 2.

Algorithm 2. The Modified Sand Cat Swarm Optimization Algorithm Pseudo-Code
Initialize the population according to Formula (16) Calculate the fitness function based on the objective function Initialize the r, r G , and R While (t ≤ maximum iteration) For each search agent Obtain a random angle based on the Roulette Wheel Selection (0 • ≤ α ≤ 360 • ). If (abs(R) > 1) Update the search agent position based on Formula (4) Use Formula (12) for the triangle walk strategy to obtain a new position Else Update the search agent position based on Formula (6) Use Formula (13) to carry out the Levy flight walk strategy to obtain a new position End Conduct the lens opposition-based learning strategy according to Formula (15) The flow chart of the MSCSO algorithm is shown in Figure 6: replaced. On the contrary, the fitness value of the original individual is better than that of the newly acquired individual, and the original individual will be retained.
The pseudo-code of the MSCSO algorithm such as Algorithm 2.

Algorithm 2. The Modified Sand Cat Swarm Optimization Algorithm Pseudo-Code
Initialize the population according to Formula (16) Calculate the fitness function based on the objective function Initialize the r, rG, and R While (t ≤ maximum iteration) For each search agent Obtain a random angle based on the Roulette Wheel Selection (0° ≤ α ≤ 360°). If (abs(R) > 1) Update the search agent position based on Formula (4) Use Formula (12) for the triangle walk strategy to obtain a new position Else Update the search agent position based on Formula (6) Use Formula (13) to carry out the Levy flight walk strategy to obtain a new position End Conduct the lens opposition-based learning strategy according to Formula (15) The flow chart of the MSCSO algorithm is shown in Figure 6:

Complexity Analysis
The time complexity depends on the population size of the sand cat (N), the dimension of the given problem (dim), the number of iterations of the algorithm (T), and the evaluation cost required to solve the function (C). Therefore, the time complexity of the MSCSO algorithm is shown in Formula (17).

Complexity Analysis
The time complexity depends on the population size of the sand cat (N), the dimension of the given problem (dim), the number of iterations of the algorithm (T), and the evaluation cost required to solve the function (C). Therefore, the time complexity of the MSCSO algorithm is shown in Formula (17).
The specific definitions of each complexity are: (1) The initialization parameter time is O(1).
Therefore, the time complexity of the MSCSO algorithm is. (18) can be simplified to Formula (19).

Experimental Results and Discussion
All the experiments in this paper are completed on the computer with the 11th Gen Intel(R) Core(TM) i7-11700 processor with a primary frequency of 2.50 GHz, 16 GB memory, and an operating system of 64-bit Windows 11 using matlab2021a.
To verify the optimization effect of the MSCSO algorithm, this paper uses 23 standard benchmark functions and CEC2014 benchmark functions to verify the performance of the MSCSO algorithm. To better show the optimization effect, the MSCSO algorithm is compared with Sand Cat Swarm Optimization (SCSO) [26], the Arithmetic Optimization Algorithm (AOA) [40], Bald Eagle Search (BES) [41], the Whale Optimization Algorithm (WOA) [6], the Remora Optimization Algorithm (ROA) [4], the Sine Cosine Algorithm (SCA) [15], the Sooty Tern Optimization Algorithm (STOA) [42], and Genetic Algorithms (GA) [8]. The parameter settings of these algorithms are shown in Table 1.

Experiments on the 23 Standard Benchmark Functions
The 23 standard benchmark functions are shown in Table 2. This benchmark contains seven unimodal, six multimodal, and ten fixed-dimension multimodal functions. Where F is the mathematical function, dim is the dimension, Range is the interval of the search space, and F min is the optimal value the corresponding function can achieve, as seen in Figure 7. In this experiment, set the population size N = 30, the spatial dimension dim = 30/500, and the maximum number of iterations T = 500. The MSCSO algorithm and the eight comparison algorithms were independently run thirty times to obtain each algorithm's best fitness, average fitness, and standard deviation. Table 3 shows the statistical results of nine algorithms in the twenty-three standard benchmark functions. In the table, the MSCSO algorithm has obtained theoretical optimal values in F1-F4. The BES obtained the theoretical optimal value in F1. The ROA also has good convergence ability in F1. In the 30 dimensions, the AOA achieves the best in F2. In F5-F6, the MSCSO algorithm's best and mean are only next to the BES. In F7, the MSCSO algorithm obtains the optimal fitness value and is very stable. In F8, the MSCSO algorithm is inferior to the WOA, the ROA, and the BES algorithms, but superior to other comparison algorithms. The MSCSO algorithm achieves theoretical optimum in F9-F11. Compared with the SCSO algorithm, it has been dramatically improved. In F12-F13, the MSCSO algorithm did not obtain the best fitness value, but it achieved a better fitness value. In the 30 dimensions of F13, GA obtain better results, indicating that GA also have better optimization effects. The function of F14-F23 is relatively simple, and it is easy to find a better fitness value, but it also tests the optimization ability of the algorithm. The MSCSO algorithm obtains the optimal fitness value in the combination function's optimal fitness. The above analysis proves that the SCSO has a better optimization effect in the MSCSO algorithm with the TW, LFW, and LOBL strategies.

Result Statistics and Convergence Curve Analysis of the 23 Standard Reference Functions
Multimodal benchmark functions [0, 10] -10.1532   Table 3 shows the statistical results of nine algorithms in the twenty-three standard benchmark functions. In the table, the MSCSO algorithm has obtained theoretical optimal values in F1-F4. The BES obtained the theoretical optimal value in F1. The ROA also has good convergence ability in F1. In the 30 dimensions, the AOA achieves the best in F2. In F5-F6, the MSCSO algorithm's best and mean are only next to the BES. In F7, the MSCSO algorithm obtains the optimal fitness value and is very stable. In F8, the MSCSO algorithm is inferior to the WOA, the ROA, and the BES algorithms, but superior to other comparison algorithms. The MSCSO algorithm achieves theoretical optimum in F9-F11. Compared with the SCSO algorithm, it has been dramatically improved. In F12-F13, the MSCSO algorithm did not obtain the best fitness value, but it achieved a better fitness value. In the 30 dimensions of F13, GA obtain better results, indicating that GA also have better optimization effects. The function of F14-F23 is relatively simple, and it is easy to find a better fitness value, but it also tests the optimization ability of the algorithm. The MSCSO algorithm obtains the optimal fitness value in the combination function's optimal fitness. The above analysis proves that the SCSO has a better optimization effect in the MSCSO algorithm with the TW, LFW, and LOBL strategies.
The Table 3 analysis cannot fully prove the optimization effect of the MSCSO algorithm in the 23 standard benchmark functions. In order to better understand the optimi-    The Table 3 analysis cannot fully prove the optimization effect of the MSCSO algorithm in the 23 standard benchmark functions. In order to better understand the optimization effect of MSCSO, Figures 8-10 show the convergence curves of each algorithm. It can be seen from the image that the MSCSO algorithm has a strong convergence ability in F1-F4, and the optimal value is found quickly. There is a small gap between algorithms in F5. In F6 and F12 of Figure 8, the MSCSO algorithm can jump out of the local optimum in the later stage so that the algorithm can converge better. Because the walking strategy is added, the sand cat group has stronger mobility, which makes the sand cat have a stronger walking ability. The exploration ability of the MSCSO algorithm is enhanced by lens oppositionbased learning. It can be concluded that the MSCSO algorithm has a better optimization effect than the SCSO algorithm in these functions. In F7, the MSCSO algorithm can quickly find a very excellent fitness value. This shows that the exploration ability of the MSCSO algorithm has been enhanced and better solutions can be found. In F9-F11, the MSCSO algorithm can quickly find the optimal value compared with other comparison algorithms. In F14-F23, these algorithms can find a better fitness value. These algorithms have good optimization effects, but the MSCSO algorithm can also find very good fitness values. It can be seen from F14, F15, F21, F22, and F23 that the MSCSO algorithm is more excellent. According to the comprehensive analysis of tables and images, the MSCSO algorithm is more stable and can find better values.

Analysis of the Wilcoxon Rank Sum Test Results
The Wilcoxon rank sum test is a nonparametric statistical test that can find more complex data distribution. Table 3 gives the best fitness value, average value, and standard deviation of each algorithm but does not compare with the results of multiple algorithms. Therefore, the Wilcoxon rank sum test is required for further verification and testing. Table 4 shows the experimental results of the MSCSO algorithm and eight other different algorithms running thirty times in the twenty-three standard benchmark functions. The significance level is 5%. Less than 5% indicates a significant difference between the two algorithms. It can be seen from the table that most test results are less than 5%, but some results are more than 5%. There are many results equal to one in F9-F11. This is because many algorithms can find the optimal value in F9-F11, resulting in the consistency of the final optimal fitness value. The MSCSO and BES algorithms have many results greater than 5% in unimodal functions, which shows that these two algorithms have good convergence ability in unimodal functions. Many algorithms can find a better value in F14 because the function is relatively simple. In the rest of the functions, the MSCSO algorithm has a significant difference compared with other algorithms. The MSCSO algorithm has generally achieved good results in the Wilcoxon rank sum test.
The above experimental analysis shows that the MSCSO algorithm has a good optimization effect in the 23 standard benchmark functions. Compared with the SCSO algorithm, it has excellent improvement. Compared with other comparison algorithms, it also has more significant advantages.

Experiments on the CEC2014 Benchmark Function
The 23 standard benchmark functions are simple test functions, which are insufficient to prove the MSCSO algorithm's optimization performance fully. In order to thoroughly verify the optimization effect of the MSCSO algorithm, the CEC2014 benchmark function is used for testing in this section. Table 5 shows the specific introduction of the CEC2014 benchmark functions. Set the number of individuals of each algorithm N = 30, the maximum number of iterations T = 500, and the dimension dim = 10. Eight algorithms run thirty times independently to obtain each algorithm's best, average, and standard deviation.

Analysis of the Wilcoxon Rank Sum Test Results
The Wilcoxon rank sum test is a nonparametric statistical test that can find more co plex data distribution. Table 3 gives the best fitness value, average value, and stand deviation of each algorithm but does not compare with the results of multiple algorith Therefore, the Wilcoxon rank sum test is required for further verification and testing. ble 4 shows the experimental results of the MSCSO algorithm and eight other differ algorithms running thirty times in the twenty-three standard benchmark functions. T significance level is 5%. Less than 5% indicates a significant difference between the t algorithms. It can be seen from the table that most test results are less than 5%, but so results are more than 5%. There are many results equal to one in F9-F11. This is beca    Table 6 shows the statistical results of the benchmark functions of the MSCSO algorithm and the eight comparison algorithms in CEC2014. The data in the table refer to literature [43]. From the table data, it can be concluded that the MSCSO algorithm has achieved good results in the CEC2014 benchmark function. In CEC1-CEC3, the MSCSO algorithm can obtain a better fitness value compared with other comparison algorithms. Only in CEC2 is the stability inferior to the WOA. In CEC4-CEC8, the MSCSO algorithm can obtain a better fitness value, but its stability is not enough. Because the MSCSO algorithm may find a better solution through the walking strategy, but it is not necessarily able to find a better fitness value. However, the solution found is generally superior to other algorithms. In CEC9, the STOA algorithm can obtain a better fitness value. In CEC10-CEC16, the MSCSO algorithm obtains a better fitness value. Only part of the standard deviation of the function is insufficient. In CEC17-CEC30, the MSCSO algorithm has a very significant optimization effect. The standard deviation of CEC22 and CEC27 is lower than that of the SCA and ROA. The average fitness value and standard deviation of CEC24 are insufficient. Among other functions, the MSCSO algorithm achieves the optimal value. According to the analysis in Table 6, the addition of a walking strategy and a lens position-based learning improves the exploration ability of the algorithm, making the MSCSO algorithm have a stronger optimization ability. 6.04 × 10 2 6.08 × 10 2 6.05 × 10 2 6.05 × 10 2 6.04 × 10 2 6.05 × 10 2 6.04 × 10 2 6.07 × 10 2 mean 6.05 × 10 2 6.06 × 10 2 6.1 × 10 2 6.09 × 10 2 6.09 × 10 2 6.07 × 10 2 6.08 × 10 2 6.08 × 10 2 6.09 × 10 2 std    Figure 11 shows the convergence curve of the MSCSO algorithm and eight comparison algorithms in the CEC2014 benchmark function. It can be seen that the MSCSO algorithm has better convergence ability. In the unimodal functions of CEC1-CEC3, the MSCSO algorithm can find a better location and converge constantly. The SCSO algorithm is easy to fall into the local optimum. The convergence curve of other comparison algorithms is still inferior to the MSCSO algorithm. In simple multimodal functions, the MSCSO algorithm also has better global optimization capability. From the convergence curve of CEC4-CEC17, it can be seen that the MSCSO algorithm can find a better position in many functions and converge quickly. The MSCSO with the TW, LFW, and LOBL has a stronger exploration ability. They can jump out of the local optimum and obtain a better fitness value. In CEC17-CEC30, many algorithms are trapped in local optima, resulting in the algorithm not being able to converge better. However, the MSCSO algorithm can find a better location in CEC17, CEC18, CEC20, CEC21, CEC24, and CEC25, which makes the algorithm converge better to the best solution.

Analysis of Box Plot Results
A box chart is a statistical chart that uses five statistics in data: minimum, upper quartile, median, lower quartile, and maximum to describe data. The box chart's top-and bottom-line segments represent the data's maximum and minimum values, respectively. The upper and lower segments of the box chart represent the third quartile and the first quartile, respectively. The thick line in the middle of the box chart represents the median of the data. It can intuitively display the abnormal value of the data, the dispersion degree of distribution, and the symmetry of the data. Figure 12 is a block diagram obtained after thirty independent operations of nine algorithms. It can be seen that the MSCSO algorithm is very narrow and keeps the lowest point. Compared with the SCSO algorithm, the MSCSO algorithm can obtain low box graphs. Compared with GA, the MSCSO algorithm has a better optimization effect. Some of the box charts have little difference because it is easy to find a good value in the function, resulting in a small variance. In general, the box graph of the MSCSO algorithm has achieved better results. Figure 11. Convergence curve of the benchmark function optimization algorithm on CEC2014.

Analysis of Box Plot Results
A box chart is a statistical chart that uses five statistics in data: minimum, upper quartile, median, lower quartile, and maximum to describe data. The box chart's top-and bottom-line segments represent the data's maximum and minimum values, respectively. The upper and lower segments of the box chart represent the third quartile and the first quartile, respectively. The thick line in the middle of the box chart represents the median of the data. It can intuitively display the abnormal value of the data, the dispersion degree of distribution, and the symmetry of the data. Figure 12 is a block diagram obtained after thirty independent operations of nine algorithms. It can be seen that the MSCSO algorithm is very narrow and keeps the lowest point. Compared with the SCSO algorithm, the MSCSO algorithm can obtain low box graphs. Compared with GA, the MSCSO algorithm has a better optimization effect. Some of the box charts have little difference because it is easy to find a good value in the function, resulting in a small variance. In general, the box graph of the MSCSO algorithm has achieved better results.

Analysis of the Wilcoxon Rank Sum Test Results
The MSCSO algorithm has achieved good results in the CEC2014 benchmark function through the above analysis. Table 7 shows that the similarity between the MSCSO algorithm and the seven comparison algorithms is low, mostly less than 5%. However, Hybrid Function 1 and Composition Functions are partially greater than 5%. This means that the fitness values obtained by the eight comparison algorithms in these functions are not significantly different from those of the MSCSO algorithm. Many 1 of CEC23 and CEC28 occur, which means that the MSCSO algorithm achieves the same fitness values as these comparison algorithms. Some of the other functions are greater than 5%. This means that in these functions, the difference between the values obtained by the MSCSO algorithm and the comparison algorithm is not obvious, and the difference between the fitness values

Analysis of the Wilcoxon Rank Sum Test Results
The MSCSO algorithm has achieved good results in the CEC2014 benchmark function through the above analysis. Table 7 shows that the similarity between the MSCSO algorithm and the seven comparison algorithms is low, mostly less than 5%. However, Hybrid Function 1 and Composition Functions are partially greater than 5%. This means that the fitness values obtained by the eight comparison algorithms in these functions are not significantly different from those of the MSCSO algorithm. Many 1 of CEC23 and CEC28 occur, which means that the MSCSO algorithm achieves the same fitness values as these comparison algorithms. Some of the other functions are greater than 5%. This means that in these functions, the difference between the values obtained by the MSCSO algorithm and the comparison algorithm is not obvious, and the difference between the fitness values obtained by the MSCSO algorithm and the comparison algorithm is small. However, most of them are less than 5%, which indicates that the MSCSO algorithm differs significantly from the comparison algorithm in most functions.

Constrained Engineering Design Problems
In the fifth part, the optimization performance of the MSCSO algorithm is verified to verify the practical effect of the MSCSO algorithm in engineering problems. In this paper, seven engineering problems are selected for testing. The specific experimental results are as follows.

Pressure Vessel Design Problem
The purpose of pressure vessel design is to minimize the total cost of a cylinder-shaped pressure vessel. The schematic diagram of the pressure vessel is shown in Figure 13. The variables in question are shell thickness T s , head thickness T h , inner radius R, and vessel length L. The minimum cost of the pressure vessel is obtained through constraints. The purpose of pressure vessel design is to minimize the total cost of a cylindershaped pressure vessel. The schematic diagram of the pressure vessel is shown in Figure  13. The variables in question are shell thickness Ts, head thickness Th, inner radius R, and vessel length L. The minimum cost of the pressure vessel is obtained through constraints. x x x x x T T R L == (20) Objective function: ( ) 2  2  2  1  2  3  2  3  1  4  1  3   0  6224  1  7781  3  1661  19  84  f x .
Subject to: Consider: Objective function: Subject to: Variable range: The results of pressure vessel design problems are shown in Table 8. It shows that the MSCSO algorithm has a good effect in solving the engineering problem. As can be seen in the table, the MSCSO algorithm obtains T s = 0.742406, T h = 0.370292, R = 40.31962, and L = 200, resulting in the minimum cost of 5734.915. Among the other comparison algorithms, eight have achieved cost values greater than 6000, and four have less than 6000. The resulting costs are greater than those of the MSCSO algorithm.

Speed Reducer Design Problem
The goal of the speed reducer design is to find the minimum mass of the reducer to meet four design constraints: bending stress of gear teeth, covering stress, lateral deflection of shaft, and stress in the shaft. This problem has seven variables, namely the width of the tooth surface x 1 , the gear module x 2 , the number of teeth on the pinion x 3 , the length of the first shaft between bearings x 4 , the length of the second shaft between bearings x 5 the diameter of the first shaft x 6 , and the diameter of the second shaft x 7 . The schematic diagram of variables is shown in Figure 14.

Speed Reducer Design Problem
The goal of the speed reducer design is to find the minimum mass of the reducer to meet four design constraints: bending stress of gear teeth, covering stress, lateral deflection of shaft, and stress in the shaft. This problem has seven variables, namely the width of the tooth surface x1, the gear module x2, the number of teeth on the pinion x3, the length of the first shaft between bearings x4, the length of the second shaft between bearings x5 the diameter of the first shaft x6, and the diameter of the second shaft x7. The schematic diagram of variables is shown in Figure 14. The mathematical formulation of this problem is shown below: Consider:  The mathematical formulation of this problem is shown below: Consider: Objective function: Subject to: Boundaries: In Table 9, the MSCSO algorithm finally obtained a weight of 2995.438. The first one is obtained in the comparison algorithm. Compared with other algorithms, it has particular improvement.

Welded Beam Design Problem
The design problem of the welded beam is to minimize the cost of the welded beam under four decision variables and seven constraints. This problem has four variables: weld width h, connecting beam length l, beam height t, and connecting beam thickness b. See Figure 15 for details.

Welded Beam Design Problem
The design problem of the welded beam is to minimize the cost of the welded beam under four decision variables and seven constraints. This problem has four variables: weld width h, connecting beam length l, beam height t, and connecting beam thickness b. See Figure 15 for details. The mathematical formulation of this problem is shown below: Consider: Objective function: Subject to: where: τ max = 13, 600 psi, and σ max = 30, 000 psi The results of the welded beam design problems are shown in Table 10. The weld width h = 0.205723, connecting beam length l = 3.253494, beam height t = 9.036686, and connecting beam thickness b = 0.205731 obtained by the MSCSO algorithm. Compared with other algorithms, the MSCSO algorithm obtains the minimum weight. The final weight is 1.695309.

Tension/Compression Spring Design Problem
The tension/compression spring design's purpose is to reduce the spring's mass through three variables and four constraints. Constraints include minimum deviation (g 1 ), shear stress (g 2 ), impact frequency (g 3 ), and outer diameter limit (g 4 ). The corresponding variables include wire diameter d, average coil diameter D, and effective coil number N. f (x) is the minimum spring mass. See Figure 16 for details.

Tension/Compression Spring Design Problem
The tension/compression spring design's purpose is to reduce the spring's mass through three variables and four constraints. Constraints include minimum deviation (g1), shear stress (g2), impact frequency (g3), and outer diameter limit (g4). The corresponding variables include wire diameter d, average coil diameter D, and effective coil number N. f(x) is the minimum spring mass. See Figure 16 for details. P P Figure 16. Model of the tension/compression spring design.
The mathematical formulation of this problem is shown below: Consider: Objective function: Subject to: The mathematical formulation of this problem is shown below: Consider: Objective function: Subject to: As can be seen in Table 11, the weight obtained by each algorithm is relatively small. This extensively tests the accuracy of the algorithm in solving engineering problems. The MSCSO algorithm achieves a minimum weight of 0.009872 among these algorithms. It shows that the MSCSO algorithm is more accurate in solving the engineering problem.

Cantilever Beam Design Problem
The optimization purpose of the cantilever beam design is to minimize the weight of the cantilever, given the following decision variables: the height or width of five hollow square blocks with constant thickness. The model of the cantilever beam is shown in Figure 17. As can be seen in Table 11, the weight obtained by each algorithm is relatively This extensively tests the accuracy of the algorithm in solving engineering problem MSCSO algorithm achieves a minimum weight of 0.009872 among these algorith shows that the MSCSO algorithm is more accurate in solving the engineering prob  [13] 0.051609 0.354714 11.41083 0.01267

Cantilever Beam Design Problem
The optimization purpose of the cantilever beam design is to minimize the we the cantilever, given the following decision variables: the height or width of five square blocks with constant thickness. The model of the cantilever beam is shown ure 17. The mathematical formulation of this problem is shown below: Consider: The mathematical formulation of this problem is shown below: Consider: Objective function: Subject to: Boundaries: 0.01 ≤ x i ≤ 100(i = 1, 2, · · · 5) (67) The statistical table of the cantilever beam design is shown in Table 12. The x i (i = 1, 2, · · · , 5) obtained by the MSCSO algorithm decreases gradually, which conforms to the design of the cantilever beam and, finally, a minimum weight of 1.33995853466334 is obtained. Compared with the data of other algorithms, the data obtained by the MSCSO algorithm are more consistent with the characteristics of the engineering problem.

Multiple Disc Clutch Brake Problem
The purpose of the multiple disc clutch brake problem is to find five related variable values of the minimum mass multi-plate brake under eight constraints. The five variables are inner radius r i , outer radius r o , brake disc thickness t, driving force F, and surface friction number Z. The specific model is shown in Figure 18.

Boundaries:
0.01 100( 1,2, 5) The statistical table of the cantilever beam design is shown in Table 12. The x ···, 5) obtained by the MSCSO algorithm decreases gradually, which conforms to sign of the cantilever beam and, finally, a minimum weight of 1.3399585346633 tained. Compared with the data of other algorithms, the data obtained by the algorithm are more consistent with the characteristics of the engineering problem

Multiple Disc Clutch Brake Problem
The purpose of the multiple disc clutch brake problem is to find five related values of the minimum mass multi-plate brake under eight constraints. The five v are inner radius ri, outer radius ro, brake disc thickness t, driving force F, and surf tion number Z. The specific model is shown in Figure 18. The mathematical formulation of this problem is shown below: Consider: Objective function: Subject to: g 1 (x) = r o − r i − ∆r ≥ 0 (70) g 2 (x) = l max − (Z + 1)(t + δ) ≥ 0 (71) g 3 (x) = P max − P rz ≥ 0 (72) g 4 (x) = P max ν sr max − P rz υ sr ≥ 0 (73) g 5 (x) = ν sr max − υ sr ≥ 0 (74) g 6 (x) = T max − T ≥ 0 (75) Variable range: Other parameters: In Table 13, the weight obtained by the MSCSO algorithm is 0.235242. Compared with other algorithms, the first algorithm is obtained. Other algorithms also have some effect, but the weight obtained is more excellent. It is proved that the MSCSO algorithm has a good effect on this problem.

Car Crashworthiness Design Problem
This problem also belongs to a minimal problem with eleven variables, subject to ten constraints. Figure 19 shows the finite element model of this problem. The decision variables are, respectively, the internal thickness of the B-pillar, the thickness of B-pillar reinforcement, the internal thickness of the floor, the thickness of the cross beam, the thickness of the door beam, the thickness of the door belt line reinforcement, the thickness of the roof longitudinal beam, the internal material of the B-pillar, the internal material of the floor, the height of the obstacle, and the impact position of the obstacle. The constraints are, respectively, the abdominal load, the upper viscosity standard, the middle viscosity standard, the lower viscosity standard, the upper rib deflection, the middle rib deflection, the lower rib deflection pubic symphysis force, B-pillar midpoint speed, and B-pillar front door speed. floor, the height of the obstacle, and the impact position of the obstacle. The cons are, respectively, the abdominal load, the upper viscosity standard, the middle vi standard, the lower viscosity standard, the upper rib deflection, the middle rib defl the lower rib deflection pubic symphysis force, B-pillar midpoint speed, and B-pilla door speed.   The mathematical formulation of this problem is shown below: Subject to: Variable Range: 0.5 ≤ x 1 − x 7 ≤ 1.5, x 8 , x 9 ∈ (0.192, 0.345),−30 ≤ x 10 , x 11 ≤ 30, Table 14 shows the statistical results of the car crash worthiness design problem. From the table data, it can be concluded that the MSCSO algorithm can obtain a better solution to this problem. The MSCSO algorithm can obtain more precise unknowns in variable solving.

Conclusions
The sand cat swarm optimization algorithm (SCSO) is a recently proposed population intelligence optimization algorithm. The SCSO algorithm simulates the hunting process of sand cats. Each sand cat will gradually move close to its prey, but the SCSO algorithm has insufficient exploration ability in the later stage, and it is easy to fall into local optimization, leading to difficulties in the convergence of the algorithm. To solve this problem, this paper proposes a modified sand cat swarm optimization algorithm (MSCSO). The core of the MSCSO algorithm is to use the wandering strategy when sand cats are hunting. When searching for prey, in order to increase the search range of the sand cat group, the triangle walking (TW) strategy is used to further search for a better position in the search range. The TW strategy first calculates the distance from the prey, then selects the walking direction through the Roulette Wheel Selection, and finally obtains the walking step length. This method increases the exploration ability of the SCSO algorithm and makes the MSCSO algorithm more global. In order to find a better position when the sand cat attacks its prey, it walks through the Levy flight walking (LFW) strategy. After adding the wandering strategy, the global exploration ability of the SCSO algorithm is enhanced. Then, the lens alternative-based learning (LBOL) strategy is added to enhance the optimization effect of the SCSO algorithm. The following conclusions can be drawn from the results of experimental performance evaluation and statistical analysis: -According to the experimental image analysis, the proposed TW, FLW, and LBOL enhance the global exploration ability of the MSCSO algorithm. -According to the experimental statistics, the proposed TW, FLW, and LBOL enhance the optimization performance of the MSCSO algorithm and can find better solutions in most functions. -In engineering problems, the MSCSO algorithm has obtained better solutions than many other algorithms. It is proved that MSCSO has a good effect in solving engineering problems.
The MSCSO algorithm has strong exploration ability and can jump out of local optimization to prevent premature convergence of the algorithm. However, the exploitation ability of the MSCSO algorithm is relatively reduced, and the algorithm is difficult to converge faster when finding a better location. However, compared with SCSO, it is greatly improved. In a future work, we will strengthen the exploitation capability of the MSCSO algorithm and apply it to UAV 3D path planning, text clustering, feature selection, scheduling in cloud computing, parameter estimation, image segmentation, intrusion detection, etc. Funding: This work was funded by National Education Science Planning Key Topics of the Ministry of Education-"Research on the core quality of applied undergraduate teachers in the intelligent age" (DIA220374).
Institutional Review Board Statement: Not applicable.

Informed Consent Statement: Not applicable.
Data Availability Statement: Not applicable.