Next Article in Journal
Design of a Tunnel Anchor Monitoring System Based on Long Short-Term Memory–Autoregressive Integrated Moving Average Prediction
Previous Article in Journal
CuFP: An HLS Library for Customized Floating-Point Operators
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Hybrid Algorithm Based on Multi-Strategy Elite Learning for Global Optimization

1
School of Electronic Information, Zhejiang Guangsha Vocational and Technical University of Construction, Dongyang 322103, China
2
College of Information Engineering, Shenyang University, Shenyang 110044, China
3
School of Computer Science and Technology, Zhejiang Normal University, Jinhua 321004, China
4
School of Intelligent Manufacturing Engineering, Jiangxi College of Application Science and Technology, Nanchang 330100, China
*
Authors to whom correspondence should be addressed.
Electronics 2024, 13(14), 2839; https://doi.org/10.3390/electronics13142839
Submission received: 4 June 2024 / Revised: 28 June 2024 / Accepted: 15 July 2024 / Published: 18 July 2024

Abstract

:
To improve the performance of the sparrow search algorithm in solving complex optimization problems, this study proposes a novel variant called the Improved Beetle Antennae Search-Based Sparrow Search Algorithm (IBSSA). A new elite dynamic opposite learning strategy is proposed in the population initialization stage to enhance population diversity. In the update stage of the discoverer, a staged inertia weight guidance mechanism is used to improve the update formula of the discoverer, promote the information exchange between individuals, and improve the algorithm’s ability to optimize on a global level. After the follower’s position is updated, the logarithmic spiral opposition-based learning strategy is introduced to disturb the initial position of the individual in the beetle antennae search algorithm to obtain a more purposeful solution. To address the issue of decreased diversity and susceptibility to local optima in the sparrow population during later stages, the improved beetle antennae search algorithm and sparrow search algorithm are combined using a greedy strategy. This integration aims to improve convergence accuracy. On 20 benchmark test functions and the CEC2017 Test suite, IBSSA performed better than other advanced algorithms. Moreover, six engineering optimization problems were used to demonstrate the improved algorithm’s effectiveness and feasibility.

1. Introduction

In recent years, driven by the rapid advancements in information technology and the continuous enhancements in computing power, heuristic algorithms have gradually become an important tool and method for solving various complex problems [1]. As one of the research hotspots in the field of artificial intelligence, heuristic algorithms can discover laws, optimize decisions, and provide innovative solutions in various fields by simulating human intelligent thinking and learning processes, as well as analyzing and processing large amounts of data. The research scope of heuristic algorithms is wide, including but not limited to genetic algorithms [2], ant colony algorithms [3], particle swarm algorithms [4], artificial neural networks [5], fuzzy logic [6], and simulated annealing algorithms [7]. These algorithms have the characteristics of adaptability, learning ability, and parallel processing ability, and they can effectively solve complex problems that traditional algorithms find difficult to deal with, such as optimization problems [8,9], data mining [10], pattern recognition [11], image processing [12], and machine learning [13].
The research and application of heuristic algorithms have not only attracted widespread attention in academia but have also had a huge impact on the industrial and commercial fields. In the industrial field, intelligent algorithms are applied to production scheduling, supply chain management, equipment failure prediction, etc., significantly improving production efficiency and resource utilization. In the commercial field, meta-heuristic algorithms are applied in market analysis, consumer behavior prediction, recommendation systems, etc., providing enterprises with more accurate and personalized services. However, although heuristic algorithms have achieved remarkable achievements in various fields, they still face many challenges and problems. For example, the performance and stability of the algorithm need to be further improved, the explainability and interpretability of the algorithm also need to be strengthened, and the consideration of data privacy and security in the algorithm has become particularly important. Therefore, it is an urgent need to conduct in-depth research on and make improvements in intelligent algorithms.
Zhu D et al. [14] introduced an enhanced version of bare-bones particle swarm optimization for addressing the DNA sequence design challenge, initialized the population through dynamic lens learning to obtain a better-quality initial solution, updated it through a proposed signal-to-noise ratio distance particle position, and finally proposed to eliminate the poor-quality solutions of the weed optimization algorithm to improve the search’s efficiency. Experiments show that the designed DNA sequence has a higher-quality solution. Zhang E et al. [15] proposed a stochastic elitist learning strategy to optimize the upper-level particles and lower-level particles of PSO to solve large-scale optimization problems. Sui FL et al. [16] created a multi-objective collision-free underwater robot path optimization scheme by establishing the upper-level path planning model of PSO-ACO and the lower-level path planning model composed of the A* algorithm. Experiments show that an optimal conflict-free path with shorter length and higher security can be generated. Wang Y et al. [17] effectively reduced the probability of premature convergence by optimizing the pheromone recording rules and parameters of the traditional ant colony algorithm. The application of the TSP problem shows significant improvement compared to the conventional ant colony algorithm, and the improved algorithm achieves solutions that are close to the theoretical optimum.
Not only these classic heuristic algorithms but also intelligent optimization algorithms, such as the bald eagle search optimization algorithm [18], the arithmetic optimization algorithm [19], the grasshopper optimization algorithm [20], etc., are widely used by scholars all over the world and improved to handle a growing number of optimization problems. TM et al. [21] introduced a local search algorithm called LSAM, which incorporates a mutation operator to enhance the diversity of solutions in the butterfly optimization algorithm. Experimental results demonstrate that the improved algorithm outperforms other algorithms in terms of feature selection and classification accuracy. Pan J. et al. [22] improved the search capability of the Golden Eagle optimization algorithm by introducing a dual learning mechanism. They further applied this enhanced algorithm to UAV path planning and demonstrated its excellent performance.
The sparrow search algorithm (SSA) introduced in this paper is a novel intelligent optimization algorithm developed by Xue J. et al. [23] in 2020 that has attracted extensive attention and research in recent years. It is based on the observed group behavior of sparrows and aims to simulate the intelligent behavior of sparrows in predation and anti-predation and apply it to solve practical problems. It is superior to many swarm intelligence algorithms in performance, but SSA also has the disadvantage of being easily trapped in the local optimum. Several researchers have proposed enhanced versions of the sparrow search algorithm for addressing this problem. Wang Z. et al. [24] presented an improved version of the sparrow search algorithm that incorporates the particle swarm optimization (PSO) algorithm. The objective was to enhance the optimization performance specifically in the context of UAV path planning. Zheng F. et al. [25] made several enhancements to the sparrow search algorithm. They improved the quality of the initial population using cubic chaotic mapping, incorporated a sinusoidal disturbance strategy into the discoverer’s position update formula to enhance global search performance, and introduced an adaptive Cauchy mutation strategy to improve the algorithm’s ability to escape local optima. The improved sparrow search algorithm was then utilized to optimize the parameters of the Long Short-Term Memory (LSTM) network. The effectiveness and feasibility of the enhanced algorithm were verified through experimental evaluation. Huang, Z et al. [26] improved the diversity of the initial population by introducing Tent mapping and generalized oppositional learning. Then, they introduced adaptive inertia weight to dynamically adjust the position of the discoverer to improve the search efficiency, and they used the non-uniform mutation strategy and somersault strategy, respectively. The update formula for followers and vigilantes improves the convergence accuracy of the algorithm, and the improved algorithm is applied to K-means image segmentation to verify the effectiveness of the improved algorithm. Sun H. et al. [27] improved the initialization process of the sparrow population by incorporating CAT chaotic mapping. This enhancement increased the randomness and ergodicity of the initial population. Additionally, they introduced Cauchy mutation and Tent chaotic perturbation techniques to enhance the local search capability of the algorithm. The improved algorithm was applied to network security situation prediction, resulting in improved prediction accuracy. Xue, Z. et al. [28] utilized the Circle map to initialize the sparrow population, thereby enhancing both the quality and diversity of the solutions. They further incorporated the information exchange enhancement mechanism from the gray wolf algorithm to update the discoverer’s position. Moreover, they introduced a chaotic sine–cosine mechanism in the follower’s position update formula, thereby improving the algorithm’s ability to escape local optima. The effectiveness of the improved algorithm was verified by applying it to solve the optimal load problem of a chiller parallel system. Liu R et al. [29] introduced the Latin hypercube sampling technique to obtain the initial population during the sparrow initialization process. Then, in order to enhance the convergence efficiency of the algorithm, an adaptively adjusted sine–cosine algorithm was proposed, incorporating the Levy flight strategy, and they finally introduced a mutation interference mechanism to optimize the population. The improved algorithm’s performance is validated through its application to the wireless sensor network coverage problem. Zhang G et al. [30] introduced an enhanced sparrow search algorithm by incorporating improved adversarial learning and adaptive inertial weights. This improved algorithm was then applied to path planning to validate its effectiveness. Wu H et al. [31] initialized the population with the sine chaotic map and introduced adaptive adjustment of hyperparameters and mutation strategies to improve the optimization ability of the sparrow search algorithm. They applied it to flame image recognition, thus improving the accuracy of fire recognition. Liu J et al. [32] proposed to introduce the Circle chaotic map into the population initialization process and, at the same time, introduce T distribution variation to improve the position update law of sparrows. Finally, they constructed a sparrow population dispersion similarity function and verified the effectiveness of the improved algorithm through engineering examples. Gao B et al. [33] initialized the population with Tent chaotic map and introduced the Levy flight and differential mutation strategy into the update formula of the sparrow population to improve the performance of the sparrow search algorithm. They applied it to improve the dynamic and steady-state performance of the servo system. Liu G Y et al. [34] obtained a high-quality solution by introducing the Cubic chaotic map initialization population and adopted the adaptive inertia weight to balance the convergence speed and exploration ability of the algorithm. The application of the improved algorithm in UAV path planning effectively addresses the challenges associated with UAV track planning. Wang, Z et al. [35] initialized the sparrow population through the improved ICMIC chaotic map and used lens imaging opposite learning to update the discoverer position with a high fitting degree in the discoverer update stage. Finally, they used generalized opposite learning to update the current global worst solution. The practicality of the improved algorithm is demonstrated through real-world engineering examples.
As stated by the NFL theorem [36], no optimization algorithm can outperform all other algorithms on all possible problems. Although various methods proposed by many experts and scholars can indeed improve the optimization effect of SSA, they still fall into the local optimum and face insufficient convergence accuracy when encountering more complex optimization problems. Most of the above studies have introduced traditional chaotic maps to solve the problem of population initialization distribution, but there are still uncertainties. Similarly, traditional opposite learning can only solve in a certain opposite space, and the effect of obtaining high-quality solutions is not obvious. In the above literature, there is no lack of introduction of adaptive inertia weight to dynamically adjust the position update of the discoverer. Although the global search capability of the algorithm can be enhanced in the initial update, the inertia weight is not considered in the case of the reduction of population diversity in the middle and late stages. In the pursuit of improving the algorithm’s performance, integrating other optimization algorithms can help mitigate convergence problems and enhance the ability to identify the global optimal solution, but only part of the update strategy is simply integrated into the position update of the sparrow algorithm, which is not used in dealing with different types of optimization problems. Considering that the performance of jumping out of the local optimum of the original sparrow algorithm is also superior, this affects the performance of the traditional sparrow search algorithm.
Considering the aforementioned issues, this paper introduces a novel approach, named IBSSA (’Improved Beetle Antennae Search-Based Sparrow Search Algorithm), which combines the strengths of both the learning hybrid beetle antennae search algorithm and the sparrow search algorithm. In the population initialization stage, an elite dynamic opposite learning strategy is proposed to obtain high-quality sparrow initial solutions and avoid solution uncertainty. Then, a stage-by-stage adaptive inertial weight guidance mechanism is proposed to improve the global optimization performance of the sparrow search algorithm. To mitigate the risk of the sparrow search algorithm converging to local optima, a combination of strategies is proposed in this study. The improved algorithm integrates the greedy strategy with the enhanced beetle antennae search algorithm and logarithmic spiral opposition-based learning. Additionally, updates are made to the formula used by the sparrow vigilante. These modifications aim to enhance the algorithm’s overall stability, the balance between exploration and exploitation, and search flexibility. The performance of the improved algorithm is evaluated using 20 commonly employed benchmark functions, and the results are compared against those obtained from nine advanced algorithms. Furthermore, to reduce reliance on the optimal value at 0, the algorithm is also benchmarked against the CEC2017 test suite using the same set of algorithms. The findings reveal that the Improved Beetle Antennae Search-Based Sparrow Search Algorithm (IBSSA) exhibits favorable optimization performance and versatility. To analyze the individual impact of each strategy, ablation experiments are conducted. Finally, the effectiveness of the improved algorithm is demonstrated through six classic engineering application examples.
The global optimization task of the algorithm proposed in this article is to prove the optimization performance of the algorithm on public datasets, such as benchmark test functions and CEC2017. The theoretical optimal value of the dataset is the global optimal value that the algorithm seeks, and the practicality test of the algorithm is selected under six classic constrained engineering optimization problems. The same optimization objective is to minimize the consumption of the engineering optimization objective model, and the proposed algorithm aims to find the minimum consumption. Therefore, the optimization objective of this article is to find or approach the theoretical minimum value of the test set to demonstrate the effectiveness of the improved algorithm, find the global minimum value, and avoid the risk of falling into local optima.
The work and innovations of IBSSA are as follows:
(1)
An elite dynamic opposite learning strategy is proposed to select elite individuals in the initial population and individuals after dynamic opposite learning to form a new population and select high-quality individuals as new populations, which improves the problem of uncertain quality of the initial population solution.
(2)
To enhance the global optimization capability of the algorithm, a staged inertial weight guidance mechanism is proposed, which improves the position update method for the discoverer.
(3)
To address the vulnerability of the sparrow search algorithm to local optima, the proposed approach introduces the improved beetle antennae search algorithm and the logarithmic spiral opposition-based learning using a greedy strategy. These enhancements are incorporated into the position update mechanism of the sparrow vigilante, effectively improving the algorithm’s local optimization performance.
(4)
The IBSSA algorithm is applied to engineering optimization problems in order to evaluate its practicality and effectiveness. Through this application, the improved algorithm’s performance and efficacy can be verified in real-world scenarios.
This paper is structured as follows: the first part introduces the meaning and application of the heuristic algorithm and the development status of the sparrow search algorithm; the second part introduces the traditional sparrow search algorithm; the third part describes the improved sparrow search algorithm and the corresponding process; the fourth part verifies the superiority of IBSSA through 20 benchmark functions and CEC2017 experiments; and the fifth part verifies the practicability of IBSSA through six engineering examples and, finally, summarizes the improvement work of this paper and analyzes the advantages and disadvantages of IBSSA and prospects for future work.

2. Sparrow Search Algorithm

The sparrow search algorithm is a novel optimization technique inspired by the predation and anti-predation behavior observed in sparrows within their natural habitat. Within the sparrow population, there are three distinct types of sparrows. One is the discoverer, which is the part of the sparrow population that is looking for food, accounting for 20% of the sparrow population. The update formula of the discoverer is as follows:
X i , j t + 1 = X i , j t exp ( i α i t e r max ) λ < S T X i , j t + Q L λ S T  
Among them, X i , j t represents the position of the i sparrow in dimension j , t is the current number of iterations, α , Q are random numbers in the range of ( 0 , 1 ] and obey the normal distribution, and λ , S T are the warning value and safety value, respectively. When λ < S T , the population is in a safe period, no predators appear, and the discoverer can forage extensively. When λ S T , a predator appears near the population, and the followers and vigilantes will escape to a farther place for food as the discoverer is far away from the range of the predator. One type is the follower, who will follow the discoverer to forage. During the foraging process, if the fitness value of the discoverer is smaller than that of the follower, then the follower will turn into a discoverer at this time, but for the discoverer and the follower, the ratio is constant. The follower update formula is as follows:
X i , j t + 1 = Q exp ( X w o r s t t X i , j t i 2 ) i > 2 n X P t + 1 + | X i t X P t + 1 | A + o t h e r w i s e
X P t + 1 represents the optimal position of the discoverer in the global search process of the t + 1 generation, X w o r s t t represents the worst position of the sparrow in the global search process of the t generation, n represents the number of sparrows in the population, and A represents the 1 × d   -dimensional matrix, A + = A T ( A A T ) 1 , in the formula. The other type is vigilantes, who account for about 10–20% of the population, and its position update formula is as follows:
X i , j t + 1 = X b e s t t + γ | X i , j t X b e s t t | f i > f g X i , j t + R ( X i , j t X w o r s t t ( f i f w + ε ) ) f i = f g
Among them, X b e s t t is an optimal position of the global iteration at this time, γ in the formula is a random number and obeys the normal distribution, f i represents the fitness value of the population at this time, and f g represents the global optimal position. The optimal fitness value, f w , represents the global worst fitness value, R represents a random number, for which the range is ( 0 , 1 ) , and ε represents a very small constant, preventing the denominator from being zero. This paper takes ε = 1 e 50 . When f i > f g , sparrows are at the fringes of the population and vulnerable to predators; when f i = f g , sparrows in danger will stay close to other sparrows to prevent predation.

3. Improved Sparrow Search Algorithm

3.1. Justification for These Improvement Strategies

The adaptability of heuristic algorithms enables them to handle various types of optimization problems. These algorithms do not rely on specific properties of the objective function, such as differentiability or convexity, and can therefore be applied to black box functions, discrete optimization problems, and combinatorial optimization problems [37].
In the initialization stage of SSA, because a certain number of sparrows are randomly generated, the positions and fitness values are both random, so there must be sparrow individuals with poor fitness values. With the continuous loss of population diversity in the iterative process, the flexibility of the sparrow population to find the optimal value is reduced. On the other hand, the update of the discovers’ position in the sparrow population only considers the influence of the position of the previous generation of sparrows, and sparrow individuals tend to jump directly to the vicinity of the current extremum at the end of the iteration, resulting in insufficient search range and being trapped in the local optimum. Finally, the position update of the vigilante in the update formula of the sparrow comprises a process of performing a local search on the entire algorithm, while the sparrow search algorithm does not have a good balance between the discoverer and the follower. The global search process is transferred to the local search process and the optimal sparrow position is not explored more extensively, resulting in a local optimum.
Based on the analysis presented above, this paper proposes an elite dynamic opposite learning strategy to enhance the quality of the initial sparrow solution. Additionally, a staged inertia weight guidance strategy is designed to facilitate stable global search during different stages of sparrow transition while considering the influence of the current optimal individual on the position update. This enhances the algorithm’s ability to optimize global optimization. Furthermore, by incorporating the improved beetle antennae search algorithm and the sparrow search algorithm vigilante through logarithmic spiral opposition-based learning, the sparrow is transformed into a beetle individual. This facilitates local mining near the optimal value and prevents falling into local optima. It ensures that the original algorithm’s optimization performance is maintained, and the overall algorithm’s optimization stability is improved through the application of a greedy strategy. Ultimately, a high-quality solution is obtained.

3.2. Elite Dynamic Opposite Learning

The initial population of a meta-heuristic optimization algorithm is typically generated randomly, which ensures the distribution of individuals in the search space but not necessarily their solution quality. The quality of the initialization directly impacts the convergence speed and accuracy of the algorithm. To improve the initialization process in meta-heuristic algorithms, various strategies are employed, such as chaotic mapping and reverse learning, to control the distribution of initial positions. In line with this, the literature [38] introduces a dynamic opposite learning (DOL) strategy to enhance the quality of the initial population’s solutions and address the issue of low population diversity resulting from uneven initial distribution.
DOL can be expressed as X D O L = X + r 1 × ( r 2 × ( l b + u b X ) X ) . X D O L represents the population position after dynamic learning, X represents the position of the randomly initialized population, and a new population X n e w = X D O L X is obtained by merging two populations. Select n individuals with the highest fitness, where n represents the number of populations. To enhance the precision of individual distribution within the population and improve the quality of population solutions, this paper proposes an elite dynamic opposite learning method based on the DOL strategy. DOL deals with the entire population of individuals, but there are also differences among population individuals, and the quality of the distribution and the quality of the solution cannot be guaranteed. Therefore, on the basis of DOL, this paper first performs the elite opposite learning operation on the individual positions generated through random initialization. The elite individuals in the population contain more effective information than other individuals. By constructing the reverse solution of elite individuals, the population’s diversity can be augmented. This contributes to enhancing the variety within the population. Compared with DOL, which can have a greater advantage in solving the random initialization position, the following is the improved DOL method:
X E O B L = K × ( a + b ) X X E D O L = X E O B L + r 1 × ( r 2 × ( l b + u b X E O B L ) X E O B L ) X n e w = X E D O L X E O B L
X E O B L represents the position of the individual after the opposite reverse learning, and X E D O L is the position of the individual after the elite’s reverse learning. K is the elite opposite coefficient between ( 0 , 1 ) , among which a = max ( X ) , b = min ( X ) represent the maximum and minimum values in X and [ l b , u b ] is the boundary range. Similarly, by selecting n individuals with the highest fitness among X n e w as a new population, compared with X D O L treatment of the random initial population, the population of X E O B L after elite opposite learning will obtain a more stable distribution than the original random population and improve the quality of the solution, thus increasing the probability that the search space expands to a position closer to the optimal solution.

3.3. Improved Discoverer Update Formula

