Next Article in Journal
Review of the Brain’s Behaviour after Injury and Disease for Its Application in an Agent-Based Model (ABM)
Next Article in Special Issue
Multi-UAV Cooperative Coverage Search for Various Regions Based on Differential Evolution Algorithm
Previous Article in Journal / Special Issue
Gender-Driven English Speech Emotion Recognition with Genetic Algorithm
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Improved Multi-Strategy Crayfish Optimization Algorithm for Solving Numerical Optimization Problems

1
Leicester Institution, Dalian University of Technology, Dalian 124221, China
2
Institute of Public Foundations, Dalian University of Technology, Dalian 124221, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Biomimetics 2024, 9(6), 361; https://doi.org/10.3390/biomimetics9060361
Submission received: 28 April 2024 / Revised: 9 June 2024 / Accepted: 12 June 2024 / Published: 14 June 2024

Abstract

:
The crayfish optimization algorithm (COA), proposed in 2023, is a metaheuristic optimization algorithm that is based on crayfish’s summer escape behavior, competitive behavior, and foraging behavior. COA has a good optimization performance, but it still suffers from the problems of slow convergence speed and sensitivity to the local optimum. To solve these problems, an improved multi-strategy crayfish optimization algorithm for solving numerical optimization problems, called IMCOA, is proposed to address the shortcomings of the original crayfish optimization algorithm for each behavioral strategy. Aiming at the imbalance between local exploitation and global exploration in the summer heat avoidance and competition phases, this paper proposes a cave candidacy strategy and a fitness–distance balanced competition strategy, respectively, so that these two behaviors can better coordinate the global and local optimization capabilities and escape from falling into the local optimum prematurely. The directly foraging formula is modified during the foraging phase. The food covariance learning strategy is utilized to enhance the population diversity and improve the convergence accuracy and convergence speed. Finally, the introduction of an optimal non-monopoly search strategy to perturb the optimal solution for updates improves the algorithm’s ability to obtain a global best solution. We evaluated the effectiveness of IMCOA using the CEC2017 and CEC2022 test suites and compared it with eight algorithms. Experiments were conducted using different dimensions of CEC2017 and CEC2022 by performing numerical analyses, convergence analyses, stability analyses, Wilcoxon rank–sum tests and Friedman tests. Experiments on the CEC2017 and CEC2022 test suites show that IMCOA can strike a good balance between exploration and exploitation and outperforms the traditional COA and other optimization algorithms in terms of its convergence speed, optimization accuracy, and ability to avoid premature convergence. Statistical analysis shows that there is a significant difference between the performance of the IMCOA algorithm and other algorithms. Additionally, three engineering design optimization problems confirm the practicality of IMCOA and its potential to solve real-world problems.

1. Introduction

The optimization problem forms a specialized class of mathematical problems aimed at improving a system or solution by finding the best solution among multiple alternatives where the intended design objective is maximized or minimized. Frequently, real-world applications require the imposition of multiple design constraints in order to satisfy the solution’s usability requirements. Most of these problems are nonlinear, complex, and non-microscopic, making them challenging to solve. To solve such problems, two main types of algorithms are available. One type is deterministic algorithms. A major drawback of these methods is that they rely on a priori information about the derivatives of the functions involved in the problem, including the objective function and constraints. In many cases, these traditional optimization methods have difficulty in determining the optimal solution because they terminate the search process when the gradient approaches zero, which occurs in both global and local optimal cases, resulting in their very low efficiency. The other category is metaheuristics, which are general-purpose algorithms developed for solving highly complex optimization problems by manipulating one or more potential solutions to achieve the optimal or most advantageous solution. Their iterative approach aims to progress from an initial solution of poor quality to an optimal solution, ending the process once some predetermined criterion has been reached. These algorithms have proven their reliability and effectiveness in discovering optimal solutions to complex real-world problems. In addition to classical numerical optimization, metaheuristic algorithms have demonstrated their efficacy in a wide range of optimization tasks, including, but not limited to, feature selection [1,2], the traveling salesman problem [3,4], image segmentation problems [5,6,7], wireless sensor coverage problems [8,9], parameter estimation for solar photovoltaic models [10,11], and path planning [12,13]. In the past decades, new metaheuristic algorithms have been continuously proposed that are based on evolutionary theory, physical laws, biological population behavior, and human behavior. Table 1 shows some of the algorithms proposed in recent years.
Metaheuristics are randomized algorithms, and that randomness often leads to better solutions. They involve two important search phases: exploration and exploitation. The exploration phase requires the algorithm to explore various regions of the search space to discover each promising region, while the exploitation phase involves continuing the search within the potential regions discovered in the exploration phase to find the best solution. According to the No Free Lunch (NFL) theorem [37], no class of algorithms can solve all problems well. The theory reflects the expandability of algorithms. Therefore, scholars continue to propose various novel or improved optimization algorithms to solve different optimization problems.
The crayfish optimization algorithm (COA) [38] is a swarm-based metaheuristic algorithm proposed by Jia et al. The algorithm is modeled by simulating the thermal, competitive, and foraging behaviors of crayfish in summer. As a new swarm-based metaheuristic algorithm, COA suffers from the drawbacks such as slow convergence, low accuracy, and tendency to fall into the local optimum when dealing with real complex problems. In order to overcome these shortcomings, an improved multi-strategy crayfish optimization algorithm (IMCOA) is proposed in this paper. First, to address the imbalance between local exploitation and global exploration in the summer heat avoidance phase and the competition phase, a cave candidate strategy and a fitness–distance balanced competition strategy are proposed, respectively, so that these two behaviors can better coordinate the global and local optimization capabilities and avoid falling into the local optimum prematurely. Second, a food covariance learning strategy is introduced in the foraging phase to enhance the population diversity and to improve the convergence accuracy and convergence speed. Finally, an optimal non-monopoly search strategy is introduced to perturb the updated optimal solution, which improves the ability of the algorithm to obtain the global optimal solution.
In the experimental part, the optimization performance of IMCOA is examined using CEC2017 and CEC2022 test functions. The superiority of the method in this paper is illustrated by numerical analyses, convergence analyses, stability analyses, Friedman tests and Wilcoxon rank–sum tests.
The main contributions of this paper are as follows.
  • A cave candidate strategy and fitness–distance balanced competition strategy are proposed to adjust the original COA heat avoidance behavior and competition behavior to improve the optimization ability of the algorithm and effectively prevent the risk of the algorithm falling into a local optimum.
  • The direct foraging behavior formula of COA is optimized using the food covariance learning strategy to improve the quality of understanding and search efficiency.
  • An optimal non-monopoly search strategy is introduced to perturb the updated optimal solution, which improves the ability of the algorithm to obtain the global optimal solution and enables the algorithm to explore more valuable domains.
  • IMCOA is tested on 29 functions of CEC2017 and 12 functions of CEC2022 with different dimensions.
  • IMCOA is tested on three engineering applications.
The rest of the paper is specifically structured as follows: Section 2 describes the basics of the COA algorithm. Section 3 presents the details of the proposed improved strategy followed by a time complexity analysis. Section 4 and Section 5 are the experimental parts, where the performance of the proposed IMCOA is evaluated by the CEC2017 and CEC2022 test suites and compared with other algorithms. Additionally, three engineering design optimization problems are employed to evaluate the performance of IMCOA. We summarize our study in Section 5 and present an outlook for future research.

2. Crayfish Optimization Algorithm (COA)

This section describes the mathematical model of COA in detail, including the processes of the initialization phase, the exploration phase, and the exploitation phase.

2.1. Initialization Phase

COA is a swarm-based optimization algorithm that utilizes randomly initialized crayfish groups as search agents. This is represented by Equation (1):
X = l b + r a n d × u b l b
In this equation, rand represents a random number in [0, 1]. u b and l b denote the upper and lower bounds of the solution space, respectively. In each iteration, each X generates a candidate solution. The best solution obtained so far is considered the minimum solution.
The behavior of crayfish enters different stages with change in temperature. The temperature is calculated as shown in Equation (2). In COA, when the temperature is higher than 30 °C, crayfish will choose heat avoidance behavior. Otherwise, crayfish will perform foraging behavior. Crayfish show strong foraging behavior between 20 °C and 30 °C. The optimal feeding temperature is 25 °C. Therefore, COA defines the temperature range as 20 °C to 35 °C. The mathematical model of crayfish feeding is shown in Equation (3).
t e m p = r a n d × 15 + 20
p r o p = C 1 × 1 2 π × exp t e m p 25 2 2 σ 2
where σ and C 1 are two constant values used to control crayfish feeding at different temperatures.

2.2. Heat Avoidance Behavior

During the heat avoidance behavior phase, when the temperature is greater than 30 degrees, crayfish recognize that the temperature is too high. At this time, crayfish will choose a relatively cool place to avoid the heat.
The mathematical model of crayfish summering behavior is shown in Equation (4):
X c a v e = X G b e s t + X L b e s t 2
where X G b e s t denotes the best position obtained by the number of iterations so far, and X L b e s t represents the best position of the current crayfish population.
During the summer vacation phase, two cases occur. One is when r a n d < 0.5 , i.e., there are no other crayfish in the cave; the crayfish directly enter the cave to avoid the heat, and the mathematical model is shown in Equation (5). The other is when r a n d 0.5 . When this occurs, crayfish compete with each other. The representation of this competitive behavior is shown in Equation (6).
X n e w = X i , j + 2 t T × r a n d × X c a v e X i , j
X n e w = X i , j X z , j + X c a v e
where t denotes the current number of iterations and T denotes the maximum number of iterations. X z , j is a randomly selected agent from the crayfish.

2.3. Foraging Behavior

When the temperature is less than or equal to 30 °C, the temperature is suitable for crayfish to forage. The crayfish will move toward the food. After finding the food, the crayfish will judge the size of the food by Equation (7); if the food is too big, the crayfish will tear the food with its claws and then eat the food with the second claw and the third claw alternately.
Q = C 2 × r a n d × F X F X G b e s t
where C 2 is the food factor representing the largest food, which has a constant value of 3; F X is the fitness value of the crayfish; and F X G b e s t is the fitness value of the global best position.
When Q > C 2 + 1 / 2 , the crayfish tears up the food and then eats alternately with the second claw and the third claw. The foraging equation at this stage is expressed as follows:
X n e w = X i , j + exp 1 Q × X G b e s t × p r o p × cos 2 × π × r a n d sin 2 × π × r a n d
When Q C 2 + 1 / 2 , the crayfish only needs to move toward the food and eat directly, and Equation (9) is as follows:
X n e w = X i , j X G b e s t × p r o p + p r o p × r a n d × X i , j
The pseudo-code of the COA is shown in Algorithm 1:
Algorithm 1 Crayfish Optimization Algorithm (COA)
Initialization: Iterations T, Population Np, Dimension Dim; Randomly generate an initial population and assess the fitness values to obtain XGbest and XLbest
While (t < T) do
  Defining temperature temp by Equation (2)
  If temp > 30
    Define a cave Xcave based on Equation (4)
    If rand < 0.5
     Update the crayfish position according to Equation (5)
    Else
     Update the crayfish position according to Equation (6)
   End
  Else
   Calculate food intake prop and food size Q are obtained by Equations (3) and (7)
   If Q > (C3 + 1)/2
    Update the crayfish position according to Equation (8)
   Else
    Update the crayfish position according to Equation (9)
   End
  End
  Update fitness values, XGbest, XLbest
  t = t + 1
End while

3. The Proposed IMCOA

This section details the four improvement strategies proposed in this paper, incorporating the cave candidacy strategy, fitness–distance balanced competition strategy, food covariance learning strategy, and optimal non-monopoly search strategy. The time complexity of the IMCOA algorithm proposed in this paper as well as the original COA algorithm is also analyzed to ensure that the algorithm proposed in this paper improves the performance of the original algorithm without significantly increasing the time complexity, which is within the acceptable range.

3.1. Cave Candidacy Strategy

In COA, the summering phase of the formulation introduces the optimal solution, which facilitates the enhancement of COA exploitation. However, if the optimal solution falls into a local optimum, it will cause the remaining agents to follow to perform the optimal trap. In addition, the overpowering exploitation capability of the exploration phase is not conducive to balancing the search in this phase. In order to ensure that the exploration phase has a certain amount of exploitation capability along with a good exploration capability, we propose a cave candidate strategy. These candidate caves consist of several different categories of caves, and the crayfish can choose one from the candidate caves to enter. The specific formula of this strategy is expressed as follows:
X c c = S e l e c t X G b e s t , X 2 , X 3 , X 4 , X 5 , X 6 , X c a v e r a n d o m
X 4 = X G b e s t + X 2 / 2
X 5 = X G b e s t + X 2 + X 3 / 3
X 6 = i = 1 0 . 35 N p ω i × X i
ω i = ln ( 0 . 35 N p + 0 . 5 ) - ln ( i ) i = 1 N P / 2 ( ln ( 0 . 35 N p + 0.5 ) - ln ( i ) )
where X 2 and X 3 are the second and third global best agents. X 4 and X 5 are composed similarly to X c a v e and are used to enhance the exploitation capability. X 6 is obtained from a weighted average of the best part of the agents in the crayfish according to their performance, which can represent the evolutionary trend of the crayfish. By introducing the cave candidacy strategy, it makes the cave selection of crayfish more diverse and ensures the performance of the algorithm. The modified heat avoidance formula is expressed as follows:
X n e w = X i , j + 2 t T × r a n d × X c c X i , j

3.2. Fitness–Distance Balanced Competition Strategy

The updating method of the competition phase is mainly used to further search the problem space, but the original formula places too much emphasizes on random searching, which weakens the exploitation. Therefore, a fitness–distance balanced competition strategy is used in this paper, which selects an agent based on both fitness and distance scores together. In order to ensure sufficient exploitation performance in the competition phase, along with some global exploration performance, the agent is further filtered using a roulette wheel to ensure that every agent has a chance to be selected. This properly synchronizes the exploitation and exploration performance. The modified competition stage formula is shown in Equation (17).
X S c o r e = n o r m F i t + n o r m D i s / 2
X F d b c = S e l e c t X r o u l e t t e
X n e w = X i , j X F d b c , j + X c a v e
where n o r m F i t is the normalized value of fitness and n o r m D i s is the normalized value of distance. X F d b c is the agent selected using the strategy.

3.3. Food Covariance Learning Strategy