Among many methods of balancing global optimization and local optimization, the introduction of inertial weight is widely recognized as one of the most impactful methods to improve the performance of meta-heuristic algorithms. This method is the most common in improving the performance of PSO. Large inertial weight is beneficial to search, but it will make the particles search in the space for too long, and the small inertia weight will speed up the convergence speed, but sometimes it will lead to a local optimum. To balance the global search and local optimization capabilities of the algorithm, a staged inertial weight reduction strategy is devised. This strategy is built upon the aforementioned principle. In the literature [39], a two-stage linear decreasing inertia weight method is proposed. The set stage inertia weight is the real value in the first stage of the extensive search, although a large step size can improve the global optimal performance of the discoverer. However, as the iteration progresses, to ensure a stable transition between exploration and exploitation and promote steady convergence, the algorithm is designed to avoid rapid convergence. Therefore, this paper proposes a new staged inertia weight reduction strategy to balance development and exploration. The designed linear reduction strategy is as follows:
w = w 1 = exp ( 20 × ( t T ) 6 ) 1 t < 1 3 T w 2 = 1 ( t T ) 1 3 T t < 2 3 T w 3 = exp ( 1 ( T + t ) ( T t + e p s ) ) 2 3 T t T
e p s is an extremely small number to prevent the denominator from being zero, as shown in Figure 1 for comparison with the strategy presented in study [39].
The control strategy discussed in study [39] primarily focuses on the wide-area search during the initial stage. While a larger search space may expedite the algorithm’s convergence speed, it also poses a risk of overlooking the optimal solution during the later stages if convergence happens too quickly. The three-stage decrement strategy ensures a comprehensive search in the early stage while effectively controlling the convergence speed of the algorithm, and the transformation process from the discoverer to the follower is stable. Even in the mid-term and the later small-scale development process, the discoverer will quickly explore but will not easily miss the global optimal position. In the traditional sparrow search algorithm, the position update of the discoverer solely relies on the position of the previous generation, overlooking the influence of the current optimal solution and the global optimal solution on the overall exploration of the discoverer. When R 2 < S T , based on the aforementioned staged control strategy diagram, it is observed that the staged linear decreasing strategy enhances the relationship between global search and local search. However, in the later stages of the iteration, the inertia coefficient tends to approach zero, resulting in a predominant focus on local search. As a consequence, the global search aspect of the algorithm is disregarded. To tackle this limitation, this paper proposes a new discoverer update formula:
X i , j t + 1 = w X i , j t + | F ( X b e s t t X i , j t ) | R 2 < S T w X i , j t + Q L R 2 > S T
where F = 5 s i g n ( α 0.5 ) exp ( α ( 1 t T ) ( t T ) 1 ) , α ( 0 , 1 ) . F is the impact factor of balancing global search and local search in the EO algorithm [40]. Considering that the position update formula of the discoverer in the sparrow search algorithm solely relies on the positions of the previous generation of sparrows, it overlooks any disparity between the global optimal position and the individual positions of the previous generation. Through the above improved formula, it can be concluded that when the global optimal and the position are the same as those of the previous iteration, the sparrow position of the next generation is updated according to the staged inertia weight. If the sparrow position of the previous generation is not optimal, the shadow persistently updates the individual positions of the next generation through the equilibrium of the EO algorithm. Throughout the entire position update process of the sparrow discoverer, the global optimal position plays a guiding role. As the algorithm advances to the later stages, a balance factor is introduced to mitigate the problem of easily falling into local optima caused by the inertia weight nearing zero. This facilitates a more refined balance between exploration and exploitation capabilities.

3.4. Fusion of Greedy Strategy to Improve Search Algorithm of Beetle Antennae Search Algorithm and Sparrow

3.4.1. Logarithmic Spiral Opposition-Based Learning

Logarithmic spiral opposition-based learning (LsOBL) is an innovative methodology introduced by Izci D et al. [41] as a further development of OBL. It has shown excellent performance in the application of the magnetic ball levitation system by combining it with the Hunger Games search algorithm. The traditional OBL involves performing reverse operations on all positions with a boundary range between [ l b , u b ] to obtain new positions; it can be expressed as X o p = u b + l b X . X represents all individual positions within the boundary, X o p represents the position after reverse learning, and the modified LsOBL can be defined as:
X o p = r 1 u b + r 2 l b X b e s t X t + 1 = | X b e s t X o p | × e b l × cos ( 2 π l ) + X b e s t
Among them, r 1 , r 2 represents a random number between (0, 1), X b e s t represents the best position in the iterative process, and X t + 1 is the position after spiral opposition learning. l is a random number that controls the entire logarithmic spiral space between ( 1 , 1 ) .
The key distinction between LsOBL and OBL lies in their treatment of positions. While OBL considers the reverse position of all individuals within the boundary, LsOBL specifically focuses on the reverse solution of the optimal individual within the boundary. Throughout the iterative process, the position of the optimal individual undergoes constant changes, leading to a reduced search space for spiral oppositional learning within OBL. In contrast, LsOBL aims to target individuals undergoing changes within a smaller space, particularly those in proximity to the optimal solution. This approach proves valuable during the later iterations, when population diversity decreases. It prevents premature convergence of the algorithm and ensures the search for the global optimal value is not missed. The schematic diagram of logarithmic spiral opposition-based learning is depicted in Figure 2 below.

3.4.2. Hybrid Search Algorithm of Beetle Antennae Search and Sparrow

The beetle antennae search algorithm (BAS) is a simple and efficient optimization algorithm proposed by Jiang et al. [42] in 2017. Inspired by the foraging behavior of longhorn beetles, the algorithm simulates the process of beetles searching for food. BAS is particularly effective for low-dimensional optimization problems due to its straightforward principle, minimal parameters, and low computational requirements.
During foraging, beetles are attracted to food by its smell. They perceive food odors through their two antennae, which results in different odor concentrations at each antenna due to the varying distance between the food and the antennae. By detecting the concentration difference, beetles randomly move towards the side with the stronger odor. Through repeated iterations, the beetle eventually locates the food source. Figure 3 provides a schematic representation of the bionic algorithm based on beetle antennae.
After applying elite dynamic opposite learning to obtain a better initial population, the improved finder formula allows sparrow individuals to escape local optima more effectively. However, maintaining a balanced and stable process for finding the optimal solution is crucial. The sparrow search algorithm relies on random selection and probability distribution to update the sparrow’s position during the local search stage. However, as the algorithm progresses, the decrease in population diversity reduces randomness and increases the risk of falling into local optima. To address this, the global optimization ability of the beetle antennae algorithm is leveraged. By introducing logarithmic spiral opposition-based learning, the position of the original beetle individual is slightly adjusted, enabling exploration in the best area and obtaining a more stable optimal solution. The beetle antennae algorithm is integrated into the local update stage of the sparrow search algorithm. After updating the position of the sparrow follower, it is treated as a beetle individual and iteratively updated. Through a greedy strategy, the fitness value obtained by the beetle antennae algorithm and the sparrow algorithm’s vigilant update are compared. If the fitness value improves, the beetle antennae algorithm’s update process is executed; otherwise, it is not executed. By employing the greedy selection strategy, the loss of population diversity in the later iterations of the sparrow search algorithm is mitigated. This approach continuously incorporates better solutions into the iterative calculation process, enhancing the algorithm’s ability to escape local optima. The improved local beetle antennae algorithm update can be summarized as follows.
First, the logarithmic spiral opposition-based learning operation is performed on the initial beetle position obtained from the sparrow follower so that it can be processed in the area that is more likely to be explored:
X o p = r 1 u b + r 2 l b X b e s t X t + 1 = | X b e s t X o p | × e b l × cos ( 2 π l ) + X b e s t
Then, use the beetle antennae algorithm update formula to update the position:
D i r = d i r / ( | | d i r | | )
Among them, d i r represents a random unit vector, and D i r represents the value after normalizing the random unit vector.
How to update the left antennae of the beetle:
X L ( t + 1 ) = X t + 1 + d t + 1 × D i r
How to update the right antennae of the beetle:
X R ( t + 1 ) = X t + 1 d t + 1 × D i r
Among them, d 0 = s t e p 0 / c , d 0 represent the length between the particle and the beetle, s t e p 0 represents the maximum step size initially set, generally set to 5, and c = 1 represents the ratio between the step and d 0 .
When the beetle obtains the objective function values of two positions, it needs to choose the best of the two positions:
X = X t + 1 s t e p t + 1 × D i r × s i g n [ f ( X L ( t + 1 ) X R ( t + 1 ) ) ]
s t e p t + 1 = η s t e p t
s t e p t represents the step size of the last iteration, s t e p t + 1 represents the current step size, and η represents the step size attenuation coefficient, generally 0.95. X represents the position after the beetle antennae algorithm is updated. Then, a greedy strategy is introduced to compare the fitness values of X and X i , j t + 1 , and the one with better fitness is taken as the new position.
X u p d a t a = X f ( X ) f ( X i , j t + 1 ) X i , j t + 1 f ( X ) > f ( X i , j t + 1 )

4. Time Complexity Analysis

The time complexity of an intelligent algorithm is a crucial factor for assessing its performance and execution time. Assume that the dimension of the data in the original algorithm is D , the maximum number of iterations is T , and the number of populations is M , and then the time complexity of SSA is H ( D × T × M ) . To analyze the time complexity of IBSSA, first use the improved elite dynamic opposite learning to initialize the sparrow population; the time complexity is H 1 = H ( D × M ) . Then, improve the update formula of the discoverer; its time complexity is H 2 = H ( D × M × T ) . The time complexity when using the improved BAS update alone is H 3 = H ( D × M × T ) . The total time complexity of the improved greedy strategy is H 4 = H 3 + H = H ( D × M × T ) .
Through the above analysis of the time complexity of the increased improvement strategy, the time complexity of the IBSSA algorithm is H = H ( D × T × M ) + H 1 + H 2 + H 4 = H ( D × T × M ) . It is consistent with the original algorithm and does not increase the time complexity, so as to prove that the improved algorithm has no additional consumption.

5. Pseudocode of IBSSA

Based on the analysis of the mathematical model mentioned above, the pseudocode of IBSSA (Algorithm 1) can be obtained as follows:
Algorithm 1. IBSSA
Import:
M :   population   size ;   P D :   proportion   of   discoverers ;   S D :   proportion   of   vigilantes ;   R 2 :   alarm   value ;   S T :   safe   value ;   T :   maximum   number   of   iterations ;   s t e p 0 : Initial step size of beetle antennae algorithm.
Output:
X b e s t :   global   best   position ;   f b : the fitness value associated with the optimal position.
1: Initialize the population using Formula (4)
2 :   w h i l e ( t < T )
3: Sort the population based on fitness values to identify the best and worst individuals.
4 :   f o r   i = 1 : P D
5: Update the discoverer’s position according to Formula (6)
6:  end for
7 :   f o r   i = ( P D + 1 ) : M
8: Update follower position according to Formula (2)
9:  end for
10 :   f o r   i = 1 : S D
11: According to the Formulas (8)–(13) and Formula (3), update the beetle’s step length, the position of the tentacles, and the position of the sparrow vigilante, and calculate the fitness of the two.
12: Greedy selection of optimal fitness through Formula (14)
13:  end for
14: Obtain a new population.
15: Update the position if the new position is superior to the current position.
16 :   t = t + 1
17: end while
18: Return the objective function value.
The overall algorithm flowchart is shown in Figure 4.

6. Analysis of Experimental Results

Intelligent optimization algorithms require a large amount of experimental table data and iterative graphs to prove their performance because these algorithms are usually applied to solve complex and variable optimization problems, which involve multiple variables, nonlinear relationships, and the possibility of multiple local optimal solutions. When facing these problems, relying solely on theoretical analysis often fails to provide sufficient insight and verification of practical effects. Therefore, a large amount of experimental data and charts are needed to visually demonstrate the performance of the algorithm, so we used multiple sets of test functions for experiments.

6.1. Benchmark Function Experiments

To evaluate the performance of IBSSA, the algorithm was tested on the first 20 benchmark functions to assess its accuracy and stability. Among the selected test functions, f1–f7 is the single modal benchmark function, f8–f13 is the multimodal benchmark function, and f14–f20 is the composite benchmark test function. The original SSA, the two SSA variants, LSSA and TSSA, proposed in the literature [43,44], the adaptive gbest-guided gravitational search algorithm (GGSA) [45], the improved gray wolf optimizer (IGWO) [46], the dung beetle optimizer (DBO) [47], the Whale Optimization Algorithm (WOA) [48], the sine–cosine Algorithm (SCA) [49], the beetle antennae search algorithm (BAS), and the improved algorithm were subjected to a comprehensive evaluation to verify their effectiveness. Table 1 presents the parameter settings for each algorithm. To ensure fairness in the comparison, the initial population size for each algorithm was set to 30, the maximum number of iterations was set to 1000, and three performance indicators (optimal value, average value, and standard deviation) were obtained from the benchmark test function. The optimal value is indicated in bold, and the effectiveness of the algorithm was assessed through the Wilcoxon rank sum test and the Friedman test with a significance level of 5%. Among them, P represents the value after the Wilcoxon test between IBSSA and each algorithm, NaN represents the algorithm with higher similarity, and Rank represents the comprehensive ranking of each algorithm after the Friedman test. The 20 benchmark functions are shown in Table 2. The experimental environment of this article is 12th-Gen-IntelR)-CoreTM)[email protected], and the experimental software used is Matlab2021a.
From the experimental test data of IBSSA and each algorithm in Table 3, it can be seen that for the unimodal functions F1–F4, IBSSA has obvious advantages, and the optimal value can be found stably in 30 experiments. For the unimodal function F5, the optimal value sought by IBSSA is several orders of magnitude lower than that of other algorithms. IBSSA demonstrates robust optimization performance, surpassing other algorithms in many cases. Its stability is comparable to that of LSSA, with differences within an order of magnitude. For the unimodal function F6, IBSSA is superior to other comparative algorithms not only in stability but also in optimization performance. Similarly, the optimal value sought on function F7 and the average value of 30 experiments are also higher than other algorithms. The gap between stability and LSSA is also within an order of magnitude. It can be seen that IBSSA exhibits strong optimization performance on the unimodal test function. For the multimodal function F8, in the classical function, only the DBO algorithm is able to find the optimal value. However, in the improved variants of the function, both LSSA and IBSSA algorithms are capable of finding the optimal value. For the multimodal functions F9–F12, IBSSA is the same as other variants of SSA, as both can find the optimal value, which shows the advantage of the overall SSA in the multimodal function. IBSSA continues to take advantage of its optimization performance on multimodal functions F12–F13, ranking first among all algorithms. For the complex fixed-dimensional function F14, IBSSA demonstrates a strong advantage over other algorithms due to its stable performance. While other algorithms can find the optimal value in various scenarios, IBSSA outperforms them in terms of accuracy and optimization stability. Thus, it can be concluded that IBSSA exhibits the best overall performance. The Wilcoxon statistical test reveals significant differences between IBSSA and other algorithms, particularly when compared to the other two algorithms of SSA. Only some similarities are observed among the other algorithms. This further validates the uniqueness of the IBSSA algorithm. Moreover, the comprehensive ranking of the Friedman test confirms that IBSSA ranks first with an average of 2.175 across the 20 benchmark functions. This reaffirms the superior performance of IBSSA.
In order to verify the role of the improved strategies in the IBSSA in the optimization process, this paper uses the original sparrow search algorithm (SSA), the improved SSA (SSA1) of elite dynamic opposite learning, the improved SSA of staged inertia weight (SSA2), SSA (SSA3) improved by the beetle antennae algorithm, SSA (SSA4) combined with SSA1 and SSA2, SSA (SSA5) combined with SSA1 and SSA3, SSA (SSA6) combined with SSA2 and SSA3, and IBSSA combined with all strategies for comparison. The statistical results are in Table 4, and the optimal value is bolded.
It can be clearly seen from Table 4 that IBSSA performs the best on these 20 test functions, and it even leads in all three indicators on 14 test functions. IBSSA exhibits superior performance after fusion, surpassing its performance on F5. The mean and variance of SSA1 and SSA2 are not as favorable as those of IBSSA. This indicates that the integration of dynamic elite opposite learning leads to a more evenly distributed initialization population, enabling the algorithm to achieve more accurate optimal value discovery in unimodal test functions. Furthermore, the stage-guided inertia weight enhances the algorithm’s developmental capabilities. The gap between IBSSA and SSA1 and SSA2 under these two indicators is within an order of magnitude, but the optimal value it finds is better than the optimal value under other strategies. The value is multiple orders of magnitude, and the optimal value sought on F7 is slightly lower than that of SSA3. The integration of the beetle antennae algorithm has resulted in an improved developmental ability of the algorithm. Both SSA6 and SSA6 can find the theoretical optimal value. It can be seen that the SSA integrated with the beetle antennae algorithm has a significant advantage in the case where the optimal value is not near 0, and it can be seen from the data of F12, F13, and F19 that the robustness of the SSA after incorporating the beetle’s antennae algorithm has been improved. The exploration performance has also been improved. The improved SSA of each strategy can only be consistent with the performance of the original algorithm on the four test functions. Only on F15 can the optimal value sought by SSA be the same as that of IBSSA, and it is slightly higher than the SSA of other improved strategies. The performance of the original SSA can be enhanced to a certain degree through the individual actions and mutual integration of the strategies. Especially for the IBSSA with all strategies integrated, the robustness and exploration performance are significantly improved.

6.2. CEC2017 Function Test

In order to further test the characteristics of IBSSA to get rid of the dependence on the benchmark function with the optimal value at 0, 10 algorithms were tested on CEC2017 to verify the practicability of IBSSA, namely LSSA, QMESSA [50], TSSA, LMHHO [51], AOA, POA [52], BAS, DBO, SSA, and IBSSA. CEC2017 has a total of 30 single objective test functions, including unimodal function (F1–F3), simple multimodal function (F4-F10), mixed function (F11–F20), and combination function (F21–F30). Due to the instability of the F2 function, no testing was conducted. Set the number of evaluations to 10,000 × dim, and conduct experiments under three different complexities with dimensions of 10, 30, and 50. It is worth noting that among several advanced algorithms, such as LMHHO, QMESSA, TSSA, and LSSA proposed in recent years, QMESSA and LSSA have passed the verification of CEC2017, and the specific parameter settings of each algorithm can be found in the literature. Each algorithm was independently run 30 times, and their performance, as reflected in Table 5, Table 6 and Table 7, was evaluated based on the mean and variance. The Wilcoxon rank sum test was employed to determine if there were significant differences between the algorithms, with a significance level of 5%. In Table 5, Table 6 and Table 7, the symbols “+” and “-” indicate whether the optimization performance of IBSSA is worse or better, respectively, compared to other algorithms. The symbol “NaN” denotes that the performance of IBSSA is equivalent to that of other algorithms. All of the results are compiled and presented in Table 5, Table 6 and Table 7, and a 30-dimensional CEC2017 convergence graph is included to observe the convergence differences between IBSSA and other algorithms.

6.2.1. CEC2017 Function Comparison under 10 Dimensions

Based on the experimental data provided in Table 5, IBSSA performs optimally on the following 19 functions from the CEC2017 test suite with a dimension of 10: F01, F04, F05, F07, F09, F10, F11, F12, F15, F16, F18, F19, F20, F22, F23, F26, F27, F28, and F30. One of the seven functions F03, F08, F13, F17, F21, F25, and F29 is in the optimal state, and IBSSA shows better performance on unimodal functions, multimodal functions, hybrid functions, and combined functions. The test results of IBSSA in multimodal functions F06 and F08, mixing function F14, and combination function F24 are slightly worse than those of QMESSA, POA, DBO, and SSA. According to the Wilcoxon rank sum test (dim = 10) data, it can be seen that IBSSA is similar to other algorithms only in individual functions, and more than half of the test results compared with QMESSA are better than QMESSA. In the Friedman test results, IBSSA ranked first among the ten algorithms, with an average ranking of 1.72 on 29 functions. In summary, IBSSA has the best performance on the CEC2017 test suite (dim = 10).

6.2.2. CEC2017 Function Comparison under 30 Dimensions

Based on the experimental data provided in Table 6, IBSSA performs optimally on the following 15 functions: F01, F03, F04, F05, F08, F17, F18, F20, F22, F24, F25, F26, F27, F29, and F30. The two performance indicators for these functions are at their best. One of the four functions of F10, F21, F23, and F27 has an index in the optimal state. As the dimension increases, the complexity of the calculation is also increasing, but IBSSA is in the single-modal function, multimodal function, and mixed function. It also shows good performance in terms of combination functions. Although the experimental data of F06, F07, F09, F19, and F28 are slightly less effective than LMHHO, QMESA, and DBO, the results of the Wilcoxon rank sum test and Friedman rank sum test indicate that IBSSA shows no strong similarity with other algorithms on the CEC2017 test suite when the dimension is 30. This suggests that IBSSA has unique characteristics when applied to problems of this dimensionality. Additionally, based on the average ranking, IBSSA achieves the top position with a ranking of 1.21. From the convergence curve (Figure 5), it can be observed that IBSSA exhibits strong capabilities in both early global search and later local search. The algorithm maintains stability throughout the entire search process.
It is difficult to observe the various data and the relationship between them from Table 6. In order to verify the stability and convergence of IBSSA, this paper also conducts a box plot analysis. Box plots summarize six types of data: maximum, upper quartile, median, lower quartile, minimum, and outlier. Figure 6 shows the box plot (dim = 30) of each algorithm in CEC2017 on 29 functions. In the figure, “+” in each box subplot indicates an outlier, “−” indicates the median, the two ends of the rectangular box are the upper and lower quartiles, and “-” indicates the largest value or minimum value. From Figure 6 below, it can be clearly seen that the length of the box plot of IBSSA is mostly shorter than those of other algorithms, and the stability is only worse in the comparison with SSA and SSA variants, but they are all in a small range. The gap indicates that IBSSA has good optimization performance and stability.
The results indicate that IBSSA surpasses the SSA algorithm, its variants, and other algorithms in terms of optimization performance. IBSSA achieves this by enhancing the quality of the initial solution through the integration of elite individuals and employing elite dynamic opposite learning in the early stage. This improvement in the initialization process contributes to the overall effectiveness of IBSSA, and in the update formula of the original sparrow discoverer, the sparrow individual directly jumps to the current optimal solution instead of a slow process. The improved stage-by-stage guidance mechanism makes the update formula of the sparrow discoverer divided into three stages, slowly approaching the optimal solution to avoid falling into a local optimum and missing high-quality solutions and using a greedy strategy to fuse improvements The beetle’s antennae algorithm is used to further explore the particles near the optimal solution in a small range. IBSSA successfully combines the strengths of the sparrow search algorithm and the beetle’s antennae algorithm. It maintains the performance of the sparrow search algorithm while harnessing the global optimization capabilities of the beetle’s antennae algorithm. This integration prevents the sparrow search algorithm from getting trapped in local optima, ensuring better overall optimization performance. There is excellent maintenance of the optimization stability of the improved algorithm. It can be seen from the box plot (dim = 30) that IBSSA has good universality and robustness in terms of optimization stability.

6.2.3. CEC2017 Function Comparison under 50 Dimensions

According to the experimental data in Table 7, the two performance indicators of IBSSA on the following benchmark functions are at their best: F01, F12, F13, F14, F15, F16, F17, F18, F19, F21, F22, F23, and F25. These functions demonstrate the superior optimization performance of IBSSA. Additionally, on the CEC2017 test suite (dim = 50), the F30 function also shows optimal performance with IBSSA. One index of the 10 functions F05, F08, F09, F10, F17, F22, F26, F27, F28, and F29 is in the optimal state. IBSSA has shown better performance in single-mode function, multimode function, mixed function, and combination function. The test results of multimodal functions F03, F04, F06, and F07, mixed functions F11 and F20, and combined functions F23 and F24 are slightly worse than those of TSSA, LSSA, QMESSA, and SSA. According to Wilcoxon rank sum test (dim = 50) data, IBSSA is not similar to other algorithms, and more than half of the test results compared with QMESSA are better than QMESSA. With the rise of the problem dimension, although the performance of IBSSA decreases when compared with lower dimensions, in Friedman’s test results, IBSSA ranks first among the ten algorithms with an average ranking of 2.03 on 29 functions, which is still strong compared to other algorithms. In conclusion, IBSSA has the best performance on the CEC2017 test suite (dim = 50).