In COA, the foraging phase is categorized by two methods. By analyzing the distribution of PROP, it is found that COA executes Equation (9) more often. This approach accelerates the convergence, but it is easy to fall into the local optimum, which is not favorable for further exploitation. Based on the above analysis, this paper proposes a food covariance learning strategy. This strategy will utilize the effective information of the better part of the agents besides utilizing the information of the food source (optimal solution) [39]. This can correctly guide the agent evolution and improve the algorithm performance.
X n e w = X G b e s t + X m e a n + X / 3 + y , y ~ N 0 , C o v
C o v ( i ) = 1 0.35 N p i = 1 0.35 N p X X m e a n × X X m e a n T
X m e a n = i = 1 0.35 N p ω i × X i
This strategy mainly utilizes the overall distribution information of the better agents, which is detrimental to the performance of the strategy when the overall number is small. Therefore, this paper further introduces an external archiving mechanism, which puts the best part of agents in each iteration into the archive. When the number of archived agents is large, the redundant agents are removed according to the first-in-first-out principle.

3.4. Optimal Non-Monopoly Search Strategy

The quality of the optimal solution has an important impact on the performance of the algorithm, and if the optimal solution falls into a local optimum, it will cause the subsequent agents to fall into a local optimum as well. In order to avoid premature convergence and to improve the global search capability, the optimal solution needs to be handled. The non-monopoly search strategy [40] is a new local search method that modifies each dimension of the current solution space along the search space, which can further improve the quality of the optimal solution. In this paper, we utilize the non-monopoly search strategy to perturb the optimal individuals to further enhance the performance. The non-monopoly search strategy is formulated as follows:
X G n e w ( j ) = r a n d × X G b e s t ( r a n d o m )
X G n e w ( j ) = X G b e s t ( j ) X G b e s t ( R S ) × r a n d × e p s X G b e s t ( j ) 1
where X G n e w ( j ) is the j dimension of the new solution. X G b e s t ( r a n d o m ) is a random dimension of the best solution. In this strategy, Equation (22) is used in pre-period, and Equation (23) is used in post-period. In order to further enhance the global search capability in the period and the local search capability in the post period, in this paper, the Cauchy operator and the Gaussian operator are introduced. The Cauchy operator can effectively provide the agent with a wide range of perturbations, while the Gaussian operator can provide the agent with finer adjustments. The modified mathematical formulas are represented as follows:
X G n e w ( j ) = C a u c h y × X G b e s t ( r a n d o m )
X G n e w ( j ) = X G b e s t ( j ) X G b e s t ( R S ) × r a n d × e p s X G b e s t ( j ) 1 × G a u s s i a n

3.5. Implementation Steps of the IMCOA Algorithm

The pseudo-code and flow chart of the IMCOA is shown in Algorithm 2 and Figure 1.
Algorithm 2 Improved Multi-strategy Crayfish Optimization Algorithm (IMCOA)
Initialization: Iterations T, Population Np, Dimension Dim; Randomly generate an initial population and assess the fitness values to obtain XGbest and XLbest
While (t < T) do
  Defining temperature temp by Equation (2)
  Calculate Score of each agent according to Equation (16)
  If temp > 30
    Define a cave Xcc based on Equation (10)
    If rand < 0.5
     Update the crayfish position according to Equation (15)
    Else
     Update the crayfish position according to Equation (18)
   End
  Else
   Calculate food intake prop and food size Q are obtained by Equations (3) and (7)
   Calculate cov and Xmean according to Equations (20) and (21)
   If Q > (C3 + 1)/2
     Update the crayfish position according to Equation (8)
   Else
     Update the crayfish position according to Equation (19)
   End
  End
  Update fitness values, XGbest, XLbest
  Update XGbest according to Equations (20), (24) and (25)
  t = t + 1
End while

3.6. Computational Time Complexity

The time complexity reflects the processing length needed for an algorithm to resolve a problem when its scale is increasing. As for COA, the population is N, the dimension is D, and the maximum number of iterations is T. During the initialization, the time complexity for fitness calculation is O N × D . The individual position update involves updating the positions of each individual over T iterations, so the time complexity is O T × N × D . Therefore, the total time complexity of COA is O N × D + T × N × D . Removing lower-order terms, the overall time complexity of COA can be simplified as O T × N × D .
For IMCOA, the initialization process is O N × D . The time complexity of the cave candidacy strategy and fitness–distance balanced competition strategy is O T × N / 2 × D , the food covariance learning strategy time complexity is O T × N / 2 × D 2 , and the optimal non-monopoly search strategy time complexity is O T × D 2 . Thus, the total complexity of IMCOA is as below:
O I M C O A = O N × D + T × N / 2 × D + T × N / 2 × D 2 + T × D 2 = O T D 2 × N / 2 + 1
Although the time complexity of IMCOA is larger than that of COA, the IMCOA performance is significantly enhanced compared with that of COA, so this case can be accepted.

4. Experimental Results and Discussion of the CEC2017 Test Suite

4.1. Parameter Setting and Environment

The software and hardware used for all experiments are given in Table 2. The experimental parameters of this paper set the population number to 50, the maximum number of iterations to 500, and each algorithm was set to run independently 30 times and to select and record the average value, best value, and standard deviation in each run. The parameters of each algorithm are set out in Table 3.

4.2. CEC2017 Benchmark Function Experiment

4.2.1. Description of Benchmark Functions

The benchmark test function serves as a crucial tool for evaluating the performance of algorithms, offering a standardized platform to assess and compare various optimization optimizers. In this study, we utilize the CEC2017 test suite to evaluate the performance of the proposed IMCOA algorithm across dimensions of 30, 50, and 100. With increasing dimensionality, the number of local optimal solutions also increases, enabling the suite to effectively evaluate the algorithm’s global optimization capability. The basic content of the CEC2017 benchmark functions are shown in Table A1 in Appendix A.

4.2.2. Case 1: CEC2017 (Dim = 30)

Quantitative Analysis

The results of this experimental case are contained in Table A2 in Appendix A. IMCOA achieved the best results for F1–F8, F10, F11, F13–F20, and F22–F29. TSO performed the best for F12 and F21. RIME provided the best solution for F9. The other algorithms did not achieve the best results for any function. In particular, it is noted that IMCOA outperformed COA on all functions, which indicates that the improvement strategy proposed in this paper effectively improves the performance of COA in 10 dimensions. To visualize the ranking of each algorithm, stacked bar charts were drawn based on the ranking of each algorithm, as shown in Figure 2. We categorized the rankings into five major categories: average rank first, average rank second, average rank third, average rank fourth, and other rankings. As can be seen in Figure 2, the IMCOA rankings are significantly higher compared with the COA rankings.
Figure A1 in Appendix A shows the average fitness convergence curves for IMCOA and the comparison algorithm with Dim = 10. As can be seen in Figure 3, IMCOA can break away from the local optimum and find better solutions in most functions, and it has the fastest convergence rate. This shows the effectiveness of the four strategies proposed in this paper. These strategies not only free the algorithm from local optimality, but they also improve the convergence speed and accuracy of the algorithm.
In Figure A2 in Appendix A, the performance of the nine algorithms is presented in detail in box-and-line plots, and it is clear that IMCOA has the best performance. The distribution of solutions for IMCOA is more centralized and smaller than that of all the other algorithms, which demonstrates the excellent performance of the IMCOA algorithm in terms of global exploration and local exploitation and verifies its effectiveness and accuracy.

Statistical Analysis

In this section, we will utilize the Wilcoxon rank–sum test and Friedman test to analyze the experimental results, assessing the statistical differences between IMCOA and other comparative algorithms.
In the rank–sum test, the significance level is defined as 5%. If the calculated value is less than 5%, this indicates that there is a significant difference between the comparison algorithms. If it is greater than 5%, it proves that there is no significant difference between the two algorithms. The symbols “+/=/−” are used to indicate whether IMCOA’s performance is superior, equivalent, or inferior to its competitors. As can be seen in Table 4 and Table 5, the similarity between IMCOA and the seven algorithms being compared is low, mostly below 5%. This indicates that there are differences between the optimization results of IMCOA and the other algorithms. The results of the Friedman test for each algorithm are also recorded in Table 5. IMCOA is ranked first in 30 dimensions and COA is ranked sixth.

4.2.3. Case 2: CEC2017 (Dim = 50)

Quantitative Analysis

The results of this experimental case are shown in Table A3 in Appendix A. IMCOA achieved the best results for all functions except F9 and F21. RIME showed the best performance for F9 and F21. The rest of the algorithms did not rank first for any function. Compared with COA, IMCOA obtained a big boost in ranking. Similarly, it can be noticed that whenever IMCOA achieved the best results, it achieved the best results in all metrics for all the functions. Figure 3 plots a bar chart based on the rankings of the different algorithms. It can be seen that IMCOA has a significant advantage.
The convergence curves and box plots of the IMCOA and comparison algorithms solving the CEC2017 test suite of dimensions 50 are shown in Figure A3 and Figure A4 in Appendix A. From Figure 3, it can be seen that IMCOA has better convergence accuracy and faster convergence for all functions except F9 and F21. This indicates that the convergence performance of IMCOA is better than the comparison algorithms. In addition, comparing the convergence in 30 and 50 dimensions, it is shown that the performance of IMCOA continues to provide good optimization results, which indicates that the performance of the improved strategy proposed in this paper does not suffer from an increase in dimensionality.
The results of the box plots illustrate that IMCOA can yield solutions with a more centralized distribution and that these solutions have better quality. This suggests that IMCOA has excellent performance in global exploration and local development and can consistently provide satisfactory solutions.

Statistical Analysis

The results of both statistical tests are given in Table 6 and Table 7. IMCOA shows no differences to any of the algorithms except to RIME for F9. For F21, IMCOA differs from the rest of the algorithms except AO and RIME. With respect to F22, there is no difference between IMCOA and SSA. Other than that, IMCOA is significantly different from the other algorithms for the rest of the functions.
Overall, IMCOA significantly outperforms the comparison algorithm in 26 functions. Especially in comparison to COA, IMCOA’s performance is not weaker than COA in any situation, which indicates that the proposed improvement method does not diminish the performance of COA.

4.2.4. Case 3: CEC2017 (Dim = 100)

Quantitative Analysis

The results of this experimental case are recorded in Table A4 in Appendix A. IMCOA achieved the best results for all functions except F9 and F21. SSA performed best in F9 and F21. The rest of the algorithms were unable to solve satisfactory results in all the functions in this dimension. Notably, IMCOA achieved 27 first places with an average ranking of 1.38, and COA has a ranking of 6.10. This indicates that the performance of the IMCOA proposed in this paper is significantly boosted. Analyzing the first two cases together, it can be seen that increasing the number of dimensions to 50 will not diminish the performance of IMCOA. When the number of dimensions is further increased to 100, the average ranking of IMCOA does not change much compared with other algorithms, which fully validates the superiority of IMCOA. This shows that the improvement strategy proposed in this paper can effectively improve the solving ability of COA and does not weaken the performance due to the increase in the number of dimensions. Figure 4 shows the ranking of each algorithm when the dimension is 100.
Figure A5 in Appendix A provides the convergence curves of IMCOA and the comparison algorithm solving the CEC2017 test suite with dimension 100. It can be seen that IMCOA converges faster and with better accuracy in the remaining functions other than F9 and F21, which indicates that IMCOA outperforms the rest of the algorithms in terms of convergence performance. SSA shows better convergence performance for F9 and F21. The quality of the solutions provided by the algorithms involved in the experiment is analyzed using box plots in Figure A6 in Appendix A. Obviously, the solutions of IMCOA have a more centralized distribution and fewer bad values, which indicates the better robustness of IMCOA.

Statistical Analysis

The results of the Wilcoxon rank–sum test and the Friedman test are presented in Table 8 and Table 9. IMCOA shows no difference with most algorithms for F9 and F19. There is no significant difference between IMCOA and COA in solving F21. Other than these, there are differences between IMCOA and the rest of the algorithms. Overall, IMCOA was able to outperform all the compared algorithms in 26 functions. IMCOA’s average ranking improved by five places to the first place compared with COA. These data show that IMCOA outperforms the other algorithms on the CEC2017 test suite (100 dimensions). Looking at the statistics of the three dimensions as a whole, IMCOA’s performance is stable in the first place, with significant differences from the other algorithms in some functions. The statistical tests in different dimensions further prove the superior performance of the IMCOA algorithm.

4.3. CEC2022 Benchmark Function Experiment

4.3.1. Description of Benchmark Functions

In this section, we further evaluate the performance of IMCOA using the CEC2022 test suite. The basic content of the CEC2022 test suite are shown in Table A5 in Appendix A.

4.3.2. Quantitative Analysis

To verify the performance of IMCOA more comprehensively, we validated it in 10 and 20 dimensions of the CEC2022 test suite, respectively. Table A6 and Table A7 show the optimum (Best), average (Ave), standard deviation (std), and ranking of IMCOA and its comparison algorithms for 30 independent runs using different dimensions. Figure 5 plots the Mulberry diagram based on the specific performance of each algorithm in both dimensions. These results show that the IMCOA algorithm proposed in this paper achieves the most significant victory with the first overall ranking. In addition, the convergence curve is shown in Figure A7, which shows that IMCOA is still improving as it has not reached the global optimum. The quality of the solutions of the nine algorithms for the two dimensions of the CEC2022 test suite is comprehensively illustrated in Figure A8 via box plots, and it can be seen that IMCOA achieves excellent results. This proves that the algorithm has excellent global exploration and local utilization capabilities and also proves the effectiveness and accuracy of the IMCOA algorithm proposed in this paper.

4.3.3. Statistical Analysis

The results of the Wilcoxon rank–sum test and Friedman test are given in Table 10, Table 11 and Table 12. Bolded data indicate a p-value greater than 0.05. The analysis shows that IMCOA is significantly different from the compared algorithms, except RIME, in most functions. Both IMCOA and RIME are significantly different in seven functions and are not different in five functions. Overall, IMCOA has the best performance, ranking first in both dimensions, with TSO and RIME each achieving second place in one dimension. COA ranks fifth and sixth, respectively. This indicates that the IMCOA proposed in this paper has a significant performance improvement over COA. Furthermore, in terms of overall performance, the decrease in the bolded entries in Table 10 and Table 11 as the dimensionality increases suggests that the difference between IMCOA and the rest of the algorithms will be more pronounced when solving in 20 dimensions, corroborating the potential of IMCOA to solve high-dimensional optimization problems. The superior performance of IMCOA is also confirmed by the fact that the number of “+” values is more than the number of “−” values in Table 12.

4.4. Impact Analysis of the Improved Strategies

In this section, we verify the effectiveness of each improvement strategy. The following four strategies are proposed in this paper: cave candidacy strategy, fitness–distance balanced competition strategy, food covariance learning strategy and optimal non-monopoly strategy. In order to analyze the four strategies together, the algorithm combining the cave candidacy strategy and the fitness–distance balanced competition strategy was named IMCOA-1, considering that both the heat avoidance and competition phases were conducted at temperatures greater than 30. The algorithm combining the food covariance learning strategy was named IMCOA-2, and the algorithm combining the optimal non-monopoly search strategy was named IMCOA-3. The three derived algorithms, COA, and IMCOA containing all four strategies were tested using the CEC2017 test function in 3 dimensions (30, 50 and 100) and the CEC2022 test suite in 2 dimensions (10 and 20). The parameter settings were kept constant.
Table 13 records the results of the Friedman test for the algorithms involved in the experiment in the five sets of tests. It can be seen that IMCOA, which contains all the strategies, has the best performance, as opposed to COA, which has the worst overall performance. The performance of the three derived algorithms in descending order is IMCOA-3 > IMCOA-2 > IMCOA-1. In order to visualize the performance of these algorithms, radar plots are drawn based on the rankings, as shown in Figure 6. The size of the area enclosed by each curve represents the good or poor performance of this algorithm. The smaller area represents the better performance of this algorithm. We can see that IMCOA has the smallest area surrounded by the curve, which indicates that IMCOA has the best performance. Overall, this algorithm shows good optimization performance in different dimensions, which indicates that our three proposed strategies effectively improve the performance of COA. Specifically, the optimal non-monopoly search strategy perturbs the optimal individuals sufficiently, which greatly improves the ability of the algorithm to get rid of localization and facilitates the further development of COA. The food covariance learning strategy guides the population toward the correct direction of evolution and enriches the population diversity. The cave candidacy strategy and fitness–distance balanced competition strategy balance well the development and exploration performance of COA and enhance the performance of COA.

5. Experimental Results and Discussion of Engineering Optimization Problems

5.1. Welded Beam Design Problem

The objective of the welded beam design problem is to minimize the manufacturing cost of the welded beam [46]. It involves four variables (h, l, t, b) and seven constraints, including tip detection, weld coverage area, bending stress, buckling load, and manufacturing cost. The schematic diagram for this engineering design problem is illustrated in Figure 7. The mathematical formulation for this engineering design problem is given below:
Consider
x = [ x 1   x 2   x 3   x 4 ] = [ h   l   t   b ]
Minimize
f ( x ) = 1.10471 x 1 2 x 2 + 0.04811 x 3 x 4 ( 14.0 + x 2 )
Variable range:
0.1 x i 2 , i = 1 , 4 ; 0.1 x i 10 , i = 2.3
Subject to
g 1 x = τ x τ max 0 , g 2 x = σ x σ max 0 , g 3 x = δ x δ max 0 g 4 x = x 1 x 4 0 , g 5 x = P P c x 0 , g 6 x = 0.125 x 1 0 g 7 x = 1.10471 x 1 2 + 0.04811 x 3 x 4 14.0 + x 2 0.5 0
where
τ x = τ 2 + 2 τ τ " x 2 2 R + τ " , τ = P 2 x 1 x 2 , τ " = M R J , M = P L + x 2 2 J = 2 2 x 1 x 2 x x 2 4 + x 1 + x 3 2 2 , δ x = 6 P L 3 E x 4 x 3 2 , R = x 2 2 4 + x 1 + x 3 2 2 , σ x = 6 P L x 4 x 3 2 P c x = x 3 2 x 4 6 0 4.013 E L 2 , 1 x 3 2 L E 4 G , 1 x 3 2 L E 4 G P = 6000 l b , L = 14 , δ max = 0.25 , E = 30 × 10 6 p s i , τ max = 13,600           p s i , a n d           σ max = 30,000               p s i
IMCOA and the competitors in Section 4.1 are applied to the welding beam problem for comparison. According to the results in Table 14, it is found that the minimum production cost, which is 1.692807, can be obtained by using IMCOA.

5.2. Tension/Compression Spring Design Problem

The tension/compression spring design is an optimization problem in engineering science aimed at reducing the weight of tension/compression springs [47]. It has four design factors that need to be optimized as shown in Figure 8, and four restrictions that should be considered. The primary objective of this problem is to minimize the weight of the spring by selecting three variables: wire diameter (d), mean coil diameter (D), and number of active coils (N). The mathematical formulation for this engineering design problem is given by Equations (29)–(31). The optimal weight of the compression spring derived by the proposed IMCOA is 0.010614. Table 15 demonstrates that all variants of the proposed algorithm outperform all other algorithms in terms of the optimum value. This implies that all variants of the proposed IMCOA are more effective than other competitors in solving this problem.
Consider
x = [ x 1   x 2   x 3 = d   D   N ]
Minimize
f ( x ) = ( x 3 + 2 ) × x 2 × x 1 2
Variable range:
0.05 x 1 2.0 , 0.25 x 2 1.3 , 2.0 x 3 15.0
Subject to
g 1 ( x ) = 1 x 3 × x 2 3 71785 × x 1 4 0 , g 2 ( x ) = 4 × x 2 2 x 1 × x 2 12566 × x 1 4 + 1 5108 × x 1 2 1 0 g 3 ( x ) = 1 140.45 × x 1 x 2 2 × x 3 0 , g 4 ( x ) = x 1 + x 2 1.5 1 0

5.3. Pressure Vessel Design Problem

The major aims of this design is to optimize the cost of materials in the formation and welding of a vessel, which is one of the common complex engineering-type problems [48]. This problem, as shown in Figure 9, contains four parametric conditions: the thickness of the shell (Ts), the thickness of the head (Th), the inner radius (R), and the length of the cylindrical section of the vessel (L). The mathematical model is developed with the simultaneous satisfaction of the four constraints as shown below:
Consider
x = x 1       x 2       x 3       x 4 = T s       T h       R       L
Minimize
f x = 0.6224 x 1 x 2 x 3 + 1.7781 x 2 x 3 2 + 3.1661 x 1 2 x 4 + 19.84 x 1 2 x 3
Variable range:
0 x 1 99 , 0 x 2 99 , 10 x 3 200 , 10 x 4 200
Subject to
g 1 ( x ) = x 1 + 0.0193 x 3 0 , g 2 ( x ) = x 3 + 0.00954 x 3 0 g 3 ( x ) = π x 3 2 x 4 + 4 3 π x 3 3 + 1,296,000 0 , g 4 ( x ) = x 4 240 0
IMCOA was compared with other algorithms on this problem model, and the results are shown in Table 16. The comparison clearly shows that IMCOA outperforms the competitors with the lowest cost of 5744.48400, which indicates that the algorithm has good optimization ability in this type of problem and can improve the design parameters effectively.

6. Conclusions

Aimed at addressing the shortcomings of the crayfish optimization algorithm such as its slow convergence speed, ease of falling into the local optimum, and low convergence accuracy, an improved multi-strategy crayfish optimization algorithm (IMCOA) is proposed. In IMCOA, a cave candidacy strategy and a fitness–distance balanced competition strategy are used to balance the development and exploration capabilities of the heat avoidance and competition phases to prevent the algorithm from falling into the local optimum. We propose using the food covariance learning strategy to improve the algorithm’s search efficiency, convergence speed, and robustness. By using the optimal non-monopoly search strategy for the optimal solution, the discovery of high-quality solutions is enhanced, and the optimization capability is improved. We evaluated the performance of IMCOA using 41 test functions from the CEC2017 and CEC2022 test suites, demonstrating its effectiveness on test functions in different dimensions. Using Wilcoxon and Friedman test statistical analyses, we confirm the significant advantages of IMCOA over its competitors in 27, 26, or 26 CEC2017 functions (Dim = 30, 50, or 100) and in 7 and 6 CEC2022 functions (Dim = 10 and 20). Additionally, we validated the applicability of IMCOA in three engineering design optimization problems, including the welded beam design problem, the tension/compression spring design problem, and the pressure vessel design problem. The experimental results thoroughly confirmed the practicality and outstanding performance of the IMCOA across the three optimization problems.
Next, we will continue to explore the applications of IMCOA in other areas, such as image segmentation, intrusion detection, wireless sensor coverage, and vehicle scheduling problems. Meanwhile, inspired by the literature [49], we can combine the characteristics of distributed algorithms to develop a distributed crayfish algorithm. In addition, multi-objective and constrained optimization problems become more important as real-world problems become more complex. Future research will develop a multi-objective version of IMCOA, focusing on IMCOA’s ability to solve multi-objective problems and to provide more comprehensive solutions to optimization problems.

Author Contributions

Conceptualization, R.W. and G.Z.; methodology, R.W. and S.Z.; software, R.W. and S.Z.; validation, R.W. and S.Z.; formal analysis, R.W. and S.Z.; investigation, R.W.; resources, R.W.; data curation, S.Z.; writing—original draft preparation, R.W.; writing—review and editing, R.W., S.Z. and G.Z.; visualization, S.Z.; supervision, G.Z.; project administration, G.Z.; funding acquisition, G.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The data presented in this study are available on request from the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A