6.2.4. CEC2017 Ablation Experiment

Similarly, in order to better verify the role of the proposed strategies in the optimization process and the ability of each strategy to get rid of the optimal value that is not at the zero point, IBSSA was again ablated on the CEC2017 (dim = 30) test suite. The meanings of the tables represented by SSA1, SSA2, SSA3, SSA4, SSA5, and SSA6 are the same as those of the 20 benchmark test functions, the evaluation times are also 10000 * dim, and the parameter settings are the same as those of the comparison test. We ran the tests independently 30 times and recorded the average and standard deviation in Table 8.
As shown in Table 8, IBSSA has the most bold font to indicate the optimal value, and it ranks first with 1.34 in the Friedman test ranking. It exhibits excellent performance in unimodal functions, simple multimodal functions, mixed functions, and combination functions. From the test values of SSA1-SSA6, we can see that they have significant improvements in some functions compared to SSA. Therefore, it can be verified that the proposed strategy has a good effect on the CEC 2017 test suite (dimension = 30). At the same time, the number of bold values with the fusion of the beetle antennae algorithm ranks second, and the number of bold values with dynamic reverse learning ranks third. This shows that the integration of the beetle antennae algorithm greatly improves the stability and optimization accuracy of the overall algorithm. F28 is the only function for which IBSSA and other strategies are not as good as SSA, while for other functions they are better than SSA. IBSSA considers the balance between development and exploration, maintaining individual progress to improve the algorithm’s local optimization ability.

7. Application of Engineering Optimization Problems

Through the performance analysis of the above algorithms, it can be concluded that the optimization performance of IBSSA is theoretically superior to other latest intelligent optimization algorithms. However, unlike the test function, there are many constraints in actual engineering problems, which is undoubtedly a challenge. Therefore, the practicality of IBSSA can be further verified through six optimization constraint problems in engineering, The compression spring design problem is tested for practicality. Each design problem is independently run 30 times, and the optimal value from the 30 results is taken for analysis [53]. The obtained data are shown in Table 9, Table 10, Table 11, Table 12, Table 13 and Table 14.

7.1. Three Truss Problems

The three-bar truss design problem is a structural optimization problem in the field of civil engineering. As shown in Figure 7, its main purpose is to minimize the weight of the stress, disturbance, and buckling constraint between two bars and to minimize the volume of the three-bar truss by adjusting the cross-sectional area. The constraints for adjustment are as follows.
Consider:
x = [ x 1 , x 2 ] = [ A 1 , A 2 ]
Reduce to a minimum:
f ( x ) = ( 2 2 x 1 + x 2 ) l
The following conditions must be met:
H 1 ( x ) = 2 x 1 + x 2 2 x 1 2 + 2 x 1 x 2 P σ 0 , H 2 ( x ) = x 2 2 x 1 2 + 2 x 1 x 2 P σ 0 , H 3 ( x ) = 1 2 x 2 + 2 x 1 P σ 0 ,
Variable range of parameters:
0 x 1 , x 2 1 ,
where
l = 100 cm , P = 2 KN / cm 2 , σ = 2 KN / cm 2 ,

7.2. WBD

The purpose of the welding beam design problem is to estimate the best value of the thickness of the bar (b), the length of the attached part of the bar (l), the height of the bar (t), and the thickness of the weld (h). As shown in Figure 8, this is performed so as to minimize the consumables and reduce the construction cost. The model expression is as follows:
Variable:
x = [ x 1 , x 2 , x 3 , x 4 ] = [ h , l , t , b ] ,
The following conditions need to be met:
H 1 ( x ) = τ ( x ) τ max 0 , H 2 ( x ) = σ ( x ) σ max 0 , H 3 ( x ) = δ ( x ) δ max 0 , H 4 ( x ) = x 1 x 4 0 , H 5 ( x ) = P P c ( x ) 0 , H 6 ( x ) = 0.125 x 1 0 , H 7 ( x ) = 1.10471 x 1 2 + 0.04811 x 3 x 4 ( 14.0 + x 2 ) 5.0 0 ,
Domain of variables:
0.1 x 1 2 , 0.1 x 2 10 , 0.1 x 3 10 , 0.1 x 4 2 ,
where
τ = P 2 x 1 x 2 , τ = M R J , M = P ( L + x 2 2 ) , R = x 2 2 4 + ( x 1 + x 3 2 ) 2 , J = 2 2 x 1 x 2 [ x 2 2 4 + ( x 1 + x 3 2 ) 2 ] , σ ( x ) = 6 P L x 4 x 3 2 , δ ( x ) = 6 P L 3 E x 3 2 x 4 , P c ( x ) = x 3 2 x 4 6 4.013 E L 2 ( 1 x 3 2 L E 4 G ) , P = 6000 l b , L = 14 i n , δ max = 0.25 i n , E = 30 × l 6 p s i , G = 12 × 10 6 p s i , τ max = 13600 p s i , σ max = 30000 p s i

7.3. CSD

The tension/compression spring design problem is intended to obtain the minimum tension/compression spring weight, and it should meet the minimum disturbance, vibration frequency, and shear stress constraints. As shown in Figure 9, the model for this case is expressed as follows:
Variable:
x = [ x 1 , x 2 , x 3 ] = [ d , D , p ]
Need to reach the minimum:
f ( x ) = ( x 3 + 2 ) x 2 x 1 2 ,
The following conditions need to be met:
H 1 ( x ) = 1 x 3 x 2 3 71785 x 1 4 0 , H 2 ( x ) = 4 x 2 2 x 1 x 2 12566 ( x 2 x 1 3 x 1 4 ) + 1 5108 x 1 2 0 , H 3 ( x ) = 1 140.45 x 1 x 2 2 x 3 0 , H 4 ( x ) = x 1 + x 2 1.5 1 0 ,
Domain of variables:
0.05 x 1 2 , 0.25 x 2 1.3 , 2 x 3 15

7.4. PVD

The objective of the pressure vessel design is to minimize the manufacturing cost associated with the production of the pressure vessel. The design of the pressure vessel is illustrated in Figure 10. Both ends of the pressure vessel are enclosed by covers, with the cover at one end of the head being hemispherical. The four design variables that must be taken into account are the thickness of the shell (Ts), the thickness of the head (Th), the inner radius of the shell (R), and the length of the container (L). The mathematical model is as follows:
cos t : F ( x ) = 0.6224 x 1 x 3 x 4 + 1.7781 x 2 x 3 2 +   3.1661 x 1 2 x 4 + 19.84 x 1 2 x 3   x = [ x 1 , x 2 , x 3 , x 4 ] = [ T s , T h , R , L ]
s . t .   g 1 ( x ) = x 1 + 0.0193 x 3 0   g 2 ( x ) = x 2 + 0.00954 x 3 0   g 3 ( x ) = π x 3 2 x 4 4 3 π x 3 2 + 1296000 0   g 4 ( x ) = x 4 240 0   0.5 x 1 99 , 0.4 x 2 99 , 10 x 3 , x 4 200

7.5. Vertical Deflection of an I-Beam

The goal of this problem is to optimize four parameters, I1, I2, I3, and I4, namely the flange width, beam height, web thickness, and flange thickness, using the given objective function. The goal is to find the optimal variable that minimizes the vertical deflection of the I-beam while satisfying the preset cross-sectional area and stress constraints under the load, as shown in Figure 11. The objective function considers a length beam of 5200 cm, a design load of 600 KN, and an elastic modulus of 523,104 KN/cm2 [54].
F = 5000 I 1 I 4 3 6 + I 3 ( I 2 2 I 4 ) 3 12 + 2 I 1 I 4 ( I 2 I 4 2 ) 2 C 1 = 2 I 1 I 3 + I 3 ( I 2 2 I 4 ) 300 C 2 = 18 I 2 * 10 4 I 3 ( I 2 2 I 4 ) 3 + 2 I 1 I 3 ( 4 I 4 2 + 3 I 2 ( I 2 2 I 4 ) ) + 15 I 1 * 10 3 ( I 2 2 I 4 ) I 3 3 + 2 I 1 3 I 3
where
10 I 1 50 , 10 I 2 80 , 0.9 I 3 5 , 0.9 I 4 5

7.6. Gear Train Design

The gear system design problem is a discrete unconstrained optimization problem with the goal of minimizing the cost of the gear transmission ratio. To solve this problem, it is necessary to optimize four integer design variables, g1, g2, g3, and g4, each representing the number of teeth of four different gears. The structural schematic diagram of the wheel system design problem is shown in Figure 12.
The objective function is:
F = ( 1 6.931 g 1 g 3 g 2 g 4 )
where
12 g 1 , g 2 , g 3 , g 4 60
Through the calculation results of six typical engineering optimization problems, it can be seen that QMESSA has advantages in engineering optimization problems, and IBSSA has significant advantages in handling engineering optimization problems, which can reduce design costs.

8. Summary

In this study, a new algorithm (IBSSA) was proposed that combines the improved learning-based beetle antennae algorithm with the sparrow search algorithm. Due to the simple population initialization process of the basic sparrow search algorithm and its randomness in obtaining high-quality initial solutions, an elite dynamic opposite learning mechanism was proposed to obtain elite solutions from randomly generated initial solutions, thus improving the quality of initial solutions. It is beneficial for the discoverers of sparrow algorithms to develop. At the same time, the development process of the sparrow search algorithm was further strengthened through a phased guidance mechanism. Finally, the improved beetle antennae algorithm was integrated with the sparrow’s vigilante update through logarithmic spiral opposition-based learning. Through a greedy strategy, combined with the improved global optimization performance of the beetle antennae algorithm, the development and exploration performance of the sparrow search algorithm are ensured. When the sparrow search algorithm falls into a local optimum, it can be improved by using the beetle antennae algorithm to jump out of the local optimum, which is conducive to achieving a balance between development and exploration through local optimization. This algorithm optimizes the basic sparrow search algorithm from both global search and local collaborative search. These three strategies can simultaneously improve the global and local optimization performance of the sparrow search algorithm. Considering that original dynamic opposite learning is a dynamic process for the entire population of particles, there will also be poorly randomized particles. Through the operation of elite opposite learning, not only can the elite particles in the original initialization process solution be obtained, but also the randomness of these elite particles can be further improved through the dynamic process, thus obtaining a wider range of solutions and improving the development performance of the algorithm. The proposal of a phased guidance mechanism takes into account the need for a stable transition in the development process of the discoverer in the sparrow search algorithm. In the early stage, due to the existence of local solutions, it is manifested as a larger parameter value to obtain better global solutions. In the mid-term, it should ensure a stable transition from development to local parts of the algorithm, achieving a balance between development and exploration. Therefore, the parameter value shows a linear decreasing trend. In the later stages of algorithm iteration, more emphasis should be placed on local development of the algorithm and improving the search speed. The logarithmic spiral opposition-based learning strategy obtains the position of particles near the optimal value and combines it with the beetle antennae algorithm to purposefully search for the optimal value in a smaller range, thus preventing the algorithm from falling into local optima. And, it greedily integrates with the vigilance update method of the sparrow population, further improving the overall algorithm optimization accuracy without affecting the performance of the sparrow search algorithm itself. In order to verify the overall performance of IBSSA, it was benchmark-tested with nine advanced algorithms, and we further discussed its performance characteristics using the Wilcoxon rank sum test. In order to break away from the algorithm’s dependence on zero points, IBSSA was tested with nine advanced algorithms in CEC2017, and its performance was further verified through the Wilcoxon rank sum test. Two sets of experiments have shown that IBSSA outperforms other comparative algorithms in terms of convergence accuracy, stability, and other aspects. Finally, the robustness and applicability of IBSSA were verified through six basic engineering applications, further demonstrating its good performance and reducing design costs in practical engineering applications.
However, for multi-dimensional optimization problems, the optimization performance of IBSSA may slightly decrease. IBSSA cannot maintain good performance like it does with low-dimensional problems, so it cannot guarantee good optimization performance when facing multi-objective optimization problems and high-dimensional problems. This is also a problem that needs to be considered in the future. With the continuous development of the field of artificial intelligence, multi-dimensional and multi-objective optimization problems will be the mainstream problems in the field of evolutionary algorithms, so the future work will be to further modify and improve the existing single-objective optimization IBSSA, which can give it good multi-objective optimization performance, and apply it to more application scenarios to deal with complex optimization problems. And, by conducting more detailed analysis on higher-dimensional test functions (such as 100 or 1000 dimensions), the results of the 10-, 30-, and 50-dimensional test functions represent a part of the performance of the improved algorithm. Considering the special needs of high-dimensional optimization problems, we plan to expand the experimental scope in future research to cover higher-dimensional test problems and further verify the performance of the algorithm in these high-dimensional problems.

Author Contributions

Conceptualization, C.Y. and D.Z.; methodology, X.Z. and D.Z.; software, C.Y. and D.Z.; validation, X.Z.; formal analysis, Y.L.; investigation, C.Y. and X.Z.; resources, X.Z.; data curation, X.Z.; writing—original draft preparation, C.Y.; writing—review and editing, C.Y. and X.Z.; visualization, C.Y. and D.Z.; project administration, X.Z.; funding acquisition, X.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This work is supported by the University–Industry Collaborative Education Program: Design and Practice of “Data Visualization” Course Based on Blended Teaching Mode (Project Number: 230710174707184).

Institutional Review Board Statement

Not applicable.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest. The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript; or in the decision to publish the results.

References

  1. Pepelyshev, A.; Zhigljavsky, A.; Žilinskas, A. Performance of global random search algorithms for large dimensions. J. Glob. Optim. 2018, 71, 57–71. [Google Scholar] [CrossRef]
  2. Bullock, G.N.; Denham, M.J.; Parmee, I.C.; Wade, J.G. Developments in the use of the genetic algorithm in engineering design. Des. Stud. 1995, 16, 507–524. [Google Scholar] [CrossRef]
  3. Gajpal, Y.; Rajendran, C. An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops. Int. J. Prod. Econ. 2006, 101, 259–272. [Google Scholar] [CrossRef]
  4. Fang, H.; Chen, L.; Shen, Z. Application of an improved PSO algorithm to optimal tuning of PID gains for water turbine governor. Energy Convers. Manag. 2011, 52, 1763–1770. [Google Scholar] [CrossRef]
  5. Niculescu, S.P. Artificial neural networks and genetic algorithms in QSAR. J. Mol. Struct. THEOCHEM 2003, 622, 71–83. [Google Scholar] [CrossRef]
  6. Kumru, M. Assessing the visual quality of sanitary ware by fuzzy logic. Appl. Soft Comput. 2013, 13, 3646–3656. [Google Scholar] [CrossRef]
  7. Peng, F.; Cui, G. Efficient simultaneous synthesis for heat exchanger network with simulated annealing algorithm. Appl. Therm. Eng. 2015, 78, 136–149. [Google Scholar] [CrossRef]
  8. Zhu, D.; Wang, S.; Huang, Z.; Zhou, C.; Zhang, L. A JAYA algorithm based on normal clouds for DNA sequence optimization. Clust. Comput. 2023, 27, 2133–2149. [Google Scholar] [CrossRef]
  9. Zhu, D.; Wang, S.; Zhou, C.; Yan, S. Manta ray foraging optimization based on mechanics game and progressive learning for multiple optimization problems. Appl. Soft Comput. 2023, 145, 110561. [Google Scholar] [CrossRef]
  10. Rambabu, D.; Govardhan, A. Optimization assisted frequent pattern mining for data replication in cloud: Combining sealion and grey wolf algorithm. Adv. Eng. Softw. 2023, 176, 103401. [Google Scholar]
  11. Zhang, Y.; Hou, X. Application of video image processing in sports action recognition based on particle swarm optimization algorithm. Prev. Med. 2023, 173, 107592. [Google Scholar] [CrossRef]
  12. Fahmy, H.; El-Gendy, E.M.; Mohamed, M.A.; Saafan, M.M. ECH3OA: An Enhanced Chimp-Harris Hawks Optimization Algorithm for copyright protection in Color Images using watermarking techniques. Knowl. Based Syst. 2023, 269, 110494. [Google Scholar] [CrossRef]
  13. Zhang, F.; Deng, S.; Zhao, H.; Liu, X. A new hybrid method based on sparrow search algorithm optimized extreme learning machine for brittleness evaluation. J. Appl. Geophys. 2022, 207, 104845. [Google Scholar] [CrossRef]
  14. Zhu, D.; Huang, Z.; Liao, S.; Zhou, C.; Yan, S.; Chen, G. Improved Bare Bones Particle Swarm Optimization for DNA Sequence Design. IEEE Trans. NanoBiosci. 2023, 22, 603–613. [Google Scholar] [CrossRef] [PubMed]
  15. Zhang, E.; Nie, Z.; Yang, Q.; Wang, Y.; Liu, D.; Jeon, S.; Zhang, J. Heterogeneous cognitive learning particle swarm optimization for large-scale optimization problems. Inf. Sci. 2023, 633, 321–342. [Google Scholar] [CrossRef]
  16. Sui, F.; Tang, X.; Dong, H.; Gen, X.; Luo, P.; Sun, J. ACO+PSO+A*: A bi-layer hybrid algorithm for multi-task path planning of an AUV. Comput. Ind. Eng. 2023, 175, 108905. [Google Scholar] [CrossRef]
  17. Wang, Y.; Gao, D.; Wang, X. Shortest Path Planning Based on Improved Ant Colony Algorithm. ASP Trans. Comput. 2021, 1, 6–11. [Google Scholar]
  18. Alsattar, H.A.; Zaidan, A.A.; Zaidan, B.B. Novel meta-heuristic bald eagle search optimisation algorithm. Artif. Intell. Rev. 2020, 53, 2237–2264. [Google Scholar] [CrossRef]
  19. Abualigah, L.; Diabat, A.; Mirjalili, S.; Elaziz, M.; Gondomi, A. The Arithmetic Optimization Algorithm. Comput. Methods Appl. Mech. Eng. 2021, 376, 113609. [Google Scholar] [CrossRef]
  20. Saremi, S.; Mirjalili, S.; Lewis, A. Grasshopper Optimisation Algorithm: Theory and application. Adv. Eng. Softw. 2017, 105, 30–47. [Google Scholar] [CrossRef]
  21. Tubishat, M.; Alswaitti, M.; Mirjalili, S.; Al-Garadi, M.; Alrashdan, M.T.; Rana, T.A. Dynamic Butterfly Optimization Algorithm for Feature Selection. IEEE Access 2020, 8, 194303–194314. [Google Scholar] [CrossRef]
  22. Pan, J.; Lv, J.; Yan, L.; Weng, S.; Chu, S.; Xue, J. Golden eagle optimizer with double learning strategies for 3D path planning of UAV in power inspection. Math. Comput. Simul. 2022, 193, 509–532. [Google Scholar] [CrossRef]
  23. Xue, J.; Shen, B. A novel swarm intelligence optimization approach: Sparrow search algorithm. Sci. Control Eng. 2020, 8, 22–34. [Google Scholar] [CrossRef]
  24. Wang, Z.; Sun, G.; Zhou, K.; Zhu, L. A parallel particle swarm optimization and enhanced sparrow search algorithm for unmanned aerial vehicle path planning. Heliyon 2023, 9, 14784. [Google Scholar] [CrossRef]
  25. Zheng, F.; Liu, G. An Adaptive Sinusoidal-Disturbance-Strategy Sparrow Search Algorithm and Its Application. Sensors 2022, 22, 8787. [Google Scholar] [CrossRef]
  26. Huang, Z.; Zhu, D.; Liu, Y.; Wang, X. Multi-strategy sparrow search algorithm with non-uniform mutation. Syst. Sci. Control Eng. 2022, 10, 936–954. [Google Scholar] [CrossRef]
  27. Sun, H.; Wang, J.; Chen, C.; Li, Z.; Li, J. ISSA-ELM: A Network Security Situation Prediction Model. Electronics 2023, 12, 25. [Google Scholar] [CrossRef]
  28. Xue, Z.; Yu, J.; Zhao, A.; Zhong, Y.; Yang, S.; Wang, M. Optimal chiller loading by improved sparrow search algorithm for saving energy consumption. J. Build. Eng. 2023, 67, 105980. [Google Scholar] [CrossRef]
  29. Liu, R.; Mo, Y. Performance of a Novel Enhanced Sparrow Search Algorithm for Engineering Design Process: Coverage Optimization in Wireless Sensor Network. Processes 2022, 10, 1691. [Google Scholar] [CrossRef]
  30. Zhang, G.; Zhang, E. An improved sparrow search based intelligent navigational algorithm for local path planning of mobile robot. J. Ambient. Intell. Humaniz. Comput. 2022, 14, 14111–14123. [Google Scholar] [CrossRef]
  31. Wu, H.; Zhang, A.; Han, Y.; Nan, J.; Li, K. Fast stochastic configuration network based on an improved sparrow search algorithm for fire flame recognition. Knowl. Based Syst. 2022, 245, 108626. [Google Scholar] [CrossRef]
  32. Liu, J.; Wang, Z. A Hybrid Sparrow Search Algorithm Based on Constructing Similarity. IEEE Access 2021, 9, 117581–117595. [Google Scholar]
  33. Gao, B.; Shen, W.; Guan, H.; Zheng, L.; Zhang, W. Research on Multistrategy Improved Evolutionary Sparrow Search Algorithm and its Application. IEEE Access 2022, 10, 62520–62534. [Google Scholar] [CrossRef]
  34. Liu, G.; Shu, C.; Liang, Z.; Liang, Z.; Peng, B.; Cheng, L. A Modified Sparrow Search Algorithm with Application in 3d Route Planning for UAV. Sensors 2021, 21, 1224. [Google Scholar] [CrossRef] [PubMed]
  35. Wang, Z.; Huang, X.; Zhu, D. A Multistrategy-Integrated Learning Sparrow Search Algorithm and Optimization of Engineering Problems. Comput. Intell. Neurosci. 2022, 2022, 2475460. [Google Scholar] [CrossRef]
  36. Wolpert, D.H.; Macready, W.G. No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1997, 1, 67–82. [Google Scholar] [CrossRef]
  37. Žilinskas, A.; Calvin, J. Bi-objective decision making in global optimization based on statistical models. J. Glob. Optim. 2019, 74, 599–609. [Google Scholar] [CrossRef]
  38. Xu, Y.; Yang, Z.; Li, X.; Kang, H.; Yang, X. Dynamic opposite learning enhanced teaching–learning-based optimization. Knowl. Based Syst. 2020, 188, 104966. [Google Scholar] [CrossRef]
  39. Zhang, X.; Zhou, K.; Li, P. An Improved Chaos Sparrow Search Optimization Algorithm Using Adaptive Weight Modification and Hybrid Strategies. IEEE Access 2020, 10, 96159–96179. [Google Scholar] [CrossRef]
  40. Faramarzi, A.; Heidarinejad, M.; Stephens, B. Equilibrium optimizer: A novel optimization algorithm. Knowl. Based Syst. 2020, 191, 105190. [Google Scholar] [CrossRef]
  41. Izci, D.; Ekinci, S.; Eker, E.; Kayri, M. Augmented hunger games search algorithm using logarithmic spiral opposition-based learning for function optimization and controller design. J. King Saud Univ. Eng. Sci. 2022, in press, corrected proof. [Google Scholar] [CrossRef]
  42. Jiang, X.; Li, S. BAS: Beetle Antennae Search Algorithm for Optimization Problems. arXiv 2017, arXiv:1710.10724. [Google Scholar] [CrossRef]
  43. Ouyang, C.; Zhu, D.; Wang, F. A Learning Sparrow Search Algorithm. Comput. Intell. Neurosci. 2021, 2021, 23. [Google Scholar] [CrossRef] [PubMed]
  44. Liu, C.; Huang, Y. Short term photovoltaic power prediction based on BP neural network optimized by improved sparrow search algorithm. In Proceedings of the 2022 4th International Academic Exchange Conference on Science and Technology Innovation (IAECST), Guangzhou, China, 9–11 December 2022; IEEE: Piscataway, NJ, USA, 2022; pp. 314–317. [Google Scholar]
  45. Mirjalili, S.; Lewis, A. Adaptive gbest-guided gravitational search algorithm. Neural Comput. Appl. 2014, 25, 1569–1584. [Google Scholar] [CrossRef]
  46. Mohammad, H.; Nadimi, S.; Shokooh, T. An improved grey wolf optimizer for solving engineering problems. Expert Syst. Appl. 2021, 166, 113917. [Google Scholar]
  47. Xue, J.; Shen, B. Dung beetle optimizer: A new meta-heuristic algorithm for global optimization. J. Supercomput. 2023, 79, 7305–7336. [Google Scholar] [CrossRef]
  48. Mirjalili, S.; Lewis, A. The Whale Optimization Algorithm. Adv. Eng. Softw. 2014, 95, 51–67. [Google Scholar] [CrossRef]
  49. Mirjalili, S. SCA: A Sine Cosine Algorithm for solving optimization problems. Knowl. Based Syst. 2016, 96, 120–133. [Google Scholar] [CrossRef]
  50. Wu, R.; Huang, H.; Wei, J. An improved sparrow search algorithm based on quantum computations and multi-strategy enhancement. Expert Syst. Appl. 2023, 215, 119421. [Google Scholar] [CrossRef]
  51. Naik, M.K.; Panda, R.; Wunnava, A. A leader Harris hawks optimization for 2-D Masi entropy-based multilevel image thresholding. Multimed. Tools Appl. 2021, 80, 35543–35583. [Google Scholar] [CrossRef]
  52. Trojovský, P.; Dehghani, M. Pelican Optimization Algorithm: A Novel Nature-Inspired Algorithm for Engineering Applications. Sensors 2022, 22, 855. [Google Scholar] [CrossRef] [PubMed]
  53. Oszust, M. Enhanced Marine Predators Algorithm with Local Escaping Operator for Global Optimization. Knowl. Based Syst. 2021, 232, 107467. [Google Scholar] [CrossRef]
  54. Minocha, S.; Singh, B. A novel equilibrium optimizer based on levy flight and iterative cosine operator for engineering optimization problems. Expert Syst. 2022, 39, e12843. [Google Scholar] [CrossRef]