Table A1. CEC2017 test functions.
Table A1. CEC2017 test functions.
TypeIDCEC2017 Function NameRangeDimensionfmin
UnimodalF1Shifted and Rotated Bent Cigar Function[−100, 100]30/50/100100
F2Shifted and Rotated Sum of Different Power Function[−100, 100]30/50/100200
F3Shifted and Rotated Zakharov Function[−100, 100]30/50/100300
MultimodalF4Shifted and Rotated Rosenbrock’s Function[−100, 100]30/50/100400
F5Shifted and Rotated Rastrigin’s Function[−100, 100]30/50/100500
F6Shifted and Rotated Expanded Scaffer’s F6 Function[−100, 100]30/50/100600
F7Shifted and Rotated Lunacek Bi_Rastrigin Function[−100, 100]30/50/100700
F8Shifted and Rotated Non-Continuous Rastrigin’s Function[−100, 100]30/50/100800
F9Shifted and Rotated Levy Function[−100, 100]30/50/100900
F10Shifted and Rotated Schwefel’s Function[−100, 100]30/50/1001000
HybridF11Hybrid Function 1 (N = 3)[−100, 100]30/50/1001100
F12Hybrid Function 2 (N = 3)[−100, 100]30/50/1001200
F13Hybrid Function 3 (N = 3)[−100, 100]30/50/1001300
F14Hybrid Function 4 (N = 4)[−100, 100]30/50/1001400
F15Hybrid Function 5 (N = 4)[−100, 100]30/50/1001500
F16Hybrid Function 6 (N = 4)[−100, 100]30/50/1001600
F17Hybrid Function 6 (N = 5)[−100, 100]30/50/1001700
F18Hybrid Function 6 (N = 5)[−100, 100]30/50/1001800
F19Hybrid Function 6 (N = 5)[−100, 100]30/50/1001900
F20Hybrid Function 6 (N = 6)[−100, 100]30/50/1002000
CompositionF21Composition Function 1 (N = 3)[−100, 100]30/50/1002100
F22Composition Function 2 (N = 3)[−100, 100]30/50/1002200
F23Composition Function 3 (N = 4)[−100, 100]30/50/1002300
F24Composition Function 4 (N = 4)[−100, 100]30/50/1002400
F25Composition Function 5 (N = 5)[−100, 100]30/50/1002500
F26Composition Function 6 (N = 5)[−100, 100]30/50/1002600
F27Composition Function 7 (N = 6)[−100, 100]30/50/1002700
F28Composition Function 8 (N = 6)[−100, 100]30/50/1002800
F29Composition Function 9 (N = 3)[−100, 100]30/50/1002900
F30Composition Function 10 (N = 3)[−100, 100]30/50/1003000
Table A2. CEC2017 experimental results (Dim = 30).
Table A2. CEC2017 experimental results (Dim = 30).
FunctionIndexIMCOACOADBOTSOGWOAOSSAHHORIME
F1Best1.12E+023.64E+062.10E+045.73E+042.49E+089.02E+081.33E+043.35E+071.00E+06
Ave6.22E+032.16E+081.14E+088.56E+051.74E+091.93E+092.32E+048.43E+072.42E+06
Std6.65E+034.46E+081.07E+081.74E+069.78E+086.00E+085.98E+033.72E+071.02E+06
Rank176389254
F2Best3.06E+024.77E+044.98E+043.06E+043.01E+044.25E+041.68E+042.97E+041.50E+04
Ave4.67E+029.97E+048.87E+045.09E+044.97E+045.83E+043.34E+044.58E+042.76E+04
Std2.31E+022.52E+042.17E+041.18E+041.15E+047.20E+039.90E+038.97E+038.95E+03
Rank198657342
F3Best4.00E+024.72E+024.92E+024.05E+025.24E+025.88E+024.70E+025.30E+024.55E+02
Ave4.63E+025.46E+026.42E+025.15E+026.04E+027.85E+025.07E+026.03E+025.21E+02
Std3.95E+014.01E+011.54E+023.06E+019.50E+011.62E+022.58E+015.32E+012.92E+01
Rank158379264
F4Best5.42E+026.12E+026.32E+025.91E+025.80E+026.44E+025.84E+026.80E+025.51E+02
Ave5.83E+027.42E+027.15E+026.62E+026.18E+027.18E+026.67E+027.55E+025.98E+02
Std2.71E+016.11E+015.29E+014.34E+013.54E+013.43E+015.08E+013.88E+012.83E+01
Rank186437592
F5Best6.00E+026.25E+026.19E+026.30E+026.03E+026.46E+026.34E+026.56E+026.03E+02
Ave6.00E+026.50E+026.36E+026.41E+026.09E+026.55E+026.51E+026.66E+026.08E+02
Std3.38E-011.30E+011.16E+017.04E+003.90E+006.14E+001.20E+014.99E+005.21E+00
Rank164538792
F6Best7.64E+028.92E+028.46E+029.55E+028.17E+021.00E+038.38E+021.21E+037.95E+02
Ave8.08E+021.19E+039.67E+021.06E+038.84E+021.11E+039.12E+021.30E+038.48E+02
Std1.95E+011.36E+027.78E+016.20E+015.64E+015.07E+016.45E+015.66E+013.06E+01
Rank185637492
F7Best8.41E+029.18E+029.15E+028.83E+028.60E+029.21E+028.95E+029.35E+028.53E+02
Ave8.76E+029.73E+029.96E+029.28E+028.94E+029.70E+029.60E+029.73E+028.99E+02
Std1.69E+012.45E+014.87E+012.55E+011.75E+012.36E+013.33E+012.30E+012.87E+01
Rank179426583
F8Best9.11E+022.92E+033.16E+031.68E+031.06E+033.93E+032.08E+035.50E+039.82E+02
Ave1.16E+036.87E+036.66E+033.51E+032.05E+036.93E+034.93E+038.05E+032.33E+03
Std2.85E+021.74E+032.20E+038.15E+028.54E+021.37E+031.57E+039.36E+021.54E+03
Rank176428593
F9Best3.20E+034.47E+034.20E+033.54E+033.22E+034.57E+033.92E+034.64E+033.23E+03
Ave5.26E+035.88E+035.76E+035.69E+034.87E+035.98E+035.02E+035.95E+034.46E+03
Std1.43E+038.09E+029.61E+021.03E+031.54E+036.84E+025.43E+026.54E+027.23E+02
Rank476529381
F10Best1.12E+031.23E+031.30E+031.15E+031.31E+031.87E+031.16E+031.24E+031.19E+03
Ave1.16E+031.45E+031.61E+031.25E+032.02E+033.02E+031.34E+031.38E+031.31E+03
Std2.82E+011.35E+022.44E+025.10E+019.04E+029.97E+027.82E+018.53E+016.01E+01
Rank167289453
F11Best5.49E+034.62E+051.21E+058.38E+041.76E+061.54E+071.79E+064.31E+061.21E+06
Ave5.08E+045.57E+063.48E+071.20E+065.81E+071.16E+082.17E+073.60E+071.51E+07
Std4.17E+043.23E+065.61E+071.11E+068.36E+079.67E+071.88E+072.58E+071.68E+07
Rank136289574
F12Best1.54E+032.37E+042.52E+042.01E+036.25E+041.52E+053.72E+042.84E+052.37E+04
Ave1.70E+041.43E+051.03E+071.23E+049.48E+066.14E+061.39E+058.29E+051.42E+05
Std2.17E+041.57E+052.05E+071.34E+043.34E+071.21E+078.72E+047.71E+051.69E+05
Rank259187364
F13Best1.49E+031.50E+045.06E+032.03E+037.97E+033.37E+045.17E+033.70E+041.32E+04
Ave1.56E+032.27E+051.57E+052.24E+046.01E+059.77E+053.90E+048.70E+056.93E+04
Std5.59E+012.33E+053.02E+052.32E+049.18E+059.60E+054.07E+047.99E+054.85E+04
Rank165279384
F14Best1.53E+034.56E+033.90E+031.62E+031.12E+042.22E+041.59E+042.47E+043.55E+03
Ave1.71E+032.07E+049.69E+046.79E+038.52E+051.55E+057.80E+041.14E+051.76E+04
Std1.58E+022.16E+041.57E+057.60E+031.57E+061.01E+056.77E+049.07E+041.25E+04
Rank146298573
F15Best1.85E+031.80E+032.32E+032.11E+031.88E+032.58E+032.07E+032.58E+032.07E+03
Ave2.34E+033.01E+033.20E+032.66E+032.58E+033.37E+032.71E+033.51E+032.64E+03
Std2.77E+024.19E+023.93E+022.72E+023.38E+025.04E+023.50E+024.54E+023.31E+02
Rank167428593
F16Best1.74E+031.95E+032.01E+031.86E+031.81E+031.90E+031.80E+032.04E+031.81E+03
Ave1.96E+032.22E+032.51E+032.28E+032.05E+032.48E+032.20E+032.62E+032.12E+03
Std1.42E+022.03E+022.73E+021.86E+021.44E+022.77E+022.00E+022.78E+021.63E+02
Rank158627493
F17Best2.01E+031.12E+051.01E+054.61E+041.04E+052.28E+059.39E+041.67E+056.26E+04
Ave1.16E+042.61E+062.82E+062.91E+052.08E+065.40E+061.24E+062.79E+061.02E+06
Std1.25E+042.49E+064.49E+063.08E+055.01E+064.38E+068.61E+052.95E+068.38E+05
Rank168259473
F18Best1.93E+032.40E+032.32E+032.18E+039.00E+031.00E+051.44E+054.34E+042.58E+03
Ave2.25E+031.26E+041.87E+068.07E+039.36E+053.04E+063.71E+061.05E+061.57E+04
Std9.39E+021.37E+042.84E+068.04E+031.63E+062.37E+062.15E+066.87E+051.38E+04
Rank137258964
F19Best2.07E+032.19E+032.34E+032.24E+032.15E+032.33E+032.22E+032.36E+032.11E+03
Ave2.32E+032.64E+032.68E+032.55E+032.43E+032.57E+032.57E+032.73E+032.43E+03
Std1.76E+022.33E+022.06E+021.70E+021.80E+021.52E+021.77E+021.91E+021.74E+02
Rank178426593
F20Best2.34E+032.38E+032.45E+032.38E+032.36E+032.43E+032.21E+032.48E+032.34E+03
Ave2.38E+032.45E+032.52E+032.44E+032.40E+032.50E+032.42E+032.57E+032.40E+03
Std2.32E+013.52E+013.90E+012.84E+013.23E+013.72E+014.71E+014.99E+012.99E+01
Rank168527493
F21Best2.30E+032.32E+032.33E+032.30E+032.40E+032.45E+032.30E+032.49E+032.31E+03
Ave3.58E+034.12E+035.50E+032.31E+035.26E+033.09E+033.82E+036.74E+034.34E+03
Std1.82E+032.70E+032.07E+034.54E+001.80E+031.10E+032.05E+031.73E+031.84E+03
Rank358172496
F22Best2.69E+032.74E+032.82E+032.75E+032.71E+032.87E+032.72E+033.02E+032.74E+03
Ave2.72E+032.84E+032.93E+032.91E+032.78E+033.00E+032.79E+033.22E+032.78E+03
Std1.46E+015.78E+017.47E+017.43E+014.72E+017.34E+014.53E+011.13E+022.80E+01
Rank157638492
F23Best2.87E+032.89E+032.96E+032.93E+032.87E+032.97E+032.88E+033.18E+032.86E+03
Ave2.90E+032.98E+033.09E+033.08E+032.95E+033.11E+032.93E+033.48E+032.93E+03
Std2.07E+014.79E+017.45E+011.02E+026.31E+016.20E+013.71E+011.46E+023.62E+01
Rank157648392
F24Best2.88E+032.91E+032.89E+032.89E+032.91E+032.96E+032.89E+032.93E+032.89E+03
Ave2.89E+032.95E+032.96E+032.92E+032.99E+033.03E+032.92E+032.98E+032.92E+03
Std1.20E+012.54E+015.43E+012.16E+016.54E+015.03E+011.97E+013.11E+012.38E+01
Rank156289473
F25Best2.80E+032.86E+033.78E+032.82E+033.64E+034.06E+032.80E+033.70E+032.85E+03
Ave3.96E+035.51E+036.42E+035.57E+034.82E+035.83E+034.56E+037.56E+034.84E+03
Std8.51E+021.42E+039.20E+021.18E+035.17E+021.40E+031.11E+031.39E+037.17E+02
Rank158637294
F26Best3.21E+033.21E+033.23E+033.23E+033.23E+033.28E+033.21E+033.30E+033.21E+03
Ave3.23E+033.27E+033.29E+033.30E+033.25E+033.37E+033.26E+033.48E+033.23E+03
Std1.17E+013.32E+015.04E+015.31E+011.98E+016.42E+014.05E+011.38E+021.32E+01
Rank156738492
F27Best3.10E+033.26E+033.30E+033.21E+033.29E+033.43E+033.22E+033.29E+033.23E+03
Ave3.18E+033.32E+033.58E+033.26E+033.42E+033.62E+033.27E+033.37E+033.27E+03
Std3.87E+012.27E+016.55E+022.47E+018.01E+011.39E+023.59E+016.32E+012.39E+01
Rank158279364
F28Best3.33E+033.61E+033.59E+033.53E+033.58E+034.07E+033.79E+033.94E+033.51E+03
Ave3.54E+034.12E+034.23E+034.19E+033.90E+034.72E+034.23E+034.66E+033.92E+03
Std1.26E+022.45E+023.02E+022.71E+021.74E+023.20E+022.50E+023.55E+022.40E+02
Rank147529683
F29Best5.56E+033.21E+041.63E+047.12E+038.46E+052.87E+063.98E+051.88E+068.16E+04
Ave8.12E+033.46E+051.82E+061.87E+049.96E+062.55E+077.06E+065.97E+066.00E+05
Std2.70E+032.85E+052.11E+068.08E+036.56E+062.27E+075.13E+063.36E+066.82E+05
Rank135289764
Table A3. CEC2017 experimental results (Dim = 50).
Table A3. CEC2017 experimental results (Dim = 50).
FunctionIndexIMCOACOADBOTSOGWOAOSSAHHORIME
F1Best1.17E+021.10E+093.98E+082.97E+071.73E+096.71E+097.13E+045.14E+081.05E+07
Ave4.48E+035.68E+092.58E+091.39E+087.41E+091.13E+101.39E+051.62E+092.43E+07
Std5.79E+033.36E+094.36E+099.71E+072.96E+092.22E+094.20E+047.56E+087.48E+06
Rank176489253
F2Best9.44E+031.64E+051.83E+051.12E+059.46E+041.67E+058.38E+049.88E+047.87E+04
Ave2.76E+043.07E+052.86E+051.62E+051.35E+052.83E+051.66E+051.41E+051.49E+05
Std1.21E+048.07E+046.99E+042.58E+042.02E+045.80E+045.34E+041.91E+043.86E+04
Rank198527634
F3Best4.29E+026.66E+027.56E+025.66E+027.08E+021.60E+035.19E+027.75E+026.14E+02
Ave5.26E+021.10E+031.21E+037.08E+021.20E+032.42E+036.40E+021.17E+036.69E+02
Std5.54E+013.62E+027.16E+028.74E+014.21E+026.32E+025.05E+011.98E+024.27E+01
Rank158479263
F4Best6.26E+028.32E+027.91E+027.21E+026.65E+028.49E+027.08E+028.56E+026.45E+02
Ave6.73E+028.81E+029.61E+028.09E+027.35E+029.08E+028.51E+029.15E+027.07E+02
Std3.30E+012.21E+017.89E+014.66E+013.76E+013.90E+016.56E+013.05E+013.51E+01
Rank169437582
F5Best6.00E+026.38E+026.37E+026.43E+026.12E+026.55E+026.44E+026.65E+026.10E+02
Ave6.01E+026.66E+026.56E+026.56E+026.19E+026.69E+026.63E+026.77E+026.23E+02
Std6.24E-017.33E+001.08E+018.33E+003.72E+006.06E+009.48E+006.01E+006.94E+00
Rank175428693
F6Best8.50E+021.30E+039.86E+021.28E+039.62E+021.52E+031.01E+031.60E+039.53E+02
Ave9.00E+021.68E+031.22E+031.52E+031.10E+031.61E+031.21E+031.87E+031.05E+03
Std2.71E+011.42E+021.56E+021.30E+028.09E+016.89E+011.23E+029.60E+017.14E+01
Rank185637492
F7Best8.94E+021.14E+031.15E+039.77E+029.62E+021.15E+031.02E+031.13E+039.31E+02
Ave9.55E+021.21E+031.28E+031.10E+031.04E+031.23E+031.12E+031.21E+031.02E+03
Std3.52E+012.27E+018.28E+014.10E+014.19E+014.22E+017.69E+013.48E+014.76E+01
Rank179438562
F8Best1.05E+031.59E+049.85E+038.68E+033.21E+031.85E+049.50E+032.37E+042.99E+03
Ave2.37E+032.86E+042.20E+041.20E+049.17E+032.48E+041.46E+042.96E+047.19E+03
Std1.59E+037.00E+037.95E+032.38E+034.52E+033.94E+032.76E+033.41E+033.53E+03
Rank186437592
F9Best5.80E+031.09E+046.82E+037.55E+036.25E+038.22E+036.08E+038.61E+034.32E+03
Ave9.68E+031.31E+049.96E+039.36E+038.51E+031.01E+048.05E+039.88E+037.46E+03
Std2.83E+031.08E+031.99E+031.60E+032.44E+031.04E+031.18E+036.44E+021.01E+03
Rank597438261
F10Best1.16E+031.82E+031.90E+031.33E+033.24E+032.58E+031.51E+031.65E+031.45E+03
Ave1.24E+033.37E+033.56E+031.49E+037.10E+035.01E+031.81E+032.09E+031.67E+03
Std4.99E+011.65E+033.07E+039.07E+013.37E+031.20E+031.72E+022.60E+021.43E+02
Rank167298453
F11Best2.65E+053.42E+077.54E+076.12E+069.15E+076.76E+082.29E+077.92E+071.86E+07
Ave1.67E+061.18E+086.26E+081.58E+076.79E+082.31E+091.54E+084.13E+081.27E+08
Std1.19E+067.59E+075.16E+087.48E+068.26E+081.13E+091.28E+082.70E+087.79E+07
Rank137289564
F12Best1.50E+036.47E+044.78E+048.57E+031.72E+066.27E+065.36E+043.43E+069.01E+04
Ave9.17E+034.20E+051.06E+082.81E+041.72E+081.62E+082.07E+057.93E+063.93E+05
Std8.57E+032.65E+051.31E+081.80E+042.08E+081.23E+081.62E+054.24E+063.09E+05
Rank157298364
F13Best1.52E+031.44E+053.39E+041.34E+048.14E+049.24E+053.17E+043.43E+055.01E+04
Ave1.72E+031.38E+062.59E+061.51E+051.84E+066.05E+063.59E+053.01E+064.20E+05
Std1.22E+021.62E+063.43E+061.42E+052.38E+065.41E+063.07E+052.50E+063.18E+05
Rank157269384
F14Best1.66E+031.60E+044.04E+042.95E+033.87E+042.98E+051.63E+043.62E+052.84E+04
Ave8.10E+036.98E+045.62E+071.21E+041.86E+072.40E+066.88E+049.03E+059.48E+04
Std6.70E+034.35E+042.67E+088.46E+032.57E+072.32E+063.74E+044.27E+054.38E+04
Rank149287365
F15Best2.50E+032.56E+033.54E+032.93E+032.36E+033.14E+033.14E+033.73E+032.66E+03
Ave2.90E+033.74E+034.50E+033.64E+033.11E+034.62E+033.91E+034.70E+033.63E+03
Std3.03E+026.85E+024.64E+023.11E+024.20E+026.80E+025.79E+026.35E+025.38E+02
Rank157428693
F16Best2.12E+032.66E+033.11E+032.96E+032.37E+033.14E+032.55E+033.01E+032.64E+03
Ave2.66E+033.47E+033.98E+033.45E+032.94E+033.83E+033.46E+033.73E+033.25E+03
Std3.25E+024.35E+024.41E+022.81E+022.46E+024.01E+023.92E+023.97E+023.38E+02
Rank169428573
F17Best6.44E+032.51E+058.06E+051.36E+059.68E+057.06E+064.68E+055.14E+056.09E+05
Ave5.16E+045.77E+068.13E+061.18E+067.75E+062.36E+074.44E+067.82E+064.28E+06
Std2.65E+045.74E+068.70E+061.14E+067.79E+061.32E+073.65E+066.56E+063.21E+06
Rank158269473
F18Best1.96E+031.67E+041.48E+045.87E+031.51E+052.83E+051.30E+051.44E+053.68E+04
Ave1.53E+041.49E+054.24E+062.29E+045.63E+065.08E+067.08E+061.92E+063.55E+05
Std9.29E+031.35E+058.55E+069.89E+039.65E+064.66E+065.03E+061.63E+063.15E+05
Rank136287954
F19Best2.25E+032.92E+032.91E+032.73E+032.49E+032.94E+032.78E+032.94E+032.71E+03
Ave2.72E+033.66E+033.71E+033.23E+033.16E+033.39E+033.25E+033.58E+033.26E+03
Std2.70E+022.18E+023.68E+023.13E+023.99E+023.18E+022.81E+022.94E+023.19E+02
Rank189326475
F20Best2.40E+032.54E+032.57E+032.50E+032.46E+032.63E+032.50E+032.79E+032.46E+03
Ave2.45E+032.67E+032.80E+032.61E+032.52E+032.76E+032.62E+032.89E+032.52E+03
Std3.47E+018.15E+019.11E+017.69E+015.07E+016.26E+017.78E+017.41E+013.94E+01
Rank168427593
F21Best2.30E+032.59E+039.23E+038.34E+037.85E+031.03E+046.63E+031.02E+047.13E+03
Ave1.07E+041.42E+041.14E+041.13E+049.90E+031.23E+049.74E+031.19E+049.34E+03
Std3.99E+032.62E+031.26E+031.77E+032.54E+038.58E+029.93E+021.01E+039.26E+02
Rank496538271
F22Best2.79E+033.02E+033.14E+033.03E+032.90E+033.36E+032.94E+033.58E+032.88E+03
Ave2.87E+033.25E+033.39E+033.31E+033.01E+033.54E+033.05E+033.94E+032.99E+03
Std3.31E+011.27E+021.09E+021.22E+024.90E+011.12E+027.17E+011.58E+025.35E+01
Rank157638492
F23Best3.00E+033.16E+033.25E+033.23E+033.05E+033.28E+033.03E+033.84E+033.03E+03
Ave3.08E+033.34E+033.52E+033.62E+033.19E+033.57E+033.17E+034.25E+033.13E+03
Std4.70E+011.25E+021.37E+022.20E+029.89E+011.16E+027.62E+012.62E+026.55E+01
Rank156847392
F24Best3.00E+033.25E+032.99E+033.11E+033.29E+033.53E+033.05E+033.22E+033.08E+03
Ave3.05E+033.54E+033.32E+033.20E+033.64E+034.09E+033.12E+033.53E+033.14E+03
Std2.70E+012.22E+021.69E+025.76E+012.33E+022.66E+022.98E+011.25E+024.59E+01
Rank175489263
F25Best2.90E+037.24E+037.16E+034.13E+035.51E+036.61E+033.00E+036.00E+035.58E+03
Ave5.61E+031.14E+041.01E+041.01E+046.64E+031.02E+045.63E+031.15E+046.39E+03
Std1.09E+031.48E+031.19E+031.92E+035.93E+021.69E+032.31E+031.35E+035.14E+02
Rank186547293
F26Best3.27E+033.47E+033.45E+033.58E+033.47E+033.85E+033.47E+033.86E+033.43E+03
Ave3.37E+033.75E+033.75E+033.91E+033.65E+034.29E+033.62E+034.67E+033.56E+03
Std6.27E+011.43E+021.59E+022.62E+021.00E+022.07E+028.49E+014.28E+028.89E+01
Rank165748392
F27Best3.26E+033.52E+033.53E+033.44E+033.70E+034.65E+033.30E+033.73E+033.34E+03
Ave3.31E+034.03E+035.31E+033.56E+034.23E+035.49E+033.39E+034.29E+033.41E+03
Std3.06E+013.31E+021.88E+037.00E+012.98E+024.78E+026.03E+013.27E+025.70E+01
Rank158469273
F28Best3.52E+034.44E+034.82E+034.37E+034.01E+035.61E+034.54E+035.34E+034.14E+03
Ave3.96E+035.52E+035.75E+035.18E+034.64E+036.89E+035.61E+036.57E+034.93E+03
Std3.40E+025.98E+024.94E+023.95E+023.60E+026.23E+026.20E+026.78E+023.58E+02
Rank157429683
F29Best6.52E+057.58E+063.44E+068.32E+055.24E+076.90E+074.45E+073.69E+072.46E+07
Ave8.87E+052.07E+073.61E+072.03E+061.26E+081.66E+081.17E+089.27E+075.08E+07
Std1.39E+051.05E+073.82E+071.11E+064.72E+076.58E+074.20E+074.07E+071.65E+07
Rank134289765
Table A4. CEC2017 experimental results (Dim = 100).
Table A4. CEC2017 experimental results (Dim = 100).
FunctionIndexIMCOACOADBOTSOGWOAOSSAHHORIME
F1Best1.30E+062.28E+101.05E+105.56E+092.75E+105.36E+101.63E+081.87E+103.42E+08
Ave3.51E+064.69E+105.46E+109.97E+094.60E+106.92E+105.02E+082.85E+105.72E+08
Std1.44E+069.07E+095.02E+103.16E+099.75E+097.42E+092.43E+085.27E+091.34E+08
Rank178469253
F2Best1.70E+054.87E+053.69E+053.28E+053.14E+053.27E+052.92E+053.00E+055.46E+05
Ave2.51E+056.88E+057.45E+054.13E+054.63E+053.53E+054.49E+053.30E+056.40E+05
Std4.13E+041.15E+052.50E+056.49E+047.37E+049.80E+031.45E+051.82E+045.84E+04
Rank189463527
F3Best6.56E+023.05E+032.51E+031.70E+032.48E+039.22E+039.33E+024.25E+038.59E+02
Ave7.32E+025.48E+031.45E+042.13E+034.11E+031.27E+041.12E+035.74E+031.10E+03
Std5.15E+011.05E+031.04E+043.10E+027.63E+021.98E+031.03E+021.23E+031.27E+02
Rank169458372
F4Best8.23E+021.39E+031.31E+031.14E+031.05E+031.52E+031.13E+031.54E+031.02E+03
Ave9.09E+021.48E+031.74E+031.37E+031.19E+031.64E+031.39E+031.63E+031.18E+03
Std5.62E+014.96E+012.02E+027.98E+011.17E+026.38E+011.17E+025.79E+018.95E+01
Rank169438572
F5Best6.02E+026.67E+026.53E+026.61E+026.32E+026.73E+026.63E+026.83E+026.32E+02
Ave6.04E+026.71E+026.76E+026.70E+026.40E+026.86E+026.71E+026.90E+026.44E+02
Std1.66E+002.44E+001.32E+014.68E+003.73E+003.98E+005.74E+003.79E+007.18E+00
Rank157428693
F6Best1.19E+032.78E+032.25E+032.69E+031.76E+033.04E+031.85E+033.46E+031.67E+03
Ave1.29E+033.30E+032.59E+033.06E+031.99E+033.37E+032.35E+033.76E+031.97E+03
Std7.92E+011.68E+022.96E+021.83E+029.47E+011.34E+022.55E+021.14E+021.51E+02
Rank175638492
F7Best1.11E+031.83E+031.62E+031.58E+031.37E+031.77E+031.57E+031.92E+031.38E+03
Ave1.21E+031.98E+032.06E+031.77E+031.50E+032.07E+031.76E+032.08E+031.50E+03
Std6.46E+015.36E+012.03E+028.93E+011.02E+028.86E+011.25E+027.68E+017.55E+01
Rank167538492
F8Best2.67E+033.25E+043.06E+042.64E+041.95E+045.28E+042.49E+045.27E+041.97E+04
Ave2.42E+044.98E+046.49E+043.21E+043.61E+046.18E+043.43E+046.49E+043.73E+04
Std1.36E+041.32E+041.77E+042.89E+031.01E+044.91E+033.53E+035.54E+031.20E+04
Rank168247395
F9Best1.41E+041.86E+041.68E+041.74E+041.48E+042.10E+041.38E+042.02E+041.55E+04
Ave2.25E+042.32E+042.14E+042.26E+042.03E+042.46E+041.67E+042.33E+041.81E+04
Std5.53E+033.05E+034.12E+033.81E+036.30E+031.88E+031.41E+031.77E+031.28E+03
Rank574639182
F10Best1.84E+031.34E+051.09E+053.46E+045.20E+041.48E+053.83E+044.24E+041.07E+04
Ave2.09E+032.60E+052.06E+056.71E+047.29E+042.92E+056.19E+049.49E+042.08E+04
Std1.97E+025.97E+045.52E+041.77E+041.25E+047.91E+041.57E+042.70E+046.63E+03
Rank187459362
F11Best5.98E+061.08E+091.59E+092.30E+083.62E+091.18E+101.73E+082.34E+091.87E+08
Ave2.03E+073.67E+094.36E+095.47E+089.22E+091.98E+109.10E+084.94E+099.88E+08
Std8.70E+062.42E+091.78E+092.37E+085.22E+095.28E+094.30E+081.54E+094.63E+08
Rank156289374
F12Best1.87E+036.54E+052.98E+066.33E+041.31E+084.24E+086.21E+042.42E+076.37E+05
Ave7.36E+036.66E+071.49E+082.62E+051.31E+091.16E+091.04E+055.28E+071.35E+06
Std6.24E+032.25E+081.24E+083.63E+051.55E+094.51E+082.88E+043.96E+071.03E+06
Rank167398254
F13Best1.32E+041.08E+062.28E+063.54E+051.61E+066.27E+061.11E+064.70E+061.85E+06
Ave9.46E+046.74E+061.27E+071.07E+067.16E+061.76E+074.28E+067.77E+067.20E+06
Std1.02E+053.31E+069.35E+065.97E+054.15E+066.31E+061.72E+061.85E+062.87E+06
Rank148259376
F14Best1.77E+039.14E+041.36E+051.02E+047.00E+051.43E+072.61E+042.23E+061.49E+05
Ave4.31E+031.50E+062.32E+072.47E+042.23E+081.49E+088.03E+045.53E+063.32E+05
Std4.98E+032.64E+063.74E+071.04E+044.55E+081.11E+083.02E+041.76E+062.88E+05
Rank157298364
F15Best3.85E+036.37E+036.27E+034.89E+035.04E+038.57E+034.76E+037.64E+035.61E+03
Ave4.88E+038.04E+038.39E+036.83E+036.57E+031.12E+047.24E+039.32E+036.92E+03
Std5.68E+021.48E+039.24E+028.16E+028.08E+021.40E+038.66E+029.94E+026.96E+02
Rank167329584
F16Best3.36E+034.86E+036.49E+035.38E+033.88E+037.34E+034.69E+035.44E+034.46E+03
Ave4.30E+036.31E+038.63E+036.21E+035.46E+031.19E+045.68E+037.04E+035.55E+03
Std5.13E+026.73E+021.26E+035.45E+021.07E+033.65E+035.97E+028.38E+025.77E+02
Rank168529473
F17Best1.04E+052.07E+064.12E+065.43E+057.68E+054.20E+061.69E+063.48E+063.03E+06
Ave3.93E+057.65E+061.71E+072.40E+067.42E+061.64E+076.93E+068.98E+069.31E+06
Std3.53E+054.31E+061.10E+071.55E+063.98E+068.48E+064.43E+064.26E+064.32E+06
Rank159248367
F18Best2.00E+031.38E+065.07E+069.12E+031.24E+073.35E+074.38E+068.16E+062.40E+06
Ave5.57E+036.44E+065.10E+071.52E+051.69E+081.30E+082.24E+072.21E+071.39E+07
Std6.19E+033.37E+066.38E+071.37E+052.13E+081.15E+081.27E+071.16E+077.12E+06
Rank137298654
F19Best3.60E+035.54E+034.93E+034.35E+034.04E+034.76E+034.66E+034.84E+034.46E+03
Ave5.43E+036.99E+036.59E+035.63E+035.67E+036.10E+035.53E+035.93E+035.54E+03
Std1.15E+035.57E+028.16E+027.30E+021.32E+035.91E+025.32E+024.79E+024.90E+02
Rank198457263
F20Best2.57E+033.40E+033.53E+033.02E+032.92E+033.64E+032.98E+033.97E+032.87E+03
Ave2.67E+033.60E+033.83E+033.36E+033.06E+034.11E+033.24E+034.24E+033.03E+03
Std5.04E+011.74E+021.68E+021.33E+021.24E+023.04E+021.44E+021.72E+028.64E+01
Rank167538492
F21Best2.32E+032.37E+041.91E+042.01E+041.76E+042.41E+042.44E+032.32E+041.76E+04
Ave2.74E+042.82E+042.39E+042.57E+042.08E+042.70E+041.98E+042.67E+042.11E+04
Std6.54E+032.23E+034.33E+033.38E+032.93E+031.41E+033.73E+031.97E+031.94E+03
Rank894527163
F22Best3.02E+033.85E+034.03E+033.98E+033.49E+034.47E+033.44E+034.57E+033.37E+03
Ave3.09E+034.11E+034.43E+034.60E+033.62E+034.88E+033.66E+035.38E+033.57E+03
Std3.69E+011.72E+021.91E+023.24E+028.91E+012.55E+021.61E+023.20E+021.09E+02
Rank156738492
F23Best3.52E+034.51E+034.81E+035.35E+033.91E+035.45E+034.06E+036.57E+033.85E+03
Ave3.61E+035.07E+035.50E+036.22E+034.23E+036.26E+034.26E+037.48E+034.08E+03
Std4.15E+013.33E+023.51E+027.89E+021.45E+023.72E+021.48E+025.59E+021.45E+02
Rank156738492
F24Best3.27E+035.05E+034.69E+033.90E+034.94E+036.57E+033.64E+035.12E+033.55E+03
Ave3.34E+036.49E+039.84E+034.39E+036.19E+038.06E+033.95E+035.64E+033.81E+03
Std5.22E+017.68E+026.20E+032.12E+027.14E+027.63E+021.39E+022.84E+029.10E+01
Rank179468352
F25Best2.96E+032.36E+041.93E+042.08E+041.43E+042.54E+047.11E+031.78E+041.11E+04
Ave8.72E+033.08E+042.57E+042.71E+041.58E+043.12E+041.63E+042.95E+041.42E+04
Std2.26E+032.84E+033.50E+032.86E+031.05E+032.40E+032.86E+032.94E+031.33E+03
Rank185639472
F26Best3.43E+033.92E+033.75E+033.91E+033.92E+035.12E+033.73E+034.32E+033.70E+03
Ave3.48E+034.37E+034.28E+034.39E+034.17E+036.30E+034.04E+035.69E+033.93E+03
Std2.99E+012.99E+023.91E+023.68E+021.49E+025.94E+021.54E+026.03E+021.10E+02
Rank165749382
F27Best3.38E+036.23E+035.63E+034.40E+036.81E+031.02E+043.81E+036.34E+033.77E+03
Ave3.46E+038.69E+031.72E+045.05E+038.43E+031.19E+044.22E+037.55E+034.03E+03
Std3.98E+011.29E+035.94E+034.46E+021.17E+031.20E+033.71E+026.93E+021.50E+02
Rank179468352
F28Best5.18E+038.59E+038.01E+037.09E+037.65E+031.13E+048.39E+031.03E+046.95E+03
Ave6.05E+031.03E+041.08E+049.26E+038.61E+031.53E+041.01E+041.18E+048.83E+03
Std5.93E+021.17E+031.69E+038.57E+025.28E+022.02E+039.58E+021.04E+038.85E+02
Rank167429583
F29Best9.03E+031.84E+071.34E+073.30E+065.53E+076.12E+084.01E+071.12E+084.68E+07
Ave2.39E+047.92E+071.33E+089.41E+067.26E+081.62E+092.26E+082.75E+081.42E+08
Std1.29E+043.98E+071.08E+086.36E+066.45E+086.04E+089.80E+071.27E+087.20E+07
Rank134289675
Table A5. CEC2022 test functions.
Table A5. CEC2022 test functions.
TypeIDCEC2022 Function NameRangeDimensionfmin
Unimodal functionF1Shifted and full Rotated Zakharov Function[−100, 100]10/20300
Basic FunctionsF2Shifted and full Rotated Rosenbrock’s Function[−100, 100]10/20400
F3Shifted and full Expanded Schaffer’s f6 Function[−100, 100]10/20600
F4Shifted and full Rotated Non-Continuous Rastrigin’s Function[−100, 100]10/20800
F5Shifted and full Rotated Levy Function[−100, 100]10/20900
Hybrid functionsF6Hybrid Function 1 (N = 3)[−100, 100]10/201800
F7Hybrid Function 2 (N = 6)[−100, 100]10/202000
F8Hybrid Function 3 (N = 5)[−100, 100]10/202200
Composition functionsF9Composition Function 1 (N = 5)[−100, 100]10/202300
F10Composition Function 2 (N = 4)[−100, 100]10/202400
F11Composition Function 3 (N = 5)[−100, 100]10/202600
F12Composition Function 5 (N = 6)[−100, 100]10/202700
Table A6. CEC2022 experimental results (Dim = 10).
Table A6. CEC2022 experimental results (Dim = 10).
FunctionIndexIMCOACOADBOTSOGWOAOSSAHHORIME
F1Best3.00E+023.70E+023.00E+023.00E+023.60E+021.16E+033.00E+023.03E+023.00E+02
Ave3.00E+022.05E+034.58E+023.00E+021.97E+032.94E+033.00E+023.93E+023.00E+02
Std3.84E-101.72E+033.22E+025.60E-021.80E+031.88E+037.39E-049.56E+012.26E-01
Rank186379254
F2Best4.00E+024.00E+024.00E+024.00E+024.04E+024.01E+024.00E+024.00E+024.00E+02
Ave4.04E+024.23E+024.22E+024.09E+024.19E+024.26E+024.06E+024.40E+024.09E+02
Std3.50E+003.11E+012.98E+011.66E+011.66E+011.93E+012.82E+004.63E+011.24E+01
Rank176358294
F3Best6.00E+026.00E+026.00E+026.00E+026.00E+026.06E+026.01E+026.11E+026.00E+02
Ave6.00E+026.06E+026.04E+026.08E+026.02E+026.18E+026.13E+026.38E+026.00E+02
Std4.03E-021.03E+013.64E+006.23E+002.31E+005.94E+001.11E+011.39E+018.44E-02
Rank154638792
F4Best8.05E+028.12E+028.11E+028.06E+028.03E+028.09E+028.08E+028.08E+028.11E+02
Ave8.13E+028.27E+028.29E+028.18E+028.13E+028.20E+028.23E+028.25E+028.25E+02
Std6.58E+007.67E+001.22E+016.59E+006.79E+006.91E+001.17E+018.80E+001.03E+01
Rank189324576
F5Best9.00E+029.00E+029.00E+029.03E+029.00E+029.03E+029.00E+029.86E+029.00E+02
Ave9.02E+021.00E+039.45E+029.70E+029.05E+021.01E+039.61E+021.32E+039.00E+02
Std4.07E+002.09E+027.52E+015.89E+011.27E+016.06E+011.45E+021.73E+024.60E-01
Rank274638591
F6Best1.80E+031.98E+031.83E+031.83E+032.85E+033.10E+031.90E+032.07E+031.92E+03
Ave1.82E+034.35E+035.14E+032.86E+036.70E+031.91E+044.33E+034.40E+034.48E+03
Std1.51E+011.71E+032.43E+031.17E+032.17E+031.61E+042.15E+031.64E+031.88E+03
Rank147289356
F7Best2.00E+032.00E+032.02E+032.00E+032.01E+032.02E+032.00E+032.03E+032.00E+03
Ave2.02E+032.02E+032.03E+032.02E+032.03E+032.05E+032.04E+032.07E+032.02E+03
Std9.15E+007.39E+001.15E+011.35E+011.06E+011.53E+011.58E+012.74E+012.47E+01
Rank125468793
F8Best2.20E+032.21E+032.22E+032.20E+032.22E+032.22E+032.21E+032.22E+032.20E+03
Ave2.22E+032.22E+032.23E+032.22E+032.23E+032.23E+032.23E+032.24E+032.22E+03
Std8.39E+006.38E+004.00E+005.11E+002.82E+003.87E+006.82E+001.35E+017.34E+00
Rank145368792
F9Best2.53E+032.53E+032.53E+032.53E+032.53E+032.55E+032.53E+032.53E+032.53E+03
Ave2.53E+032.54E+032.54E+032.53E+032.56E+032.59E+032.54E+032.58E+032.53E+03
Std2.68E+014.48E+013.48E+012.68E+013.23E+012.81E+012.33E+014.13E+012.68E+01
Rank156179483
F10Best2.50E+032.50E+032.50E+032.50E+032.50E+032.50E+032.50E+032.50E+032.50E+03
Ave2.55E+032.55E+032.53E+032.52E+032.54E+032.57E+032.50E+032.58E+032.54E+03
Std5.74E+016.13E+015.64E+014.49E+015.61E+015.96E+012.24E+019.98E+015.42E+01
Rank673258194
F11Best2.60E+032.60E+032.60E+032.60E+032.75E+032.61E+032.60E+032.61E+032.60E+03
Ave2.85E+032.79E+032.86E+032.71E+032.94E+032.74E+032.94E+032.83E+032.90E+03
Std1.07E+021.42E+023.66E+021.40E+028.62E+011.04E+023.63E+021.16E+026.45E+01
Rank536192847
F12Best2.86E+032.86E+032.86E+032.86E+032.86E+032.86E+032.86E+032.86E+032.86E+03
Ave2.86E+032.87E+032.87E+032.87E+032.87E+032.87E+032.86E+032.90E+032.87E+03
Std1.68E+003.86E+009.12E+001.95E+006.65E+002.75E+001.67E+004.14E+012.18E+00
Rank268457193
Table A7. CEC2022 experimental results (Dim = 20).
Table A7. CEC2022 experimental results (Dim = 20).
FunctionIndexIMCOACOADBOTSOGWOAOSSAHHORIME
F1Best3.00E+021.91E+049.51E+032.35E+032.31E+032.35E+043.05E+024.06E+033.87E+02
Ave3.00E+024.04E+042.56E+046.25E+031.17E+045.40E+041.03E+031.30E+046.03E+02
Std1.37E-051.46E+041.01E+042.42E+035.62E+031.65E+046.34E+024.57E+032.21E+02
Rank187459362
F2Best4.00E+024.45E+024.07E+024.00E+024.54E+024.68E+024.34E+024.59E+024.06E+02
Ave4.39E+024.74E+024.82E+024.58E+025.00E+025.42E+024.59E+025.31E+024.52E+02
Std2.20E+012.52E+016.30E+012.01E+013.49E+014.40E+011.75E+014.65E+011.61E+01
Rank156379482
F3Best6.00E+026.01E+026.07E+026.16E+026.01E+026.29E+026.11E+026.45E+026.01E+02
Ave6.00E+026.30E+026.22E+026.28E+026.04E+026.43E+026.34E+026.62E+026.02E+02
Std1.22E-011.93E+019.87E+008.06E+002.46E+008.00E+001.63E+018.27E+001.40E+00
Rank164538792
F4Best8.21E+028.60E+028.40E+028.30E+028.25E+028.55E+028.41E+028.54E+028.24E+02
Ave8.46E+028.87E+029.06E+028.54E+028.59E+028.74E+028.83E+028.88E+028.52E+02
Std1.09E+011.01E+012.87E+011.41E+013.10E+011.37E+012.51E+011.43E+011.57E+01
Rank179345682
F5Best9.00E+021.37E+039.65E+021.11E+039.05E+021.49E+039.67E+022.09E+039.01E+02
Ave1.01E+032.55E+032.07E+031.71E+031.11E+032.19E+031.90E+032.84E+031.05E+03
Std1.39E+026.00E+027.46E+023.65E+021.49E+024.06E+026.81E+023.39E+022.21E+02
Rank186437592
F6Best1.85E+032.05E+032.00E+031.88E+034.26E+031.95E+042.18E+032.20E+042.34E+03
Ave2.01E+036.83E+033.46E+056.75E+039.35E+052.47E+059.77E+031.65E+051.10E+04
Std2.97E+026.73E+035.88E+056.31E+032.84E+062.11E+057.23E+031.03E+056.78E+03
Rank138297465
F7Best2.02E+032.03E+032.04E+032.06E+032.03E+032.08E+032.03E+032.13E+032.03E+03
Ave2.05E+032.10E+032.12E+032.10E+032.08E+032.12E+032.10E+032.20E+032.06E+03
Std1.91E+015.20E+015.50E+012.54E+014.81E+012.11E+014.35E+016.63E+013.30E+01
Rank168437592
F8Best2.22E+032.23E+032.23E+032.22E+032.23E+032.23E+032.22E+032.23E+032.22E+03
Ave2.25E+032.28E+032.29E+032.23E+032.26E+032.25E+032.29E+032.29E+032.24E+03
Std5.26E+017.24E+016.56E+019.05E+005.30E+013.69E+016.69E+018.96E+013.91E+01
Rank369154872
F9Best2.48E+032.48E+032.48E+032.48E+032.48E+032.52E+032.48E+032.49E+032.48E+03
Ave2.48E+032.48E+032.52E+032.48E+032.51E+032.56E+032.52E+032.52E+032.48E+03
Std5.19E-081.99E-014.20E+018.95E-032.73E+013.12E+015.34E+012.53E+014.02E-01
Rank136259874
F10Best2.50E+032.50E+032.50E+032.50E+032.50E+032.50E+032.50E+032.50E+032.50E+03
Ave2.71E+033.59E+033.03E+032.65E+033.81E+033.18E+033.79E+033.90E+032.65E+03
Std2.81E+021.16E+039.68E+024.45E+028.70E+021.05E+031.23E+038.20E+021.71E+02
Rank364185792
F11Best2.90E+032.91E+032.60E+032.90E+033.10E+033.12E+032.61E+032.97E+032.96E+03
Ave2.90E+032.99E+032.90E+032.92E+033.53E+033.64E+032.90E+033.31E+033.00E+03
Std7.61E-041.18E+027.98E+017.20E+013.49E+024.89E+025.58E+014.89E+022.50E+01
Rank152489376
F12Best2.94E+032.94E+032.95E+032.95E+032.95E+032.97E+032.94E+032.97E+032.94E+03
Ave2.96E+032.98E+033.01E+033.03E+032.97E+033.03E+032.97E+033.14E+032.96E+03
Std1.98E+013.70E+016.90E+017.86E+011.34E+013.65E+012.48E+011.46E+021.45E+01
Rank256837491
Figure A1. Comparison of convergence curves of the 9 algorithms using CEC2017 (Dim = 30).
Figure A1. Comparison of convergence curves of the 9 algorithms using CEC2017 (Dim = 30).
Biomimetics 09 00361 g0a1aBiomimetics 09 00361 g0a1b
Figure A2. Comparison of box diagrams of the 9 algorithms using CEC2017(Dim = 30).
Figure A2. Comparison of box diagrams of the 9 algorithms using CEC2017(Dim = 30).
Biomimetics 09 00361 g0a2aBiomimetics 09 00361 g0a2b
Figure A3. Comparison of convergence curves of the 9 algorithms using CEC2017(Dim = 50).
Figure A3. Comparison of convergence curves of the 9 algorithms using CEC2017(Dim = 50).
Biomimetics 09 00361 g0a3aBiomimetics 09 00361 g0a3b
Figure A4. Comparison of box diagrams of the 9 algorithms using CEC2017(Dim = 50).
Figure A4. Comparison of box diagrams of the 9 algorithms using CEC2017(Dim = 50).
Biomimetics 09 00361 g0a4aBiomimetics 09 00361 g0a4b
Figure A5. Comparison of convergence curves of the 9 algorithms using CEC2017(Dim = 100).
Figure A5. Comparison of convergence curves of the 9 algorithms using CEC2017(Dim = 100).
Biomimetics 09 00361 g0a5aBiomimetics 09 00361 g0a5b
Figure A6. Comparison of the box diagrams of 9 algorithms using CEC2017(Dim = 100).
Figure A6. Comparison of the box diagrams of 9 algorithms using CEC2017(Dim = 100).
Biomimetics 09 00361 g0a6aBiomimetics 09 00361 g0a6b
Figure A7. Comparison of convergence curves of the 9 algorithms using CEC2022.
Figure A7. Comparison of convergence curves of the 9 algorithms using CEC2022.
Biomimetics 09 00361 g0a7aBiomimetics 09 00361 g0a7b
Figure A8. Comparison of box diagrams of the 9 algorithms using CEC2022.
Figure A8. Comparison of box diagrams of the 9 algorithms using CEC2022.
Biomimetics 09 00361 g0a8aBiomimetics 09 00361 g0a8b

References

  1. Jia, H.; Zhang, W.; Zheng, R.; Wang, S.; Leng, X.; Cao, N. Ensemble mutation slime mould algorithm with restart mechanism for feature selection. Int. J. Intell. Syst. 2021, 37, 2335–2370. [Google Scholar] [CrossRef]
  2. Zouache, D.; Got, A.; Alarabiat, D.; Abualigah, L.; Talbi, E.G. A novel multi-objective wrapper-based feature selection method using quantum-inspired and swarm intelligence techniques. Multimed. Tools Appl. 2024, 83, 22811–22835. [Google Scholar] [CrossRef]
  3. Li, X.; Zhang, S.; Shao, P. Discrete artificial bee colony algorithm with fixed neighborhood search for traveling salesman problem. Eng. Appl. Artif. Intell. 2024, 131, 107816. [Google Scholar] [CrossRef]
  4. Linganathan, S.; Singamsetty, P. Genetic algorithm to the bi-objective multiple travelling salesman problem. Alex. Eng. J. 2024, 90, 98–111. [Google Scholar] [CrossRef]
  5. Liu, Q.; Li, N.; Jia, H.; Qi, Q.; Abualigah, L. Modified Remora Optimization Algorithm for Global Optimization and Multilevel Thresholding Image Segmentation. Mathematics 2022, 10, 1014. [Google Scholar] [CrossRef]
  6. Liu, Q.; Li, N.; Jia, H.; Qi, Q.; Abualigah, L. A chimp-inspired remora optimization algorithm for multilevel thresholding image segmentation using cross entropy. Artif. Intell. Rev. 2023, 56, 159–216. [Google Scholar] [CrossRef]
  7. Wang, S.; Jia, H.; Peng, X. Modified salp swarm algorithm based multilevel thresholding for color image segmentation. Math. Biosci. Eng. 2020, 17, 700–724. [Google Scholar] [CrossRef] [PubMed]
  8. Ou, Y.; Qin, F.; Zhou, K.-Q.; Yin, P.-F.; Mo, L.-P.; Mohd Zain, A. An Improved Grey Wolf Optimizer with Multi-Strategies Coverage in Wireless Sensor Networks. Symmetry 2024, 16, 286. [Google Scholar] [CrossRef]
  9. Wang, J.; Zhu, Z.; Zhang, F.; Liu, Y. An improved salp swarm algorithm for solving node coverage optimization problem in WSN. Peer-to-Peer Netw. Appl. 2024, 17, 1091–1102. [Google Scholar] [CrossRef]
  10. Kullampalayam Murugaiyan, N.; Chandrasekaran, K.; Manoharan, P.; Derebew, B. Leveraging opposition-based learning for solar photovoltaic model parameter estimation with exponential distribution optimization algorithm. Sci. Rep. 2024, 14, 528. [Google Scholar] [CrossRef]
  11. Premkumar, M.; Jangir, P.; Ramakrishnan, C.; Kumar, C.; Sowmya, R.; Deb, S.; Kumar, N.M. An enhanced Gradient-based Optimizer for parameter estimation of various solar photovoltaic models. Energy Rep. 2022, 8, 15249–15285. [Google Scholar] [CrossRef]
  12. Tang, A.D.; Han, T.; Zhou, H.; Xie, L. An improved equilibrium optimizer with application in unmanned aerial vehicle path planning. Sensors 2021, 21, 1814. [Google Scholar] [CrossRef] [PubMed]
  13. Wang, X.; Zhao, H.; Han, T.; Zhou, H.; Li, C. A grey wolf optimizer using Gaussian estimation of distribution and its application in the multi-UAV multi-target urban tracking problem. Appl. Soft Comput. J. 2019, 78, 240–260. [Google Scholar] [CrossRef]
  14. Holland, J.H. Adaptation in Natural and Artificial Systems; University of Michigan Press: Ann Arbor, MI, USA, 1992. [Google Scholar]
  15. Sarker, R.A.; Elsayed, S.M.; Ray, T. Differential evolution with dynamic parameters selection for optimization problems. IEEE Trans. Evol. Comput. 2013, 18, 689–707. [Google Scholar] [CrossRef]
  16. Fogel, D.B. Applying evolutionary programming to selected traveling salesman problems. Cybern. Syst. 1993, 24, 27–36. [Google Scholar] [CrossRef]
  17. Beyer, H.-G.; Schwefel, H.-P. Evolution strategies—A comprehensive introduction. Nat. Comput. 2002, 1, 3–52. [Google Scholar] [CrossRef]
  18. Yang, X. Nature-Inspired Metaheuristic Algorithms; Luniver Press: London, UK, 2010; ISBN 9781905986286. [Google Scholar]
  19. Rashedi, E.; Nezamabadi-pour, H.; Saryazdi, S. GSA: A Gravitational Search Algorithm. Inf. Sci. 2009, 179, 2232–2248. [Google Scholar] [CrossRef]
  20. Mirjalili, S. SCA: A Sine Cosine Algorithm for solving optimization problems. Knowl. Based Syst. 2016, 96, 120–133. [Google Scholar] [CrossRef]
  21. Mirjalili, S.; Mirjalili, S.M.; Hatamlou, A. Multi-Verse Optimizer: A nature-inspired algorithm for global optimization. Neural Comput. Appl. 2015, 27, 495–513. [Google Scholar] [CrossRef]
  22. Hashim, F.A.; Houssein, E.H.; Mabrouk, M.S.; Al-Atabany, W.; Mirjalili, S. Henry gas solubility optimization: A novel physics-based algorithm. Futur. Gener. Comput. Syst. 2019, 101, 646–667. [Google Scholar] [CrossRef]
  23. Deng, L.; Liu, S. Snow ablation optimizer: A novel metaheuristic technique for numerical optimization and engineering design. Expert Syst. Appl. 2023, 225, 120069. [Google Scholar] [CrossRef]
  24. Rao, R.V.; Savsani, V.J.; Vakharia, D.P. Teaching-learning-based optimization: A novel method for constrained mechanical design optimization problems. CAD Comput. Aided Des. 2011, 43, 303–315. [Google Scholar] [CrossRef]
  25. Bayzidi, H.; Talatahari, S.; Saraee, M.; Lamarche, C.P. Social Network Search for Solving Engineering Optimization Problems. Comput. Intell. Neurosci. 2021, 2021, 1–32. [Google Scholar] [CrossRef] [PubMed]
  26. Zhang, Y.; Jin, Z. Group teaching optimization algorithm: A novel metaheuristic method for solving global optimization problems. Expert Syst. Appl. 2020, 148, 113246. [Google Scholar] [CrossRef]
  27. Ma, B.; Hu, Y.; Lu, P.; Liu, Y. Running city game optimizer: A game-based metaheuristic optimization algorithm for global optimization. J. Comput. Des. Eng. 2022, 10, 65–107. [Google Scholar] [CrossRef]
  28. Kumar, M.; Kulkarni, A.J.; Satapathy, S.C. Socio evolution & learning optimization algorithm: A socio-inspired optimization methodology. Futur. Gener. Comput. Syst. 2018, 81, 252–272. [Google Scholar] [CrossRef]
  29. Kennedy, J.; Eberhart, R. Particle swarm optimization. In Proceedings of the IEEE International Conference on Neural Networks, Perth, WA, Australia, 27 November–1 December 1995. [Google Scholar]
  30. Dorigo, M.; Di Caro, G. Ant colony optimization: A new meta-heuristic. In Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999, Washington, DC, USA, 6–9 July 1999. [Google Scholar]
  31. Mirjalili, S.; Lewis, A. The Whale Optimization Algorithm. Adv. Eng. Softw. 2016, 95, 51–67. [Google Scholar] [CrossRef]
  32. Mirjalili, S.; Mirjalili, S.M.; Lewis, A. Grey Wolf Optimizer. Adv. Eng. Softw. 2014, 69, 46–61. [Google Scholar] [CrossRef]
  33. Jia, H.; Peng, X.; Lang, C. Remora optimization algorithm. Expert Syst. Appl. 2021, 185, 115665. [Google Scholar] [CrossRef]
  34. Abualigah, L.; Elaziz, M.A.; Sumari, P.; Geem, Z.W.; Gandomi, A.H. Reptile Search Algorithm (RSA): A nature-inspired meta-heuristic optimizer. Expert Syst. Appl. 2022, 191, 116158. [Google Scholar] [CrossRef]
  35. Xie, L.; Han, T.; Zhou, H.; Zhang, Z.-R.; Han, B.; Tang, A. Tuna Swarm Optimization: A Novel Swarm-Based Metaheuristic Algorithm for Global Optimization. Comput. Intell. Neurosci. 2021, 2021, 1–22. [Google Scholar] [CrossRef]
  36. Seyyedabbasi, A.; Kiani, F. Sand Cat swarm optimization: A nature-inspired algorithm to solve global optimization problems. Eng. Comput. 2022, 39, 2627–2651. [Google Scholar] [CrossRef]
  37. Wolpert, D.H.; Macready, W.G. No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1997, 1, 67–82. [Google Scholar] [CrossRef]
  38. Jia, H.; Rao, H.; Wen, C.; Mirjalili, S. Crayfish optimization algorithm. Artif. Intell. Rev. 2023, 56, 1919–1979. [Google Scholar] [CrossRef]
  39. Tang, A.; Zhou, H.; Han, T.; Xie, L. A modified manta ray foraging optimization for global optimization problems. IEEE Access 2021, 9, 128702–128721. [Google Scholar] [CrossRef]
  40. Abualigah, L.; Al-qaness, M.A.A.; Abd Elaziz, M.; Ewees, A.A.; Oliva, D.; Cuong-Le, T. The non-monopolize search (NO): A novel single-based local search optimization algorithm. Neural Comput. Appl. 2023, 36, 5305–5332. [Google Scholar] [CrossRef]
  41. Xue, J.; Shen, B. Dung beetle optimizer: A new meta-heuristic algorithm for global optimization. J. Supercomput. 2022, 79, 7305–7336. [Google Scholar] [CrossRef]
  42. Abualigah, L.; Yousri, D.; Abd Elaziz, M.; Ewees, A.A.; Al-qaness, M.A.A.; Gandomi, A.H. Aquila Optimizer: A novel meta-heuristic optimization algorithm. Comput. Ind. Eng. 2021, 157, 107250. [Google Scholar] [CrossRef]
  43. Mirjalili, S.; Gandomi, A.H.; Mirjalili, S.Z.; Saremi, S.; Faris, H.; Mirjalili, S.M. Salp Swarm Algorithm: A bio-inspired optimizer for engineering design problems. Adv. Eng. Softw. 2017, 114, 163–191. [Google Scholar] [CrossRef]
  44. Heidari, A.A.; Mirjalili, S.; Faris, H.; Aljarah, I.; Mafarja, M.; Chen, H. Harris hawks optimization: Algorithm and applications. Futur. Gener. Comput. Syst. 2019, 97, 849–872. [Google Scholar] [CrossRef]
  45. Su, H.; Zhao, D.; Heidari, A.A.; Liu, L.; Zhang, X.; Mafarja, M.; Chen, H. RIME: A physics-based optimization. Neurocomputing 2023, 532, 183–214. [Google Scholar] [CrossRef]
  46. Deb, K. Optimal design of a welded beam via genetic algorithms. AIAA J. 1991, 29, 2013–2015. [Google Scholar] [CrossRef]
  47. Singiresu, S.R. Engineering Optimization Theory and Practice; John Wiley & Sons Inc.: Hoboken, NJ, USA, 2009; ISBN 9780470183526. [Google Scholar]
  48. Dennis, R. Moss. Pressure Vessel Design Manual; Gulf Professional Publishing: Sebastopol, CA, USA, 2004. [Google Scholar]
  49. Li, Y.; Zhang, H.; Liang, X.; Huang, B. Event-Triggered-Based Distributed Cooperative Energy Management for Multienergy Systems. IEEE Trans. Ind. Inform. 2018, 15, 2008–2022. [Google Scholar] [CrossRef]
Figure 1. The flow chart of IMCOA.
Figure 1. The flow chart of IMCOA.
Biomimetics 09 00361 g001
Figure 2. CEC2017 ranking stack chart (Dim = 30).
Figure 2. CEC2017 ranking stack chart (Dim = 30).
Biomimetics 09 00361 g002
Figure 3. CEC2017 ranking stack chart (Dim = 50).
Figure 3. CEC2017 ranking stack chart (Dim = 50).
Biomimetics 09 00361 g003
Figure 4. CEC2017 ranking stack chart (Dim = 100).
Figure 4. CEC2017 ranking stack chart (Dim = 100).
Biomimetics 09 00361 g004
Figure 5. CEC2022 Sankey ranking diagram.
Figure 5. CEC2022 Sankey ranking diagram.
Biomimetics 09 00361 g005
Figure 6. Ranking of each strategy on the CEC2017 and CEC2022 test suites.
Figure 6. Ranking of each strategy on the CEC2017 and CEC2022 test suites.
Biomimetics 09 00361 g006
Figure 7. Schematic design of the welded beam.
Figure 7. Schematic design of the welded beam.
Biomimetics 09 00361 g007
Figure 8. Schematic design of the tension/compression spring design problem.
Figure 8. Schematic design of the tension/compression spring design problem.
Biomimetics 09 00361 g008
Figure 9. Schematic design of the pressure vessel design problem.
Figure 9. Schematic design of the pressure vessel design problem.
Biomimetics 09 00361 g009
Table 1. Metaheuristic algorithms.
Table 1. Metaheuristic algorithms.
Evolution-based algorithmsGenetic Algorithm (GA) [14]
Differential Evolution (DE) [15]
Genetic Programming (GP) [16]
Evolutionary Strategy (ES) [17]
Physics-based algorithmsSimulated Annealing (SA) [18]
Gravitational Search Algorithm (GSA) [19]
Sine Cosine Algorithm (SCA) [20]
Multi-Verse Optimization (MVO) [21]
Henry Gas Solubility Optimization (HGSO) [22]
Snow Ablation Optimizer (SAO) [23]
Human-based algorithmsTeaching- And Learning-Based Optimization (TLBO) [24]
Social Network Search (SNS) [25]
Group Teaching Optimization Algorithm (GTOA) [26]
Running City Game Optimizer (RCGO) [27]
Social Evolution And Learning Optimization (SELO) [28]
Swarm-based algorithmsParticle Swarm Optimization (PSO) [29]
Ant Colony Optimization (ACO) [30]
Whale Optimization Algorithm (WOA) [31]
Grey Wolf Optimization (GWO) [32]
Remora Optimization Algorithm (ROA) [33]
Reptile Search Algorithm (RSA) [34]
Tuna Swarm Optimization (TSO) [35]
Sand Cat Swarm Optimization (SCSO) [36]
Table 2. Software and hardware for all experiments.
Table 2. Software and hardware for all experiments.
ItemDescription
SoftwareLanguage MATLAB 2020a
Operating SystemWindows 10
HardwareHard Drive 1000 GB
RAM16.00 GB
Frequency2.50 GHz
CPUIntel(R) Core(TM) i7-11700
Table 3. Parameter settings of each algorithm.
Table 3. Parameter settings of each algorithm.
AlgorithmParameter Setting
IMCOAk = 1
COAk = 1
DBO [41]p = 0.2
TSO [35]c = 0.003
GWO [32]a = [2, 0]
AO [42]Alpha = 0.1, delta = 0.1
SSA [43]no parameters
HHO [44]E0 ϵ [−1, 1], E1 ϵ [0, 2]
RIME [45]w = 0.5
Table 4. Wilcoxon rank–sum test on CEC2017 (Dim = 30).
Table 4. Wilcoxon rank–sum test on CEC2017 (Dim = 30).
COADBOTSOGWOAOSSAHHORIME
F13.02E-113.02E-113.02E-113.02E-113.02E-118.10E-103.02E-113.02E-11
F23.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F31.55E-091.21E-109.83E-083.02E-113.02E-115.46E-063.02E-112.03E-07
F41.46E-104.50E-113.49E-097.73E-063.69E-113.49E-093.02E-112.61E-02
F53.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F63.02E-113.69E-113.02E-112.03E-093.02E-115.49E-113.02E-112.00E-06
F73.02E-113.02E-115.07E-104.98E-043.02E-118.15E-113.02E-113.67E-03
F83.02E-113.02E-114.08E-118.35E-083.02E-113.02E-113.02E-113.32E-06
F95.83E-032.81E-024.51E-022.12E-016.67E-035.11E-013.67E-034.68E-02
F103.02E-113.02E-111.56E-083.02E-113.02E-111.61E-103.02E-117.39E-11
F113.02E-113.69E-118.15E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F122.44E-093.47E-102.84E-013.02E-113.02E-112.87E-103.02E-117.38E-10
F133.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F143.02E-113.02E-117.37E-103.02E-113.02E-113.02E-113.02E-113.02E-11
F156.53E-084.20E-107.20E-055.57E-031.96E-108.15E-051.96E-101.17E-03
F162.32E-061.86E-097.69E-082.15E-022.03E-091.17E-051.96E-103.01E-04
F173.02E-113.02E-113.34E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F182.37E-107.39E-118.89E-103.02E-113.02E-113.02E-113.02E-112.15E-10
F193.83E-069.06E-082.77E-052.32E-022.00E-069.51E-067.12E-091.44E-02
F202.61E-103.02E-118.89E-102.71E-024.08E-115.46E-063.02E-114.86E-03
F212.62E-032.88E-067.73E-023.16E-055.55E-021.33E-026.01E-083.37E-04
F224.50E-113.02E-113.02E-113.35E-083.02E-115.00E-093.02E-111.61E-10
F238.10E-103.02E-114.08E-111.89E-043.02E-111.75E-053.02E-111.04E-04
F241.77E-101.29E-094.12E-065.49E-113.02E-112.44E-093.02E-114.31E-08
F253.37E-059.76E-103.26E-075.86E-068.29E-069.52E-041.69E-095.09E-06
F261.85E-089.26E-091.17E-094.44E-073.02E-112.00E-053.02E-111.09E-01
F273.02E-113.02E-111.21E-103.02E-113.02E-117.39E-113.02E-114.98E-11
F281.09E-108.15E-112.87E-101.07E-093.02E-113.34E-113.02E-115.97E-09
F293.02E-114.50E-111.31E-083.02E-113.02E-113.02E-113.02E-113.02E-11
Table 5. Statistical results using CEC2017 (Dim = 30).
Table 5. Statistical results using CEC2017 (Dim = 30).
Dimensions30
AlgorithmAverage RankOverall Rank(+/=/−)
IMCOA1.211
COA5.62629/0/0
DBO6.86729/0/0
TSO3.76327/2/0
GWO4.76528/1/0
AO7.79928/1/0
SSA4.28428/1/0
HHO7.62829/0/0
RIME3.10227/1/1
Table 6. Wilcoxon rank–sum test on CEC2017 (Dim = 50).
Table 6. Wilcoxon rank–sum test on CEC2017 (Dim = 50).
COADBOTSOGWOAOSSAHHORIME
F13.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F23.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F33.02E-113.02E-112.15E-103.02E-113.02E-118.89E-103.02E-113.34E-11
F43.02E-113.02E-114.08E-111.47E-073.02E-114.98E-113.02E-118.56E-04
F53.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F63.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F73.02E-113.02E-115.49E-115.00E-093.02E-115.49E-113.02E-119.53E-07
F83.02E-113.02E-113.02E-115.07E-103.02E-113.02E-113.02E-112.92E-09
F93.83E-063.55E-016.95E-011.91E-012.71E-017.24E-023.04E-017.29E-03
F103.02E-113.02E-116.07E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F123.02E-113.02E-113.01E-073.02E-113.02E-113.02E-113.02E-113.02E-11
F133.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F146.07E-113.02E-111.22E-023.02E-113.02E-116.07E-113.02E-113.02E-11
F154.11E-073.69E-112.92E-092.15E-026.70E-115.57E-103.02E-112.57E-07
F162.02E-084.50E-114.20E-106.55E-044.98E-113.20E-091.78E-101.25E-07
F173.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F182.61E-101.61E-104.43E-033.02E-113.02E-113.02E-113.02E-113.69E-11
F197.39E-111.33E-108.35E-082.43E-051.55E-092.83E-089.92E-118.35E-08
F203.02E-113.02E-117.39E-114.11E-073.02E-114.08E-113.02E-111.25E-07
F211.58E-042.97E-014.83E-018.24E-023.78E-021.91E-011.02E-013.51E-02
F223.02E-113.02E-113.02E-116.07E-113.02E-113.02E-113.02E-113.16E-10
F233.34E-113.02E-113.02E-117.60E-073.02E-114.12E-063.02E-111.24E-03
F243.02E-113.82E-093.02E-113.02E-113.02E-111.69E-093.02E-111.96E-10
F254.08E-116.07E-112.23E-094.44E-071.21E-109.71E-015.49E-118.20E-07
F264.08E-114.98E-113.02E-115.49E-113.02E-114.08E-113.02E-111.07E-09
F273.02E-113.02E-113.02E-113.02E-113.02E-118.48E-093.02E-115.07E-10
F286.70E-113.69E-111.46E-101.56E-083.02E-116.70E-113.02E-114.20E-10
F293.02E-113.02E-118.10E-103.02E-113.02E-113.02E-113.02E-113.02E-11
Table 7. Statistical results using CEC2017 (Dim = 50).
Table 7. Statistical results using CEC2017 (Dim = 50).
Dimensions50
AlgorithmAverage RankOverall Rank(+/=/−)
IMCOA1.24 1
COA6.03 629/0/0
DBO6.93 727/2/0
TSO3.90 327/2/0
GWO4.76 527/2/0
AO7.93 928/1/0
SSA4.10 426/3/0
HHO7.10 827/2/0
RIME3.00 227/0/2
Table 8. Wilcoxon rank–sum test on CEC2017 (Dim = 100).
Table 8. Wilcoxon rank–sum test on CEC2017 (Dim = 100).
COADBOTSOGWOAOSSAHHORIME
F13.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F23.02E-113.02E-113.02E-116.07E-113.02E-117.39E-113.82E-103.02E-11
F33.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F43.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.34E-11
F53.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F63.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F73.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F86.01E-081.07E-092.51E-021.00E-033.02E-115.08E-033.02E-118.56E-04
F96.31E-016.41E-017.62E-018.77E-022.46E-011.87E-055.01E-012.38E-03
F103.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F123.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F133.02E-113.02E-114.50E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F143.02E-113.02E-112.37E-103.02E-113.02E-113.34E-113.02E-113.02E-11
F153.02E-113.02E-111.96E-101.17E-093.02E-114.62E-103.02E-117.39E-11
F164.50E-113.02E-113.02E-113.09E-063.02E-114.62E-103.02E-112.23E-09
F173.02E-113.02E-113.16E-104.08E-113.02E-113.34E-113.02E-113.02E-11
F183.02E-113.02E-115.49E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F191.47E-072.84E-046.41E-014.92E-016.35E-029.12E-012.17E-019.47E-01
F203.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F211.71E-011.33E-029.47E-039.51E-065.32E-037.60E-079.07E-037.74E-06
F223.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F233.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F243.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F253.02E-113.02E-113.02E-113.02E-113.02E-113.82E-103.02E-113.69E-11
F263.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F273.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F283.02E-113.02E-113.34E-113.02E-113.02E-113.02E-113.02E-113.69E-11
F293.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
Table 9. Statistical results using CEC2017 (Dim = 100).
Table 9. Statistical results using CEC2017 (Dim = 100).
Dimensions100
AlgorithmAverage RankOverall Rank(+/=/−)
IMCOA1.38 1
COA6.10 627/2/0
DBO6.97 827/2/1
TSO4.10 426/2/1
GWO4.59 526/2/1
AO8.10 926/2/1
SSA3.59 326/1/2
HHO6.93 726/2/1
RIME3.24 226/1/2
Table 10. Wilcoxon rank–sum test using CEC2022 (Dim = 10).
Table 10. Wilcoxon rank–sum test using CEC2022 (Dim = 10).
COADBOTSOGWOAOSSAHHORIME
F13.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F25.08E-081.92E-065.54E-031.28E-091.28E-098.65E-052.67E-064.79E-07
F37.39E-113.47E-103.02E-118.15E-113.02E-113.02E-113.02E-112.92E-09
F43.01E-071.16E-075.82E-039.00E-012.25E-049.79E-054.11E-073.57E-06
F53.16E-054.80E-071.46E-101.99E-021.33E-109.05E-023.02E-118.42E-01
F63.02E-114.98E-116.70E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F71.06E-037.09E-083.56E-041.16E-073.34E-116.12E-103.02E-118.30E-01
F82.78E-075.53E-083.34E-032.61E-105.49E-116.52E-092.87E-103.33E-01
F92.11E-107.62E-033.01E-012.57E-102.83E-102.83E-102.57E-102.57E-10
F101.76E-021.19E-011.30E-016.52E-016.20E-046.31E-011.32E-044.73E-01
F113.78E-021.96E-042.13E-043.50E-091.12E-021.27E-025.55E-023.50E-09
F125.57E-034.21E-041.58E-014.73E-017.03E-078.23E-021.85E-098.77E-02
Table 11. Wilcoxon rank–sum test using CEC2022 (Dim = 20).
Table 11. Wilcoxon rank–sum test using CEC2022 (Dim = 20).
COADBOTSOGWOAOSSAHHORIME
F13.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F28.48E-097.22E-063.16E-051.61E-104.08E-111.49E-065.49E-111.86E-06
F33.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F44.98E-113.16E-101.50E-024.12E-015.57E-109.83E-081.21E-101.58E-01
F54.08E-116.72E-101.21E-108.12E-043.34E-111.31E-083.02E-117.96E-01
F65.07E-101.33E-105.96E-093.02E-113.02E-111.33E-103.02E-114.07E-11
F72.78E-072.39E-086.52E-091.77E-036.70E-114.80E-073.02E-117.73E-01
F85.61E-055.86E-062.38E-036.77E-052.84E-047.74E-064.94E-056.55E-04
F93.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-113.02E-11
F102.01E-041.45E-017.39E-013.83E-069.33E-024.98E-042.39E-088.07E-01
F113.02E-117.08E-083.02E-113.02E-113.02E-115.57E-103.02E-113.02E-11
F127.62E-031.02E-052.38E-078.68E-031.07E-095.75E-021.46E-109.71E-01
Table 12. Statistical results using CEC2022.
Table 12. Statistical results using CEC2022.
Dimensions1020
AlgorithmAverage RankOverall Rank(+/=/−)Average RankOverall Rank(+/=/−)
IMCOA1.961 1.421
COA5.50511/1/05.67612/0/0
DBO5.75711/0/16.25711/1/0
TSO3.2128/3/13.42310/1/1
GWO5.5059/3/05.25411/1/0
AO7.33811/0/17.17811/1/0
SSA4.3349/3/05.33511/1/0
HHO7.67911/1/07.83912/0/0
RIME3.7537/5/02.6726/5/1
Overall (+/=/−) 77/16/3 84/10/2
Table 13. Friedman test results of each strategy for the CEC2017 and CEC2022 test suites.
Table 13. Friedman test results of each strategy for the CEC2017 and CEC2022 test suites.
TypeDimIMCOAIMCOA-1IMCOA-2IMCOA-3COA
CEC2017301.283.662.722.384.97
501.143.932.722.244.97
1001.213.862.412.624.90
CEC2022101.752.923.583.003.75
201.333.333.082.424.83
Average rank1.343.54 2.91 2.53 4.68
Table 14. Experimental results of the welded beam design.
Table 14. Experimental results of the welded beam design.
AlgorithmhltbOptimal Cost
IMCOA0.2057383.2348029.0364580.2057381.692807
COA0.2040393.531069.0274630.2061471.731991
DBO [41]0.2058033.2308609.0469270.2060051.696152
TSO [35]0.2057003.4705009.0366400.2057001.724900
GWO [32]0.2026013.2979319.0446650.2056901.697776
AO [42]0.2057603.2529099.0364440.2057411.695358
SSA [43]0.2054153.4723469.035220.201161.72359
HHO [44]0.1849813.9583429.0858910.2060821.737752
RIME [45]0.2057453.2347479.0362530.2057461.692831
Table 15. Experimental results of the tension/compression spring design problem.
Table 15. Experimental results of the tension/compression spring design problem.
AlgorithmdDNOptimal Cost
IMCOA0.0537990.469515.811220.010614
COA0.0510820.3422612.199190.012681
DBO [41]0.0500000.3174014.034860.012723
TSO [35]0.0510820.3422612.199190.012681
GWO [32]0.0500000.3174114.032050.012721
AO [42]0.0516290.3552811.373620.012665
SSA [43]0.0520560.3656210.785590.012667
HHO [44]0.0576310.5172545.7222520.013266
RIME [45]0.05540.45267.28860.012901
Table 16. Experimental results of the pressure vessel design problem.
Table 16. Experimental results of the pressure vessel design problem.
AlgorithmTsThRLOptimal Cost
IMCOA0.73790.373640.4105198.80075744.4840
COA1.07050.528655.388560.615465962.0081
DBO [41]0.81250.402342.0984176.63675949.1354
TSO [35]0.79850.485140.3391199.72845895.3175
GWO [32]0.77930.386040.3824199.17255890.6776
AO [42]0.77810.384640.3207199.98415885.3869
SSA [43]0.80150.396241.5312183.93235929.6608
HHO [44]0.77810.384640.3196200.00006541.0173
RIME [45]0.75000.437540.3471200.00005839.6372
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

Wang, R.; Zhang, S.; Zou, G. An Improved Multi-Strategy Crayfish Optimization Algorithm for Solving Numerical Optimization Problems. Biomimetics 2024, 9, 361. https://doi.org/10.3390/biomimetics9060361

AMA Style

Wang R, Zhang S, Zou G. An Improved Multi-Strategy Crayfish Optimization Algorithm for Solving Numerical Optimization Problems. Biomimetics. 2024; 9(6):361. https://doi.org/10.3390/biomimetics9060361

Chicago/Turabian Style

Wang, Ruitong, Shuishan Zhang, and Guangyu Zou. 2024. "An Improved Multi-Strategy Crayfish Optimization Algorithm for Solving Numerical Optimization Problems" Biomimetics 9, no. 6: 361. https://doi.org/10.3390/biomimetics9060361

Article Metrics

Back to TopTop