Figure 1. The stage-by-stage inertia weight curves in this paper and study [39]. The staged control proposed in this paper (a). The staged control (b) that appeared in literature [39].
Figure 1. The stage-by-stage inertia weight curves in this paper and study [39]. The staged control proposed in this paper (a). The staged control (b) that appeared in literature [39].
Electronics 13 02839 g001
Figure 2. Schematic diagram of logarithmic spiral opposition-based learning.
Figure 2. Schematic diagram of logarithmic spiral opposition-based learning.
Electronics 13 02839 g002
Figure 3. Schematic diagram of the bionic algorithm of the beetle antennae.
Figure 3. Schematic diagram of the bionic algorithm of the beetle antennae.
Electronics 13 02839 g003
Figure 4. IBSSA flowchart.
Figure 4. IBSSA flowchart.
Electronics 13 02839 g004
Figure 5. Convergence graph of IBSSA and the other 9 algorithms on the CEC2017 (dim = 30) test suite.
Figure 5. Convergence graph of IBSSA and the other 9 algorithms on the CEC2017 (dim = 30) test suite.
Electronics 13 02839 g005aElectronics 13 02839 g005bElectronics 13 02839 g005cElectronics 13 02839 g005d
Figure 6. Box plot of IBSSA and the other 9 algorithms on the CEC2017 (dim = 30) test suite.
Figure 6. Box plot of IBSSA and the other 9 algorithms on the CEC2017 (dim = 30) test suite.
Electronics 13 02839 g006aElectronics 13 02839 g006bElectronics 13 02839 g006cElectronics 13 02839 g006dElectronics 13 02839 g006e
Figure 7. Schematic diagram of three truss problems.
Figure 7. Schematic diagram of three truss problems.
Electronics 13 02839 g007
Figure 8. Schematic diagram of WBD problem.
Figure 8. Schematic diagram of WBD problem.
Electronics 13 02839 g008
Figure 9. Schematic diagram of CSD problems.
Figure 9. Schematic diagram of CSD problems.
Electronics 13 02839 g009
Figure 10. Schematic diagram of PVD problems.
Figure 10. Schematic diagram of PVD problems.
Electronics 13 02839 g010
Figure 11. Schematic diagram of I-beam design problem.
Figure 11. Schematic diagram of I-beam design problem.
Electronics 13 02839 g011
Figure 12. Schematic diagram of gear train design problem.
Figure 12. Schematic diagram of gear train design problem.
Electronics 13 02839 g012
Table 1. Parameter settings of each algorithm.
Table 1. Parameter settings of each algorithm.
AlgorithmParameter Settings
SSA P D = 0.2 , S T = 0.8 , S D = 0.2
LSSA P D = 0.2 , S T = 0.8 , S D = 0.2
TSSA P D = 0.2 , S T = 0.8 , S D = 0.2
GGSA α = 20
IGWO a max = 2 , a min = 0
DBO k = 0.1 , λ = 0.1 , b = 0.3 , S = 0.5
WOA a = 2 0
SCA a = 2
BAS η = 0.95 , d 0 = 5
IBSSA P D = 0.2 , S T = 0.8 , S D = 0.2
Table 2. Twenty benchmark functions.
Table 2. Twenty benchmark functions.
FormulaDimRangeMin
f 1 ( x ) = i = 1 n x i 2 30 [ 100 , 100 ] 0
f 2 ( x ) = i = 1 n | x i | + i = 1 n | x i | 30 [ 10 , 10 ] 0
f 3 ( x ) = i = 1 n j = 1 i x j 2 30 [ 100 , 100 ] 0
f 4 ( x ) = m a x i | x i | , 1 i n 30 [ 100 , 100 ] 0
f 5 ( x ) = i = 1 n 1 [ 100 ( x i + 1 x i 2 ) 2 + ( x i 1 ) 2 ] 30 [ 30 , 30 ] 0
f 6 ( x ) = i = 1 n ( [ x i + 0.5 ] ) 2 30 [ 100 , 100 ] 0
f 7 ( x ) = i = 1 n i x i 4 + r a n d o m [ 0 , 1 ) 30 [ 1.28 , 1.28 ] 0
f 8 ( x ) = i = 1 n x i sin ( | x i | ) 30 [ 500 , 500 ] −12569.5
f 9 ( x ) = i = 1 n [ x i 2 10 cos ( 2 π x i ) + 10 ] 30 [ 5.12 , 5.12 ] 0
f 10 ( x ) = 20 exp ( 0.2 1 n i = 1 n x i 2 ) exp ( 1 n i = 1 n cos ( 2 π x i ) ) + 20 + e 30 [ 32 , 32 ] 0
f 11 ( x ) = 1 4000 i = 1 n x i 2 i = 1 n cos ( x i i ) + 1 30 [ 600 , 600 ] 0
f 12 ( x ) = π n 10 sin ( π y 1 ) + i = 1 n 1 ( y i 1 ) 2 [ 1 + 10 sin 2 ( π y i + 1 ) ] + ( y n 1 ) 2   + i = 1 n u ( x i , 10 , 100 , 4 )
y i = 1 + x i + 1 4 u ( x i , a , k , m ) = k ( x i a ) m x i > a 0 a < x i < a k ( x i a ) m x i < a
30 [ 50 , 50 ] 0
f 13 ( x ) = 0.1 sin 2 ( 3 π x 1 ) + i = 1 n ( x i 1 ) 2 [ 1 + sin 2 ( 3 π x i + 1 ) ]   + ( x n 1 ) 2 [ 1 + sin 2 ( 2 π x n ) ] + i = 1 n u ( x i , 5 , 100 , 4 ) 30 [ 50 , 50 ] 0
f 14 ( x ) = ( 1 500 + j = 1 25 1 j + i = 1 2 ( x i a i j ) 6 ) 1 2 [ 65 , 65 ] 0.998
f 15 ( x ) = i = 1 11 [ a i x 1 ( b i 2 + b i x 2 ) b i 2 + b i x 3 + x 4 ] 2 4 [ 5 , 5 ] 0.0003075
f 16 ( x ) = 4 x 1 2 2.1 x 1 4 + 1 3 x 1 6 + x 1 x 2 4 x 2 2 + 4 x 2 4 2 [ 5 , 5 ] 1.0316
f 17 ( x ) = ( x 2 5.1 4 π 2 x 1 2 + 5 π x 1 6 ) 2 + 10 ( 1 1 8 π ) cos x 1 + 10 2 [ 5 , 5 ] 0.398
f 18 ( x ) = [ 1 + ( x 1 + x 2 + 1 ) 2 ( 19 14 x 1 + 3 x 1 2 14 x 2 + 6 x 1 x 2 + 3 x 2 2 ) ]   × [ 30 + ( 2 x 1 3 x 2 ) 2 × ( 18 32 x 1 + 12 x 1 2 + 48 x 2 36 x 1 x 2 + 27 x 2 2 ) ] 2 [ 2 , 2 ] 3
f 19 ( x ) = i = 1 4 c i exp ( j = 1 3 a i j ( x j p i j ) 2 ) 3 [ 1 , 3 ] 3.86
f 20 ( x ) = i = 1 4 c i exp ( j = 1 6 a i j ( x j p i j ) 2 ) 6 [ 0 , 1 ] 3.32
Table 3. Experimental test data of IBSSA and each algorithm.
Table 3. Experimental test data of IBSSA and each algorithm.
FIndexSSALSSATSSAGGSAIGWODBOWOASCABASIBSSA
Min7.295 × 10−2470.000 × 10+004.961 × 10−3186.311 × 10−192.532 × 10−562.380 × 10−3923.664 × 10−1333.592 × 10−064.084 × 10+040.000 × 10+00
F1Mean1.534 × 10−724.800 × 10−2824.870 × 10−702.712 × 10−188.070 × 10−533.152 × 10−2418.572 × 10−1082.088 × 10−025.330 × 10+040.000 × 10+00
Std8.400 × 10−720.000 × 10+002.666 × 10−691.586 × 10−182.978 × 10−520.000 × 10+004.691 × 10−1077.788 × 10−025.564 × 10+030.000 × 10+00
P1.212 × 10−121.166 × 10−011.567 × 10−121.212 × 10−121.212 × 10−121.212 × 10−121.212 × 10−121.212 × 10−121.212 × 10−12
Min1.140 × 10−815.291 × 10−2536.168 × 10−703.611 × 10−097.415 × 10−331.422 × 10−1521.515 × 10−1312.918 × 10−071.112 × 10+020.000 × 10+00
F2Mean2.242 × 10−404.068 × 10−1626.708 × 10−401.046 × 10−082.463 × 10−312.589 × 10−1211.302 × 10−1073.231 × 10−051.297 × 10+020.000 × 10+00
Std1.164 × 10−392.223 × 10−1612.545 × 10−399.405 × 10−093.531 × 10−311.411 × 10−1206.815 × 10−1071.141 × 10−041.035 × 10+010.000 × 10+00
P1.212 × 10−121.212 × 10−121.212 × 10−121.212 × 10−121.212 × 10−121.212 × 10−121.212 × 10−121.212 × 10−121.212 × 10−12
Min6.104 × 10−940.000 × 10+008.836 × 10−2961.965 × 10+021.417 × 10−171.034 × 10−2757.990 × 10+034.137 × 10+013.866 × 10+040.000 × 10+00
F3Mean2.643 × 10−364.297 × 10−2791.926 × 10−364.084 × 10+026.274 × 10−137.370 × 10−1112.685 × 10+043.706 × 10+037.076 × 10+040.000 × 10+00
Std8.461 × 10−30.000 × 10+008.692 × 10−361.484 × 10+021.916 × 10−124.037 × 10−1109.612 × 10+034.501 × 10+032.006 × 10+040.000 × 10+00
P1.212 × 10−123.255 × 10−011.212 × 10−121.212 × 10−121.212 × 10−121.212 × 10−121.212 × 10−121.212 × 10−121.212 × 10−12
Min1.200 × 10−1736.614 × 10−2244.40 × 10−2485.144 × 10−091.369 × 10−151.025 × 10−1517.487 × 10−052.278 × 10+006.240 × 10+010.000 × 10+00
F4Mean3.836 × 10−351.120 × 10−1461.374 × 10−321.310 × 10+002.132 × 10−142.480 × 10−1112.675 × 10+012.221 × 10+017.343 × 10+010.000 × 10+00
Std2.030 × 10−346.133 × 10−1467.526 × 10−329.926 × 10−012.839 × 10−141.226 × 10−1102.712 × 10+011.357 × 10+014.284 × 10+000.000 × 10+00
P1.212 × 10−121.212 × 10−121.212 × 10−121.212 × 10−121.212 × 10−121.212 × 10−121.212 × 10−121.212 × 10−121.212 × 10−12
Min3.832 × 10−104.167 × 10−112.586 × 10−112.521 × 10+012.527 × 10+012.473 × 10+012.624 × 10+012.784 × 10+013.243 × 10+072.146 × 10−17
F5Mean8.214 × 10−062.227 × 10−068.934 × 10−063.132 × 10+012.684 × 10+012.496 × 10+012.794 × 10+017.759 × 10+025.619 × 10+076.141 × 10−06
Std1.993 × 10−051.069 × 10−052.229 × 10−052.114 × 10+018.309 × 10−011.353 × 10−017.924 × 10−011.345 × 10−031.420 × 10+071.856 × 10−05
P2.921 × 10−028.303 × 10−013.778 × 10−023.020 × 10−113.020 × 10−113.020 × 10−113.020 × 10−113.020 × 10−113.020 × 10−11
Min9.762 × 10−223.663 × 10−213.433 × 10−245.240 × 10−194.494 × 10−083.226 × 10−112.953 × 10−013.922 × 10+003.615 × 10+044.376 × 10−31
F6Mean1.253 × 10−184.516 × 10−183.931 × 10−192.549 × 10−185.668 × 10−012.391 × 10−081.518 × 10+004.743 × 10+005.289 × 10+042.184 × 10−20
Std4.229 × 10−181.274 × 10−171.286 × 10−181.950 × 10−183.543 × 10−017.112 × 10−089.205 × 10−017.638 × 10−015.835 × 10+035.721 × 10−20
P9.514 × 10−064.616 × 10−108.684 × 10−033.020 × 10−113.020 × 10−113.020 × 10−113.020 × 10−113.020 × 10−113.020 × 10−11
Min1.054 × 10−043.194 × 10−054.249 × 10−052.186 × 10−021.867 × 10−046.751 × 10−051.212 × 10−043.284 × 10−037.473 × 10+022.258 × 10−05
F7Mean1.172 × 10−034.322 × 10−041.131 × 10−033.387 × 10−018.085 × 10−047.676 × 10−043.753 × 10−032.357 × 10−021.178 × 10+024.140 × 10−04
Std7.640 × 10−043.607 × 10−049.135 × 10−041.084 × 10+004.436 × 10−045.452 × 10−043.776 × 10−031.736 × 10−022.517 × 10+013.758 × 10−04
P1.635 × 10−056.952 × 10−011.681 × 10−043.020 × 10−111.585 × 10−044.856 × 10−034.311 × 10−083.020 × 10−113.020 × 10−11
Min−9.895 × 10+03−1.257 × 10+04−1.045 × 10+04−3.862 × 10+03−7.606 × 10+03−1.257 × 10+04−1.168 × 10+04−4.356 × 10+03−4.112 × 10+03−1.257 × 10+04
F8Mean−8.895 × 10+03−1.123 × 10+04−8.888 × 10+03−2.853 × 10+03−6.118 × 10+03−9.317 × 10+03−8.737 × 10+03−3.886 × 10+03−2.930 × 10+03−8.501 × 10+03
Std6.764 × 10+021.507 × 10+037.575 × 10+024.919 × 10+026.877 × 10+022.064 × 10+039.324 × 10+022.624 × 10+025.443 × 10+021.935 × 10+03
P9.823 × 10−017.600 × 10−053.183 × 10−013.020 × 10−112.154 × 10−064.376 × 10−018.650 × 10−013.020 × 10−113.020 × 10−11
Min0.000 × 10+000.000 × 10+000.000 × 10+001.990 × 10+010.000 × 10+000.000 × 10+000.000 × 10+004.089 × 10−053.871 × 10+020.000 × 10+00
F9Mean0.000 × 10+000.000 × 10+000.000 × 10+003.333 × 10+011.541 × 10−013.350 × 10+002.102 × 10−011.959 × 10+014.411 × 10+020.000 × 10+00
Std0.000 × 10+000.000 × 10+000.000 × 10+001.018 × 10+018.440 × 10−011.835 × 10−011.151 × 10+002.196 × 10+012.193 × 10+010.000 × 10+00
P NaN NaN NaN 1.212 × 10−124.187 × 10−023.337 × 10−013.337 × 10−011.212 × 10−121.212 × 10−12
Min8.882 × 10−168.882 × 10−168.882 × 10−164.369 × 10−107.994 × 10−158.882 × 10−168.882 × 10−162.602 × 10−041.926 × 10+018.882 × 10−16
F10Mean8.882 × 10−168.882 × 10−168.882 × 10−161.258 × 10−091.332 × 10−141.125 × 10−154.204 × 10−151.463 × 10+011.969 × 10+018.882 × 10−16
Std0.000 × 10+000.000 × 10+000.000 × 10+004.557 × 10−102.913 × 10−159.014 × 10−161.598 × 10−158.554 × 10+001.803 × 10−010.000 × 10+00
P NaN NaN NaN 1.212 × 10−123.121 × 10−131.607 × 10−013.387 × 10−111.212 × 10−121.212 × 10−12
Min0.000 × 10+000.000 × 10+000.000 × 10+004.229 × 10+000.000 × 10+000.000 × 10+000.000 × 10+003.580 × 10−064.403 × 10+020.000 × 10+00
F11Mean0.000 × 10+000.000 × 10+000.000 × 10+007.66 × 10+002.384 × 10−033.442 × 10−032.270 × 10−032.560 × 10−015.866 × 10+020.000 × 10+00
Std0.000 × 10+000.000 × 10+000.000 × 10+002.411 × 10+006.452 × 10−031.460 × 10−021.243 × 10−022.232 × 10−017.500 × 10+010.000 × 10+00
P NaN NaN NaN 1.212 × 10−124.193 × 10−021.608 × 10−013.337 × 10−011.212 × 10−121.212 × 10−12
Min1.676 × 10−232.790 × 10−244.687 × 10−235.542 × 10−216.650 × 10−035.661 × 10−136.802 × 10−033.773 × 10−016.963 × 10+072.757 × 10−25
F12Mean4.209 × 10−203.750 × 10−201.288 × 10−191.590 × 10−014.023 × 10−029.573 × 10−062.876 × 10−011.211 × 10+001.343 × 10+078.570 × 10−21
Std1.512 × 10−191.376 × 10−193.145 × 10−193.067 × 10−012.134 × 10−025.243 × 10−051.048 × 10+001.137 × 10+004.727 × 10+072.273 × 10−20
P1.335 × 10−015.298 × 10−014.427 × 10−031.691 × 10−093.020 × 10−113.020 × 10−113.020 × 10−113.020 × 10−113.020 × 10−11
Min1.482 × 10−231.825 × 10−227.868 × 10−244.822 × 10−202.855 × 10−011.070 × 10−084.625 × 10−011.923 × 10+001.864 × 10+082.220 × 10−26
F13Mean2.170 × 10−185.353 × 10−198.000 × 10−191.156 × 10−015.411 × 10−012.708 × 10−011.463 × 10+009.523 × 10+003.558 × 10+081.960 × 10−19
Std7.535 × 10−181.591 × 10−181.931 × 10−184.033 × 10−011.941 × 10−012.815 × 10−014.929 × 10−011.131 × 10+019.194 × 10+076.146 × 10−19
P3.387 × 10−021.188 × 10−017.959 × 10−031.248 × 10−073.020 × 10−113.020 × 10−113.020 × 10−113.020 × 10−113.020 × 10−11
Min9.980 × 10−019.980 × 10−019.980 × 10−019.980 × 10−019.980 × 10−019.980 × 10−019.980 × 10−019.980 × 10−019.980 × 10−019.980 × 10−01
F14Mean7.620 × 10+001.196 × 10+005.031 × 10+003.522 × 10+003.544 × 10+001.329 × 10+006.824 × 10+001.527 × 10+001.130 × 10+009.980 × 10−01
Std5.539 × 10+006.054 × 10−015.039 × 10+003.124 × 10+003.940 × 10+007.515 × 10−014.864 × 10+008.924 × 10−014.310 × 10−011.047 × 10−16
P1.211 × 10−078.149 × 10−022.880 × 10−055.392 × 10−094.376 × 10−121.102 × 10−024.488 × 10−121.212 × 10−122.157 × 10−02
Min3.074 × 10−043.074 × 10−043.074 × 10−047.212 × 10−043.074 × 10−043.074 × 10−043.110 × 10−043.672 × 10−041.026 × 10−033.074 × 10−04
F15Mean3.410 × 10−043.414 × 10−045.900 × 10−042.058 × 10−033.015 × 10−036.532 × 10−046.439 × 10−049.250 × 10−041.515 × 10−033.390 × 10−04
Std1.670 × 10−041.668 × 10−044.227 × 10−047.447 × 10−046.923 × 10−032.750 × 10−044.281 × 10−043.717 × 10−044.284 × 10−045.790 × 10−05
P4.129 × 10−019.941 × 10−015.365 × 10−012.928 × 10−116.632 × 10−031.657 × 10−081.077 × 10−081.171 × 10−102.928 × 10−11
Min−1.032 × 10+00−1.032 × 10+00−1.032 × 10+00−1.032 × 10+00−1.032 × 10+00−1.032 × 10+00−1.032 × 10+00−1.032 × 10+00−1.032 × 10+00−1.032 × 10+00
F16Mean−1.032 × 10+00−1.032 × 10+00−1.032 × 10+00−1.032 × 10+00−1.022 × 10+00−1.032 × 10+00−1.032 × 10+00−1.032 × 10+00−1.032 × 10+00−1.032 × 10+00
Std5.454 × 10−165.758 × 10−165.975 × 10−165.904 × 10−164.838 × 10−026.253 × 10−163.203 × 10−122.740 × 10−055.532 × 10−165.454 × 10−16
P NaN NaN NaN NaN 1.212 × 10−12 NaN 1.698 × 10−081.212 × 10−12 NaN
Min3.978 × 10−013.978 × 10−013.978 × 10−013.978 × 10−013.978 × 10−013.978 × 10−013.978 × 10−013.978 × 10−013.978 × 10−013.978 × 10−01
F17Mean3.978 × 10−013.978 × 10−013.978 × 10−013.978 × 10−013.978 × 10−013.978 × 10−013.978 × 10−013.978 × 10−013.978 × 10−013.978 × 10−01
Std0.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+002.540 × 10−040.000 × 10+003.209 × 10−071.068 × 10−030.000 × 10+000.000 × 10+00
P NaN NaN NaN NaN 1.212 × 10−121.212 × 10−121.698 × 10−081.212 × 10−12 NaN
Min3.000 × 10+003.000 × 10+003.000 × 10+003.000 × 10+003.000 × 10+003.000 × 10+003.000 × 10+003.000 × 10+003.000 × 10+003.000 × 10+00
F18Mean3.900 × 10+004.800 × 10+004.800 × 10+003.000 × 10+003.000 × 10+003.000 × 10+003.000 × 10+003.000 × 10+003.000 × 10+003.000 × 10+00
Std4.930 × 10+006.850 × 10+006.850 × 10+002.154 × 10−159.722 × 10−062.511 × 10−152.564 × 10−036.819 × 10−055.555 × 10−155.539 × 10−04
P8.813 × 10−037.373 × 10−023.641 × 10−026.181 × 10−016.554 × 10−042.738 × 10−012.463 × 10−073.320 × 10−046.181 × 10−01
Min−3.863 × 10+00−3.863 × 10+00−3.863 × 10+00−3.863 × 10+00−3.863 × 10+00−3.863 × 10+00−3.863 × 10+00−3.863 × 10+00−3.863 × 10+00−3.863 × 10+00
F19Mean−3.837 × 10+00−3.863 × 10+00−3.863 × 10+00−3.863 × 10+00−3.863 × 10+00−3.863 × 10+00−3.863 × 10+00−3.855 × 10+00−3.370 × 10+00−3.863 × 10+00
Std1.411 × 10−012.319 × 10−152.297 × 10−152.987 × 10−032.852 × 10−033.391 × 10−037.821 × 10−031.935 × 10−034.295 × 10−012.279 × 10−15
P3.337 × 10−01 NaN NaN 2.150 × 10−021.212 × 10−125.466 × 10−031.212 × 10−121.212 × 10−121.212 × 10−12
Min−3.322 × 10+00−3.322 × 10+00−3.322 × 10+00−3.322 × 10+00−3.322 × 10+00−3.322 × 10+00−3.322 × 10+00−3.178 × 10+00−3.322 × 10+00−3.322 × 10+00
F20Mean−3.263 × 10+00−3.263 × 10+00−3.270 × 10+00−2.846 × 10+00−3.250 × 10+00−3.218 × 10+00−3.118 × 10+00−2.895 × 10+00−2.179 × 10+00−3.310 × 10+00
Std6.046 × 10−026.046 × 10−025.992 × 10−027.392 × 10−017.768 × 10−028.086 × 10−023.358 × 10−013.313 × 10−017.975 × 10−013.628 × 10−02
P8.287 × 10−048.287 × 10−043.911 × 10−048.925 × 10−053.542 × 10−103.044 × 10−061.940 × 10−103.151 × 10−121.603 × 10−11
Rank 4.453.0254.46.666.434.767.007.888.232.175
Table 4. IBSSA benchmark function ablation experiments.
Table 4. IBSSA benchmark function ablation experiments.
FIndexSSA1SSA2SSA3SSA4SSA5SSA6SSAIBSSA
Min0.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+007.295 × 10−2470.000 × 10+00
F1Mean6.916 × 10−780.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+001.534 × 10−720.000 × 10+00
Std3.788 × 10−770.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+008.400 × 10−720.000 × 10+00
Min0.000 × 10+001.324 × 10−1750.000 × 10+001.756 × 10−1780.000 × 10+000.000 × 10+001.140 × 10−810.000 × 10+00
F2Mean3.772 × 10−412.395 × 10−1650.000 × 10+008.243 × 10−1650.000 × 10+000.000 × 10+002.242 × 10−400.000 × 10+00
Std1.479 × 10−400.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+001.164 × 10−390.000 × 10+00
Min0.000 × 10+005.281 × 10−2510.000 × 10+008.040 × 10−2500.000 × 10+000.000 × 10+006.104 × 10−940.000 × 10+00
F3Mean4.485 × 10−347.600 × 10−2180.000 × 10+005.446 × 10−2230.000 × 10+000.000 × 10+002.643 × 10−360.000 × 10+00
Std2.456 × 10−330.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+008.461 × 10−30.000 × 10+00
Min0.000 × 10+003.649 × 10−1970.000 × 10+003.919 × 10−1880.000 × 10+000.000 × 10+001.200 × 10−1730.000 × 10+00
F4Mean7.182 × 10−383.473 × 10−1700.000 × 10+003.428 × 10−1690.000 × 10+000.000 × 10+003.836 × 10−350.000 × 10+00
Std3.425 × 10−370.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+002.030 × 10−340.000 × 10+00
Min7.826 × 10−126.460 × 10−122.544 × 10−115.227 × 10−141.814 × 10−122.242 × 10−123.832 × 10−102.146 × 10−17
F5Mean3.552 × 10−063.940 × 10−066.557 × 10−061.083 × 10−056.468 × 10−061.853 × 10−058.214 × 10−066.141 × 10−06
Std1.287 × 10−051.164 × 10−052.192 × 10−054.663 × 10−051.416 × 10−054.987 × 10−051.993 × 10−051.856 × 10−05
Min1.423 × 10−222.128 × 10−241.428 × 10−239.036 × 10−261.852 × 10−221.223 × 10−299.762 × 10−224.376 × 10−31
F6Mean3.567 × 10−192.468 × 10−195.370 × 10−191.903 × 10−192.160 × 10−191.886 × 10−191.253 × 10−182.184 × 10−20
Std7.836 × 10−191.100 × 10−181.565 × 10−189.263 × 10−194.501 × 10−196.537 × 10−194.229 × 10−185.721 × 10−20
Min1.389 × 10−043.948 × 10−053.651 × 10−051.981 × 10−055.188 × 10−059.341 × 10−051.054 × 10−042.258 × 10−05
F7Mean1.332 × 10−035.664 × 10−047.131 × 10−045.685 × 10−047.928 × 10−047.333 × 10−041.172 × 10−034.140 × 10−04
Std1.291 × 10−034.700 × 10−045.421 × 10−044.326 × 10−041.078 × 10−036.948 × 10−047.640 × 10−043.758 × 10−04
Min−1.023 × 10+04−1.002 × 10+04−1.017 × 10+04−9.320 × 10+03−1.257 × 10+04−1.257 × 10+04−9.895 × 10+03−1.257 × 10+04
F8Mean−8.614 × 10+03−8.530 × 10+03−8.145 × 10+03−8.600 × 10+03−7.935 × 10+03−8.537 × 10+03−8.895 × 10+03−8.501 × 10+03
Std7.127 × 10+025.780 × 10+021.484 × 10+034.565 × 10+021.675 × 10+031.779 × 10+036.764 × 10+021.935 × 10+03
Min0.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+00
F9Mean0.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+00
Std0.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+00
Min8.882 × 10−168.882 × 10−168.882 × 10−168.882 × 10−168.882 × 10−168.882 × 10−168.882 × 10−168.882 × 10−16
F10Mean8.882 × 10−161.243 × 10−158.882 × 10−161.480 × 10−158.882 × 10−168.882 × 10−168.882 × 10−168.882 × 10−16
Std0.000 × 10+001.084 × 10−150.000 × 10+001.347 × 10−150.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+00
Min0.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+00
F11Mean0.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+00
Std0.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+00
Min1.872 × 10−241.795 × 10−244.191 × 10−231.170 × 10−241.243 × 10−231.565 × 10−251.676 × 10−232.757 × 10−25
F12Mean1.091 × 10−191.285 × 10−201.074 × 10−192.937 × 10−204.523 × 10−191.875 × 10−204.209 × 10−208.570 × 10−21
Std3.058 × 10−193.336 × 10−203.112 × 10−191.323 × 10−192.175 × 10−185.416 × 10−201.512 × 10−192.273 × 10−20
Min5.684 × 10−237.261 × 10−258.581 × 10−253.297 × 10−243.386 × 10−232.240 × 10−231.482 × 10−232.220 × 10−26
F13Mean1.093 × 10−181.945 × 10−195.575 × 10−202.320 × 10−191.808 × 10−181.212 × 10−182.170 × 10−181.960 × 10−19
Std3.576 × 10−185.030 × 10−191.214 × 10−199.580 × 10−194.800 × 10−183.292 × 10−187.535 × 10−186.146 × 10−19
Min9.980 × 10−019.980 × 10−019.980 × 10−019.980 × 10−019.980 × 10−019.980 × 10−019.980 × 10−019.980 × 10−01
F14Mean5.075 × 10+003.274 × 10+001.378 × 10+005.354 × 10+001.914 × 10+001.987 × 10+007.620 × 10+009.980 × 10−01
Std5.252 × 10+004.344 × 10+001.798 × 10+005.205 × 10+002.500 × 10+002.673 × 10+005.539 × 10+001.047 × 10−16
Min3.074 × 10−043.074 × 10−043.074 × 10−043.074 × 10−043.074 × 10−043.074 × 10−043.074 × 10−043.074 × 10−04
F15Mean3.338 × 10−043.758 × 10−043.616 × 10−043.383 × 10−043.322 × 10−043.412 × 10−043.410 × 10−043.390 × 10−04
Std1.672 × 10−042.315 × 10−046.527 × 10−051.671 × 10−045.313 × 10−055.042 × 10−051.670 × 10−045.790 × 10−05
Min−1.032 × 10+00−1.032 × 10+00−1.032 × 10+00−1.032 × 10+00−1.032 × 10+00−1.032 × 10+00−1.032 × 10+00−1.032 × 10+00
F16Mean−1.032 × 10+00−1.032 × 10+00−1.032 × 10+00−1.032 × 10+00−1.032 × 10+00−1.032 × 10+00−1.032 × 10+00−1.032 × 10+00
Std5.608 × 10−165.831 × 10−165.296 × 10−165.216 × 10−165.532 × 10−165.376 × 10−165.454 × 10−165.454 × 10−16
Min3.978 × 10−013.978 × 10−013.978 × 10−013.978 × 10−013.978 × 10−013.978 × 10−013.978 × 10−013.978 × 10−01
F17Mean3.978 × 10−013.978 × 10−013.978 × 10−013.978 × 10−013.978 × 10−013.978 × 10−013.978 × 10−013.978 × 10−01
Std0.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+000.000 × 10+00
Min3.000 × 10+003.000 × 10+003.000 × 10+003.000 × 10+003.000 × 10+003.000 × 10+003.000 × 10+003.000 × 10+00
F18Mean3.900 × 10+003.900 × 10+003.900 × 10+003.900 × 10+003.000 × 10+003.000 × 10+003.900 × 10+003.000 × 10+00
Std4.930 × 10+003.900 × 10+004.918 × 10−043.900 × 10+001.074 × 10−043.642 × 10−033.900 × 10+005.539 × 10−04
Min−3.863 × 10+00−3.863 × 10+00−3.863 × 10+00−3.863 × 10+00−3.863 × 10+00−3.863 × 10+00−3.863 × 10+00−3.863 × 10+00
F19Mean−3.863 × 10+00−3.863 × 10+00−3.863 × 10+00−3.863 × 10+00−3.863 × 10+00−3.863 × 10+00−3.863 × 10+00−3.863 × 10+00
Std2.297 × 10−152.361 × 10−152.287 × 10−152.270 × 10−152.380 × 10−152.270 × 10−151.411 × 10−012.279 × 10−15
Min−3.322 × 10+00−3.322 × 10+00−3.322 × 10+00−3.322 × 10+00−3.322 × 10+00−3.322 × 10+00−3.322 × 10+00−3.322 × 10+00
F20Mean−3.282 × 10+00−3.267 × 10+00−3.282 × 10+00−3.298 × 10+00−3.301 × 10+00−3.278 × 10+00−3.263 × 10+00−3.310 × 10+00
Std5.700 × 10−026.033 × 10−025.700 × 10−024.837 × 10−026.010 × 10−025.827 × 10−026.046 × 10−023.628 × 10−02
Table 5. CEC2017 test data (dim = 10).
Table 5. CEC2017 test data (dim = 10).
FIndexBASAOAPOADBOLMHHOTSSAQMESSALSSASSAIBSSA
Ave9.616 × 10+095.622 × 10+063.221 × 10+075.187 × 10+031.370 × 10+094.143 × 10+031.040 × 10+034.778 × 10+034.013 × 10+034.903 × 10+02
F1Std4.748 × 10+092.529 × 10+071.075 × 10+083.943 × 10+039.795 × 10+093.352 × 10+031.365 × 10+033.588 × 10+033.612 × 10+032.778 × 10+02
P3.020 × 10−11
(+)
3.020 × 10−11
(+)
3.020 × 10−11
(+)
1.555 × 10−07
(+)
3.020 × 10−11
(+)
5.091 × 10−06
(+)
5.322 × 10−03
(+)
8.891 × 10−10
(+)
1.493 × 10−04
(+)
Rank10786932541
Ave1930 × 10+043.234 × 10+023.965 × 10+023.000 × 10+024.568 × 10+033.000 × 10+023.000 × 10+023.000 × 10+023.000 × 10+023.000 × 10+02
F3Std6.666 × 10+038.876 × 10+012.270 × 10+021.267 × 10−131.758 × 10+033.950 × 10−144.504 × 10−136.333 × 10−147.237 × 10−147.828 × 10−14
P1.121 × 10−12
(+)
1.121 × 10−12
(+)
1.121 × 10−12
(+)
NaN1.121 × 10−12
(+)
NaN2.728 × 10−03
(+)
NaNNaN
Rank10895716234
Ave1.245 × 10+034.366 × 10+024.074 × 10+024.155 × 10+025.386 × 10+024.019 × 10+024.000 × 10+024.019 × 10+024.000 × 10+024.000 × 10+02
F4Std5.816 × 10+024.239 × 10+028.217 × 10+002.441 × 10+011.052 × 10+021.015 × 10+017.956 × 10−021.015 × 10+019.683 × 10−025.74 × 10−02
P3.020 × 10−11
(+)
4.975 × 10−11
(+)
3.690 × 10−11
(+)
4.504 × 10−11
(+)
3.020 × 10−11
(+)
3.478 × 10−01
(-)
8.485 × 10−09
(+)
3.010 × 10−07
(+)
2.062 × 10−01
(-)
10857942631
Ave5.769 × 10+025.516 × 10+025.407 × 10+025.256 × 10+025.748 × 10+025.326 × 10+025.312 × 10+025.301 × 10+025.343 × 10+025.087 × 10+02
F5Std1.922 × 10+011.406 × 10+011.604 × 10+019.419 × 10+002.057 × 10+011.539 × 10+011.156 × 10+011.298 × 10+011.270 × 10+011.406 × 10+00
P2.574 × 10−11 (+)2.574 × 10−11 (+)2.574 × 10−11 (+)1.862 × 10−10 (+)2.574 × 10−11 (+)2.574 × 10−11 (+)2.564 × 10−11 (+)2.574 × 10−11 (+)2.574 × 10−11 (+)
Rank9482973461
Ave6.568 × 10+026.393 × 10+026.152 × 10+026.056 × 10+026.494 × 10+026.072 × 10+026.005 × 10+026.049 × 10+026.041 × 10+026.032 × 10+02
F6Std8.657 × 10+006.640 × 10+001.070 × 10+014.567 × 10+001.294 × 10+016.877 × 10+001.141 × 10+008.243 × 10+005.784 × 10+003.052 × 10+00
P3.020 × 10−11 (+)3.020 × 10−11 (+)1.010 × 10−08 (+)2.921 × 10−02 (+)3.020 × 10−11 (+)1.700 × 10−02 (+)4.460 × 10−04 (+)8.303 × 10−01 (-)7.506 × 10−01 (-)
Rank10784961532
Ave1.054 × 10+037.976 × 10+027.725 × 10+027.418 × 10+028.075 × 10+027.781 × 10+027.567 × 10+027.799 × 10+027.695 × 10+027.483 × 10+02
F7Std8.983 × 10+011.655 × 10+011.983 × 10+011.091 × 10+011.465 × 10+012.622 × 10+011.477 × 10+012.633 × 10+012.534 × 10+019.849 × 10+00
P3.020 × 10−11 (+)3.020 × 10−11 (+)2.317 × 10−06 (+)1.123 × 10−02 (+)2.371 × 10−10 (+)9.533 × 10−07 (+)1.628 × 10−02 (+)9.533 × 10−07 (+)4.982 × 10−04 (+)
Rank10451783951
Ave8.579 × 10+028.308 × 10+028.262 × 10+028.241 × 10+028.370 × 10+028.294 × 10+028.287 × 10+028.291 × 10+028.322 × 10+028.270 × 10+02
F8Std1.758 × 10+016.450 × 10+005.895 × 10+009.253 × 10+004.739 × 10+001.337 × 10+018.479 × 10+007.375 × 10+001.048 × 10+019.227 × 10+00
P8.088 × 10−10 (+)5.745 × 10−02 (-)8.650 × 10−01 (-)2.611 × 10−01 (-)7.214 × 10−06 (+)7.171 × 10−01 (-)4.118 × 10−01 (-)3.218 × 10−01 (-)5.183 × 10−02 (-)
Rank10512585393
Ave2.313 × 10+031.362 × 10+031.043 × 10+039.306 × 10+021.579 × 10+031.129 × 10+039.552 × 10+021.170 × 10+031.083 × 10+039.151 × 10+02
F9Std3.390 × 10+021.953 × 10+021.210 × 10+025.436 × 10+021.860 × 10+022.470 × 10+027.967 × 10+013.455 × 10+022.456 × 10+021.756 × 10+01
P3.020 × 10−11 (+)3.685 × 10−11 (+)3.349 × 10−08 (+)1.624 × 10−01 (-)3.020 × 10−11 (+)4.107 × 10−07 (+)6.662 × 10−03 (+)1.721 × 10−03 (+)1.783 × 10−04 (+)
Rank1063566294 1
Ave1.963 × 10+032.028 × 10+031.745 × 10+031.862 × 10+032.217 × 10+031.820 × 10+031.611 × 10+031.759 × 10+031.789 × 10+031.391 × 10+03
F10Std1.899 × 10+022.643 × 10+022.396 × 10+022.328 × 10+021.471 × 10+023.136 × 10+022.890 × 10+022.413 × 10+022.654 × 10+021.136 × 10+02
P1.329 × 10−10 (+)3.020 × 10−11 (+)3.965 × 10−08 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)5.462 × 10−09 (+)2.000 × 10−05 (+)1.857 × 10−09 (+)1.202 × 10−08 (+)
Rank4924794381
Ave2.462 × 10+031.134 × 10+031.140 × 10+031.164 × 10+031.377 × 10+031.167 × 10+031.117 × 10+031.149 × 10+031.168 × 10+031.117 × 10+03
F11Std1.514 × 10+031.971 × 10+012.251 × 10+014.956 × 10+012.628 × 10+027.742 × 10+019.871 × 10+003.865 × 10+015.147 × 10+014.717 × 10+00
P3.020 × 10−11 (+)3.020 × 10−11 (+)9.533 × 10−07 (+)2.678 × 10−06 (+)3.020 × 10−11 (+)1.249 × 10−05 (+)1.715 × 10−01 (-)7.043 × 10−07 (+)2.879 × 10−06 (+)
Rank10346972581
Ave9.665 × 10+073.920 × 10+053.595 × 10+045.235 × 10+055.592 × 10+061.292 × 10+041.039 × 10+041.188 × 10+041.469 × 10+041.890 × 10+03
F12Std1.470 × 10+074.173 × 10+057.709 × 10+041.694 × 10+065.537 × 10+061.262 × 10+048.329 × 10+031.492 × 10+041.662 × 10+042.269 × 10+02
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)2.602 × 10−08 (+)1.613 × 10−10 (+)9.919 × 10−11 (+)2.922 × 10−09 (+)
Rank10768932351
Ave4.372 × 10+031.269 × 10+041.815 × 10+037.489 × 10+031.256 × 10+044.667 × 10+031.124 × 10+044.492 × 10+033.305 × 10+031.692 × 10+03
F13Std2.892 × 10+031.012 × 10+042.202 × 10+028.498 × 10+038.694 × 10+033.400 × 10+036.373 × 10+033.710 × 10+031.939 × 10+032.986 × 10+02
P1.070 × 10−09 (+)3.690 × 10−11 (+)4.358 × 10−02 (+)1.429 × 10−08 (+)3.020 × 10−11 (+)5.264 × 10−04 (+)1.329 × 10−10 (+)7.220 × 10−06 (+)1.249 × 10−05 (+)
Rank41017957531
Ave1.577 × 10+038.963 × 10+031.451 × 10+031.478 × 10+031.711 × 10+031.463 × 10+031.504 × 10+031.478 × 10+031.469 × 10+031.487 × 10+03
F14Std1.084 × 10+028.528 × 10+032.004 × 10+014.154 × 10+019.514 × 10+012.984 × 10+011.538 × 10+023.506 × 10+023.604 × 10+013.76 × 10+02
P5.462 × 10−06 (+)3.965 × 10−08 (+)2.254 × 10−04 (+)2.707 × 10−01 (-)9.756 × 10−10 (+)1.911 × 10−02 (+)6.353 × 10−02 (-)3.183 × 10−01 (-)5.943 × 10−02 (-)
Rank71035713629
Ave4.557 × 10+037.066 × 10+031.581 × 10+031.634 × 10+031.157 × 10+041.583 × 10+031.529 × 10+031.566 × 10+031.561 × 10+031.510 × 10+03
F15Std3.009 × 10+036.053 × 10+034.028 × 10+018.260 × 10+011.824 × 10+038.033 × 10+013.605 × 10+014.903 × 10+015.095 × 10+011.330 × 10+01
P3.020 × 10−11 (+)3.020 × 10−11 (+)1.206 × 10−10 (+)2.034 × 10−09 (+)3.020 × 10−11 (+)2.389 × 10−04 (+)5.554 × 10−02 (-)4.205 × 10−06 (+)2.600 × 10−05 (+)
Rank81037942551
Ave2.050 × 10+031.999 × 10+031.775 × 10+031.718 × 10+032.070 × 10+031.743 × 10+031.741 × 10+031.763 × 10+031.772 × 10+031.614 × 10+03
F16Std1.492 × 10+021.610 × 10+021.216 × 10+021.023 × 10+021.572 × 10+021.477 × 10+021.398 × 10+021.155 × 10+021.624 × 10+021.164 × 10+01
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.256 × 10−07 (+)1.529 × 10−05 (+)3.020 × 10−11 (+)8.841 × 10−07 (+)1.911 × 10−02 (+)6.528 × 10−08 (+)2.783 × 10−07 (+)
Rank79621054381
Ave1.867 × 10+031.846 × 10+031.755 × 10+021.751 × 10+031.784 × 10+031.774 × 10+031.766 × 10+031.769 × 10+031.786 × 10+031.733 × 10+03
F17Std6.346 × 10+018.886 × 10+011.095 × 10+011.566 × 10+012.775 × 10+014.958 × 10+015.303 × 10+014.213 × 10+015.320 × 10+011.164 × 10+01
P3.020 × 10−11 (+)4.504 × 10−11 (+)2.227 × 10−09 (+)3.835 × 10−06 (+)3.020 × 10−11 (+)2.597 × 10−05 (+)4.290 × 10−01 (-)1.041 × 10−04 (+)1.635 × 10−05 (+)
Rank8823557481
Ave9.961 × 10+041.426 × 10+042.018 × 10+031.667 × 10+041.602 × 10+041.962 × 10+035.585 × 10+031.939 × 10+032.014 × 10+031.837 × 10+03
F18Std4.276 × 10+059.316 × 10+031.754 × 10+021.392 × 10+041.111 × 10+044.027 × 10+023.291 × 10+032.447 × 10+025.577 × 10+028.920 × 10+00
P3.020 × 10−11 (+)3.020 × 10−11 (+)1.777 × 10−10 (+)2.872 × 10−10 (+)3.020 × 10−11 (+)3.006 × 10−04 (+)1.777 × 10−10 (+)1.123 × 10−02 (+)9.533 × 10−07 (+)
Rank10739846251
Ave2.903 × 10+041.524 × 10+041.938 × 10+031.984 × 10+031.143 × 10+051.950 × 10+032.040 × 10+031.937 × 10+031.957 × 10+031.918 × 10+03
F19Std6.639 × 10+041.426 × 10+042.847 × 10+011.350 × 10+023.848 × 10+055.288 × 10+013.907 × 10+024.078 × 10+015.410 × 10+021.354 × 10+01
P3.020 × 10−11 (+)4.975 × 10−11 (+)6.203 × 10−04 (+)5.265 × 10−05 (+)3.020 × 10−11 (+)4.841 × 10−02 (+)8.500 × 10−02 (-)1.118 × 10−01 (-)5.828 × 10−03 (+)
Rank98251047361
Ave2.182 × 10+032.119 × 10+032.095 × 10+032.069 × 10+032.214 × 10+032.094 × 10+032.034 × 10+032.089 × 10+032.066 × 10+032.034 × 10+03
F20Std7.508 × 10+015.110 × 10+015.542 × 10+014.596 × 10+015.579 × 10+017.565 × 10+013.024 × 10+015.461 × 10+015.381 × 10+021.312 × 10+01
P3.020 × 10−11 (+)3.020 × 10−11 (+)5.600 × 10−07 (+)1.836 × 10−04 (+)3.020 × 10−11 (+)2.531 × 10−04 (+)2.772 × 10−01 (-)9.514 × 10−06 (+)6.353 × 10−02 (-)
Rank9553982471
Ave2.322 × 10+032.311 × 10+032.276 × 10+032.203 × 10+032.322 × 10+032.322 × 10+032.338 × 10+032.318 × 10+032.331 × 10+032.203 × 10+03
F21Std4.807 × 10+015.110 × 10+017.171 × 10+011.469 × 10+006.534 × 10+014.925 × 10+014.172 × 10+014.825 × 10+014.742 × 10+011.503 × 10+00
P1.614 × 10−11 (+)8.168 × 10−11 (+)7.865 × 10−07 (+)7.927 × 10−06 (+)1.614 × 10−11 (+)2.989 × 10−08 (+)3.215 × 10−10 (+)5.277 × 10−09 (+)2.113 × 10−09 (+)
Rank34618975102
Ave3.025 × 10+032.504 × 10+032.318 × 10+032.307 × 10+032.393 × 10+032.359 × 10+032.320 × 10+032.326 × 10+032.378 × 10+032.302 × 10+03
F22Std2.672 × 10+029.834 × 10+012.629 × 10+011.410 × 10+011.162 × 10+022.293 × 10+021.436 × 10+021.449 × 10+022.815 × 10+027.056 × 10+00
P3.020 × 10−11 (+)3.020 × 10−11 (+)2.879 × 10−06 (+)2.879 × 10−06 (+)4.856 × 10−03 (+)2.707 × 10−01 (-)1.695 × 10−02 (+)5.395 × 10−01 (-)2.838 × 10−01 (-)
Rank10532554891
Ave2.752 × 10+032.712 × 10+032.652 × 10+032.631 × 10+032.725 × 10+032.636 × 10+032.636 × 10+032.636 × 10+032.636 × 10+032.636 × 10+03
F23Std5.492 × 10+014.199 × 10+011.686 × 10+011.416 × 10+014.487 × 10+012.503 × 10+011.180 × 10+011.322 × 10+011.118 × 10+011.034 × 10+01
P3.020 × 10−11 (+)3.020 × 10−11 (+)9.063 × 10−08 (+)3.183 × 10−01 (-)3.020 × 10−11 (+)1.023 × 10−01 (-)9.626 × 10−02 (-)7.483 × 10−02 (-)3.644 × 10−02 (+)
Rank10875963421
Ave2.865 × 10+032.831 × 10+032.673 × 10+032.568 × 10+032.800 × 10+032.737 × 10+032.706 × 10+032.749 × 10+032.765 × 10+032.682 × 10+03
F24Std8.868 × 10+017.021 × 10+011.346 × 10+021.121 × 10+029.218 × 10+019.714 × 10+011.279 × 10+026.908 × 10+011.388 × 10+011.018 × 10+02
P6.473 × 10−08 (+)6.456 × 10−09 (+)6.138 × 10−09 (-)1.277 × 10−02 (+)1.058 × 10−07 (+)5.362 × 10−07 (+)1.673 × 10−03 (+)1.985 × 10−07 (+)2.345 × 10−10 (+)
Rank10663858114
Ave3.512 × 10+032.956 × 10+032.939 × 10+032.931 × 10+033.000 × 10+032.938 × 10+032.930 × 10+032.937 × 10+032.932 × 10+032.889 × 10+03
F25Std3.157 × 10+023.734 × 10+013.958 × 10+012.835 × 10+015.196 × 10+013.378 × 10+016.436 × 10+013.216 × 10+013.061 × 10+015.460 × 10+01
P2.111 × 10−11 (+)1.007 × 10−08 (+)7.032 × 10−06 (+)4.588 × 10−05 (+)2.111 × 10−11 (+)3.020 × 10−07 (+)5.534 × 10−08 (+)9.950 × 10−06 (+)7.353 × 10−05 (+)
Rank10751937524
Ave3.963 × 10+033.611 × 10+033.034 × 10+033.016 × 10+033.626 × 10+032.954 × 10+033.149 × 10+033.177 × 10+033.242 × 10+032.870 × 10+03
F26Std3.770 × 10+024.218 × 10+021.159 × 10+021.559 × 10+024.754 × 10+021.872 × 10+025.512 × 10+023.779 × 10+024.735 × 10+027.601 × 10+01
P2.272 × 10−11 (+)1.222 × 10−09 (+)6.377 × 10−08 (+)2.674 × 10−06 (+)4.604 × 10−11 (+)7.405 × 10−04 (+)7.976 × 10−01 (-)4.217 × 10−08 (+)4.095 × 10−07 (+)
Rank66221026561
Ave3.229 × 10+033.202 × 10+033.102 × 10+033.099 × 10+033.206 × 10+033.110 × 10+033.128 × 10+033.114 × 10+033.107 × 10+033.096 × 10+03
F27Std5.073 × 10+015.584 × 10+011.755 × 10+015.788 × 10+006.027 × 10+012.778 × 10+014.131 × 10+013.055 × 10+012.060 × 10+013.026 × 10+00
P3.020 × 10−11 (+)3.020 × 10−11 (+)8.771 × 10−02 (-)6.145 × 10−02 (-)3.020 × 10−11 (+)5.083 × 10−03 (+)1.557 × 10−08 (+)6.668 × 10−03 (+)4.225 × 10−03 (+)
Rank98321057641
Ave3.682 × 10+033.414 × 10+033.273 × 10+033.230 × 10+033.592 × 10+033.411 × 10+033.406 × 10+033.349 × 10+033.353 × 10+033.111 × 10+03
F28Std2.112 × 10+021.681 × 10+021.181 × 10+021.075 × 10+021.850 × 10+021.458 × 10+027.748 × 10+011.706 × 10+021.555 × 10+023.102 × 10+01
P4.111 × 10−11 (+)2.285 × 10−11 (+)9.763 × 10−11 (+)4.795 × 10−10 (+)1.087 × 10−11 (+)3.265 × 10−10 (+)2.204 × 10−10 (+)2.406 × 10−08 (+)1.627 × 10−09 (+)
Rank10832964751
Ave3.392 × 10+033.357 × 10+033.226 × 10+033.198 × 10+033.427 × 10+033.255 × 10+033.241 × 10+033.255 × 10+033.247 × 10+033.234 × 10+03
F29Std1.005 × 10+031.161 × 10+024.906 × 10+015.224 × 10+011.015 × 10+028.115 × 10+014.135 × 10+018.225 × 10+016.937 × 10+014.070 × 10+01
P2.227 × 10−09 (+)2.317 × 10−06 (+)4.825 × 10−01 (-)1.953 × 10−03 (+)6.121 × 10−10 (+)8.187 × 10−01 (-)6.414 × 10−01 (-)5.011 × 10−01 (-)7.062 × 10−01 (-)
Rank89261053741
Ave7.039 × 10+061.175 × 10+063.530 × 10+047.568 × 10+056.073 × 10+061.557 × 10+055.953 × 10+033.718 × 10+053.969 × 10+053.828 × 10+03
F30Std8.628 × 10+061.781 × 10+061.484 × 10+051.040 × 10+066.524 × 10+063.491 × 10+051.484 × 10+038.156 × 10+057.572 × 10+051.405 × 10+02
P3.020 × 10−11 (+)3.020 × 10−11 (+)8.485 × 10−09 (+)3.000 × 10−11 (+)3.020 × 10−11 (+)8.290 × 10−06 (+)3.020 × 10−11 (+)8.273 × 10−06 (+)3.502 × 10−07 (+)
Rank10837942651
Average Rank8.667.034.284.218.285.104.174.835.171.72
+/NaN/-29/0/028/0/125/0/423/1/529/0/023/1/518/1/1021/1/721/1/7
Table 6. CEC2017 test data (dim = 30).
Table 6. CEC2017 test data (dim = 30).
FIndexBASAOAPOADBOLMHHOTSSAQMESSALSSASSAIBSSA
Ave1.054 × 10+104.203 × 10+101.445 × 10+108.911 × 10+041.663 × 10+104.049 × 10+033.663 × 10+038.025 × 10+037.593 × 10+031.430 × 10+03
F1Std1.711 × 10+106.379 × 10+097.650 × 10+091.699 × 10+053.093 × 10+094.822 × 10+034.316 × 10+037.208 × 10+036.329 × 10+031.165 × 10+03
P3.020 × 10−11
(+)
3.020 × 10−11 (+)3.020 × 10−11 (+)3.197 × 10−09
(+)
3.020 × 10−11 (+)3.020 × 10−11 (+)6.577 × 10−02 (-)2.678 × 10−06 (+)1.606 × 10−06 (+)
Rank10986732541
Ave1.746 × 10+057.464 × 10+042.232 × 10+043.996 × 10+037.261 × 10+043.000 × 10+023.000 × 10+023.000 × 10+023.000 × 10+023.000 × 10+02
F3Std3.372 × 10+047.427 × 10+038.161 × 10+035.394 × 10+035.292 × 10+035.078 × 10−101.194 × 10−016.540 × 10−031.077 × 10−109.570 × 10−11
P2.686 × 10−11 (+)2.686 × 10−11 (+)2.686 × 10−11 (+)2.686 × 10−11 (+)2.686 × 10−11 (+)2.686 × 10−11 (+)2.686 × 10−11 (+)2.686 × 10−11 (+)8.743 × 10−02 (-)
Rank10886735421
Ave3.795 × 10+048.853 × 10+031.674 × 10+035.124 × 10+024.056 × 10+034.215 × 10+024.632 × 10+024.487 × 10+024.319 × 10+024.030 × 10+02
F4Std9.718 × 10+031.941 × 10+031.363 × 10+034.529 × 10+011.077 × 10+032.980 × 10+013.214 × 10+013.068 × 10+013.780 × 10+015.951 × 10+00
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)4.504 × 10−11 (+)3.020 × 10−11 (+)2.145 × 10−02 (+)5.092 × 10−08 (+)4.113 × 10−07 (+)5.825 × 10−03 (+)
Rank10976725341
Ave9.995 × 10+028.211 × 10+027.460 × 10+027.269 × 10+028.337 × 10+027.585 × 10+026.681 × 10+027.085 × 10+027.538 × 10+026.538 × 10+02
F5Std6.726 × 10+013.637 × 10+014.154 × 10+014.907 × 10+012.602 × 10+014.545 × 10+013.046 × 10+016.021 × 10+013.975 × 10+012.231 × 10+01
P3.020 × 10−11 (+)3.020 × 10−11 (+)9.919 × 10−11 (+)1.202 × 10−08 (+)3.020 × 10−11 (+)8.101 × 10−10 (+)2.509 × 10−02 (+)1.302 × 10−03 (+)1.464 × 10−10 (+)
Rank10636392631
Ave6.922 × 10+026.680 × 10+026.565 × 10+026.390 × 10+026.840 × 10+026.456 × 10+026.184 × 10+026.366 × 10+026.459 × 10+026.411 × 10+02
F6Std7.287 × 10+006.466 × 10+007.114 × 10+001.280 × 10+014.472 × 10+009.649 × 10+007.343 × 10+001.230 × 10+011.123 × 10+015.955 × 10+00
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.197 × 10−09 (+)6.100 × 10−01 (-)3.020 × 10−11 (+)3.917 × 10−02 (+)1.329 × 10−10 (+)1.907 × 10−01 (-)8.236 × 10−02 (-)
Rank10551483592
Ave3.281 × 10+031.294 × 10+031.243 × 10+039.651 × 10+021.332 × 10+031.210 × 10+039.382 × 10+021.093 × 10+031.219 × 10+039.910 × 10+02
F7Std3.037 × 10+025.677 × 10+017.725 × 10+017.591 × 10+013.422 × 10+019.011 × 10+014.560 × 10+011.328 × 10+021.014 × 10+024.047 × 10+01
P3.020 × 10−11 (+)3.020 × 10−11 (+)4.077 × 10−11 (+)9.883 × 10−03 (+)3.020 × 10−11 (+)3.690 × 10−11 (+)3.831 × 10−05 (+)8.120 × 10−04 (+)9.756 × 10−10 (+)
Rank10573461792
Ave1.212 × 10+031.040 × 10+039.897 × 10+029.925 × 10+021.039 × 10+039.813 × 10+029.382 × 10+029.634 × 10+029.772 × 10+029.342 × 10+02
F8Std5.524 × 10+013.407 × 10+012.083 × 10+015.056 × 10+012.875 × 10+012.537 × 10+012.410 × 10+013.075 × 10+013.272 × 10+011.432 × 10+01
P3.020 × 10−11 (+)3.020 × 10−11 (+)4.077 × 10−11 (+)1.492 × 10−06 (+)3.020 × 10−11 (+)1.695 × 10−09 (+)5.793 × 10−01 (-)1.407 × 10−04 (+)1.586 × 10−07 (+)
Rank10938742461
Ave1.429 × 10+045.819 × 10+035.208 × 10+034.290 × 10+036.705 × 10+035.416 × 10+034.402 × 10+035.027 × 10+035.259 × 10+034.364 × 10+03
F9Std2.219 × 10+036.012 × 10+026.242 × 10+021.530 × 10+038.250 × 10+024.257 × 10+026.461 × 10+027.133 × 10+024.481 × 10+024.592 × 10+02
P3.020 × 10−11 (+)9.919 × 10−11 (+)5.186 × 10−107 (+)4.035 × 10−01 (-)3.020 × 10−11 (+)3.352 × 10−08 (+)6.309 × 10−01 (-)8.292 × 10−06 (+)5.462 × 10−09 (+)
Rank10865923631
Ave6.942 × 10+036.408 × 10+034.665 × 10+035.784 × 10+036.467 × 10+035.084 × 10+034.510 × 10+034.822 × 10+035.314 × 10+034.587 × 10+03
F10Std3.642 × 10+025.438 × 10+026.272 × 10+026.317 × 10+028.287 × 10+025.752 × 10+025.062 × 10+024.971 × 10+025.751 × 10+022.860 × 10+02
P3.020 × 10−11 (+)3.020 × 10−11 (+)1.858 × 10−01 (-)5.462 × 10−09 (+)3.020 × 10−11 (+)7.295 × 10−04 (+)1.858 × 10−01 (-)3.265 × 10−02 (+)4.444 × 10−07 (+)
Rank68491052371
Ave2.118 × 10+043.253 × 10+031.962 × 10+031.387 × 10+035.912 × 10+031.347 × 10+031.175 × 10+031.388 × 10+031.339 × 10+031.214 × 10+03
F11Std6.657 × 10+031.012 × 10+035.963 × 10+029.220 × 10+011.095 × 10+037.516 × 10+013.279 × 10+011.038 × 10+028.403 × 10+012.198 × 10+01
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)1.094 × 10−10 (+)3.020 × 10−11 (+)1.329 × 10−10 (+)1.635 × 10−05 (+)4.616 × 10−10 (+)4.686 × 10−08 (+)
Rank10875931631
Ave2.346 × 10+108.478 × 10+091.005 × 10+091.009 × 10+072.116 × 10+094.142 × 10+047.457 × 10+045.457 × 10+043.696 × 10+047.438 × 10+03
F12Std5.060 × 10+092.678 × 10+091.242 × 10+099.400 × 10+069.801 × 10+091.551 × 10+044.632 × 10+043.268 × 10+042.045 × 10+041.258 × 10+03
P2.954 × 10−11 (+)2.954 × 10−11 (+)2.954 × 10−11 (+)2.954 × 10−11 (+)2.954 × 10−11 (+)2.954 × 10−11 (+)2.954 × 10−11 (+)2.954 × 10−11 (+)2.954 × 10−11 (+)
Rank10976725421
Ave2.073 × 10+101.111 × 10+071.775 × 10+079.887 × 10+056.737 × 10+081.679 × 10+058.749 × 10+033.032 × 10+062.426 × 10+042.541 × 10+03
F13Std9.381 × 10+096.070 × 10+075.517 × 10+071.143 × 10+067.428 × 10+088.086 × 10+059.495 × 10+031.306 × 10+072.415 × 10+044.481 × 10+02
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)5.084 × 10−03 (+)3.020 × 10−11 (+)1.777 × 10−10 (+)
Rank10775942631
Ave7.392 × 10+065.071 × 10+047.762 × 10+037.394 × 10+042.762 × 10+065.069 × 10+031.275 × 10+047.290 × 10+036.273 × 10+034.777 × 10+03
F14Std9.063 × 10+064.577 × 10+041.337 × 10+041.206 × 10+052.619 × 10+062.833 × 10+031.020 × 10+044.144 × 10+032.987 × 10+032.147 × 10+03
P3.020 × 10−11 (+)1.174 × 10−09 (+)9.000 × 10−01 (-)8.485 × 10−09 (+)3.020 × 10−11 (+)7.483 × 10−02 (-)8.883 × 10−06 (+)1.729 × 10−07 (+)2.597 × 10−05 (+)
Rank10758925431
Ave2.332 × 10+092.155 × 10+043.958 × 10+049.637 × 10+041.908 × 10+069.625 × 10+032.468 × 10+031.405 × 10+041.230 × 10+042.343 × 10+03
F15Std1.234 × 10+098.959 × 10+032.186 × 10+047.752 × 10+041.367 × 10+061.192 × 10+041.196 × 10+031.322 × 10+041.287 × 10+044.943 × 10+02
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)2.002 × 10−06 (+)1.580 × 10−01 (-)8.485 × 10−09 (+)3.805 × 10−07 (+)
Rank10478932641
Ave6.838 × 10+034.026 × 10+032.926 × 10+032.972 × 10+034.909 × 10+033.022 × 10+032.897 × 10+032.937 × 10+032.896 × 10+032.821 × 10+03
F16Std1.704 × 10+035.762 × 10+023.585 × 10+023.209 × 10+026.695 × 10+022.973 × 10+023.480 × 10+024.509 × 10+023.481 × 10+022.275 × 10+02
P3.020 × 10−11 (+)3.338 × 10−11 (+)2.973 × 10−01 (-)9.334 × 10−02 (-)3.020 × 10−11 (+)9.468 × 10−03 (+)6.520 × 10−01 (-)3.711 × 10−01 (-)2.340 × 10−01 (-)
Rank10864942731
Ave7.391 × 10+032.903 × 10+032.206 × 10+032.437 × 10+032.946 × 10+032.577 × 10+032.290 × 10+032.517 × 10+032.522 × 10+032.051 × 10+03
F17Std7.409 × 10+032.536 × 10+021.864 × 10+022.363 × 10+023.503 × 10+023.047 × 10+022.066 × 10+022.955 × 10+023.401 × 10+029.255 × 10+01
P3.020 × 10−11 (+)3.020 × 10−11 (+)6.913 × 10−04 (+)4.998 × 10−09 (+)3.020 × 10−11 (+)4.616 × 10−10 (+)4.801 × 10−07 (+)4.573 × 10−09 (+)9.063 × 10−08 (+)
Rank10624973571
Ave1.149 × 10+097.268 × 10+051.388 × 10+056.139 × 10+051.295 × 10+071.344 × 10+051.841 × 10+051.163 × 10+051.469 × 10+057.091 × 10+03
F18Std1.108 × 10+087.900 × 10+051.272 × 10+055.872 × 10+061.167 × 10+071.094 × 10+051.833 × 10+058.492 × 10+041.047 × 10+051.754 × 10+03
P1.617 × 10−11 (+)1.617 × 10−11 (+)1.617 × 10−11 (+)1.617 × 10−11 (+)1.617 × 10−11 (+)1.617 × 10−11 (+)1.617 × 10−11 (+)1.617 × 10−11 (+)1.617 × 10−11 (+)
Rank10757936241
Ave3.488 × 10+091.075 × 10+063.957 × 10+052.292 × 10+062.159 × 10+079.912 × 10+034.154 × 10+031.215 × 10+041.283 × 10+044.911 × 10+03
F19Std2.413 × 10+091.335 × 10+054.501 × 10+053.158 × 10+064.846 × 10+071.061 × 10+041.898 × 10+031.598 × 10+041.625 × 10+042.114 × 10+03
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.334 × 10−11 (+)6.121 × 10−10 (+)3.020 × 10−11 (+)2.709 × 10−02 (+)1.023 × 10−01 (-)3.034 × 10−03 (+)1.413 × 10−01 (-)
Rank10786931452
Ave2.782 × 10+032.748 × 10+032.478 × 10+032.485 × 10+032.935 × 10+032.674 × 10+032.543 × 10+032.643 × 10+032.792 × 10+032.308 × 10+03
F20Std1.321 × 10+022.030 × 10+021.457 × 10+021.624 × 10+022.000 × 10+022.059 × 10+022.848 × 10+022.075 × 10+022.071 × 10+027.992 × 10+01
P3.020 × 10−11 (+)2.371 × 10−10 (+)2.154 × 10−06 (+)4.420 × 10−06 (+)3.020 × 10−11 (+)2.610 × 10−10 (+)1.370 × 10−03 (+)2.831 × 10−08 (+)1.329 × 10−10 (+)
Rank45239578101
Ave2.765 × 10+032.621 × 10+032.517 × 10+032.523 × 10+032.667 × 10+032.517 × 10+032.477 × 10+032.496 × 10+032.547 × 10+032.461 × 10+03
F21Std6.282 × 10+016.407 × 10+017.251 × 10+017.236 × 10+014.224 × 10+015.273 × 10+014.161 × 10+014.594 × 10+016.823 × 10+015.293 × 10+01
P3.020 × 10−11 (+)3.020 × 10−11 (+)2.879 × 10−06 (+)1.473 × 10−07 (+)3.020 × 10−11 (+)4.943 × 10−05 (+)4.733 × 10−01 (-)9.468 × 10−03 (+)2.491 × 10−06 (+)
Rank10796541272
Ave8.588 × 10+038.063 × 10+035.009 × 10+033.151 × 10+038.167 × 10+036.015 × 10+033.319 × 10+035.080 × 10+035.998 × 10+032.309 × 10+03
F22Std4.916 × 10+028.513 × 10+021.485 × 10+031.252 × 10+039.987 × 10+021.938 × 10+031.761 × 10+032.075 × 10+031.981 × 10+034.708 × 10+01
P2.449 × 10−11 (+)2.449 × 10−11 (+)2.449 × 10−11 (+)8.581 × 10−08 (+)2.449 × 10−11 (+)1.446 × 10−07 (+)4.651 × 10−03 (+)5.604 × 10−04 (+)2.789 × 10−08 (+)
Rank63321073771
Ave3.739 × 10+033.421 × 10+032.997 × 10+032.912 × 10+033.501 × 10+032.933 × 10+032.836 × 10+032.909 × 10+032.951 × 10+032.861 × 10+03
F23Std2.000 × 10+021.595 × 10+026.796 × 10+018.061 × 10+011.688 × 10+028.411 × 10+014.675 × 10+016.837 × 10+018.183 × 10+013.099 × 10+01
P3.020 × 10−11 (+)3.020 × 10−11 (+)1.094 × 10−10 (+)2.157 × 10−03 (+)3.006 × 10−04 (+)3.006 × 10−04 (+)1.765 × 10−02 (+)1.597 × 10−03 (+)1.385 × 10−06 (+)
Rank10854961361
Ave4.105 × 10+033.807 × 10+033.157 × 10+033.067 × 10+033.766 × 10+033.108 × 10+033.044 × 10+033.036 × 10+033.081 × 10+032.971 × 10+03
F24Std2.484 × 10+022.207 × 10+027.138 × 10+017.647 × 10+012.999 × 10+021.026 × 10+025.650 × 10+016.124 × 10+017.766 × 10+012.096 × 10+01
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.256 × 10−07 (+)3.020 × 10−11 (+)6.518 × 10−09 (+)1.873 × 10−07 (+)6.736 × 10−06 (+)5.462 × 10−09 (+)
Rank9864972251
Ave1.371 × 10+044.526 × 10+033.264 × 10+032.913 × 10+033.432 × 10+032.894 × 10+032.898 × 10+032.892 × 10+032.899 × 10+032.887 × 10+03
F25Std3.501 × 10+035.660 × 10+022.430 × 10+022.788 × 10+017.703 × 10+011.346 × 10+011.748 × 10+011.407 × 10+011.738 × 10+014.190 × 10+00
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)7.599 × 10−07 (+)3.020 × 10−11 (+)1.765 × 10−02 (+)8.684 × 10−03 (+)9.626 × 10−02 (-)1.597 × 10−03 (+)
Rank10976725341
Ave1.451 × 10+049.795 × 10+037.330 × 10+036.035 × 10+039.499 × 10+036.261 × 10+034.376 × 10+035.832 × 10+036.505 × 10+032.874 × 10+03
F26Std2.489 × 10+039.774 × 10+021.257 × 10+039.003 × 10+026.490 × 10+021.467 × 10+031.750 × 10+031.197 × 10+039.291 × 10+024.539 × 10+01
P2.281 × 10−11 (+)2.281 × 10−11 (+)2.281 × 10−11 (+)2.281 × 10−11 (+)2.281 × 10−11 (+)3.268 × 10−09 (+)1.010 × 10−03 (+)1.585 × 10−09 (+)3.865 × 10−11 (+)
Rank10882476341
Ave4.849 × 10+034.388 × 10+033.338 × 10+033.302 × 10+033.995 × 10+033.266 × 10+033.261 × 10+033.258 × 10+033.261 × 10+033.261 × 10+03
F27Std5.139 × 10+023.380 × 10+026.802 × 10+015.730 × 10+014.048 × 10+023.984 × 10+012.289 × 10+012.773 × 10+013.142 × 10+012.124 × 10+01
P2.281 × 10−11 (+)2.281 × 10−11 (+)3.965 × 10−08 (+)2.266 × 10−03 (+)3.020 × 10−11 (+)8.650 × 10−01 (-)9.941 × 10−01 (-)3.555 × 10−01 (-)6.952 × 10−01 (-)
Rank10876851242
Ave1.173 × 10+046.283 × 10+033.934 × 10+033.302 × 10+034.629 × 10+033.145 × 10+033.138 × 10+033.146 × 10+033.134 × 10+033.146 × 10+03
F28Std1.795 × 10+035.603 × 10+025.273 × 10+021.315 × 10+023.658 × 10+026.158 × 10+016.079 × 10+016.375 × 10+015.980 × 10+016.040 × 10+01
P2.489 × 10−11 (+)2.489 × 10−11 (+)2.489 × 10−11 (+)2.655 × 10−10 (+)2.489 × 10−11 (+)8.158 × 10−01 (-)3.973 × 10−01 (-)2.700 × 10−01 (-)3.447 × 10−01 (-)
Rank10976742513
Ave1.684 × 10+046.073 × 10+034.534 × 10+034.239 × 10+036.349 × 10+034.232 × 10+033.971 × 10+034.161 × 10+034.165 × 10+033.759 × 10+03
F29Std1.970 × 10+048.848 × 10+023.384 × 10+022.839 × 10+028.746 × 10+023.307 × 10+022.683 × 10+022.764 × 10+022.971 × 10+028.156 × 10+01
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)2.922 × 10−09 (+)3.020 × 10−11 (+)9.260 × 10−09 (+)2.531 × 10−04 (+)1.473 × 10−07 (+)1.359 × 10−07 (+)
Rank10875862341
Ave1.976 × 10+093.641 × 10+083.093 × 10+062.453 × 10+062.038 × 10+081.135 × 10+049.053 × 10+031.266 × 10+041.186 × 10+047.841 × 10+03
F30Std1.208 × 10+098.772 × 10+082.349 × 10+066.388 × 10+062.261 × 10+084.707 × 10+033.122 × 10+034.754 × 10+034.677 × 10+031.494 × 10+03
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)1.988 × 10−02 (+)1.809 × 10−01 (-)4.942 × 10−05 (+)4.226 × 10−03 (+)
Rank10966832531
average
Rank
9.487.315.935.287.624.452.904.484.691.21
+/NaN/-29/0/029/0/026/0/326/0/329/0/026/0/318/0/1124/0/523/0/6
Table 7. CEC2017 test data (dim = 50).
Table 7. CEC2017 test data (dim = 50).
FIndexBASAOAPOADBOLMHHOTSSAQMESSALSSASSAIBSSA
Ave2.327 × 10+111.054 × 10+113.740 × 10+106.434 × 10+064.295 × 10+104.616 × 10+032.132 × 10+037.688 × 10+036.042 × 10+031.450 × 10+03
F1Std1.963 × 10+101.063 × 10+109.396 × 10+098.734 × 10+068.228 × 10+095.021 × 10+032.114 × 10+036.130 × 10+037.941 × 10+031.079 × 10+03
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)2.324 × 10−02 (+)4.733 × 10−01 (-)4.685 × 10−08 (+)9.883 × 10−03 (+)
Rank10976732441
Ave3.267 × 10+051.740 × 10+056.121 × 10+041.111 × 10+052.093 × 10+053.115 × 10+025.825 × 10+031.692 × 10+043.166 × 10+024.511 × 10+02
F3Std4.383 × 10+042.622 × 10+041.619 × 10+042.563 × 10+043.235 × 10+042.026 × 10+014.794 × 10+031.164 × 10+042.084 × 10+019.246 × 10+02
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.690 × 10−11 (+)9.833 × 10−08 (+)5.494 × 10−11 (+)3.690 × 10−11 (+)
Rank10867914523
Ave9.334 × 10+072.921 × 10+046.270 × 10+036.450 × 10+021.136 × 10+044.710 × 10+025.110 × 10+024.708 × 10+024.740 × 10+025.049 × 10+02
F4Std1.691 × 10+045.297 × 10+032.321 × 10+031.100 × 10+023.314 × 10+043.959 × 10+015.166 × 10+014.170 × 10+015.304 × 10+015.029 × 10+01
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)8.484 × 10−08 (+)3.020 × 10−11 (+)1.170 × 10−02 (+)5.201 × 10−01 (-)6.915 × 10−03 (+)2.109 × 10−02 (+)
Rank10986714153
Ave1.459 × 10+031.099 × 10+038.997 × 10+029.447 × 10+021.022 × 10+038.719 × 10+028.166 × 10+028.584 × 10+028.812 × 10+028.090 × 10+02
F5Std7.529 × 10+012.921 × 10+012.788 × 10+017.386 × 10+022.851 × 10+012.459 × 10+013.833 × 10+013.222 × 10+012.449 × 10+018.453 × 10+01
P3.341 × 10−11 (+)5.572 × 10−10
(+)
2.754 × 10−03 (+)4.981 × 10−04 (+)5.573 × 10−10 (+)3.478 × 10−01 (-)5.539 × 10−08 (+)1.700 × 10−01 (+)2.971 × 10−01
(-)
Rank10859713416
Ave7.077 × 10+026.856 × 10+026.679 × 10+026.597 × 10+026.923 × 10+026.593 × 10+026.296 × 10+026.522 × 10+026.609 × 10+026.617 × 10+02
F6Std7.725 × 10+006.038 × 10+005.440 × 10+009.283 × 10+002.609 × 10+005.167 × 10+005.111 × 10+007.675 × 10+005.526 × 10+004.797 × 10+00
P3.020 × 10−11 (+)3.020 × 10−11 (+)1.430 × 10−05 (+)2.972 × 10−01 (-)3.020 × 10−11 (+)3.772 × 10−02 (+)3.020 × 10−11 (+)2.678 × 10−06 (+)4.733 × 10−01
(-)
Rank10978421463
Ave5.787 × 10+031.857 × 10+031.707 × 10+031.346 × 10+031.917 × 10+031.714 × 10+031.286 × 10+031.610 × 10+031.725 × 10+031.447 × 10+03
F7Std5.095 × 10+026.892 × 10+018.615 × 10+011.522 × 10+023.674 × 10+011.051 × 10+029.712 × 10+011.536 × 10+029.454 × 10+014.546 × 10+01
P3.020 × 10−11 (+)4.573 × 10−09 (+)5.106 × 10−01 (-)6.066 × 10−11 (+)3.020 × 10−11 (+)6.952 × 10−01 (-)3.020 × 10−11 (+)2.052 × 10−03 (+)4.376 × 10−01
(-)
Rank10635482871
Ave1.753 × 10+031.438 × 10+031.222 × 10+031.254 × 10+031.382 × 10+031.203 × 10+031.091 × 10+031.191 × 10+031.202 × 10+031.160 × 10+03
F8Std8.839 × 10+014.326 × 10+014.723 × 10+027.225 × 10+015.300 × 10+012.211 × 10+013.963 × 10+014.066 × 10+013.781 × 10+011.030 × 10+01
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.034 × 10−03 (+)7.200 × 10−05 (+)3.020 × 10−11 (+)9.334 × 10−02 (-)1.547 × 10−09 (+)5.106 × 10−01 (-)7.978 × 10−02
(-)
Rank10696632541
Ave4.462 × 10+042.443 × 10+041.469 × 10+041.735 × 10+042.181 × 10+041.296 × 10+041.161 × 10+041.206 × 10+041.274 × 10+048.795 × 10+03
F9Std5.773 × 10+033.041 × 10+031.180 × 10+036.963 × 10+033.356 × 10+034.511 × 10+021.562 × 10+031.637 × 10+031.360 × 10+031.998 × 10+03
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.352 × 10−08 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)6.046 × 10−07 (+)2.602 × 10−08 (+)1.857 × 10−09 (+)
Rank10759711533
Ave1.281 × 10+041.277 × 10+048.140 × 10+039.639 × 10+031.225 × 10+048.823 × 10+037.196 × 10+038.238 × 10+038.385 × 10+037.449 × 10+03
F10Std5.554 × 10+028.715 × 10+021.033 × 10+031.505 × 10+031.220 × 10+038/038 × 10+027.312 × 10+029.307 × 10+028.612 × 10+024.829 × 10+02
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)
Rank7859932531
Ave5.481 × 10+041.869 × 10+045.279 × 10+031.654 × 10+031.143 × 10+041.380 × 10+031.286 × 10+031.561 × 10+031.366 × 10+031.438 × 10+03
F11Std1.155 × 10+042.308 × 10+032.210 × 10+031.531 × 10+022.664 × 10+037.796 × 10+014.062 × 10+018.468 × 10+017.106 × 10+018.588 × 10+01
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)
Rank10876831424
Ave1.210 × 10+116.678 × 10+101.288 × 10+107.680 × 10+072.480 × 10+119.309 × 10+051.094 × 10+061.149 × 10+069.207 × 10+052.186 × 10+05
F12Std2.700 × 10+101.198 × 10+10 6.951 × 10+095.274 × 10+076.684 × 10+097.504 × 10+057.030 × 10+056.205 × 10+055.311 × 10+055.189 × 10+04
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)1.202 × 10−08 (+)9.919 × 10−11 (+)2.438 × 10−09 (+)3.020 × 10−11 (+)
Rank10876833321
Ave6.822 × 10+101.085 × 10+101.269 × 10+099.759 × 10+058.780 × 10+092.172 × 10+046.952 × 10+032.039 × 10+041.604 × 10+043.250 × 10+03
F13Std2.273 × 10+106.972 × 10+092.634 × 10+091.231 × 10+063.820 × 10+091.408 × 10+045.999 × 10+031.325 × 10+049.831 × 10+033.865 × 10+02
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)7.389 × 10−11 (+)5.264 × 10−04 (+)3.020 × 10−11 (+)4.077 × 10−11 (+)
Rank10976852431
Ave2.081 × 10+082.618 × 10+061.308 × 10+057.397 × 10+053.629 × 10+074.099 × 10+045.929 × 10+046.223 × 10+043.493 × 10+041.997 × 10+04
F14Std1.057 × 10+083.324 × 10+061.161 × 10+057.188 × 10+053.142 × 10+073.274 × 10+045.083 × 10+044.016 × 10+043.615 × 10+041.008 × 10+04
P3.020 × 10−11 (+)6.066 × 10−11 (+)2.891 × 10−03 (+)1.202 × 10−08 (+)3.020 × 10−11 (+)5.395 × 10−01 (-)4.464 × 10−01 (-)1.580 × 10−01 (-)9.926 × 10−02
(-)
Rank10867924421
Ave2.246 × 10+104.927 × 10+061.009 × 10+086.642 × 10+066.683 × 10+081.812 × 10+041.172 × 10+041.784 × 10+041.657 × 10+042.982 × 10+03
F15Std7.915 × 10+092.679 × 10+072.193 × 10+082.148 × 10+076.608 × 10+088.620 × 10+035.676 × 10+036.864 × 10+039.578 × 10+034.910 × 10+02
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)9.260 × 10−09 (+)9.063 × 10−08 (+)3.020 × 10−11 (+)5.967 × 10−09 (+)
Rank10686942341
Ave1.215 × 10+047.254 × 10+034.082 × 10+034.317 × 10+036.860 × 10+033.975 × 10+033.573 × 10+033.936 × 10+033.997 × 10+032.891 × 10+03
F16Std3.178 × 10+031.636 × 10+036.041 × 10+026.396 × 10+021.145 × 10+035.707 × 10+025.215 × 10+025.002 × 10+024.675 × 10+021.678 × 10+02
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)1.464 × 10−10 (+)3.020 × 10−11 (+)1.174 × 10−09 (+)1.286 × 10−06 (+)4.200 × 10−10 (+)4.077 × 10−11 (+)
Rank10967853241
Ave4.652 × 10+054.529 × 10+033.584 × 10+033.717 × 10+034.693 × 10+033.453 × 10+033.347 × 10+033.454 × 10+033.645 × 10+032.956 × 10+03
F17Std5.711 × 10+057.187 × 10+024.720 × 10+023.870 × 10+027.231 × 10+023.819 × 10+023.743 × 10+023.357 × 10+024.153 × 10+021.845 × 10+02
P3.020 × 10−11 (+)3.020 × 10−11 (+)9.063 × 10−08 (+)1.411 × 10−09 (+)3.020 × 10−11 (+)8.352 × 10−08 (+)1.635 × 10−05 (+)3.965 × 10−08 (+)3.965 × 10−08 (+)
Rank10855942351
Ave5.023 × 10+082.899 × 10+071.300 × 10+062.565 × 10+066.120 × 10+071.700 × 10+052.022 × 10+052.482 × 10+051.592 × 10+055.558 × 10+04
F18Std2.802 × 10+083.427 × 10+078.974 × 10+053.108 × 10+065.921 × 10+079.008 × 10+049.070 × 10+041.299 × 10+057.920 × 10+041.464 × 10+04
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)1.613 × 10−10 (+)3.020 × 10−11 (+)2.034 × 10−09 (+)2.610 × 10−10 (+)
Rank10867934521
Ave8.624 × 10+094.667 × 10+055.105 × 10+069.952 × 10+051.921 × 10+082.097 × 10+042.249 × 10+042.494 × 10+042.109 × 10+044.102 × 10+03
F19Std3.315 × 10+091.156 × 10+041.748 × 10+079.248 × 10+053.624 × 10+081.497 × 10+049.580 × 10+031.541 × 10+041.527 × 10+041.544 × 10+03
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.690 × 10−11 (+)3.020 × 10−11 (+)2.491 × 10−06 (+)3.690 × 10−11 (+)2.195 × 10−08 (+)4.311 × 10−08 (+)
Rank10587922641
Ave3.830 × 10+033.510 × 10+033.229 × 10+033.457 × 10+033.821 × 10+033.416 × 10+033.305 × 10+033.358 × 10+033.572 × 10+033.250 × 10+03
F20Std2.070 × 10+023.017 × 10+022.501 × 10+023.342 × 10+022.540 × 10+023.10 × 10+022.960 × 10+023.336 × 10+023.336 × 10+022.281 × 10+02
P2.594 × 10−02 (+)2.510 × 10−02 (+)4.801 × 10−07 (+)1.112 × 10−02 (+)7.483 × 10−02 (-)1.370 × 10−03 (+)7.221 × 10−06 (+)3.005 × 10−04 (+)1.857 × 10−01(-)
Rank46110843692
Ave3.312 × 10+033.048 × 10+032.771 × 10+032.793 × 10+033.122 × 10+032.83 × 10+032.990 × 10+032.769 × 10+032.815 × 10+032.905 × 10+03
F21Std1.231 × 10+027.399 × 10+016.457 × 10+016.693 × 10+019.779 × 10+013.104 × 10+026.650 × 10+017.998 × 10+011.226 × 10+025.500 × 10+01
P4.975 × 10−11 (+)2.491 × 10−06 (+)2.154 × 10−06 (+)4.943 × 10−05 (+)1.700 × 10−08 (+)2.813 × 10−02 (+)3.690 × 10−11 (+)4.744 × 10−06 (+)5.084 × 10−03 (+)
Rank10623896451
Ave1.456 × 10+041.514 × 10+041.087 × 10+041.129 × 10+041.484 × 10+041.040 × 10+048.894 × 10+039.935 × 10+031.021 × 10+048.631 × 10+03
F22Std5.520 × 10+026.106 × 10+029.859 × 10+021.153 × 10+039.413 × 10+021.075 × 10+039.539 × 10+021.031 × 10+039.167 × 10+021.237 × 10+03
P3.020 × 10−11 (+)3.020 × 10−11 (+)1.547 × 10−09 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.352 × 10−08 (+)9.941 × 10−01 (-)1.868 × 10−05 (+)9.756 × 10−10 (+)
Rank36610881415
Ave4.911 × 10+034.468 × 10+033.490 × 10+033.314 × 10+034.548 × 10+033.393 × 10+033.096 × 10+033.261 × 10+033.393 × 10+033.458 × 10+03
F23Std2.726 × 10+022.850 × 10+021.375 × 10+022.001 × 10+022.668 × 10+021.374 × 10+025.471 × 10+011.245 × 10+021.100 × 10+021.502 × 10+02
P3.020 × 10−11 (+)3.020 × 10−11 (+)5.297 × 10−01 (-)3.183 × 10−03 (+)3.020 × 10−11 (+)7.978 × 10−02 (-)7.389 × 10−11 (+)5.091 × 10−06 (+)4.676 × 10−02 (+)
Rank10965841237
Ave5.670 × 10+034.943 × 10+033.636 × 10+033.482 × 10+034.790 × 10+033.543 × 10+033.344 × 10+033.414 × 10+033.521 × 10+033.716 × 10+03
F24Std3.688 × 10+023.238 × 10+021.431 × 10+021.523 × 10+022.987 × 10+021.698 × 10+021.156 × 10+021.364 × 10+021.178 × 10+023.908 × 10+02
P4.975 × 10−11 (+)8.891 × 10−10 (+)8.999 × 10−01 (-)1.518 × 10−03 (+)2.223 × 10−09 (+)2.416 × 10−02 (+)1.010 × 10−08 (+)3.571 × 10−06 (+)1.076 × 10−02 (+)
Rank10954861263
Ave5.178 × 10+041.456 × 10+045.860 × 10+033.099 × 10+037.068 × 10+033.053 × 10+033.061 × 10+033.090 × 10+033.053 × 10+033.053 × 10+03
F25Std7.118 × 10+031.793 × 10+039.087 × 10+025.473 × 10+019.600 × 10+024.728 × 10+013.730 × 10+014.553 × 10+014.822 × 10+012.613 × 10+01
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)5.493 × 10−01 (-)3.020 × 10−11 (+)1.501 × 10−02 (+)3.514 × 10−02 (+)7.659 × 10−05 (+)1.171 × 10−02 (+)
Rank10976822541
Ave2.919 × 10+041.604 × 10+041.186 × 10+048.723 × 10+031.391 × 10+047.109 × 10+036.155 × 10+035.523 × 10+037.223 × 10+034.994 × 10+03
F26Std4.271 × 10+039.565 × 10+021.362 × 10+031.607 × 10+036.614 × 10+024.055 × 10+033.369 × 10+033.392 × 10+033.831 × 10+032.808 × 10+03
P1.956 × 10−11 (+)1.956 × 10−11 (+)7.257 × 10−11 (+)6.327 × 10−06 (+)1.956 × 10−11 (+)1.738 × 10−02 (+)1.526 × 10−01 (-)7.253 × 10−01 (-)2.520 × 10−02 (+)
Rank10755282281
Ave7.823 × 10+037.169 × 10+034.117 × 10+033.881 × 10+036.398 × 10+033.724 × 10+033.579 × 10+033.542 × 10+033.667 × 10+033.602 × 10+03
F27Std8.866 × 10+026.506 × 10+022.719 × 10+021.843 × 10+029.214 × 10+022.833 × 10+021.520 × 10+021.656 × 10+021.378 × 10+021.174 × 10+02
P1.206 × 10−10 (+)3.159 × 10−10 (+)4.113 × 10−07 (+)2.624 × 10−03 (+)4.616 × 10−10 (+)6.843 × 10−02 (-)3.671 × 10−03 (+)4.980 × 10−04 (+)4.290 × 10−01
(-)
Rank10875962241
Ave2.314 × 10+041.178 × 10+046.090 × 10+034.072 × 10+037.432 × 10+033.293 × 10+033.293 × 10+033.293 × 10+033.298 × 10+033.293 × 10+03
F28Std2.753 × 10+038.807 × 10+028.312 × 10+021.335 × 10+035.213 × 10+022.607 × 10+012.636 × 10+012.17 × 10+012.697 × 10+012.260 × 10+01
P3.020 × 10−11 (+)3.020 × 10−11 (+)2.154 × 10−10 (+)4.616 × 10−10 (+)3.020 × 10−11 (+)5.592 × 10−01 (-)2.838 × 10−01 (-)4.207 × 10−02 (+)4.290 × 10−01
(-)
Rank10968634152
Ave9.786 × 10+051.924 × 10+046.364 × 10+035.977 × 10+031.538 × 10+045.190 × 10+034.520 × 10+034.903 × 10+035.229 × 10+034.622 × 10+03
F29Std1.898 × 10+067.218 × 10+036.039 × 10+027.624 × 10+026.783 × 10+034.868 × 10+023.585 × 10+023.770 × 10+023.781 × 10+022.446 × 10+02
P3.020 × 10−11 (+)3.020 × 10−11 (+)1.558 × 10−108 (+)1.320 × 10−04 (+)3.338 × 10−11 (+)6.735 × 10−01 (-)3.805 × 10−07 (+)1.174 × 10−03 (+)9.470 × 10−01
(-)
Rank10966841341
Ave1.520 × 10+101.022 × 10+092.079 × 10+081.677 × 10+078.250 × 10+081.491 × 10+068.921 × 10+051.849 × 10+061.423 × 10+068.664 × 10+05
F30Std4.676 × 10+091.427 × 10+094.585 × 10+081.017 × 10+073.285 × 10+086.294 × 10+051.605 × 10+056.462 × 10+055.048 × 10+059.744 × 10+04
P3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)3.020 × 10−11 (+)8.189 × 10−01 (-)1.695 × 10−09 (+)5.092 × 10−08 (+)
Rank10976742531
Average
Rank
9.447.795.966.557.483.862.373.823.962.03
+/NaN/-29/0/029/0/026/0/327/0/228/0/121/0/822/0/726/0/320/0/9
Table 8. IBSSA ablation test on CEC2017 test suite (dim = 30).
Table 8. IBSSA ablation test on CEC2017 test suite (dim = 30).
FIndexSSA1SSA2SSA3SSA4SSA5SSA6SSAIBSSA
Mean4.271 × 10+032.543 × 10+032.525 × 10+032.965 × 10+031.812 × 10+032.482 × 10+037.593 × 10+031.430 × 10+03
F1Std5.572 × 10+032.351 × 10+032.363 × 10+032.870 × 10+031.688 × 10+032.225 × 10+036.329 × 10+031.165 × 10+03
Rank74462381
Mean3.000 × 10+023.000 × 10+023.000 × 10+023.000 × 10+023.000 × 10+023.000 × 10+023.000 × 10+023.000 × 10+02
F3Std3.120 × 10−147.722 × 10−104.961 × 10−091.467 × 10−092.923 × 10−084.663 × 10−101.077 × 10−109.570 × 10−11
Rank14657382
Mean4.183 × 10+024.400 × 10+024.463 × 10+024.382 × 10+024.333 × 10+024.488 × 10+024.319 × 10+024.030 × 10+02
F4Std2.700 × 10+013.452 × 10+014.741 × 10+013.934 × 10+014.002 × 10+014.005 × 10+013.780 × 10+015.951 × 10+00
Rank24856731
Mean7.573 × 10+027.705 × 10+027.200 × 10+027.742 × 10+027.602 × 10+027.506 × 10+027.538 × 10+026.538 × 10+02
F5Std3.650 × 10+014.330 × 10+014.198 × 10+013.464 × 10+014.643 × 10+014.42 × 10+013.975 × 10+012.231 × 10+01
Rank37258531
Mean6.487 × 10+026.502 × 10+026.483 × 10+026.501 × 10+026.483 × 10+026.473 × 10+026.459 × 10+026.411 × 10+02
F6Std9.791 × 10+009.600 × 10+009.001 × 10+001.172 × 10+018.310 × 10+001.201 × 10+011.123 × 10+015.955 × 10+00
Rank57382631
Mean1.192 × 10+031.236 × 10+039.67 × 10+021.203 × 10+031.273 × 10+031.213 × 10+031.219 × 10+039.910 × 10+02
F7Std1.133 × 10+021.001 × 10+023.05 × 10+011.121 × 10+021.842 × 10+021.032 × 10+021.014 × 10+024.047 × 10+01
Rank44148732
Mean9.703 × 10+029.653 × 10+029.823 × 10+029.766 × 10+029.601 × 10+029.786 × 10+029.772 × 10+029.342 × 10+02
F8Std3.219 × 10+012.543 × 10+013.050 × 10+012.947 × 10+013.234 × 10+012.681 × 10+013.272 × 10+011.432 × 10+01
Rank62733581
Mean4.515 × 10+035.255 × 10+035.311 × 10+035.278 × 10+035.169 × 10+035.190 × 10+035.259 × 10+034.364 × 10+03
F9Std3.935 × 10+023.691 × 10+022.540 × 10+023.301 × 10+025.172 × 10+022.754 × 10+024.481 × 10+024.592 × 10+02
Rank25467183
Mean4.613 × 10+035.343 × 10+035.233 × 10+035.376 × 10+035.539 × 10+035.266 × 10+035.314 × 10+034.587 × 10+03
F10Std3.551 × 10+025.737 × 10+025.184 × 10+025.051 × 10+023.901 × 10+025.224 × 10+025.751 × 10+022.860 × 10+02
Rank27355471
Mean1.339 × 10+031.318 × 10+031.324 × 10+031.323 × 10+031.325 × 10+031.321 × 10+031.339 × 10+031.214 × 10+03
F11Std7.591 × 10+017.562 × 10+017.085 × 10+017.869 × 10+011.100 × 10+028.209 × 10+018.403 × 10+012.198 × 10+01
Rank62347581
Mean1.003 × 10+041.033 × 10+048.463 × 10+038.881 × 10+038.661 × 10+038.627 × 10+033.696 × 10+047.438 × 10+03
F12Std2.504 × 10+032.526 × 10+031.866 × 10+031.680 × 10+031.545 × 10+031.371 × 10+032.045 × 10+041.258 × 10+03
Rank67353281
Mean7.384 × 10+037.061 × 10+036.195 × 10+036.961 × 10+036.905 × 10+036.565 × 10+032.426 × 10+042.541 × 10+03
F13Std2.698 × 10+033.423 × 10+032.570 × 10+033.002 × 10+032.362 × 10+035.200 × 10+032.415 × 10+044.481 × 10+02
Rank67243481
Mean4.772 × 10+035.483 × 10+035.319 × 10+034.360 × 10+035.592 × 10+035.778 × 10+036.273 × 10+034.777 × 10+03
F14Std2.557 × 10+032.911 × 10+032.502 × 10+031.862 × 10+032.401 × 10+032.381 × 10+032.987 × 10+032.147 × 10+03
Rank37415582
Mean4.682 × 10+034.287 × 10+033.774 × 10+034.491 × 10+033.943 × 10+034.962 × 10+031.230 × 10+042.343 × 10+03
F15Std2.684 × 10+032.730 × 10+031.722 × 10+033.012 × 10+031.948 × 10+032.888 × 10+031.287 × 10+044.943 × 10+02
Rank54263781
Mean2.852 × 10+032.771 × 10+032.841 × 10+032.891 × 10+032.893 × 10+032.311 × 10+032.896 × 10+032.821 × 10+03
F16Std3.256 × 10+022.433 × 10+023.252 × 10+023.320 × 10+023.401 × 10+023.250 × 10+023.481 × 10+022.275 × 10+02
Rank51467381
Mean2.481 × 10+032.480 × 10+032.533 × 10+032.608 × 10+032.479 × 10+032.488 × 10+032.522 × 10+032.051 × 10+03
F17Std3.057 × 10+022.601 × 10+022.947 × 10+022.681 × 10+023.280 × 10+023.150 × 10+023.401 × 10+029.255 × 10+01
Rank32663581
Mean9.251 × 10+039.579 × 10+038.674 × 10+038.790 × 10+037.881 × 10+038.782 × 10+031.469 × 10+057.091 × 10+03
F18Std3.061 × 10+032.702 × 10+032.291 × 10+032.342 × 10+032.610 × 10+032.763 × 10+031.047 × 10+051.754 × 10+03
Rank66243581
Mean4.610 × 10+035.461 × 10+035.457 × 10+035.636 × 10+034.728 × 10+034.451 × 10+031.283 × 10+044.911 × 10+03
F19Std2.412 × 10+032.823 × 10+032.613 × 10+032.723 × 10+032.420 × 10+032.631 × 10+031.625 × 10+042.114 × 10+03
Rank16563382
Mean2.771 × 10+032.771 × 10+032.753 × 10+032.665 × 10+032.672 × 10+032.861 × 10+032.792 × 10+032.308 × 10+03
F20Std2.303 × 10+022.112 × 10+022.288 × 10+022.149 × 10+022.172 × 10+022.184 × 10+022.071 × 10+027.992 × 10+01
Rank74623851
Mean2.523 × 10+032.535 × 10+032.573 × 10+032.538 × 10+032.573 × 10+032.529 × 10+032.547 × 10+032.461 × 10+03
F21Std5.042 × 10+015.381 × 10+015.293 × 10+011.032 × 10+015.871 × 10+015.462 × 10+016.823 × 10+015.293 × 10+01
Rank14568371
Mean5.831 × 10+034.856 × 10+035.427 × 10+036.188 × 10+036.349 × 10+035.882 × 10+035.998 × 10+032.309 × 10+03
F22Std2.302 × 10+032.331 × 10+032.291 × 10+031.862 × 10+031.701 × 10+031.261 × 10+021.981 × 10+034.708 × 10+01
Rank54355251
Mean2.971 × 10+032.983 × 10+032.961 × 10+032.972 × 10+032.972 × 10+032.381 × 10+032.951 × 10+032.861 × 10+03
F23Std1.422 × 10+021.699 × 10+029.160 × 10+017.445 × 10+011.121 × 10+023.242 × 10+018.183 × 10+013.099 × 10+01
Rank78446131
Mean3.132 × 10+033.133 × 10+033.161 × 10+033.141 × 10+033.229 × 10+033.001 × 10+033.081 × 10+032.971 × 10+03
F24Std8.812 × 10+011.032 × 10+021.969 × 10+021.572 × 10+022.688 × 10+023.962 × 10+017.766 × 10+012.096 × 10+01
Rank45768231
Mean2.903 × 10+032.903 × 10+032.908 × 10+032.892 × 10+032.903 × 10+032.903 × 10+032.899 × 10+032.887 × 10+03
F25Std1.472 × 10+011.881 × 10+012.062 × 10+011.421 × 10+012.052 × 10+013.262 × 10+011.738 × 10+014.190 × 10+00
Rank24615782
Mean5.813 × 10+036.302 × 10+036.205 × 10+035.740 × 10+035.771 × 10+036.401 × 10+036.505 × 10+032.874 × 10+03
F26Std1.760 × 10+021.933 × 10+021.571 × 10+021.844 × 10+021.820 × 10+024.789 × 10+029.291 × 10+024.539 × 10+01
Rank26222781
Mean3.362 × 10+033.271 × 10+033.291 × 10+033.270 × 10+033.329 × 10+033.261 × 10+033.261 × 10+033.261 × 10+03
F27Std3.813 × 10+024.312 × 10+015.532 × 10+013.301 × 10+012.723 × 10+025.323 × 10+013.142 × 10+012.124 × 10+01
Rank85647321
Mean3.148 × 10+033.141 × 10+033.153 × 10+033.147 × 10+033.144 × 10+033.141 × 10+033.134 × 10+033.146 × 10+03
F28Std5.832 × 10+016.373 × 10+019.282 × 10+015.590 × 10+017.612 × 10+017.634 × 10+015.980 × 10+016.040 × 10+01
Rank35826714
Mean4.225 × 10+034.214 × 10+034.311 × 10+034.190 × 10+034.241 × 10+034.112 × 10+034.165 × 10+033.759 × 10+03
F29Std2.767 × 10+022.942 × 10+022.409 × 10+022.771 × 10+022.710 × 10+022.441 × 10+022.971 × 10+028.156 × 10+01
Rank58335251
Mean8.971 × 10+039.134 × 10+038.568 × 10+038.269 × 10+038.121 × 10+038.092 × 10+031.186 × 10+047.841 × 10+03
F30Std3.243 × 10+032.927 × 10+032.322 × 10+032.097 × 10+032.036 × 10+032.210 × 10+034.677 × 10+031.494 × 10+03
Rank66542381
Average Rank4.245.004.274.414.894.316.131.34
Table 9. Experimental results of three truss problems.
Table 9. Experimental results of three truss problems.
Algorithm x 1 x 2 Optimal Cost
IBSSA0.7884530950.408001671263.8523490
SSA0.777819840.438927512263.9379689
QMESSA0.7950063130.389797431263.883539
LSSA0.7965528580.385572543263.8996827
DBO0.7829840690.424106744263.8846622
PSO0.7830935470.423354054263.8735309
BBO0.7672960040.47128734264.2056443
DE0.7949085110.38974078263.8894148
SCA0.771183560.456863478264.3307459
GWO0.7942370830.39190159263.8767489
Table 10. WBD problem experimental results.
Table 10. WBD problem experimental results.
Algorithm h l t b Optimal Cost
LBSSA0.2032189613.2946704149.0695951860.2062654251.706856383
SSA0.1650513514.0977043249.2605021970.2046550271.773439207
QMESSA0.2175237673.2907337188.1915903560.2503645741.878052948
LSSA0.171044754.0236967289.1021186160.2060136291.756034065
DBO0.1864982313.6382259979.0551287390.2062325841.724475807
GSA0.1990060495.711672281100.2236177722.370518451
PSO0.9480665181.635150837221.09 × 1014
BBO0.9710281051.587812929221.09 × 1014
DE0.7906689622221.09 × 1014
ACO14321.69 × 105
SCA0.2202113633.677689586100.2231709252.10 × 100
GWO0.204407093.3653304039.0443168640.2083236831.729436313
Table 11. Experimental results of CSD problems.
Table 11. Experimental results of CSD problems.
Algorithm x 1 x 2 x 3 Optimal Cost
BSSA0.1391540681.311.893975143.661894436
SSA0.1377264911.25941461212.557686593.678904737
ACO1323.90 × 10+02
GSA0.1269567511.2780901688.4778046525.65 × 100
PSO2.00006105122409.7905129
BBO2.0012062112.0000000342410.0817285
SCA0.1339228511.17760770513.420062163.897248467
GWO0.1391871671.311.890711543.662048997
Table 12. Experimental results of PVD problems.
Table 12. Experimental results of PVD problems.
Algorithms T s T h R L Optimal Cost
SSA0.6164085430.40000000045.27477441162.09714254797.882431
GWO0.6190441770.40000000045.30387753161.99056594797.882715
SCA 0.6926526540.40000000048.43816405137.65133064797.804015
BBO0.6482301070.40000000046.54471795151.33021714797.804015
QMESSA0.7781071180.50935743546.02728934131.75232784797.804015
IBSSA0.5395713960.40000000041.97999301187.33333334797.804015
Table 13. Experimental results of I-beam design problem.
Table 13. Experimental results of I-beam design problem.
Algorithms I 1 I 2 I 3 I 4 Optimal Cost
SSA49.8500078.222200.90002.432000.02111089
GWO50.0000080.000000.90002.336280.01126443
SCA 50.0000080.000000.95002.356410.01984311
BBO50.0000080.000000.90002.451230.01653121
QMESSA50.0000080.0000051.75465.00000.006624354
IBSSA50.0000080.000001.76505.00000.006623211
Table 14. Experimental results of gear train design problem.
Table 14. Experimental results of gear train design problem.
Algorithms g 1 g 2 g 3 g 4 Optimal Cost
SSA431619492.81875115 × 10−12
GWO452022502.12875411 × 10−08
SCA 331515447.87251312 × 10−11
BBO501122514.21873112 × 10−10
QMESSA431619492.71023412 × 10−12
IBSSA431619492.70012421 × 10−12
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Zhao, X.; Yang, C.; Zhu, D.; Liu, Y. A Hybrid Algorithm Based on Multi-Strategy Elite Learning for Global Optimization. Electronics 2024, 13, 2839. https://doi.org/10.3390/electronics13142839

AMA Style

Zhao X, Yang C, Zhu D, Liu Y. A Hybrid Algorithm Based on Multi-Strategy Elite Learning for Global Optimization. Electronics. 2024; 13(14):2839. https://doi.org/10.3390/electronics13142839

Chicago/Turabian Style

Zhao, Xuhua, Chao Yang, Donglin Zhu, and Yujia Liu. 2024. "A Hybrid Algorithm Based on Multi-Strategy Elite Learning for Global Optimization" Electronics 13, no. 14: 2839. https://doi.org/10.3390/electronics13142839

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop