Next Article in Journal
Topologically Optimized Anthropomorphic Prosthetic Limb: Finite Element Analysis and Mechanical Evaluation Using Plantogram-Derived Foot Pressure Data
Previous Article in Journal
What Inspires Biomimicry in Construction? Patterns, Trends, and Applications
Previous Article in Special Issue
IA-DTPSO: A Multi-Strategy Integrated Particle Swarm Optimization for Predicting the Total Urban Water Resources in China
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Innovative Differentiated Creative Search Based on Collaborative Development and Population Evaluation

1
College of Business, Jiaxing University, Jiaxing 314001, China
2
School of Civil Engineering and Architecture, Jiaxing Nanhu University, Jiaxing 314000, China
*
Author to whom correspondence should be addressed.
Biomimetics 2025, 10(5), 260; https://doi.org/10.3390/biomimetics10050260
Submission received: 2 April 2025 / Revised: 22 April 2025 / Accepted: 22 April 2025 / Published: 23 April 2025

Abstract

:
In real-world applications, many complex problems can be formulated as mathematical optimization challenges, and efficiently solving these problems is critical. Metaheuristic algorithms have proven highly effective in addressing a wide range of engineering issues. The differentiated creative search is a recently proposed evolution-based meta-heuristic algorithm with certain advantages. However, it also has limitations, including weakened population diversity, reduced search efficiency, and hindrance of comprehensive exploration of the solution space. To address the shortcomings of the DCS algorithm, this paper proposes a multi-strategy differentiated creative search (MSDCS) based on the collaborative development mechanism and population evaluation strategy. First, this paper proposes a collaborative development mechanism that organically integrates the estimation distribution algorithm and DCS to compensate for the shortcomings of the DCS algorithm’s insufficient exploration ability and its tendency to fall into local optimums through the guiding effect of dominant populations, and to improve the quality of the DCS algorithm’s search efficiency and solution at the same time. Secondly, a new population evaluation strategy is proposed to realize the coordinated transition between exploitation and exploration through the comprehensive evaluation of fitness and distance. Finally, a linear population size reduction strategy is incorporated into DCS, which significantly improves the overall performance of the algorithm by maintaining a large population size at the initial stage to enhance the exploration capability and extensive search of the solution space, and then gradually decreasing the population size at the later stage to enhance the exploitation capability. A series of validations was conducted on the CEC2018 test set, and the experimental results were analyzed using the Friedman test and Wilcoxon rank sum test. The results show the superior performance of MSDCS in terms of convergence speed, stability, and global optimization. In addition, MSDCS is successfully applied to several engineering constrained optimization problems. In all cases, MSDCS outperforms the basic DCS algorithm with fast convergence and strong robustness, emphasizing its superior efficacy in practical applications.

1. Introduction

With the rapid advancement of society, academic research and engineering applications are increasingly confronted with complex optimization problems [1,2]. Solving an optimization problem is the process of determining the optimal solution from among many feasible solutions in a given problem space [3]. Optimization problems are centered on maximizing or minimizing one or more dimensional objective functions while satisfying a set of constraints. Such problems are widespread in fields such as engineering, medicine, economics, and agriculture [4]. However, real-world optimization problems are often extremely complicated due to complex properties such as multivariate, multi-objective, multi-constraint, non-linear, multi-peaked, and non-differentiable [5]. Mathematically, many optimization problems are classified as NP-hard, which implies that the exact solution is computationally resource-intensive and usually cannot be achieved in polynomial time [6,7]. Optimization methods are usually divided into two main categories: deterministic and stochastic algorithms. Deterministic algorithms determine the globally optimal solution using rigorous mathematical techniques such as linear programming, nonlinear programming, branch-and-bound, and dynamic programming [8]. They always produce the same output for a given input and rigorously search for an exact solution to the problem. Although such algorithms often produce optimal solutions, they are computationally demanding, especially when applied to large datasets, and often require longer execution times. In addition, they rely on ideal problem conditions such as linearity, convexity, and differentiability [9]. When dealing with non-differentiable objective functions or problems with multiple local optima, deterministic algorithms tend to fall into local optimality and thus exhibit limited adaptability [10]. Given the increasingly complex and diverse problem space, there is an urgent need for more efficient, stable, and highly portable algorithms to overcome these challenges. Meta-heuristic algorithms are stochastic algorithms. Unlike traditional optimization methods, metaheuristic algorithms require no precise mathematical properties, such as gradient information. Instead, they utilize probabilistic strategies to iteratively explore and exploit the problem space, incrementally improving the quality of the solution. By balancing global exploration (extensive search in the solution space) with local exploitation (fine-tuning of promising solutions), these algorithms effectively mitigate the risk of premature convergence to suboptimal solutions [11]. In addition, the non-derivative or non-gradient character of metaheuristic algorithms allows these algorithms to be quickly applied to optimization problems in a variety of complex scenarios without paying attention to the specific structure of the problem [12]. They can obtain near-optimal solutions while reducing computational resource requirements, making them suitable for complex real-world optimization problems such as path planning [13,14], wireless sensor network coverage [15,16], image segmentation [17,18], and feature selection [19,20]. By drawing inspiration from nature and social systems, metaheuristic algorithms provide diverse and flexible solutions to complex optimization problems.
Metaheuristic algorithms represent a class of stochastic optimization techniques inspired by natural phenomena, physical laws, or human behavior. Metaheuristic algorithms can be categorized into four primary groups based on their inspiration (as shown in Figure 1). Evolution-based algorithms: These algorithms are inspired by the principles of natural evolution, including selection, mutation, and crossover. These algorithms mimic the process of natural selection, where the fittest individuals are selected to create the next generation. Examples include the Genetic Algorithm (GA) [21], Evolutionary Strategy (ES) [22], Differential Evolution (DE) [23], Covariance Matrix Adaptive Evolutionary Strategy (CMA-ES) [24], Human Evolutionary Optimization Algorithm (HEOA) [25], and Chaotic Evolution Optimization (CEO) [26]. Physics-based algorithms: these draw on the laws of physics or chemical reaction mechanisms, including Multi-Verse Optimizer (MVO) [27], Fick’s Law Algorithm (FLA) [28], Snow Ablation Optimization (SAO) [29], Polar Lights Optimizer (PLO) [30], Special Relativity Search (SRS) [31], Mirage Search Optimization (MSO) [32], and Kepler Optimization Algorithm (KOA) [33]. The third category comprises mathematical-based algorithms, which are inspired by mathematical theories, functions, and formulas, which have demonstrated significant promise in enhancing the computing efficacy of optimization approaches. One of the noteworthy methods in this category is the Sine Cosine Algorithm (SCA) [34], which applies the concept of trigonometric functions to create an algorithmic model. Arithmetic Optimization Algorithm (AOA) [35], Quasi-random Fractal Search (QRFS) [36], Weighted Average Algorithm (WAA) [37], Triangulation Topology Aggregation Optimizer (TTAO) [38], and Exponential-Trigonometric Optimization Algorithm (ETOA) [39] are other instances in this category. Swarm-based algorithms focus on group collaboration and information exchange to find global optima, simulating the collective social behavior of foraging, reproduction, and avoidance of natural enemies in groups of organisms. Particle Swarm Optimization (PSO) [40] is one of the classical instances in which the foraging behavioral patterns of bird flocks are simulated to locate the ideal solution. Other prominent algorithms in this category comprise Ant Colony Optimization (ACO) [41], Grey Wolf Optimizer (GWO) [42], Artificial Lemming Algorithm (ALA) [43], Crayfish Optimization Algorithm (COA) [44], Dwarf Mongoose Optimization (DMO) [45], Sled Dog Optimizer (SDO) [46], Slime Mould Algorithm (SMA) [47], Tuna Swarm Optimization (TSO) [48], Genghis Khan Shark Optimizer (GKSO) [49], Prairie Dog Optimization Algorithm (PDOA) [50], and Secretary Bird Optimization Algorithm (SBOA) [51].
Their widespread success across various domains reinforces their standing as a superior alternative to traditional optimization methods. Despite significant progress in various areas, metaheuristic algorithms have encountered challenges and problems. First, metaheuristic algorithms can obtain better solutions, but it is difficult to obtain optimal solutions. Second, metaheuristic algorithms are often difficult to balance between exploitation and exploration, which is related to the adaptive nature of their parameters or the focus of the search strategy. The population will homogenize to a single position at some moment, which causes the algorithm to easily fall into a local optimum. Notably, the no free lunch theorem clearly states that no single algorithm can outperform all other algorithms on all possible optimization problems [52]. In other words, optimization algorithms may perform well on some problems but poorly on others. This forces researchers to design or improve efficient algorithms for specific optimization problems with the aim of providing superior solutions.
Differentiated Creative Search (DCS) is an evolution-based meta-heuristic algorithm proposed by Duankhan et al. in 2024 [53]. DCS utilizes differential knowledge acquisition and creative realism to model the algorithm and proposes two different search strategies, divergent and convergent thinking, to implement the problem solution. Although DCS has shown great potential as a metaheuristic algorithm, limitations such as insufficient population diversity, unbalanced exploitation and exploration, and weak global search capability hinder its performance in complex optimization scenarios. To address these challenges, several researchers have systematically improved the algorithm. Chermite et al. designed a hybrid DCS algorithm that utilizes the Newton Raphson method to further improve the quality of the solution and achieve parameter extraction for PV models [54]. Zhang et al. adopted a guided learning strategy to balance the exploitation and exploration of DCS and applied the improved DCS algorithm to optimize the support vector machine model parameters [55]. Liu et al. enhanced the convergence accuracy and the ability to get rid of local optimums by integrating multiple improvement strategies in DCS and solved the agricultural UAV path planning problem [56].
The above studies have enhanced the efficiency of DCS through different methods. However, the inability of DCS to face complex optimization problems is something that exists objectively. Meanwhile, the theory of no free lunch states that a great algorithm may perform well in solving a specific type of optimization problem but may be ineffective for other types of problems. Considering the above factors, this paper proposes a new variant of DCS called Multi-Strategy Differentiated Creative Search (MSDCS). MSDCS combines three improvement techniques to realize a leap in performance. First, this paper proposes a collaborative development mechanism to organically integrate the estimation distribution algorithm and DCS. The defects of the DCS algorithm, including its insufficient exploration ability and the fact that it is easy for it to fall into local optimization, are compensated for by the guiding effect of advantageous populations. At the same time, it improves the search efficiency and the quality of the DCS algorithm. Secondly, a new population evaluation strategy is proposed to realize the coordinated transition between exploitation and exploration through the comprehensive evaluation of fitness and distance. Finally, a linear population size reduction strategy is integrated into DCS, which enhances the exploration capability and searches the solution space extensively by maintaining a large population size at the initial stage. At a later stage, the population size is gradually reduced to enhance the exploitation capability and improve the accuracy and quality of the solution. Meanwhile, the search process is optimized to significantly improve the overall performance of the algorithm. The proposed MSDCS is comprehensively examined on the CEC2018 benchmark test functions and thoroughly compared with different classes of basic and improved algorithms. Statistical tests, including Friedman’s test and the Wilcoxon rank sum test, are performed to analyze the differences between MSDCS and other compared algorithms. Engineering constrained optimization problems confirm the ability of MSDCS to solve realistic optimization problems. The contributions of this paper are as follows:
(1)
Proposing a DCS variant, MSDCS, that combines three improved techniques.
(2)
Comprehensively examining the performance of MSDCS using the CEC2018 test suite and confirming its superiority through the Friedman test and the Wilcoxon value sum test.
(3)
Applying MSDCS successfully to the wireless sensor network coverage problem and engineering constrained optimization problems, showing its adaptability in facing real-world problems.
The structure of this article is as follows: Section 2 delves into the architecture and specifics of the DCS algorithm. The third chapter is the construction of the theoretical framework, which proposes three improvement strategies, including a collaborative development mechanism, a population evaluation strategy, and a linear population size reduction strategy. Meanwhile, Section 3 provides an in-depth analysis of the algorithmic complexity of MSDCS, including both time complexity and space complexity. Section 4 presents ablation experiments on MSDCS, validating the soundness of its design by testing it on CEC2018 test functions. Furthermore, Section 4 employs a comprehensive and rigorous evaluation of the MSDCS algorithm alongside nine competitive algorithms, utilizing the 10-dimensional, 30-dimensional, 50-dimensional, and 100-dimensional CEC-2017 benchmark functions, with a detailed analysis of the experimental results. Section 5 applies the algorithm to engineering-constrained optimization problems. Finally, Section 6 summarizes the entire work, analyzes the potential limitations of the MSDCS algorithm, and outlines future research directions.

2. Differentiated Creative Search

DCS starts the search from a set of randomly generated solution sets and deepens the search through three different update strategies as well as differentiated knowledge acquisition strategies. When the stopping criteria are satisfied, DCS ends the search and outputs the optimal solution. The specific structure of DCS is represented as follows.

2.1. Initialization

The original DCS algorithm begins by generating a random population with a uniform distribution to initiate the optimization process. The initial population can be determined using the following equation.
X i , j = L b j + U b j L b j × U , i = 1 , 2 , , N ; j = 1 , 2 , , D
where X i , j denotes the j t h dimensional position of the i t h individual; U is a randomly generated number within the range [0, 1]. U b j and L b j represent the minimum and maximum bounds of the problem, respectively. N is the total number of whole individuals. Unlike other metaheuristic algorithms, DCS evaluates all individuals after initialization and ranks them based on their fitness. In this paper, we take the minimization problem as an example, where individuals with smaller fitness are ranked higher.

2.2. Differentiated Knowledge Acquisition

In the differentiated knowledge-acquisition phase, DCS will calculate the knowledge acquisition rate η i t at the t t h iteration for each individual. The η i t affects the knowledge uptake of each individual in different dimensions, represented as follows.
η i t = 1 2 r o u n d U × ϑ i t + 1 , i f   U < ϑ i t 0 , i f   U ϑ i t
where r o u n d · denotes rounding the given value to the nearest integer. ϑ i t is a coefficient that describes an individual’s knowledge deficit and can be represented as follows, with the higher-ranked individual having a smaller ϑ i t .
ϑ i t = 0.25 + 0.55 × R i t / N
where R i t is ranking of the i t h individual at the t t h iteration. After obtaining the knowledge acquisition rate of each individual, the following equation calculates whether each individual learns the corresponding dimension or not.
X n e w i , j = v i , j , i f   U < η i t   j = j r a n d X i , j , o t h e r w i s e
j r a n d = r a n d i n t 1 , D
where v i , j is the j t h dimensional position of the trial vector for each individual after updating at the t t h iteration. X n e w i , j is the child individual of each individual after absorbing the knowledge. j r a n d is an integer randomly chosen from 1 to D and generated once for each iteration.

2.3. Creative Realism

DCS divides the population into three segments: a high-level group with good fitness, a medium level general group with intermediate fitness, and the least fit individual. The high-level group contains the top-ranked N s individuals. Creative realism consists of divergent thinking for the high-level group and convergent thinking for the medium-level group. For the normal group, DCS obtains the trial vector v based on the optimal individual by drawing on the knowledge of two different individuals, denoted as follows.
v i , j = X b e s t , j + λ × X r 2 , j X i , j + ω × X r 1 , j X i , j , i = N s + 1 , N s + 2 , , N
λ = 0.1 + 0.518 × 1 F E s / F E s max
where X b e s t , j is the j t h dimensional position of the best individual in the population. X r 1 , j is the j t h dimensional position of a randomly selected individual in the population that is different from X b e s t , X r 2 , and X i . X r 2 , j is the j t h dimensional position of a randomly selected individual from the medium level population and X r 2 X r 1 X b e s t X i . ω is a randomly generated number within the range [0, 1]. F E s max and F E s denote the maximum number of function evaluations and the current number of function evaluations, respectively. For high-level groups, DCS generates the experiment vectors using an updating method based on the Linnik distribution, denoted as follows.
v i , j = X r 3 , j + L k α , β , i = 1 , 2 , , N s
where L k α , β symbolizes the Linnik distribution random number generator with control parameters α and β . X r 3 , j is the j t h dimensional position of a randomly selected individual from the whole population and X r 3 X b e s t X i . For the worst individual, DCS generates the trial vector v N using the following equation.
v N = L b + U b L b × r a n d 1 , D , i f   r a n d < p c
where v N denotes the trial vector of the N t h individual, which is also the trial vector of the worst individual. p c is a constant with a value of 0.5.

2.4. Retrospective Assessment

After generating the trial vectors and learning based on the knowledge acquisition rate, the DCS evaluates the learned individuals and selects them according to the following equation.
X i t + 1 = X n e w , i f   F X n e w F X i t X i t , o t h e r w i s e
where F X n e w and F X i t are fitness values of X n e w and X i t , respectively.

3. Proposed Multi-Strategy Differentiated Creative Search

The DCS algorithm suffers from some shortcomings, limiting its search efficiency. The effective information of the dominant group is ignored throughout the search process, which leads to the evolutionary direction of the population being disordered. In addition, the grouping of DCS is based on the magnitude of fitness, which ignores the factor of distance between different individuals. Fixed population size cannot expand the search in the early stage and narrow the range in the later stage, which weakens the performance of DCS. To overcome these limitations, this paper proposes a multi-strategy DCS algorithm that incorporates three improvement strategies. In this section, the three improvement strategies are described in detail sequentially, accompanied by pseudo-code and a flow chart. The time complexity and space complexity of MSDCS are also demonstrated in this section.

3.1. Population Evaluation Strategy (PES)

The DCS divides the population into three segments based on the fitness ordering and uses this to calculate the knowledge acquisition rate of different individuals. However, DCS relies only on fitness for grouping and ignores the distance information between individuals, making it difficult to maintain population diversity. In order to enrich the population diversity and promote the wide distribution of populations, this paper proposes a population evaluation strategy (PES). PES can consider both fitness and distance to divide populations, and the detailed steps are shown below.
Step 1: Calculate the Euclidean distance between each individual and the optimal individual as in Equation (11).
D i s i = X i , 1 X b e s t , 1 2 + X i , 2 X b e s t , 2 2 + + X i , j X b e s t , j 2
Step 2: Calculate the score for each individual based on normalized distance and normalized fitness as in Equation (12).
S c o r e i = σ 1 × N o r m D i s i + 1 σ 1 × N o r m F X i
Step 3: Sort each individual based on their score (minimization problem is descending). The coefficient σ 1 determines the extent to which fitness and distance affect the score. In this work, σ 1 is calculated by Equation (13).
σ 1 = mod F E s max 10 , F E s / F E s max × 1 γ + γ

3.2. Linear Population Size Reduction Strategy (LPSR)

The size of the population affects the performance of an algorithm. At the initial stage of the algorithm, a larger population size contributes to the population diversity and enhances the exploration capability, enabling the algorithm to search the solution space more extensively and find potential high-quality solution regions. With the gradual reduction of the population size, the exploitation ability of the algorithm is enhanced, and it can focus more on the promising regions to improve the accuracy and quality of the solution, thus effectively balancing the exploration and exploitation ability and making the algorithm converge to the global optimal solution more efficiently and stably. The linear population size reduction strategy (LPSR) is a successful population size adjustment strategy that has been applied in algorithms such as LSHADE. In order to improve the performance of the DCS algorithm, this paper integrates the LPSR strategy into the DCS algorithm. The LPSR strategy is described as follows.
N n e w = r o u n d N i n i F E s F E s max × N i n i N m i n
where N i n i is the initial population size and N m i n is the final population size. When the new population size N n e w is smaller than the current population size N , the population is sorted according to the value of the objective function and the worst N N n e w individuals are discarded.

3.3. Collaborative Development Mechanism (CDM)

DCS ignores the guiding effect of the dominant population throughout the search process, which causes the algorithm to fall into local optima more easily, making it difficult to provide high-quality solutions. In order to enhance the global search capability of the DCS algorithm, this paper incorporates the estimation distribution algorithm into DCS. Since the estimated distribution algorithm depends not on an individual but updates the population by virtue of the information of the dominant group, this enables the EDA to have a powerful exploration capability, which is lacking in the DCS algorithm. EDA algorithms can be divided into three phases: selection phase, modeling phase, and generation phase. In the selection phase, EDA ranks the individuals according to the size of their fitness and selects the top fifty percent to form the dominant group P d . Then, a Gaussian probability distribution model based on the dominant group is established. Finally, new individuals are generated based on the Gaussian probability distribution model. The mean μ and the covariance matrix C of the Gaussian probability distribution model are calculated as Equations (15) and (16). Equation (17) represents the approach to the new individual generated by the EDA
μ = 1 P d × i = 1 P d X i , X i P d
C = 1 P d × i = 1 P d X i μ × X i μ T , X i P d
X n e w i = μ + g , g G 0 , C
where P d is the number of dominant groups. Common integration methods include two categories. One category is to replace the original search strategy with a new one. The other category is where the two methods are randomly selected according to probability. These two types of integration methods make it difficult to utilize the existing search strategies at the same time. For this reason, this paper proposes a collaborative development mechanism (CDM) to realize the coexistence of the original and new strategies. The process of the collaborative development mechanism is shown in Figure 2. Specifically, the EDA algorithm models the probability distribution using the population generated by the DCS algorithm and generates new individuals accordingly. The DCS utilizes a greedy strategy to select the offspring individuals from the new individuals provided by itself and those generated by the EDA. The individuals used by the DCS may contain individuals generated by the EDA based on the dominant population’s guidance, which allows the DCS approach to utilize the dominant population’s guidance as well. The EDA method utilizes individuals who are not exclusively self-provided, which mitigates the weakening of population diversity.

3.4. The Framework of MSDCS

The MSDCS algorithm is obtained by integrating three improvement strategies into the basic DCS algorithm. PES is designed to sort the populations. LPSR adjusts the number of populations participating in the next iteration at the end of each iteration. CDM replenishes the populations with high-quality individuals. To facilitate the understanding of the execution steps of MSDCS, the corresponding pseudo-code is described in detail in Algorithm 1. In addition, a flowchart depicting the MSDCS algorithm is provided in Figure 3.
Algorithm 1. Multi Strategy Differentiated Creative Search (MSDCS)
1: Initialization: Xi(i = 1, 2, 3, …, NP), FEs = 0, FEsmax
2: Evaluate the fitness values of the initial population X
3: while (FEs < FEsmax) do
4: Calculate S c o r e of each individual using Equation (12)//PES
5: Sort the population in ascending order of S c o r e
6:    for every individual, do
7:     Calculate the η i t and ϑ i t using Equations (2) and (3)
8:     Randomly select j r a n d using Equation (5)
9:     if i == N
10:        Update the v N using Equation (9)
11:     else if i N s
12:        Update the v i , j using Equation (8)
13:     else
14:        Update the v i , j using Equation (6)
15:     end if
16:     Update the Xnewi using Equation (4)
17:     FEs = Fes + 1
18:    end for
19:    Calculate μ and C using Equations (14) and (15)//CDM
20:    Generate N c new individuals using Equation (16)//CDM
21:    FEs = Fes + Nc
22:    Calculate the Nnew using Equation (13)//LPSR
23:    Shrinking X by discarding the worst solutions
24: end while
25: Return best individual

3.5. Complexity Analysis of MSDCS

In this section, we analyze the time complexity and space complexity of MSDCS. Time complexity measures the rate at which the algorithm’s execution time increases as the input size grows. It indicates the order of magnitude of the time required as the problem size expands. On the other hand, space complexity measures the rate at which the amount of memory required by the algorithm grows as the input size increases, reflecting the algorithm’s demand for memory resources. Both time complexity and space complexity are critical metrics for evaluating the efficiency of an algorithm.
For the basic DCS algorithm, the time complexity and space complexity of DCS are O N × D × T and O N × D , respectively, according to its original literature. In this subsection, T denotes the number of iterations, N represents the population size, and D is the dimensionality of the search space.
For the proposed MSDCS, the three improved strategies do not add an initialization step, so the time complexity of population initialization remains unchanged. In the whole optimization process, the PES strategy does not involve population updating and fitness calculation, which has no effect on the time complexity. The CDM strategy additionally generates N c individuals, and the time complexity of this part is O N c × D × T . The LPSR strategy ensures that the number of evaluations N L per iteration is less than N , which means that the time complexity is reduced. Therefore, the time complexity of MSDCS is O N c × D × T + N L × D × T . The space complexity of MSDCS can be analyzed based on the main data structures and variables involved in storing the information. The most important variables in the algorithm are the particle position matrix X and the particle fitness matrix. This matrix stores the coordinates of each particle, so its space complexity is O N × D . Other parts of the algorithm, such as the PES and CDM, while updating the individual positions, only require temporary variables to store intermediate results. These operations do not contribute additional space complexity. Therefore, the extra memory required for intermediate calculations does not exceed O N × D . In conclusion, the overall space complexity of MSDCS is O N × D .

4. Numerical Experiments Using CEC 2017 Test Suite

In this section, we focus on the performance of the proposed MSDCS algorithm on the CEC2018 test suite with the aim of evaluating its capability in dealing with complex test functions. Section 4.1 describes the CEC2018 benchmark test functions in detail and provides a description of the parameters for the comparison algorithms. In addition, this subsection describes the hardware and software configurations of the experimental platform. Section 4.2 and Section 4.3 show the results of the parameter sensitivity analysis and ablation experiments, respectively, which provide insights into the effects of different parameter settings and strategies on the performance of MSDCS. Finally, in Section 4.4, we provide a comprehensive performance comparison analysis of MSDCS with other comparative algorithms to further validate its effectiveness.

4.1. Experiment Setting and Performance Metrics

The hardware configuration used in this experiment includes an AMD R9 7945HX, 2.5 Ghz CPU, 32 GB of memory, and a 4060 GPU. The software configuration consists of the Windows 11 operating system and MATLAB 2023a.
To test the performance of MSDCS, the IEEE CEC 2018 test suite is selected; it has 29 test functions, in which F1 is an unimodal function, F3–F9 are multimodal functions, F10–F19 are hybrid functions, and F20–F29 are composite functions. The unimodal function with a unique global optimal solution is mainly used to evaluate the convergence accuracy and speed of the algorithm in basic optimization scenarios. Multi-peak functions contain multiple local extremes and are used to test the algorithm’s ability to find the global optimal solution as well as its ability to jump out of the local optimum. Hybrid functions, on the other hand, combine multiple local optima and global optima, through which the balance between the algorithm’s ability to explore globally and exploit locally in a complex search space can be tested. Composite functions further increase the complexity and difficulty of the problem and are used to test the algorithm’s ability to solve highly complex and comprehensive problems. In this work, the maximum number of function evaluations is used instead of the maximum number of iterations as a stopping criterion to fairly compare the performance of each algorithm. The dimensions are 10D, 30D, 50D, and 100D, and the search range is [−100, 100]D. The F E s max is 1000 times the number of dimensions, which is set to 10,000, 30,000, 90,000, and 100,000, respectively. All experimental results are obtained by running each algorithm independently 30 times. The optimum, mean, and standard deviation of all experiments were recorded, and the data were analyzed using the Friedman test and Wilcoxon rank sum test.
To rigorously assess the performance of the MSDCS algorithm, it was compared against several advanced basic and improved algorithms, including (1) evolution-based algorithms: AE [57], LSHADE [58], and APSM-jSO [59]; (2) physics-based algorithms: RIME [60], RDGMVO [61]; (3) mathematics-based algorithms: QIO [62], MTVSCA [63]; (4) swarm-based algorithms: MRFO [64], EOSMA [65]. Table 1 provides the detailed parameter settings of these comparative algorithms, derived from the respective original literature.

4.2. Parameter Sensitivity Analysis

The parameter settings have a great impact on the search efficiency of the metaheuristic algorithm. Two important parameters that affect the performance of MSDCS are the minimum population N min for the LPSR strategy and the population N c for the CDM strategy. Parameter sensitivity is analyzed on the CEC2017 test set with the goal of finding a parameter setting with a relatively high average ranking. Note that the experimental results in this section are based on 30 separate runs. The grid search is conducted. The N min is searched from 0.1N to 0.9N with a value interval of 0.1N. The N c is searched from 0.1N to 1.0N with a value interval of 0.1N. Table 2 and Table 3 show the statistical results of Friedman’s test using α = 0.05 significance level for N min and N c , respectively, and the best ranking is bold. Figure 4 and Figure 5 show the rankings for different parameter settings.
For N min , we can see that MSDCS achieves the best average ranking when N min = 0.1 N or N min = 0.2 N . Moreover, as N min decreases, the corresponding rankings increase. This shows that the LPSR strategy can improve the algorithm’s performance by dynamically adjusting the population size. It should be noted that the value of n chosen in this paper is 0.2 N , which is because the CDM strategy needs to model the probability distribution through a sufficiently large number of populations, and too small a number cannot represent the population evolutionary trend.
For N c , MSDCS with N c = 0.7 N achieved the best average ranking on 10D. The setting of N c = 0.5 N allowed MSDCS to reach the best Friedman ranking on 30D. For 50D and 100D, MSDCS performed best overall when N c = 0.3 N . When all four dimensions are considered together, the parameter setting of N c = 0.5 N ensures that MSDCS has the highest overall average ranking. In conclusion, the parameter settings we chose for MSDCS were N min = 0.2 N and N c = 0.5 N .

4.3. Ablation Experiment

This subsection discusses the effects of PES, LPSR, and CDM on MSDCM performance. Three MSDCS variants combining a single improvement strategy were developed as shown in Table 4. DCS-PES, DCS-LPSR, and DCS-CDM can be compared with the basic DCS to demonstrate the effectiveness of each strategy. Comparison of DCS-PES, DCS-LPSR, DCS-CDM and MSDCS can be further verified to the promotion between the improvement strategies.
DCS, DCS-PES, DCS-LPSR, DCS-CDM and MSDCS were run independently 30 times in the four-dimensional settings of the CEC2017 test suite and the results were analyzed using Friedman’s test. The original data containing the optimum values, mean values, and standard deviations can be found in Table A1, Table A2, Table A3 and Table A4 in the Appendix A file. Table 5 summarizes the Friedman rankings for DCS, DCS-PES, DCS-LPSR, DCS-CDM, and MSDCS and is visualized in Figure 6. The Friedman test is a nonparametric statistical test used to compare the overall performance of multiple algorithms for significant differences. It determines the performance of an algorithm by ranking its performance on the test set and calculating the average ranking.
According to Table 5, the p-value for all four cases is less than 0.05, which indicates that there is a significant difference between DCS, DCS-PES, DCS-LPSR, DCS-CDM, and MSDCS. Based on Table 5 and Figure 6, the discussion is as follows. MSDCS ranks first in all four cases with an overall average ranking of 1.431, followed by DCS-CDM, DCS-PES, and DCS-LPSR, in that order, with the basic DCS coming last. The average ranking of the three DCS variants incorporating a single improvement strategy is better than that of the basic DCS, indicating that the single improvement strategy is effective in enhancing the DCS performance. The enhancement of DCS by PES and CDM is similar at 10D, 30D, and 50D, but CDM enhances the DCS performance more at 100D. The effects of the three strategies on DCS performance are CDM > PES > LPSR in descending order. The MSDCS, incorporating the three improvement strategies, outperforms the DCS variant incorporating a single improvement strategy, which indicates that the three improvement strategies can enhance each other to further enhance the DCS performance.
The excellent performance of the DCS-CDM algorithm is attributed to the guidance of the CDM strategy, which calculates the distribution trend of the dominant population through a Gaussian probability distribution model and thus guides the evolution of the entire population. In addition, the CDM strategy enriches the population diversity by adding individuals to the population that are not new individuals generated based on a single old individual. The PES strategy selects agents by comprehensively evaluating fitness and distance, which allows for a better balance between exploitation and exploration. However, since it does not implement a new search strategy, it does not improve the performance of the DCS as much as the CDM strategy. The LPSR strategy ensures that convergence can be accelerated at a later stage by shrinking the population, but, at the same time, this measure somewhat weakens the population diversity. Each of the three strategies has its own focus and at the same time complements the other to realize the enhancement of MSDCS.

4.4. Comparison with Other Advanced Algorithms

After the parameter sensitivity analysis and ablation experiments, we further perform a full comparison using the advanced improved and basic algorithms and the proposed MSDCS in the CEC2017 test set. In this subsection, this paper mainly analyzes the experimental results using the Friedman test and Wilcoxon rank sum test. The complete experimental results obtained by MSDCS and the comparison algorithms are summarized in Table A5, Table A6, Table A7 and Table A8 in Appendix A, including the best value (Best), the average value (Ave), the standard deviation (Std), and the rank. As the Friedman test and Wilcoxon test analyze the performance of MSDCS and the comparison algorithms as a whole, this paper uses heat maps to initially show the mean-based rankings of MSDCS and the competition algorithms on each function.
The ranking of MSDCS and the comparison algorithms on each function in different dimensions is visualized in Figure 7. In Figure 7, MSDCS ranks first with 22 functions on 10D, performs best with 18 functions on 30D, provides the best solution with 15 functions on 50D, and achieves the top ranking with 16 functions on 100D. That is, MSDCS achieved the best rankings in more than half of the 29 CEC2017 test functions under different dimensions, which tentatively shows the superiority of MSDCS.
Table 6 summarizes the Friedman test results for MSDCS, DCS, AE, LSHADE, APSM-jSO, RIME, RDGMVO, QIO, MTVSCA, MRFO, and EOSMA, and the corresponding rankings are displayed in Figure 8. In Figure 8, the rankings of all the algorithms are kept stable across dimensions, which suggests that the algorithms that participate in the experiments have good robustness. The proposed MSDCS is ranked first in all four cases, and DCS is ranked last. This fully reflects the advantage of MSDCS over DCS. MSDCS and RDGMVO are ranked similarly on 50D and 100D, which is consistent with the analysis results in Figure 7. According to Table 6, the Friedman p-value for all four dimensions is less than 0.05, which means that there is a significant difference between MSDCS and DCS, AE, LSHADE, APSM-jSO, RIME, RDGMVO, QIO, MTVSCA, MRFO, and EOSMA. The following provides specific Friedman test results from Table 6.
For CEC2017 10D, MSDCS ranks in the first place, followed by APSM-jSO, QIO, RDGMVO, RIME, MRFO, EOSMA, LSHADE, AE, MTVSCA, and DCS. This shows that MSDCS is outpacing the competition algorithm when solving CEC2017 10D functions.
For CEC2017 30D, MSDCS ranks in the first place, followed by RDGMVO, APSM-jSO, RIME, LSHADE, QIO, MRFO, EOSMA, AE, MTVSCA, and DCS. This shows that MSDCS is outpacing the competition algorithm when solving CEC2017 50D functions.
For CEC2017 50D, MSDCS ranks in the first place, followed by RDGMVO, APSM-jSO, LSHADE, RIME, QIO, EOSMA, MRFO, AE, MTVSCA, and DCS. This shows that MSDCS is outpacing the competition algorithm when solving CEC2017 50D functions.
For CEC2017 100D, MSDCS ranks in the first place, followed by RDGMVO, LSHADE, APSM-jSO, RIME, QIO, EOSMA, MRFO, AE, MTVSCA, and DCS. This shows that MSDCS is outpacing the competition algorithm when solving CEC2017 100D functions.
The Friedman test only indicates whether there is a difference between MSDCS and the comparison algorithms, but it does not formalize the difference between MSDCS and each algorithm. Based on the results of the Friedman test, the Nemenyi test was used as a post hoc test. Figure 1 illustrates the magnitude of the differences between MSDCS and the comparison algorithms, where the algorithms that are connected by lines indicate that there are no significant differences between them. From Figure 9, MSDCS differs from all comparison algorithms on 10D. As for RDGMVO, MSDCS has no significant difference in the remaining three dimensions. For APSM-jSO and LSHADE, MSDCS differs on 30D and has no difference on 50D and 100D. For all other algorithms, MSDCS shows significant superiority. In conclusion, MSDCS has significant advantages and is a promising DCS variant.
This was followed by a Wilcoxon rank sum test to examine the differences between MSDCS and all comparison algorithms for each function. Table 7 summarizes the statistics for MSDCS, DCS, AE, LSHADE, APSM-jSO, RIME, RDGMVO, QIO, MTVSCA, MRFO, and EOSMA, where the number of symbols “+” denotes the number of functions for which MSDCS outperforms the comparative algorithms. The number of “−” symbols indicates the number of functions for which MSDCS is inferior to the comparison algorithm. The number of “=” indicates the number of functions for which MSDCS and the comparison algorithm have similar performance. Figure 10 shows the number of functions for which MSDCS is better/similar/inferior to the comparison algorithm. From the “Total” in the last column of Table 7, it can be seen that MSDCS significantly outperforms at least half of the functions when compared with different algorithms, which indicates that the overall performance of MSDCS is better than that of other comparative algorithms. In 10D, MSDCS only underperforms the other algorithms when compared with APSM-jSO, RIME, RDGMVO, and EOSMA, but at least 19 functions are better than these algorithms. In 30D, MSDCS only loses to RIME, RDGMVO, and QIO in some of the functions, but outperforms each of them in more functions (at least 18). In higher-dimensional functions (50D/100D), MSDCS performance drops slightly. MSDCS scores against each other in comparisons with APSM-jSO, RIME, RDGMVO, and QIO. For 50D, MSDCS achieves fewer “+” than “−” in the comparison with RDGMVO. However, combining the Friedman test and heat map analysis, MSDCS is the better performer in all three functions, in which MSDCS and RDGMVO perform similarly. Therefore, we can still conclude that the overall performance of MSDCS is superior to that of RDGMVO for the 50D functions. Notably, MSDCS achieves the success of all the functions under all four dimensions in comparison with DCS. In conclusion, the Wilcoxon rank sum test reconfirms the great performance of MSDCS.

5. Numerical Experiments Using Engineering Optimization Problem

In this section, we apply MSDCS to solve engineering optimization problems with the aim of evaluating its potential for solving real-world optimization problems. The engineering optimization problems contain the wireless sensor network coverage problem and the pressure vessel design problem. The parameter settings for all algorithms involved in the following experiments of this section are the same as in Table 1.

5.1. Wireless Sensor Network Coverage Problem

Wireless sensor networks (WSNs) have become more popular than ever. WSNs represent an emerging computing and networking paradigm that can be defined as networks composed of miniature, small, inexpensive, and highly intelligent devices known as sensor nodes. In wireless sensor network node deployment, we deploy N wireless sensor nodes in a two-dimensional planar region. The set of homogeneous wireless sensor nodes is S = { s 1 , s 2 , s 3 , , s i , , s N } . Each node can obtain its position and has an identical sensing radius R s . We assume the monitoring area is a 2D rectangular area of L × W . The set of monitoring nodes is M = { m 1 , m 2 , m 3 , , m j , , M L × W } . ( x i , y i ) denotes the coordinates of each sensor node s i . ( x j , y j ) denotes the coordinates of each monitoring node m j . The Euclidean distance between the two nodes is as below:
d ( s i , m j ) = ( x i x j ) 2 + ( y i y j ) 2
In this paper, we use a Boolean 0–1 model to determine whether a sensor node can detect a monitoring node or not. The probability of monitoring point m j being sensed by node s i is defined as follows:
p c ( s i , m j ) = 1 , i f     d ( s i , m j ) R s 0 , o t h e r w i s e
The all-sensor coverage rate C r can be obtained from Equation (20).
C r = j = 1 L × W p c ( s i , m j ) L × W
Figure 11 presents the visual representation of the coverage area for different algorithms in solving the wireless network coverage problem. Figure 12 displays the convergence curves and boxplots for the same problem, showing the coverage area for different algorithms. It is evident that MSDCS achieves the largest network coverage area, outperforming the DCS, RDGMVO, and APSM-jSO. The experimental results presented in Table 8 compare the performance of various algorithms in optimizing sensor wireless network coverage. The MSDCS algorithm achieves the highest coverage value of 85.95%, demonstrating its superior ability to maximize sensor coverage. This result highlights MSDCS’s exceptional efficiency in optimizing network coverage compared to other algorithms. The RDGMVO algorithm follows closely behind with a value of 80.99%, showing competitive performance in terms of coverage efficiency. The APSM-jSO algorithm achieves a coverage value of 71.90%, performing slightly better than the DCS algorithm, which achieved a value of 64.46%. The convergence curves show that the MSDCS algorithm is able to find the best coverage scheme quickly. The boxplot shows that MSDCS has the best robustness and provides a more centralized distribution of solutions. These results confirm that the proposed MSDCS is the most efficient approach to solving the sensor network coverage problem, outperforming other compared algorithms.

5.2. Constrained Engineering Optimization

In this subsection, we verify the performance of MSDCS through 10 constrained optimization problems. The details of these constrained problems are displayed in Table 9. When applying meta-heuristic algorithms to solve constrained optimization problems, the handling of constraints is crucial. Commonly used methods include the penalty function method, repair strategy, and rule-based constraint processing. The penalty function method converts the degree of constraint violation into a penalty term to be added to the objective function; the repair strategy repairs the infeasible solution into a feasible solution; and the rule-based constraint processing utilizes the problem rules to filter or adjust the solution. This paper adopts the penalty function method to convert a constrained optimization problem into an unconstrained optimization problem. That is, a large penalty value is imposed on the solution when it violates the constraints. Table 10 summarizes the results obtained by MSDCS, DCS, AE, LSHADE, APSM-jSO, RIME, RDGMVO, QIO, MTVSCA, MRFO, and EOSMA for solving the constrained optimization problems and visualizes the ranking based on the average values as shown in Figure 13. According to Figure 13, MSEDO provided the best solution on seven constraint problems and the second-best solution on three constraint problems. In sharp contrast, DCS ranks last on all problems. This indicates that the proposed improvement strategies are effective in enhancing the performance of DCS and providing MSEDO with the ability to solve real-world problems.

6. Conclusions

This paper presents a DCS algorithm variant, called MSDCS, which achieves DCS performance improvement by integrating three improvement strategies. Firstly, a collaborative development mechanism is proposed to organically integrate the estimation allocation algorithm and DCS. Through the guiding effect of the dominant population, it makes up for the defects that the DCS algorithm has, such as an insufficient exploratory ability and the fact that it can easily fall into local optimization. Secondly, a new population evaluation strategy is proposed to realize the coordinated transition of development and exploration through the comprehensive evaluation of adaptation and distance. Finally, a linear population size reduction strategy is integrated into the distributed control system to enhance the exploration ability and extensively search the solution space by maintaining a large population size at the initial stage. The proposed MSDCS algorithm is validated on the CEC2017 test set, a wireless sensor network coverage problem, and an engineering-constrained optimization problem, and the following conclusions are presented.
On the CEC2017 test suite, we obtained the optimal parameter settings through parameter sensitivity analysis and verified the effectiveness of the improved strategies through ablation experiments. The excellent performance of MSDCS is validated by comparing it with other advanced basic and improved algorithms and applying Friedman’s test and Wilcoxon rank sum test. On the wireless sensor network coverage problem, MSDCS provides the best coverage solution with an 85.95% coverage rate. In addition, MSDCS performs well on 10 engineering-constrained optimization problems, ranking first in 7 of them. In summary, the MSDCS proposed in this paper is a promising metaheuristic algorithm variant. Certainly, MSDCS has some limitations. Firstly, the parameters of MSDCS need to be determined manually, and its generalized optimal parameter settings on a wider range of problems need further research. Secondly, MSDCS does not perform as well on high-dimensional problems as it does on low-dimensional problems, which may be caused by the mutual constraints between the too small number of populations at the later stage and the sufficient number of populations required by the synergistic development mechanism. This suggests that MSDCS needs to further improve its ability to solve high-dimensional problems. In addition, the optimal parameters need to be determined experimentally, and such fixed parameters may weaken the algorithm’s search capability, leading to premature convergence and, in some cases, to local optima. Finally, it is necessary to develop a multi-objective version of MSDCS, which is due to the fact that real-world optimization problems often have multiple objectives to satisfy and are difficult to achieve at the same time.

Author Contributions

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

Funding

This research was funded by the Major Humanities and Social Sciences Research Projects in Zhejiang Higher Education Institutions (Grant Number: 2024QN018) and the Zhejiang Provincial Philosophy and Social Sciences Planning Special Project on Higher Education Basic Research Funding Reform (Grant Number: 25NDJC153YBMS).

Data Availability Statement

Data will be made available on request.

Acknowledgments

The authors would like to thank their anonymous reviewers and the editor for their careful reviews and constructive suggestions to help us.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A

Table A1. The statistical results of MSDCS with different strategies for solving CEC2017 (D = 10).
Table A1. The statistical results of MSDCS with different strategies for solving CEC2017 (D = 10).
FunctionIndexDCSDCS-PESDCS-LPSRDCS-CDMMSDCSFunctionIndexDCSDCS-PESDCS-LPSRDCS-CDMMSDCS
F1Best5.749E+091.002E+021.730E+061.589E+021.000E+02F16Best1.812E+031.731E+031.739E+031.706E+031.708E+03
Mean1.416E+101.006E+026.761E+061.959E+031.000E+02Mean2.139E+031.741E+031.750E+031.722E+031.727E+03
Std4.455E+093.216E-013.158E+062.124E+031.786E-04Std1.598E+026.389E+007.504E+009.146E+008.155E+00
F2Best2.182E+043.000E+021.777E+033.000E+023.000E+02F17Best2.449E+061.802E+036.754E+031.803E+031.800E+03
Mean4.706E+043.000E+028.772E+033.003E+023.000E+02Mean2.549E+081.810E+031.515E+041.824E+031.805E+03
Std1.740E+049.349E-063.893E+033.293E-012.735E-09Std2.261E+086.262E+006.760E+039.643E+007.111E+00
F3Best7.774E+024.002E+024.054E+024.005E+024.001E+02F18Best2.783E+031.901E+031.942E+031.901E+031.900E+03
Mean1.774E+034.011E+024.120E+024.024E+024.007E+02Mean8.309E+061.903E+032.355E+031.903E+031.901E+03
Std6.895E+025.480E-015.797E+007.140E-014.802E-01Std8.178E+066.232E-015.995E+021.133E+005.817E-01
F4Best5.899E+025.098E+025.109E+025.115E+025.103E+02F19Best2.263E+032.015E+032.021E+032.005E+032.008E+03
Mean6.366E+025.207E+025.234E+025.170E+025.162E+02Mean2.375E+032.034E+032.038E+032.014E+032.020E+03
Std2.293E+015.161E+004.691E+003.418E+003.861E+00Std5.961E+018.083E+006.878E+006.658E+006.720E+00
F5Best6.465E+026.000E+026.004E+026.000E+026.000E+02F20Best2.278E+032.200E+032.204E+032.200E+032.200E+03
Mean6.786E+026.000E+026.009E+026.000E+026.000E+02Mean2.406E+032.271E+032.230E+032.256E+032.264E+03
Std1.370E+011.867E-032.781E-012.636E-033.299E-05Std4.711E+016.302E+014.716E+016.132E+016.064E+01
F6Best8.880E+027.262E+027.335E+027.228E+027.203E+02F21Best2.557E+032.200E+032.267E+032.200E+032.300E+03
Mean9.093E+027.329E+027.499E+027.326E+027.281E+02Mean3.554E+032.297E+032.304E+032.296E+032.300E+03
Std1.523E+014.019E+006.364E+005.188E+004.288E+00Std3.922E+021.843E+011.082E+012.376E+015.324E-01
F7Best8.570E+028.075E+028.144E+028.093E+028.079E+02F22Best2.736E+032.610E+032.617E+032.602E+032.604E+03
Mean9.033E+028.210E+028.264E+028.169E+028.165E+02Mean2.796E+032.619E+032.625E+032.614E+032.613E+03
Std1.358E+014.894E+005.167E+003.665E+004.026E+00Std2.490E+014.661E+003.787E+004.373E+004.436E+00
F8Best2.591E+039.000E+029.036E+029.000E+029.000E+02F23Best2.846E+032.500E+032.515E+032.500E+032.500E+03
Mean3.425E+039.000E+029.109E+029.000E+029.000E+02Mean2.932E+032.739E+032.571E+032.702E+032.722E+03
Std4.504E+026.786E-074.790E+008.294E-022.978E-12Std4.990E+014.545E+016.942E+019.186E+016.047E+01
F9Best2.458E+031.499E+031.709E+031.230E+031.437E+03F24Best2.986E+032.898E+032.906E+032.898E+032.898E+03
Mean3.058E+032.068E+032.049E+031.742E+031.882E+03Mean3.810E+032.924E+032.923E+032.926E+032.927E+03
Std3.212E+021.870E+021.626E+022.008E+021.643E+02Std4.016E+022.295E+011.407E+012.328E+012.232E+01
F10Best1.465E+031.104E+031.137E+031.102E+031.103E+03F25Best3.845E+032.900E+032.783E+032.900E+032.900E+03
Mean7.862E+031.106E+031.164E+031.105E+031.104E+03Mean4.601E+032.900E+032.931E+032.902E+032.900E+03
Std5.270E+031.243E+001.740E+011.684E+008.064E-01Std3.360E+024.062E-043.732E+018.608E+002.980E-07
F11Best1.464E+081.230E+033.190E+052.978E+031.200E+03F26Best3.168E+033.090E+033.093E+033.089E+033.090E+03
Mean1.071E+091.386E+033.553E+061.137E+041.395E+03Mean3.319E+033.093E+033.098E+033.092E+033.094E+03
Std6.320E+081.089E+022.030E+069.209E+031.311E+02Std7.996E+011.946E+002.439E+002.490E+001.543E+00
F12Best2.253E+051.303E+031.973E+031.303E+031.301E+03F27Best3.464E+033.100E+033.090E+032.800E+033.100E+03
Mean8.389E+071.310E+039.609E+031.317E+031.309E+03Mean3.851E+033.197E+033.209E+033.159E+033.168E+03
Std8.428E+073.546E+006.426E+037.651E+004.157E+00Std1.342E+021.403E+028.947E+011.437E+021.257E+02
F13Best1.654E+031.409E+031.441E+031.402E+031.401E+03F28Best3.419E+033.163E+033.188E+033.166E+033.153E+03
Mean2.840E+051.416E+031.596E+031.416E+031.410E+03Mean3.744E+033.191E+033.227E+033.186E+033.180E+03
Std6.030E+054.346E+002.724E+029.981E+006.457E+00Std1.483E+021.607E+012.012E+011.631E+011.488E+01
F14Best1.531E+041.501E+031.565E+031.501E+031.501E+03F29Best3.125E+063.411E+033.646E+043.586E+033.415E+03
Mean2.000E+061.503E+032.013E+031.504E+031.502E+03Mean7.109E+074.526E+044.062E+051.322E+051.140E+05
Std4.195E+068.736E-014.724E+021.351E+007.093E-01Std4.385E+072.286E+054.074E+053.358E+053.433E+05
F15Best1.926E+031.604E+031.621E+031.602E+031.602E+03
Mean2.485E+031.618E+031.657E+031.617E+031.609E+03
Std2.084E+021.396E+013.639E+013.157E+011.120E+01
Table A2. The statistical results of MSDCS with different strategies for solving CEC2017 (D = 30).
Table A2. The statistical results of MSDCS with different strategies for solving CEC2017 (D = 30).
FunctionIndexDCSDCS-PESDCS-LPSRDCS-CDMMSDCSFunctionIndexDCSDCS-PESDCS-LPSRDCS-CDMMSDCS
F1Best6.968E+102.270E+024.068E+073.478E+021.279E+02F16Best3.739E+031.923E+031.984E+031.815E+031.847E+03
Mean8.010E+102.605E+038.142E+073.932E+032.443E+03Mean5.844E+032.098E+032.273E+032.006E+032.055E+03
Std2.634E+092.095E+032.582E+073.772E+032.807E+03Std2.641E+031.038E+021.194E+021.402E+021.213E+02
F2Best9.466E+043.021E+028.756E+047.698E+023.008E+02F17Best9.494E+061.830E+031.766E+052.951E+031.843E+03
Mean3.768E+054.010E+021.139E+051.498E+033.422E+02Mean1.955E+081.887E+031.480E+061.669E+041.888E+03
Std5.610E+059.564E+011.740E+046.535E+026.647E+01Std1.562E+084.374E+016.999E+051.161E+043.026E+01
F3Best9.913E+034.186E+025.456E+024.061E+024.064E+02F18Best9.253E+081.923E+032.996E+051.951E+031.913E+03
Mean2.296E+044.904E+025.803E+024.899E+024.879E+02Mean3.318E+091.942E+031.311E+062.170E+031.932E+03
Std2.739E+032.344E+011.761E+012.310E+012.174E+01Std6.716E+081.103E+019.060E+054.597E+029.265E+00
F4Best1.007E+036.126E+026.440E+025.967E+026.084E+02F19Best3.027E+032.257E+032.481E+032.128E+032.132E+03
Mean1.017E+036.452E+026.690E+026.300E+026.266E+02Mean3.451E+032.511E+032.615E+032.376E+032.375E+03
Std1.419E+011.360E+011.091E+011.403E+011.037E+01Std1.604E+021.353E+027.827E+011.403E+021.089E+02
F5Best6.882E+026.000E+026.023E+026.000E+026.000E+02F20Best2.705E+032.437E+032.441E+032.400E+032.402E+03
Mean7.103E+026.001E+026.036E+026.001E+026.000E+02Mean2.849E+032.450E+032.468E+032.428E+032.426E+03
Std1.028E+011.318E-027.271E-018.160E-022.205E-03Std5.269E+018.612E+001.269E+011.389E+011.119E+01
F6Best1.587E+038.623E+029.010E+028.406E+028.468E+02F21Best9.019E+032.300E+032.322E+032.300E+032.300E+03
Mean1.620E+038.816E+029.275E+028.689E+028.623E+02Mean1.072E+042.300E+032.328E+032.301E+032.300E+03
Std3.374E+011.017E+011.375E+011.263E+019.628E+00Std7.906E+022.376E-023.647E+001.280E+004.113E-04
F7Best1.237E+039.322E+029.394E+028.595E+029.080E+02F22Best3.493E+032.771E+032.778E+032.717E+032.742E+03
Mean1.260E+039.491E+029.684E+029.306E+029.286E+02Mean3.664E+032.796E+032.817E+032.767E+032.770E+03
Std1.959E+017.717E+001.223E+011.780E+011.019E+01Std1.150E+021.161E+011.327E+011.953E+011.210E+01
F8Best1.574E+049.000E+029.963E+029.001E+029.000E+02F23Best3.609E+032.928E+032.970E+032.850E+032.852E+03
Mean2.080E+049.000E+021.171E+039.070E+029.001E+02Mean3.962E+032.959E+032.992E+032.917E+032.920E+03
Std1.933E+034.982E-021.166E+026.199E+001.970E-01Std1.995E+021.334E+011.053E+013.683E+012.926E+01
F9Best7.817E+036.502E+036.390E+035.360E+035.699E+03F24Best7.213E+032.887E+032.913E+032.887E+032.887E+03
Mean9.176E+037.156E+036.929E+036.289E+036.607E+03Mean7.285E+032.887E+032.942E+032.888E+032.887E+03
Std7.033E+023.388E+022.581E+023.419E+022.801E+02Std1.365E+023.421E-012.009E+013.119E+002.911E-01
F10Best8.764E+031.112E+031.425E+031.144E+031.109E+03F25Best1.058E+044.315E+032.936E+032.900E+032.900E+03
Mean2.074E+041.160E+031.637E+031.205E+031.142E+03Mean1.338E+044.918E+034.634E+034.642E+034.440E+03
Std6.427E+033.859E+011.602E+024.007E+012.644E+01Std1.373E+031.929E+028.457E+024.237E+024.810E+02
F11Best1.101E+104.512E+036.760E+064.065E+044.828E+03F26Best3.893E+033.186E+033.234E+033.199E+033.175E+03
Mean1.799E+101.914E+042.851E+072.323E+051.535E+04Mean4.811E+033.211E+033.263E+033.212E+033.203E+03
Std3.544E+091.150E+041.051E+072.533E+057.828E+03Std3.550E+021.067E+011.419E+017.533E+009.145E+00
F12Best6.002E+091.455E+031.352E+062.600E+031.387E+03F27Best8.047E+033.173E+033.263E+033.206E+033.108E+03
Mean1.465E+101.676E+035.353E+061.121E+041.625E+03Mean9.416E+033.205E+033.309E+033.222E+033.200E+03
Std4.760E+091.372E+022.878E+067.866E+031.628E+02Std4.558E+021.300E+012.360E+011.533E+012.518E+01
F13Best3.317E+061.444E+038.872E+031.452E+031.439E+03F28Best6.165E+033.642E+033.955E+033.411E+033.488E+03
Mean1.707E+071.473E+035.651E+041.557E+031.461E+03Mean1.026E+043.825E+034.226E+033.640E+033.657E+03
Std1.309E+071.117E+013.254E+045.019E+011.223E+01Std3.517E+031.139E+021.255E+021.301E+029.849E+01
F14Best5.795E+081.527E+031.077E+051.654E+031.524E+03F29Best3.403E+085.623E+034.805E+058.071E+035.380E+03
Mean3.195E+091.584E+037.857E+052.042E+031.566E+03Mean2.340E+096.232E+031.897E+061.351E+045.957E+03
Std1.372E+093.916E+014.762E+052.299E+023.286E+01Std9.410E+084.660E+021.062E+064.943E+034.161E+02
F15Best4.748E+032.665E+032.722E+032.149E+032.286E+03
Mean7.231E+032.949E+033.085E+032.759E+032.810E+03
Std1.036E+031.552E+021.883E+022.743E+021.825E+02
Table A3. The statistical results of MSDCS with different strategies for solving CEC2017 (D = 50).
Table A3. The statistical results of MSDCS with different strategies for solving CEC2017 (D = 50).
FunctionIndexDCSDCS-PESDCS-LPSRDCS-CDMMSDCSFunctionIndexDCSDCS-PESDCS-LPSRDCS-CDMMSDCS
F1Best1.349E+113.291E+038.262E+072.836E+031.306E+02F16Best1.118E+043.134E+033.315E+032.852E+033.068E+03
Mean1.351E+111.005E+042.203E+081.344E+042.852E+03Mean1.183E+053.554E+033.797E+033.274E+033.424E+03
Std7.063E+083.780E+039.252E+077.381E+032.927E+03Std6.094E+041.978E+022.333E+022.427E+021.657E+02
F2Best2.546E+052.017E+031.664E+055.762E+032.573E+03F17Best5.761E+071.972E+031.613E+061.219E+041.998E+03
Mean1.568E+065.768E+032.370E+051.399E+045.523E+03Mean3.693E+082.176E+034.114E+067.666E+042.186E+03
Std4.582E+062.229E+032.333E+045.243E+031.718E+03Std2.065E+081.284E+021.920E+064.934E+041.588E+02
F3Best4.151E+044.319E+026.888E+025.004E+024.764E+02F18Best3.452E+091.959E+032.781E+052.072E+031.959E+03
Mean5.570E+045.518E+027.457E+025.742E+025.478E+02Mean7.670E+092.031E+031.758E+061.040E+042.014E+03
Std3.776E+034.499E+013.272E+013.330E+014.058E+01Std1.877E+093.598E+011.054E+068.717E+034.176E+01
F4Best1.316E+037.856E+028.011E+027.367E+027.476E+02F19Best4.041E+033.156E+033.355E+032.874E+032.920E+03
Mean1.353E+038.109E+028.497E+027.831E+027.791E+02Mean4.711E+033.642E+033.681E+033.488E+033.493E+03
Std2.671E+011.295E+011.791E+011.618E+011.467E+01Std3.096E+021.690E+021.253E+022.524E+021.750E+02
F5Best7.080E+026.001E+026.040E+026.004E+026.000E+02F20Best3.140E+032.582E+032.611E+032.542E+032.532E+03
Mean7.171E+026.001E+026.054E+026.008E+026.000E+02Mean3.369E+032.608E+032.644E+032.577E+032.580E+03
Std9.009E+002.446E-028.224E-013.109E-017.718E-03Std8.072E+011.476E+011.725E+011.814E+011.517E+01
F6Best2.199E+039.939E+021.099E+031.011E+039.816E+02F21Best1.484E+042.347E+032.409E+032.323E+032.300E+03
Mean2.234E+031.057E+031.145E+031.051E+031.032E+03Mean1.734E+041.312E+041.128E+041.134E+041.215E+04
Std4.704E+012.125E+012.040E+011.982E+011.580E+01Std9.203E+022.928E+034.429E+033.467E+033.232E+03
F7Best1.592E+031.065E+031.125E+031.019E+031.024E+03F22Best4.223E+033.001E+033.043E+032.811E+032.938E+03
Mean1.623E+031.113E+031.155E+031.078E+031.077E+03Mean4.719E+033.040E+033.084E+032.989E+033.002E+03
Std3.300E+011.720E+011.440E+012.050E+011.857E+01Std2.341E+021.833E+011.868E+014.720E+012.159E+01
F8Best3.676E+049.003E+021.378E+039.314E+029.002E+02F23Best4.523E+033.065E+033.192E+032.974E+032.942E+03
Mean5.901E+049.026E+021.857E+031.123E+039.016E+02Mean5.194E+033.183E+033.248E+033.091E+033.114E+03
Std6.442E+032.056E+003.592E+022.043E+021.426E+00Std2.586E+023.290E+011.910E+016.805E+016.448E+01
F9Best1.277E+041.139E+041.118E+041.037E+041.021E+04F24Best1.944E+042.966E+033.137E+033.004E+032.974E+03
Mean1.489E+041.234E+041.197E+041.106E+041.145E+04Mean1.950E+043.033E+033.188E+033.044E+033.030E+03
Std9.045E+024.225E+023.517E+022.756E+024.800E+02Std9.155E+012.468E+012.386E+012.139E+012.165E+01
F10Best3.620E+041.160E+032.226E+031.187E+031.158E+03F25Best1.885E+046.070E+036.910E+034.770E+034.542E+03
Mean5.580E+041.231E+032.888E+031.285E+031.200E+03Mean1.966E+046.522E+037.244E+035.917E+036.085E+03
Std6.723E+032.826E+015.693E+026.231E+012.490E+01Std2.737E+022.185E+022.009E+025.997E+024.009E+02
F11Best7.626E+101.095E+055.381E+075.385E+051.719E+05F26Best5.741E+033.257E+033.484E+033.254E+033.245E+03
Mean1.050E+118.012E+051.260E+082.076E+065.518E+05Mean7.454E+033.317E+033.575E+033.328E+033.306E+03
Std1.598E+106.737E+053.494E+071.073E+063.401E+05Std5.898E+024.513E+016.028E+014.486E+014.209E+01
F12Best3.184E+102.633E+031.141E+062.423E+032.439E+03F27Best1.673E+043.265E+033.356E+033.264E+033.259E+03
Mean4.982E+103.406E+031.555E+078.393E+033.547E+03Mean1.933E+043.312E+033.452E+033.310E+033.287E+03
Std1.244E+103.761E+021.092E+074.976E+037.059E+02Std1.170E+033.636E+014.421E+012.224E+012.390E+01
F13Best1.749E+071.507E+031.055E+051.668E+031.475E+03F28Best1.833E+043.796E+034.982E+033.536E+033.756E+03
Mean1.336E+081.558E+034.806E+052.987E+031.543E+03Mean2.987E+054.439E+035.501E+033.931E+034.140E+03
Std7.684E+073.471E+011.953E+055.288E+033.608E+01Std2.602E+052.629E+022.648E+022.697E+022.266E+02
F14Best6.771E+091.773E+031.001E+062.235E+031.700E+03F29Best2.875E+091.060E+062.571E+071.187E+067.826E+05
Mean1.803E+101.919E+033.428E+065.940E+031.893E+03Mean1.138E+101.309E+064.482E+072.114E+069.898E+05
Std5.359E+098.884E+011.365E+063.808E+031.197E+02Std3.338E+091.607E+051.382E+075.076E+051.325E+05
F15Best9.193E+033.854E+033.794E+032.307E+033.413E+03
Mean1.132E+044.271E+034.607E+033.663E+034.111E+03
Std1.237E+031.898E+022.783E+026.137E+022.339E+02
Table A4. The statistical results of MSDCS with different strategies for solving CEC2017 (D = 100).
Table A4. The statistical results of MSDCS with different strategies for solving CEC2017 (D = 100).
FunctionIndexDCSDCS-PESDCS-LPSRDCS-CDMMSDCSFunctionIndexDCSDCS-PESDCS-LPSRDCS-CDMMSDCS
F1Best2.968E+119.542E+063.979E+084.840E+051.335E+04F16Best3.008E+065.759E+036.720E+034.274E+035.731E+03
Mean2.976E+111.798E+076.953E+081.804E+062.925E+04Mean1.646E+076.506E+037.237E+035.896E+036.310E+03
Std1.629E+094.566E+061.846E+088.645E+051.153E+04Std1.285E+072.665E+022.802E+026.713E+022.801E+02
F2Best3.666E+056.134E+043.648E+055.341E+044.792E+04F17Best2.436E+083.317E+031.675E+065.722E+045.582E+03
Mean1.617E+068.012E+045.342E+058.050E+046.645E+04Mean6.265E+087.778E+036.339E+062.210E+051.579E+04
Std3.570E+061.422E+044.272E+041.553E+041.140E+04Std2.073E+082.958E+032.686E+061.084E+056.740E+03
F3Best1.291E+056.824E+029.632E+026.468E+026.286E+02F18Best2.198E+102.474E+031.220E+062.148E+032.162E+03
Mean1.596E+057.768E+021.112E+037.252E+027.044E+02Mean3.444E+103.264E+037.509E+063.828E+032.574E+03
Std5.875E+034.167E+016.502E+013.641E+014.391E+01Std5.384E+091.399E+034.581E+062.882E+035.819E+02
F4Best2.308E+031.254E+031.291E+037.973E+021.159E+03F19Best7.480E+036.232E+036.622E+035.851E+035.462E+03
Mean2.328E+031.312E+031.353E+031.190E+031.208E+03Mean8.474E+036.895E+036.998E+036.560E+036.638E+03
Std1.875E+012.442E+013.130E+018.764E+012.901E+01Std4.279E+022.568E+022.419E+023.087E+023.319E+02
F5Best7.201E+026.016E+026.076E+026.018E+026.001E+02F20Best4.686E+033.053E+033.105E+032.908E+032.973E+03
Mean7.246E+026.021E+026.094E+026.041E+026.002E+02Mean5.081E+033.138E+033.186E+033.039E+033.037E+03
Std3.781E+003.045E-011.042E+001.112E+004.938E-02Std1.613E+023.050E+013.650E+016.145E+012.720E+01
F6Best4.234E+031.502E+031.685E+031.542E+031.409E+03F21Best3.118E+042.328E+032.786E+042.492E+042.661E+04
Mean4.315E+031.593E+031.742E+031.640E+031.493E+03Mean3.396E+042.871E+042.902E+042.695E+042.807E+04
Std4.467E+012.853E+012.881E+015.471E+012.649E+01Std1.690E+035.012E+035.333E+026.678E+026.535E+02
F7Best2.736E+031.562E+031.579E+031.416E+031.462E+03F22Best6.374E+033.566E+033.619E+033.080E+033.292E+03
Mean2.778E+031.604E+031.643E+031.503E+031.505E+03Mean7.204E+033.648E+033.674E+033.385E+033.477E+03
Std4.203E+012.193E+012.974E+015.272E+012.349E+01Std3.676E+023.876E+012.758E+011.402E+026.365E+01
F8Best1.040E+051.061E+033.208E+033.277E+039.376E+02F23Best1.026E+043.950E+034.031E+033.526E+033.426E+03
Mean1.125E+051.220E+035.809E+037.504E+039.904E+02Mean1.216E+044.058E+034.132E+033.783E+033.840E+03
Std6.007E+039.719E+011.528E+033.006E+033.938E+01Std7.577E+024.434E+013.839E+011.658E+021.794E+02
F9Best2.928E+042.553E+042.470E+042.310E+042.478E+04F24Best3.507E+043.364E+033.697E+033.292E+033.211E+03
Mean3.147E+042.731E+042.663E+042.450E+042.568E+04Mean3.519E+043.438E+033.815E+033.395E+033.336E+03
Std1.261E+036.364E+025.795E+026.272E+024.586E+02Std2.839E+025.333E+018.936E+015.718E+014.470E+01
F10Best2.401E+052.267E+037.506E+042.223E+031.959E+03F25Best5.893E+041.152E+041.354E+048.153E+037.509E+03
Mean5.004E+052.675E+031.291E+052.570E+032.233E+03Mean5.913E+041.313E+041.434E+041.066E+041.047E+04
Std1.467E+052.351E+022.627E+041.612E+021.883E+02Std2.846E+026.244E+024.503E+021.577E+031.593E+03
F11Best2.078E+116.007E+062.132E+083.330E+061.267E+06F26Best1.104E+043.615E+033.695E+033.384E+033.415E+03
Mean2.545E+111.898E+074.277E+081.683E+074.716E+06Mean1.408E+043.730E+033.923E+033.501E+033.510E+03
Std1.434E+107.757E+061.267E+088.325E+062.522E+06Std1.057E+037.567E+011.151E+026.911E+014.556E+01
F12Best3.576E+101.180E+047.198E+054.303E+033.513E+03F27Best3.356E+043.494E+033.740E+033.435E+033.402E+03
Mean6.282E+101.801E+047.267E+069.456E+037.528E+03Mean3.368E+043.566E+033.967E+033.507E+033.474E+03
Std5.774E+094.541E+038.204E+062.986E+032.996E+03Std1.731E+024.227E+011.244E+023.515E+013.775E+01
F13Best1.677E+081.700E+031.414E+062.356E+041.673E+03F28Best5.127E+057.521E+038.665E+035.003E+036.440E+03
Mean3.045E+081.865E+034.117E+066.806E+041.819E+03Mean2.590E+068.550E+039.721E+036.398E+037.677E+03
Std3.415E+079.469E+011.494E+063.545E+049.232E+01Std1.542E+063.465E+024.065E+027.818E+025.654E+02
F14Best2.349E+103.190E+035.256E+052.142E+032.098E+03F29Best3.111E+105.288E+043.136E+061.522E+041.641E+04
Mean3.401E+104.217E+036.952E+063.820E+032.574E+03Mean5.396E+101.101E+057.832E+065.073E+042.463E+04
Std4.789E+098.085E+025.328E+062.477E+034.791E+02Std7.581E+094.233E+043.430E+063.139E+045.749E+03
F15Best2.123E+048.177E+038.499E+033.794E+037.114E+03
Mean3.031E+049.068E+039.399E+036.858E+038.320E+03
Std3.732E+033.464E+023.613E+021.515E+035.072E+02
Table A5. The statistical results of MSDCS and competition algorithms for solving CEC2017 (D = 10).
Table A5. The statistical results of MSDCS and competition algorithms for solving CEC2017 (D = 10).
FunctionIndexMSDCSDCSAELSHADEAPSM-jSORIMERDGMVOQIOMTVSCAMRFOEOSMA
F1Best1.0000E+025.7493E+092.0254E+063.7831E+051.4755E+045.3260E+042.5642E+023.8778E+044.7698E+079.5523E+046.2711E+05
Mean1.0000E+021.4158E+105.9158E+063.4316E+064.1725E+045.5621E+051.4843E+043.1529E+051.6500E+083.1513E+055.0134E+06
Std1.7861E-044.4550E+092.6245E+063.5433E+062.2437E+044.9964E+052.7503E+042.2557E+057.7902E+072.2294E+053.3463E+06
Rank1119736251048
F2Best3.0000E+022.1823E+042.4369E+033.1469E+023.0055E+023.1591E+023.0000E+025.7698E+022.7174E+033.1261E+028.2288E+02
Mean3.0000E+024.7063E+044.9389E+037.2511E+023.0334E+023.7082E+023.0012E+021.2623E+035.1493E+034.6712E+022.3948E+03
Std2.7352E-091.7395E+041.4506E+033.3588E+021.9975E+005.4313E+012.4183E-014.6842E+021.7953E+031.4327E+021.3961E+03
Rank1119634271058
F3Best4.0007E+027.7740E+024.0624E+024.0446E+024.0387E+024.0008E+024.0037E+024.0187E+024.1309E+024.0200E+024.0502E+02
Mean4.0066E+021.7742E+034.0747E+024.0708E+024.0488E+024.1039E+024.0814E+024.0840E+024.2536E+024.0801E+024.0732E+02
Std4.8019E-016.8948E+024.0923E-019.2466E-015.4504E-011.6528E+011.5208E+011.1560E+018.0864E+008.7552E+001.4958E+00
Rank1115329781064
F4Best5.1030E+025.8986E+025.2550E+025.1768E+025.1731E+025.0721E+025.0500E+025.0950E+025.3387E+025.0804E+025.1252E+02
Mean5.1618E+026.3658E+025.3732E+025.3883E+025.3377E+025.1900E+025.1911E+025.2794E+025.4482E+025.2538E+025.2730E+02
Std3.8614E+002.2926E+016.4713E+008.3857E+005.8940E+006.5260E+008.6678E+009.2346E+004.6029E+001.0508E+015.7513E+00
Rank1118972361045
F5Best6.0000E+026.4647E+026.0093E+026.0161E+026.0029E+026.0032E+026.0007E+026.0054E+026.0959E+026.0037E+026.0116E+02
Mean6.0000E+026.7863E+026.0224E+026.0380E+026.0069E+026.0109E+026.0025E+026.0144E+026.1377E+026.0158E+026.0252E+02
Std3.2986E-051.3695E+016.1605E-011.3746E+002.2380E-016.3389E-011.7612E-011.0036E+002.3962E+001.3607E+009.9250E-01
Rank1117934251068
F6Best7.2033E+028.8796E+027.3389E+027.4647E+027.3663E+027.1892E+027.1378E+027.3599E+027.4378E+027.2989E+027.2387E+02
Mean7.2806E+029.0928E+027.4693E+027.6061E+027.4891E+027.3470E+027.2823E+027.4763E+027.7472E+027.4960E+027.4026E+02
Std4.2884E+001.5234E+015.6237E+008.5151E+006.0122E+009.2727E+001.0144E+016.1932E+009.0861E+009.2899E+006.1761E+00
Rank1115973261084
F7Best8.0794E+028.5697E+028.1856E+028.2438E+028.1873E+028.0533E+028.0697E+028.0680E+028.2689E+028.0618E+028.1396E+02
Mean8.1653E+029.0329E+028.3373E+028.4130E+028.3609E+028.1770E+028.1901E+028.2211E+028.4754E+028.2092E+028.2624E+02
Std4.0259E+001.3581E+017.1353E+009.6248E+007.1735E+006.5434E+007.4739E+001.0125E+017.1703E+009.3344E+006.3941E+00
Rank1117982351046
F8Best9.0000E+022.5909E+039.0119E+029.0247E+029.0018E+029.0020E+029.0000E+029.0021E+029.4019E+029.0039E+029.0079E+02
Mean9.0000E+023.4254E+039.0269E+029.1259E+029.0038E+029.0230E+029.0515E+029.0093E+021.0251E+039.0545E+029.0689E+02
Std2.9783E-124.5037E+021.1132E+007.4943E+001.3740E-013.4621E+002.0279E+017.3702E-015.3334E+011.1258E+016.6783E+00
Rank1115924631078
F9Best1.4374E+032.4583E+032.1938E+032.0536E+031.9719E+031.0226E+031.1260E+031.9908E+032.1855E+031.5052E+031.5181E+03
Mean1.8821E+033.0583E+032.6710E+032.5458E+032.6108E+031.5588E+031.7127E+032.4507E+032.5581E+032.0555E+032.3069E+03
Std1.6429E+023.2115E+022.2077E+022.2489E+022.2867E+022.6641E+023.2696E+022.2287E+022.0811E+023.0414E+022.6950E+02
Rank3111079126845
F10Best1.1029E+031.4647E+031.1307E+031.1090E+031.1067E+031.1031E+031.1021E+031.1070E+031.1411E+031.1105E+031.1127E+03
Mean1.1044E+037.8617E+031.1461E+031.1204E+031.1118E+031.1347E+031.1140E+031.1151E+031.1756E+031.1200E+031.1337E+03
Std8.0644E-015.2704E+031.0143E+017.7311E+002.4660E+006.0100E+011.7949E+016.2181E+001.8774E+017.8392E+001.5966E+01
Rank1119628341057
F11Best1.2005E+031.4638E+082.1922E+058.2101E+032.8664E+031.2048E+041.2600E+042.5023E+048.1639E+051.8912E+042.9941E+04
Mean1.3946E+031.0711E+099.8144E+051.2265E+055.9365E+031.2769E+066.0515E+052.7579E+056.7415E+061.8522E+056.5871E+05
Std1.3112E+026.3202E+085.7889E+051.7321E+052.7993E+031.6782E+066.6829E+054.7869E+054.2237E+062.1173E+056.0399E+05
Rank1118329651047
F12Best1.3008E+032.2525E+052.9846E+031.4033E+031.3258E+031.8184E+031.3242E+031.3831E+032.9281E+031.5709E+031.9207E+03
Mean1.3089E+038.3893E+078.5516E+031.6971E+031.3524E+031.0766E+049.4812E+031.5773E+038.6622E+038.3282E+036.1903E+03
Std4.1569E+008.4280E+072.6780E+031.8807E+022.3846E+018.1255E+038.1323E+033.4744E+025.7888E+036.7004E+033.2397E+03
Rank1117421093865
F13Best1.4010E+031.6535E+031.4993E+031.4220E+031.4235E+031.4349E+031.4091E+031.4182E+031.4608E+031.4530E+031.4728E+03
Mean1.4095E+032.8400E+051.6264E+031.4410E+031.4308E+034.3511E+036.3744E+031.4298E+031.5042E+031.6244E+031.5355E+03
Std6.4567E+006.0296E+051.3233E+027.6765E+003.1971E+003.9295E+035.9838E+033.5210E+003.0758E+011.5524E+023.4230E+01
Rank1118439102576
F14Best1.5005E+031.5311E+041.7312E+031.5124E+031.5049E+031.5683E+031.5030E+031.5052E+031.6319E+031.6031E+031.6936E+03
Mean1.5016E+032.0001E+063.2182E+031.5439E+031.5113E+034.2349E+036.5258E+031.5161E+031.9293E+032.5458E+032.2961E+03
Std7.0929E-014.1953E+061.0759E+032.5733E+013.4618E+004.4649E+036.4658E+036.1365E+002.3096E+021.2108E+034.4323E+02
Rank1118429103576
F15Best1.6020E+031.9256E+031.6849E+031.6245E+031.6309E+031.6034E+031.6007E+031.6135E+031.6472E+031.6027E+031.6182E+03
Mean1.6089E+032.4853E+031.7909E+031.7087E+031.6767E+031.7111E+031.7449E+031.6813E+031.8157E+031.7629E+031.6698E+03
Std1.1199E+012.0842E+027.2196E+018.3029E+013.9587E+011.0266E+021.2965E+026.2715E+017.3752E+011.2025E+025.9635E+01
Rank1119536741082
F16Best1.7079E+031.8120E+031.7697E+031.7433E+031.7474E+031.7120E+031.7009E+031.7288E+031.7649E+031.7301E+031.7438E+03
Mean1.7274E+032.1391E+031.8066E+031.7763E+031.7771E+031.7497E+031.7353E+031.7574E+031.8041E+031.7539E+031.7667E+03
Std8.1552E+001.5983E+022.0363E+012.4908E+011.3420E+013.1434E+013.3402E+011.8249E+012.1915E+011.7887E+011.2338E+01
Rank1111078325946
F17Best1.8005E+032.4488E+064.6853E+031.8901E+031.8355E+033.0733E+036.0183E+031.8557E+035.0878E+033.2995E+035.5077E+03
Mean1.8051E+032.5489E+081.4566E+042.3704E+031.8504E+031.9717E+042.1238E+042.0548E+031.8979E+041.0591E+042.1178E+04
Std7.1105E+002.2608E+087.8372E+038.8279E+021.1899E+011.1309E+041.1936E+042.4754E+021.2195E+047.3165E+031.6613E+04
Rank1116428103759
F18Best1.9004E+032.7827E+032.0219E+031.9071E+031.9049E+031.9206E+031.9066E+031.9050E+031.9353E+031.9761E+031.9493E+03
Mean1.9013E+038.3093E+063.5861E+031.9167E+031.9078E+035.9047E+036.5940E+031.9084E+032.2900E+033.2191E+032.5978E+03
Std5.8166E-018.1776E+061.3430E+036.7484E+001.4101E+004.6855E+035.6768E+031.7432E+004.6198E+021.3231E+037.1579E+02
Rank1118429103576
F19Best2.0075E+032.2627E+032.0627E+032.0329E+032.0491E+032.0065E+032.0005E+032.0248E+032.0498E+032.0131E+032.0350E+03
Mean2.0205E+032.3748E+032.1120E+032.0604E+032.0792E+032.0299E+032.0215E+032.0565E+032.1006E+032.0597E+032.0614E+03
Std6.7204E+005.9615E+012.5586E+011.8227E+011.3504E+011.2538E+012.3301E+011.6347E+012.4887E+012.8835E+011.4982E+01
Rank1111068324957
F20Best2.2000E+032.2778E+032.2181E+032.2048E+032.2018E+032.2016E+032.2000E+032.1934E+032.2100E+032.2006E+032.2035E+03
Mean2.2637E+032.4061E+032.3097E+032.2778E+032.3010E+032.2667E+032.2822E+032.2124E+032.2988E+032.2480E+032.2402E+03
Std6.0644E+014.7107E+014.0100E+016.4494E+015.8076E+016.0394E+016.2719E+013.2171E+015.4048E+015.5353E+015.1257E+01
Rank4111069571832
F21Best2.3000E+032.5573E+032.3077E+032.2605E+032.3038E+032.2018E+032.2226E+032.2125E+032.2783E+032.2232E+032.2167E+03
Mean2.3004E+033.5541E+032.3104E+032.3090E+032.3068E+032.2942E+032.2988E+032.3020E+032.3290E+032.3027E+032.3048E+03
Std5.3239E-013.9223E+021.1781E+009.2783E+001.3535E+003.1612E+011.8224E+012.2208E+011.5785E+012.0421E+012.1761E+01
Rank3119871241056
F22Best2.6044E+032.7360E+032.6270E+032.6147E+032.6268E+032.6081E+032.6090E+032.6100E+032.6289E+032.6136E+032.6129E+03
Mean2.6135E+032.7955E+032.6380E+032.6317E+032.6347E+032.6215E+032.6235E+032.6205E+032.6446E+032.6288E+032.6260E+03
Std4.4362E+002.4902E+015.7527E+008.5999E+004.6485E+006.8253E+009.1208E+006.1075E+007.6926E+008.5818E+006.7002E+00
Rank1119783421065
F23Best2.5000E+032.8460E+032.7351E+032.5157E+032.6295E+032.5019E+032.5001E+032.5015E+032.5824E+032.5015E+032.5299E+03
Mean2.7215E+032.9318E+032.7622E+032.7487E+032.7579E+032.6863E+032.7069E+032.6696E+032.7414E+032.7379E+032.6937E+03
Std6.0473E+014.9897E+017.6980E+006.2816E+012.8267E+011.0637E+029.8395E+011.1556E+026.2861E+016.4861E+018.7729E+01
Rank5111089241763
F24Best2.8977E+032.9859E+032.9187E+032.9011E+032.8979E+032.8982E+032.8978E+032.8987E+032.9394E+032.8980E+032.9064E+03
Mean2.9270E+033.8100E+032.9447E+032.9345E+032.9202E+032.9292E+032.9307E+032.9300E+032.9593E+032.9216E+032.9386E+03
Std2.2318E+014.0162E+029.4120E+002.0131E+012.3150E+012.4955E+012.3248E+012.1948E+016.7199E+002.3375E+011.6443E+01
Rank3119714651028
F25Best2.9000E+033.8446E+032.9162E+032.9035E+032.9004E+032.6150E+032.8006E+032.9017E+032.9509E+032.8182E+032.7594E+03
Mean2.9000E+034.6015E+032.9356E+032.9222E+032.9009E+032.9151E+032.9616E+032.9163E+033.0281E+032.9189E+032.9265E+03
Std2.9802E-073.3601E+021.1421E+011.7723E+013.3107E-017.4756E+011.5665E+021.6192E+014.0095E+015.5160E+013.7675E+01
Rank1118623941057
F26Best3.0900E+033.1681E+033.0934E+033.0900E+033.0891E+033.0897E+033.0737E+033.0934E+033.1041E+033.0935E+033.0930E+03
Mean3.0941E+033.3186E+033.0983E+033.0934E+033.0910E+033.0958E+033.0924E+033.0999E+033.1093E+033.1041E+033.0971E+03
Std1.5433E+007.9957E+011.5598E+002.1453E+001.5088E+003.5479E+002.8838E+013.3901E+002.9186E+001.1693E+011.6954E+00
Rank4117315281096
F27Best3.1000E+033.4636E+033.1689E+033.1197E+033.1019E+033.1037E+033.1001E+033.1027E+033.2034E+033.1043E+033.1352E+03
Mean3.1681E+033.8514E+033.2676E+033.2111E+033.2324E+033.2773E+033.2312E+033.2159E+033.2533E+033.2690E+033.1973E+03
Std1.2567E+021.3415E+027.7804E+019.0134E+011.3345E+021.1233E+026.1484E+011.0604E+023.2703E+011.3869E+025.8523E+01
Rank1118361054792
F28Best3.1525E+033.4186E+033.2074E+033.1814E+033.1815E+033.1505E+033.1366E+033.1721E+033.1872E+033.1644E+033.1693E+03
Mean3.1802E+033.7442E+033.2549E+033.2263E+033.2126E+033.1984E+033.2084E+033.2209E+033.2644E+033.2193E+033.2161E+03
Std1.4881E+011.4833E+022.7033E+013.1315E+011.9708E+014.4018E+014.9649E+013.0714E+013.6303E+013.8406E+012.6174E+01
Rank1119842371065
F29Best3.4150E+033.1248E+064.0335E+055.3272E+033.6342E+034.4292E+033.8858E+032.2907E+043.9652E+047.2975E+036.1996E+03
Mean1.1400E+057.1092E+071.3283E+062.3745E+051.0364E+053.9717E+052.5083E+044.9143E+051.2247E+067.1444E+052.8318E+05
Std3.4330E+054.3848E+078.4507E+054.8294E+053.0635E+055.7051E+053.1032E+048.8873E+051.1072E+069.9113E+055.7114E+05
Rank3111042617985
Table A6. The statistical results of MSDCS and competition algorithms for solving CEC2017 (D = 30).
Table A6. The statistical results of MSDCS and competition algorithms for solving CEC2017 (D = 30).
FunctionIndexMSDCSDCSAELSHADEAPSM-jSORIMERDGMVOQIOMTVSCAMRFOEOSMA
F1Best1.2789E+026.9678E+106.4842E+079.6229E+067.0730E+041.0115E+072.2982E+032.5572E+071.7446E+092.7199E+079.1788E+07
Mean2.4428E+038.0101E+101.2490E+082.9292E+071.2570E+052.5748E+071.0190E+055.6322E+073.4245E+095.6907E+074.0150E+08
Std2.8072E+032.6339E+093.9593E+071.3945E+074.6680E+041.1722E+071.5103E+051.7546E+079.0780E+081.9774E+071.2956E+08
Rank1118534261079
F2Best3.0078E+029.4664E+045.2191E+048.0755E+036.3748E+021.4127E+043.2131E+034.5889E+044.7636E+042.0795E+043.6754E+04
Mean3.4215E+023.7681E+057.2093E+041.7769E+041.6346E+032.9966E+047.9464E+036.0370E+046.5992E+043.1407E+045.7956E+04
Std6.6465E+015.6101E+058.9338E+035.1024E+038.4654E+021.0495E+042.6125E+031.1281E+049.5735E+035.2953E+031.3805E+04
Rank1111042538967
F3Best4.0645E+029.9125E+035.4047E+024.9758E+024.8674E+024.9797E+024.1996E+024.9081E+027.9115E+024.8470E+025.4189E+02
Mean4.8789E+022.2956E+045.6575E+025.2247E+024.9631E+025.3192E+024.6135E+025.5831E+029.9079E+025.5406E+025.8642E+02
Std2.1736E+012.7394E+031.8881E+011.2807E+011.1765E+012.7109E+013.3667E+013.5079E+011.4430E+023.4094E+012.8049E+01
Rank2118435171069
F4Best6.0835E+021.0066E+036.5531E+026.4337E+026.6181E+025.5826E+025.6377E+026.1066E+027.0609E+025.8767E+026.2099E+02
Mean6.2659E+021.0167E+037.0006E+026.7944E+026.9274E+025.8825E+026.1293E+026.6718E+027.4485E+026.5762E+026.5512E+02
Std1.0369E+011.4189E+011.5449E+011.6828E+011.2268E+011.5402E+012.7901E+013.2730E+011.5249E+013.8743E+011.7986E+01
Rank3119781261054
F5Best6.0000E+026.8815E+026.0517E+026.0371E+026.0054E+026.0299E+026.0058E+026.0529E+026.2645E+026.0634E+026.0579E+02
Mean6.0000E+027.1028E+026.0717E+026.0736E+026.0084E+026.0855E+026.0351E+026.1190E+026.3074E+026.2410E+026.1024E+02
Std2.2047E-031.0282E+011.3808E+002.3914E+001.8008E-013.1862E+002.6960E+003.2483E+003.2977E+001.4465E+012.6056E+00
Rank1114526381097
F6Best8.4684E+021.5872E+038.9452E+028.8854E+028.9741E+028.0976E+027.8756E+028.9706E+021.0035E+038.6640E+028.7118E+02
Mean8.6226E+021.6200E+039.4096E+029.2144E+029.2160E+028.7769E+028.5849E+029.4967E+021.0557E+039.9026E+029.1035E+02
Std9.6278E+003.3744E+011.7434E+011.7586E+018.6095E+002.9992E+013.8109E+012.0903E+012.9602E+015.5529E+012.1628E+01
Rank2117563181094
F7Best9.0802E+021.2371E+039.5693E+029.2519E+029.5760E+028.5711E+028.6071E+028.7822E+029.9985E+028.8133E+029.0705E+02
Mean9.2857E+021.2602E+039.9478E+029.7446E+029.8561E+028.8969E+028.9980E+029.3115E+021.0358E+039.3048E+029.4591E+02
Std1.0187E+011.9590E+011.5720E+012.2990E+011.1417E+012.3824E+012.8064E+013.2196E+011.6353E+012.5559E+011.8321E+01
Rank3119781251046
F8Best9.0000E+021.5743E+049.5161E+029.5029E+029.0077E+021.0303E+031.3332E+031.0111E+032.0751E+031.7020E+031.0216E+03
Mean9.0006E+022.0803E+041.0526E+031.0566E+039.0186E+021.7186E+033.3263E+031.2360E+033.1588E+033.8599E+031.3133E+03
Std1.9701E-011.9327E+036.2455E+017.2868E+011.3727E+005.2236E+021.3637E+032.1169E+025.9128E+021.3182E+032.1910E+02
Rank1113427958106
F9Best5.6989E+037.8165E+038.0205E+035.9157E+037.9234E+033.1085E+033.1814E+037.5132E+037.8360E+034.2946E+037.0040E+03
Mean6.6065E+039.1763E+038.7444E+038.0210E+038.6795E+034.5889E+034.0954E+038.5351E+038.6381E+036.3286E+037.8182E+03
Std2.8013E+027.0332E+023.1874E+026.6958E+022.7523E+027.0624E+026.3033E+023.3318E+022.7112E+029.6997E+023.8077E+02
Rank4111069217835
F10Best1.1094E+038.7639E+031.6348E+031.2109E+031.1784E+031.2140E+031.1416E+031.2816E+031.6305E+031.3427E+031.4262E+03
Mean1.1424E+032.0738E+041.8026E+031.3096E+031.2175E+031.3523E+031.1845E+031.3396E+031.9944E+031.4310E+031.6081E+03
Std2.6436E+016.4274E+031.1884E+024.6648E+013.0352E+019.1755E+013.2090E+013.2309E+012.3648E+026.7219E+011.0736E+02
Rank1119436251078
F11Best4.8283E+031.1012E+104.7083E+063.6529E+053.2532E+042.6023E+065.3799E+051.1219E+061.0275E+083.3893E+053.1825E+06
Mean1.5346E+041.7992E+108.6813E+062.9070E+061.8758E+051.9415E+074.5416E+065.1306E+062.2206E+084.9188E+061.4806E+07
Std7.8276E+033.5436E+092.6514E+063.6250E+061.5335E+051.5158E+073.9333E+063.0300E+067.5342E+074.1107E+061.1167E+07
Rank1117329461058
F12Best1.3874E+036.0015E+091.1837E+053.4413E+047.8270E+037.3724E+042.6081E+031.4751E+041.2668E+071.1394E+046.6095E+04
Mean1.6245E+031.4654E+102.9136E+059.5555E+041.5153E+042.4881E+052.1622E+043.3656E+043.2745E+073.6475E+042.6494E+05
Std1.6281E+024.7599E+099.7410E+045.1504E+046.9316E+032.4078E+052.5195E+041.8523E+041.2221E+074.3226E+042.0220E+05
Rank1119627341058
F13Best1.4389E+033.3165E+061.3025E+041.5570E+031.4851E+035.5984E+032.5114E+035.3237E+031.9818E+043.3197E+034.7445E+03
Mean1.4605E+031.7072E+074.6612E+041.6790E+031.5228E+035.9309E+044.4655E+042.3843E+044.8016E+043.8729E+042.4547E+04
Std1.2228E+011.3086E+072.1699E+049.5858E+011.3373E+014.8589E+043.4230E+041.9080E+042.3984E+043.2537E+041.8724E+04
Rank1118321074965
F14Best1.5245E+035.7946E+082.4078E+046.5196E+031.9318E+031.6141E+041.6334E+034.2687E+034.9801E+052.2119E+031.3672E+04
Mean1.5660E+033.1947E+094.3102E+042.0277E+042.2963E+036.9537E+048.6588E+039.7852E+032.5862E+061.0344E+045.2308E+04
Std3.2864E+011.3721E+091.1856E+041.3156E+042.1917E+024.1652E+048.9135E+034.9710E+031.5826E+061.1114E+043.0419E+04
Rank1117629341058
F15Best2.2858E+034.7477E+032.7115E+032.6878E+032.8858E+031.8709E+032.1759E+032.1550E+033.3343E+032.4338E+032.2428E+03
Mean2.8099E+037.2309E+033.4056E+033.2775E+033.2492E+032.5671E+032.5603E+032.9042E+033.6385E+032.8167E+032.7722E+03
Std1.8253E+021.0356E+031.9267E+022.3919E+021.7570E+022.8530E+022.3818E+024.2004E+021.6902E+022.8056E+023.1813E+02
Rank4119872161053
F16Best1.8474E+033.7393E+032.1346E+031.9849E+031.9885E+031.7723E+031.7682E+031.8012E+032.0818E+031.8130E+031.8357E+03
Mean2.0549E+035.8444E+032.4139E+032.2427E+032.2746E+032.1119E+032.0794E+031.9991E+032.4667E+032.0926E+032.0163E+03
Std1.2127E+022.6407E+031.1498E+021.3594E+021.1767E+021.7694E+021.7424E+021.7936E+021.5564E+021.7923E+021.4197E+02
Rank3119786411052
F17Best1.8427E+039.4938E+061.6473E+055.9353E+032.1495E+031.5659E+058.7134E+041.1633E+053.6184E+056.6498E+041.4903E+05
Mean1.8879E+031.9552E+086.9501E+053.6252E+042.7279E+031.5461E+061.0152E+065.6277E+051.2128E+065.9050E+056.8045E+05
Std3.0259E+011.5622E+083.5416E+051.7018E+046.4050E+021.4528E+061.0071E+063.8426E+056.9813E+057.6539E+055.3510E+05
Rank1117321084956
F18Best1.9129E+039.2534E+085.0720E+042.7846E+032.0634E+032.6605E+041.9848E+032.7186E+035.9694E+052.1459E+039.8101E+03
Mean1.9319E+033.3185E+091.3818E+051.1072E+042.1566E+032.5734E+051.2363E+049.9789E+033.6871E+061.1886E+041.3711E+05
Std9.2647E+006.7163E+086.0497E+046.5001E+036.1788E+012.3388E+051.6566E+047.2472E+032.3170E+061.3210E+041.4307E+05
Rank1118429631057
F19Best2.1320E+033.0274E+032.6063E+032.3259E+032.5950E+032.0985E+032.0560E+032.1806E+032.6763E+032.2454E+032.1971E+03
Mean2.3746E+033.4508E+032.7865E+032.6830E+032.7747E+032.4425E+032.4687E+032.4758E+032.8590E+032.4728E+032.4505E+03
Std1.0893E+021.6038E+021.0155E+022.0074E+029.9529E+011.6048E+021.7922E+021.5605E+021.1333E+021.6826E+021.1333E+02
Rank1119782461053
F20Best2.4020E+032.7045E+032.4590E+032.4144E+032.4569E+032.3642E+032.3531E+032.3782E+032.4897E+032.2241E+032.4093E+03
Mean2.4256E+032.8492E+032.4924E+032.4719E+032.4818E+032.4016E+032.4075E+032.4333E+032.5342E+032.4277E+032.4434E+03
Std1.1193E+015.2695E+011.1772E+012.2443E+011.2215E+012.6143E+013.2462E+013.4799E+011.4527E+014.2532E+011.8105E+01
Rank3119781251046
F21Best2.3000E+039.0188E+032.3432E+032.3302E+032.3042E+032.3219E+032.3006E+032.3318E+032.6608E+032.3345E+032.3801E+03
Mean2.3000E+031.0720E+042.3679E+032.3549E+032.3095E+033.7835E+033.0755E+032.3452E+033.6784E+032.3792E+032.4453E+03
Std4.1125E-047.9063E+021.5171E+011.7305E+012.2206E+001.9636E+031.3395E+036.6221E+001.4148E+031.8731E+029.0232E+01
Rank1115421083967
F22Best2.7417E+033.4926E+032.8187E+032.8029E+032.8119E+032.7142E+032.7118E+032.7653E+032.8498E+032.7530E+032.7389E+03
Mean2.7700E+033.6640E+032.8438E+032.8318E+032.8399E+032.7485E+032.7688E+032.8409E+032.9068E+032.8231E+032.7939E+03
Std1.2097E+011.1501E+021.5672E+011.4353E+011.1327E+012.6539E+013.0882E+013.3583E+012.0937E+013.6225E+012.2704E+01
Rank3119671281054
F23Best2.8517E+033.6088E+032.9730E+032.9124E+032.9774E+032.8758E+032.8870E+032.9166E+033.0240E+032.9340E+032.9259E+03
Mean2.9201E+033.9615E+033.0106E+032.9942E+033.0040E+032.9097E+032.9446E+032.9854E+033.0689E+033.0063E+032.9601E+03
Std2.9263E+011.9954E+021.9380E+012.4202E+011.1858E+012.1289E+013.2188E+013.5366E+011.7459E+015.3729E+011.8173E+01
Rank2119671351084
F24Best2.8868E+037.2135E+032.9294E+032.8927E+032.8872E+032.8973E+032.8775E+032.9045E+033.0675E+032.9079E+032.9302E+03
Mean2.8871E+037.2849E+032.9639E+032.9089E+032.8878E+032.9313E+032.8907E+032.9475E+033.1837E+032.9483E+032.9806E+03
Std2.9114E-011.3651E+021.5995E+011.1790E+017.4233E-012.5773E+011.4471E+012.8692E+016.2297E+011.9487E+012.1447E+01
Rank1118425361079
F25Best2.9000E+031.0578E+045.3542E+034.9122E+035.0895E+034.1261E+032.8030E+032.9820E+034.5671E+033.0838E+033.5112E+03
Mean4.4405E+031.3379E+045.6667E+035.3164E+035.3737E+034.7998E+034.5571E+034.8837E+036.2411E+035.0061E+034.9088E+03
Std4.8095E+021.3730E+031.3579E+021.9655E+021.1541E+023.0929E+029.4378E+029.2771E+024.4505E+021.0979E+034.9019E+02
Rank1119783241065
F26Best3.1752E+033.8929E+033.2496E+033.2142E+033.2043E+033.2099E+033.1655E+033.2622E+033.3259E+033.2599E+033.2441E+03
Mean3.2030E+034.8110E+033.2713E+033.2376E+033.2220E+033.2314E+033.1877E+033.3004E+033.3761E+033.3063E+033.2659E+03
Std9.1451E+003.5498E+021.2823E+011.2713E+017.8312E+001.2674E+011.1917E+012.4611E+012.4826E+012.7096E+011.3713E+01
Rank2117534181096
F27Best3.1082E+038.0469E+033.3076E+033.2420E+033.2099E+033.2431E+033.2010E+033.2654E+033.4919E+033.2393E+033.2801E+03
Mean3.1997E+039.4157E+033.3401E+033.2702E+033.2339E+033.3164E+033.2433E+033.3171E+033.6307E+033.3236E+033.3585E+03
Std2.5184E+014.5578E+021.5935E+011.7252E+011.4000E+014.6283E+013.1649E+012.2777E+018.2890E+012.9490E+013.0828E+01
Rank1118425361079
F28Best3.4879E+036.1648E+033.9332E+033.7051E+033.8226E+033.5757E+033.5029E+033.6068E+034.1640E+033.5471E+033.6585E+03
Mean3.6567E+031.0257E+044.2599E+034.0688E+034.0290E+033.8564E+033.7994E+033.8383E+034.5583E+033.9188E+033.8653E+03
Std9.8493E+013.5170E+031.3816E+021.9884E+021.2625E+022.2218E+021.3203E+021.6027E+021.7583E+022.0898E+021.3594E+02
Rank1119874231065
F29Best5.3796E+033.4033E+083.6473E+053.7088E+048.7309E+032.2549E+059.3382E+035.5908E+042.2886E+062.9447E+042.5746E+05
Mean5.9567E+032.3402E+091.0855E+061.7177E+051.5522E+041.9855E+069.5918E+042.5124E+059.6583E+061.6342E+051.4191E+06
Std4.1611E+029.4098E+084.6725E+051.2804E+055.6107E+031.6168E+061.4589E+051.4015E+053.7327E+061.1588E+059.9749E+05
Rank1117529361048
Table A7. The statistical results of MSDCS and competition algorithms for solving CEC2017 (D = 50).
Table A7. The statistical results of MSDCS and competition algorithms for solving CEC2017 (D = 50).
FunctionIndexMSDCSDCSAELSHADEAPSM-jSORIMERDGMVOQIOMTVSCAMRFOEOSMA
F1Best1.3060E+021.3487E+114.2215E+082.8919E+073.7483E+057.6035E+073.8773E+042.0545E+087.5938E+094.3024E+081.1567E+09
Mean2.8517E+031.3512E+116.8873E+088.6544E+077.8669E+051.6704E+083.4845E+054.0192E+081.2956E+109.4278E+082.7588E+09
Std2.9271E+037.0630E+081.6210E+084.1883E+072.6999E+056.9993E+074.4701E+051.0596E+082.9357E+094.4807E+089.3678E+08
Rank1117435261089
F2Best2.5734E+032.5461E+051.2998E+053.6202E+046.9610E+035.7080E+042.8103E+041.0508E+051.2495E+058.5142E+048.8133E+04
Mean5.5231E+031.5675E+061.6013E+055.4716E+041.2646E+041.0325E+054.8394E+041.4005E+051.5326E+051.3356E+051.3827E+05
Std1.7185E+034.5821E+061.3530E+041.2483E+043.5464E+031.8245E+048.3873E+031.8679E+042.0486E+042.2917E+041.9125E+04
Rank1111042538967
F3Best4.7642E+024.1506E+047.1041E+025.8647E+024.9276E+025.9302E+024.2954E+026.7027E+021.5596E+036.5812E+027.6102E+02
Mean5.4778E+025.5700E+047.8001E+026.5073E+025.7022E+026.8437E+025.1726E+027.7413E+022.2954E+038.7480E+029.0700E+02
Std4.0575E+013.7760E+033.5786E+012.2762E+014.4658E+015.5145E+015.3526E+015.2179E+014.8432E+021.2401E+021.0004E+02
Rank2117435161089
F4Best7.4758E+021.3156E+038.4938E+027.4976E+028.3081E+026.3793E+026.4486E+027.3284E+028.9207E+027.4469E+027.4524E+02
Mean7.7911E+021.3527E+038.9848E+028.1565E+028.5801E+027.1134E+027.2982E+028.0836E+029.5744E+028.2743E+028.0193E+02
Std1.4673E+012.6714E+012.0168E+012.8152E+011.2455E+014.4418E+014.2303E+015.7194E+012.3723E+014.2789E+012.8019E+01
Rank3119681251074
F5Best6.0001E+027.0803E+026.0733E+026.0560E+026.0072E+026.0849E+026.0301E+026.1272E+026.2690E+026.2569E+026.0992E+02
Mean6.0002E+027.1706E+026.1037E+026.0871E+026.0109E+026.1760E+026.1188E+026.2015E+026.4226E+026.4499E+026.1747E+02
Std7.7178E-039.0086E+001.6222E+001.8354E+002.6473E-014.7498E+006.5775E+004.8722E+004.9215E+001.1735E+014.0195E+00
Rank1114327589106
F6Best9.8160E+022.1987E+031.1327E+031.0598E+031.0743E+031.0257E+038.9539E+021.1033E+031.2955E+031.0907E+031.0715E+03
Mean1.0323E+032.2338E+031.1818E+031.0908E+031.1087E+031.0981E+031.0003E+031.1924E+031.3870E+031.3078E+031.1408E+03
Std1.5797E+014.7037E+011.9328E+011.8159E+011.3347E+014.1775E+016.0251E+014.2940E+014.7642E+011.0490E+024.0208E+01
Rank2117354181096
F7Best1.0240E+031.5916E+031.1554E+031.0335E+031.1062E+039.3894E+029.5628E+029.6794E+021.1992E+031.0283E+031.0427E+03
Mean1.0772E+031.6229E+031.1960E+031.1138E+031.1584E+031.0202E+031.0290E+031.0930E+031.2641E+031.1307E+031.1166E+03
Std1.8567E+013.3004E+011.6907E+013.1735E+011.7242E+013.6137E+014.6512E+015.3815E+012.6081E+014.6686E+012.8551E+01
Rank3119581241076
F8Best9.0018E+023.6764E+041.1867E+031.1759E+039.0285E+021.7813E+034.3217E+031.6739E+036.7774E+039.0592E+032.0770E+03
Mean9.0164E+025.9013E+041.7824E+031.3990E+039.0771E+025.7289E+038.8040E+034.1463E+031.0221E+041.9846E+044.0539E+03
Std1.4258E+006.4422E+032.8044E+021.4490E+024.1750E+002.6091E+033.2487E+031.2682E+031.9007E+035.7257E+031.1967E+03
Rank1114327869105
F9Best1.0209E+041.2768E+041.4040E+041.2129E+041.3794E+046.9993E+035.3035E+031.3329E+041.3850E+047.6160E+031.1690E+04
Mean1.1449E+041.4889E+041.4973E+041.3932E+041.4845E+048.4465E+036.9517E+031.4617E+041.4924E+041.0380E+041.3147E+04
Std4.8002E+029.0451E+023.7070E+028.1625E+024.8090E+029.1692E+028.7379E+026.1705E+023.7685E+021.5513E+036.2884E+02
Rank4911682171035
F10Best1.1579E+033.6201E+043.3295E+031.3852E+031.2554E+031.4220E+031.1898E+031.5687E+033.5517E+031.6061E+032.2059E+03
Mean1.2003E+035.5800E+044.1013E+031.5000E+031.3286E+031.7367E+031.2744E+031.7567E+035.0610E+031.8973E+032.9282E+03
Std2.4902E+016.7233E+036.8966E+027.0642E+013.1763E+011.2695E+024.1114E+011.3102E+029.2993E+022.5197E+024.8175E+02
Rank1119435261078
F11Best1.7189E+057.6264E+104.3218E+076.1703E+069.2833E+056.1401E+076.5903E+062.0549E+077.2555E+081.3711E+076.8476E+07
Mean5.5177E+051.0496E+116.7145E+071.6412E+072.5667E+061.9110E+082.7374E+075.0589E+071.4658E+094.7893E+071.6570E+08
Std3.4008E+051.5978E+101.3997E+079.6656E+061.0227E+061.1738E+082.0812E+072.3085E+074.6421E+082.8927E+076.1621E+07
Rank1117329461058
F12Best2.4391E+033.1843E+109.7256E+053.6086E+042.1042E+042.8426E+059.7950E+037.8852E+047.9005E+073.0591E+045.3090E+05
Mean3.5475E+034.9819E+101.6292E+061.0609E+053.6306E+049.6855E+054.5318E+043.4467E+051.9378E+089.4563E+041.8643E+06
Std7.0586E+021.2436E+104.0098E+055.0874E+048.3680E+035.2810E+053.2309E+042.3570E+056.5900E+074.0260E+041.1958E+06
Rank1118527361049
F13Best1.4751E+031.7495E+077.5992E+041.8250E+031.6287E+035.2149E+042.3804E+046.8934E+048.0445E+041.4352E+045.1818E+04
Mean1.5427E+031.3358E+082.6436E+053.4418E+031.6983E+033.4092E+052.5753E+052.5393E+053.6473E+051.9972E+052.0847E+05
Std3.6079E+017.6838E+079.4448E+042.5264E+033.3378E+012.2575E+051.7116E+052.0534E+051.6057E+052.0699E+051.3496E+05
Rank1118329761045
F14Best1.7004E+036.7712E+096.1112E+041.0822E+043.1595E+033.2584E+042.8235E+035.9753E+037.6169E+063.5969E+032.9355E+04
Mean1.8928E+031.8031E+101.5195E+053.2309E+044.9339E+032.4974E+051.8707E+041.3111E+042.7783E+071.2980E+047.3525E+04
Std1.1971E+025.3589E+096.0069E+041.2740E+041.0462E+035.0344E+051.9226E+044.9386E+031.5484E+079.1785E+033.9862E+04
Rank1118629541037
F15Best3.4129E+039.1935E+034.0010E+033.8105E+033.8013E+032.7224E+032.3367E+032.2976E+034.8427E+032.7697E+033.0889E+03
Mean4.1109E+031.1324E+044.4745E+034.4596E+034.5948E+033.6035E+033.3240E+033.1241E+035.2910E+033.5904E+033.5538E+03
Std2.3387E+021.2373E+032.5125E+023.0966E+022.8464E+024.1564E+024.2303E+024.7547E+022.2717E+024.8634E+023.3505E+02
Rank6118795211043
F16Best3.0677E+031.1176E+043.6479E+033.1624E+033.1645E+032.4416E+032.1071E+032.4097E+033.7035E+032.3757E+032.4259E+03
Mean3.4240E+031.1826E+053.8554E+033.5836E+033.7371E+033.1298E+032.9425E+032.9753E+034.1454E+033.0585E+033.1463E+03
Std1.6574E+026.0937E+041.1687E+022.3375E+022.0361E+023.3966E+023.0160E+023.6048E+021.6166E+023.2802E+022.7815E+02
Rank6119784121035
F17Best1.9983E+035.7610E+071.5850E+062.0840E+043.1707E+033.0820E+052.6616E+054.2225E+051.9810E+064.2380E+052.1801E+05
Mean2.1863E+033.6930E+082.6875E+065.7383E+045.8459E+034.1709E+063.1496E+062.1394E+065.7047E+062.0063E+062.1710E+06
Std1.5880E+022.0653E+088.1533E+052.2422E+041.8646E+033.0919E+062.0306E+062.0346E+062.7423E+061.5498E+061.1872E+06
Rank1117329851046
F18Best1.9594E+033.4516E+098.0256E+044.9139E+032.2565E+035.4001E+042.1806E+034.0608E+035.2122E+063.3964E+034.2786E+04
Mean2.0143E+037.6699E+091.8257E+052.5242E+042.9372E+031.5267E+061.4591E+041.6749E+041.2584E+071.4580E+043.6463E+05
Std4.1762E+011.8775E+095.3654E+041.4147E+048.3088E+021.6546E+061.2773E+048.4849E+036.2772E+061.0566E+043.6527E+05
Rank1117629451038
F19Best2.9200E+034.0413E+033.2258E+033.1455E+033.2645E+032.5615E+032.3627E+032.8742E+033.6984E+032.5155E+032.5675E+03
Mean3.4931E+034.7111E+033.9305E+033.6829E+033.9101E+033.1080E+032.9374E+033.6604E+034.0840E+033.1305E+033.2411E+03
Std1.7500E+023.0960E+022.2372E+022.9979E+021.9964E+022.5026E+023.3466E+023.3226E+021.8454E+023.2618E+023.0061E+02
Rank5119782161034
F20Best2.5322E+033.1403E+032.6315E+032.5413E+032.6125E+032.4545E+032.4365E+032.4674E+032.7067E+032.5095E+032.5361E+03
Mean2.5803E+033.3690E+032.6789E+032.6179E+032.6562E+032.5070E+032.4988E+032.5799E+032.7535E+032.5987E+032.5875E+03
Std1.5172E+018.0721E+011.5664E+013.3937E+011.7707E+013.8421E+013.7862E+015.0364E+012.1107E+014.0482E+012.6456E+01
Rank4119782131065
F21Best2.3001E+031.4843E+045.0061E+033.2616E+032.4737E+038.0262E+037.1865E+032.4908E+031.4945E+042.6251E+032.9254E+03
Mean1.2149E+041.7341E+041.5681E+041.5098E+041.5455E+041.0117E+048.8049E+037.5520E+031.6192E+041.1522E+041.3706E+04
Std3.2318E+039.2034E+022.5391E+032.3974E+033.5481E+039.4581E+027.9747E+025.7162E+034.7156E+023.2781E+033.0753E+03
Rank5119783211046
F22Best2.9380E+034.2234E+033.0593E+033.0025E+033.0430E+032.8524E+032.8584E+033.0462E+033.1503E+033.0080E+032.9719E+03
Mean3.0021E+034.7191E+033.1198E+033.0573E+033.0812E+032.9663E+032.9712E+033.1409E+033.2587E+033.1895E+033.0337E+03
Std2.1591E+012.3406E+022.6752E+012.7820E+012.0977E+014.8006E+015.3163E+015.7024E+013.6419E+017.5567E+013.8387E+01
Rank3117561281094
F23Best2.9416E+034.5226E+033.2146E+033.1332E+033.1888E+033.0049E+033.0283E+033.1904E+033.3291E+033.2322E+033.1274E+03
Mean3.1141E+035.1940E+033.2762E+033.2236E+033.2491E+033.1009E+033.1278E+033.3236E+033.4165E+033.3482E+033.1931E+03
Std6.4476E+012.5858E+022.3540E+013.7138E+011.7997E+014.4582E+015.5563E+016.6596E+013.5291E+018.7159E+013.0711E+01
Rank2117561381094
F24Best2.9736E+031.9442E+043.1934E+033.0671E+032.9916E+033.0419E+032.9379E+033.1365E+033.9980E+033.2247E+033.2646E+03
Mean3.0296E+031.9504E+043.2745E+033.0996E+033.0467E+033.1417E+033.0028E+033.2592E+034.6014E+033.3114E+033.4615E+03
Std2.1650E+019.1548E+013.7974E+011.6360E+012.1419E+015.4620E+014.6577E+015.3801E+013.6621E+025.9852E+019.7124E+01
Rank2117435161089
F25Best4.5423E+031.8852E+047.4764E+036.2607E+036.6373E+033.4882E+032.9006E+033.9090E+038.3870E+033.6995E+036.1016E+03
Mean6.0845E+031.9663E+047.8236E+036.7253E+037.0617E+036.0559E+034.1325E+037.1583E+039.1684E+037.5521E+036.8685E+03
Std4.0086E+022.7371E+021.9561E+022.7576E+021.8993E+026.0319E+021.8467E+031.5724E+033.4099E+022.4724E+034.3141E+02
Rank3119462171085
F26Best3.2448E+035.7410E+033.4828E+033.3078E+033.2444E+033.3422E+033.2000E+033.5779E+033.8527E+033.6345E+033.5373E+03
Mean3.3064E+037.4537E+033.6409E+033.4005E+033.2748E+033.4817E+033.2596E+033.7935E+034.0863E+033.8922E+033.6165E+03
Std4.2092E+015.8978E+028.2932E+014.9043E+012.5987E+018.0812E+015.6865E+011.0545E+021.2702E+021.6709E+025.8717E+01
Rank3117425181096
F27Best3.2593E+031.6734E+043.5239E+033.3414E+033.2650E+033.3573E+033.2563E+033.4409E+034.5866E+033.5337E+033.7823E+03
Mean3.2867E+031.9329E+043.6940E+033.3884E+033.3116E+033.4933E+033.2994E+033.6144E+035.3313E+033.7592E+034.0716E+03
Std2.3897E+011.1703E+031.0486E+022.3380E+012.1806E+018.1097E+013.0522E+011.1884E+024.0442E+021.4047E+021.8541E+02
Rank1117435261089
F28Best3.7557E+031.8325E+044.9786E+034.2669E+034.3046E+034.1416E+033.8382E+033.8890E+035.5302E+034.0426E+034.0729E+03
Mean4.1403E+032.9872E+055.4517E+034.8537E+034.8356E+034.7579E+034.3055E+034.5815E+036.2126E+034.8858E+034.5321E+03
Std2.2657E+022.6022E+052.3005E+022.5976E+022.1025E+023.9890E+023.3234E+023.6302E+023.1859E+024.8997E+023.2028E+02
Rank1119765241083
F29Best7.8257E+052.8747E+091.7100E+076.2304E+061.2985E+062.0167E+072.3065E+057.7012E+061.0520E+086.7975E+062.6337E+07
Mean9.8976E+051.1380E+102.5235E+079.5422E+061.9701E+065.3858E+073.1582E+061.6510E+071.7985E+081.7509E+075.0427E+07
Std1.3245E+053.3383E+094.4256E+062.5653E+063.3702E+052.3456E+071.9481E+064.2169E+064.5413E+077.6094E+061.7943E+07
Rank1117429351068
Table A8. The statistical results of MSDCS and competition algorithms for solving CEC2017 (D = 100).
Table A8. The statistical results of MSDCS and competition algorithms for solving CEC2017 (D = 100).
FunctionIndexMSDCSDCSAELSHADEAPSM-JsoRIMERDGMVOQIOMTVSCAMRFOEOSMA
F1Best1.3350E+042.9684E+112.6090E+092.9174E+088.0595E+068.5841E+083.0785E+052.2240E+093.8284E+107.6353E+091.5183E+10
Mean2.9247E+042.9764E+113.6879E+094.9785E+081.5859E+071.4656E+093.3567E+063.3316E+095.5903E+101.2933E+102.1570E+10
Std1.1532E+041.6287E+095.5874E+081.2670E+085.9913E+064.6316E+085.0088E+065.2953E+087.3869E+093.1514E+094.5282E+09
Rank1117435261089
F2Best4.7915E+043.6664E+052.9412E+051.4678E+054.6562E+042.5071E+051.4082E+052.8031E+052.7783E+052.5892E+052.9198E+05
Mean6.6450E+041.6169E+063.3820E+051.7255E+056.7962E+043.7506E+051.7517E+053.5681E+053.5498E+052.8973E+053.6448E+05
Std1.1398E+043.5697E+061.4640E+042.0569E+041.0281E+045.1070E+041.8732E+043.2608E+043.4888E+041.9080E+044.3300E+04
Rank1116321048759
F3Best6.2864E+021.2914E+051.1603E+037.8044E+026.9022E+029.2486E+025.5629E+021.1546E+034.8246E+031.9266E+032.0024E+03
Mean7.0445E+021.5964E+051.3172E+038.8262E+027.5663E+021.1549E+037.0548E+021.4575E+037.5043E+032.3761E+032.6752E+03
Std4.3913E+015.8754E+038.0855E+014.8852E+013.3427E+011.6176E+027.2881E+011.7453E+021.3289E+033.0475E+024.6118E+02
Rank1116435271089
F4Best1.1591E+032.3076E+031.3471E+031.1186E+031.2460E+039.3697E+029.3687E+021.1064E+031.5342E+031.2689E+031.1842E+03
Mean1.2082E+032.3276E+031.4489E+031.2015E+031.3060E+031.1018E+031.0623E+031.2590E+031.6018E+031.3688E+031.2910E+03
Std2.9011E+011.8753E+015.0899E+014.5381E+012.2262E+018.3525E+018.0549E+016.4184E+013.4505E+015.4262E+014.9968E+01
Rank4119372151086
F5Best6.0009E+027.2008E+026.1287E+026.0862E+026.0166E+026.2507E+026.1001E+026.3322E+026.4475E+026.5439E+026.2587E+02
Mean6.0019E+027.2459E+026.1626E+026.1154E+026.0259E+026.3379E+026.2418E+026.4223E+026.5645E+026.6531E+026.3553E+02
Std4.9376E-023.7810E+001.5777E+001.5940E+005.3474E-014.0863E+006.1948E+005.9726E+004.5676E+006.9985E+004.5964E+00
Rank1114326589107
F6Best1.4090E+034.2344E+031.6990E+031.4690E+031.5474E+031.6492E+031.2379E+031.7421E+032.2776E+032.1412E+031.7926E+03
Mean1.4928E+034.3151E+031.7786E+031.5668E+031.6237E+031.8791E+031.4988E+031.9292E+032.4752E+032.6372E+031.9948E+03
Std2.6487E+014.4668E+012.9735E+014.7091E+012.8969E+011.1242E+021.5958E+027.2153E+011.2859E+022.5664E+029.0620E+01
Rank1115346279108
F7Best1.4618E+032.7360E+031.6554E+031.4301E+031.5353E+031.2154E+031.1941E+031.4953E+031.8261E+031.5400E+031.4679E+03
Mean1.5050E+032.7783E+031.7483E+031.5189E+031.6056E+031.3972E+031.3404E+031.6019E+031.9144E+031.7316E+031.5797E+03
Std2.3491E+014.2030E+013.7612E+015.1068E+012.8396E+018.8138E+018.2532E+016.0702E+014.0603E+011.0080E+025.6604E+01
Rank3119472161085
F8Best9.3759E+021.0399E+055.4226E+031.9435E+039.4932E+021.3390E+041.2086E+041.2195E+042.8904E+043.1287E+041.2322E+04
Mean9.9044E+021.1248E+056.8974E+033.0474E+031.0389E+032.6553E+042.4118E+042.8892E+043.4249E+044.9525E+042.3193E+04
Std3.9379E+016.0070E+031.2710E+036.5567E+026.1779E+019.2911E+035.1026E+037.6037E+033.0445E+039.7716E+035.3367E+03
Rank1114327689105
F9Best2.4778E+042.9275E+042.9969E+042.5728E+043.0376E+041.6730E+041.1350E+042.9385E+043.0253E+041.6105E+042.5259E+04
Mean2.5680E+043.1473E+043.1819E+042.9168E+043.1842E+041.9530E+041.4314E+043.1258E+043.1654E+042.1769E+042.8185E+04
Std4.5864E+021.2612E+037.5126E+021.3505E+035.5021E+021.6465E+031.3525E+037.5523E+026.1466E+023.5483E+031.4281E+03
Rank4810611217935
F10Best1.9592E+032.4012E+054.9933E+044.0350E+032.1346E+037.1013E+032.2200E+033.7837E+044.0356E+045.2662E+043.8626E+04
Mean2.2330E+035.0035E+056.7846E+046.2837E+032.5840E+031.1354E+042.7605E+036.1852E+047.3882E+046.5593E+045.9875E+04
Std1.8827E+021.4673E+051.2338E+041.4875E+032.0304E+022.9310E+032.8835E+021.4458E+041.1044E+048.1461E+031.1507E+04
Rank1119425371086
F11Best1.2667E+062.0781E+114.8488E+083.9720E+078.8760E+063.6094E+082.8820E+073.0530E+086.5630E+093.9521E+088.9452E+08
Mean4.7159E+062.5449E+116.1856E+081.1104E+082.3810E+079.0860E+081.8844E+085.8245E+088.8107E+097.2175E+081.3499E+09
Std2.5222E+061.4336E+108.7346E+074.2713E+071.0507E+073.3934E+088.4431E+071.8915E+081.7059E+092.0701E+082.9808E+08
Rank1116328451079
F12Best3.5128E+033.5757E+101.4217E+063.2577E+042.3581E+048.5149E+052.0374E+045.9674E+052.0921E+081.9798E+052.5229E+06
Mean7.5280E+036.2823E+102.6871E+064.7951E+043.1703E+043.1786E+065.2340E+041.1260E+065.8124E+085.8425E+057.9870E+06
Std2.9964E+035.7740E+096.1405E+059.9427E+035.8564E+031.8120E+062.5284E+042.9597E+052.2985E+082.4476E+053.8984E+06
Rank1117328461059
F13Best1.6734E+031.6766E+081.6814E+068.9207E+032.0717E+031.1704E+063.3716E+059.0726E+053.0731E+067.3809E+051.4504E+06
Mean1.8192E+033.0448E+082.8006E+064.0016E+042.2824E+034.6634E+061.6296E+061.6692E+064.8133E+062.0851E+063.6329E+06
Std9.2321E+013.4149E+076.3487E+052.3752E+041.5681E+022.1901E+069.0448E+055.8006E+051.1471E+061.0199E+061.3470E+06
Rank1117329451068
F14Best2.0984E+032.3488E+101.7170E+051.8415E+049.8597E+031.3014E+051.3160E+042.3144E+042.8296E+071.8102E+041.2471E+05
Mean2.5738E+033.4015E+102.3135E+052.8697E+041.7787E+045.8427E+053.3717E+045.4552E+041.0111E+083.1364E+042.7507E+05
Std4.7907E+024.7886E+093.5246E+047.9118E+033.7618E+034.0695E+051.4200E+041.5301E+045.2012E+071.0669E+041.2804E+05
Rank1117329561048
F15Best7.1139E+032.1235E+048.7712E+036.4232E+038.3254E+034.6307E+033.8843E+034.6268E+039.1373E+034.5869E+035.2187E+03
Mean8.3202E+033.0307E+049.5862E+038.3067E+039.1585E+036.5446E+035.4145E+035.9189E+031.0795E+046.4693E+037.0781E+03
Std5.0722E+023.7320E+033.4883E+026.7186E+023.8193E+028.9291E+027.7728E+027.4864E+025.1507E+029.0729E+026.8898E+02
Rank7119684121035
F16Best5.7313E+033.0078E+065.9553E+035.4573E+036.1223E+034.2969E+033.8511E+034.0112E+037.2091E+033.7855E+033.5796E+03
Mean6.3100E+031.6464E+076.8110E+036.3693E+036.7019E+035.3021E+034.8435E+034.9971E+037.6751E+035.0748E+035.0650E+03
Std2.8006E+021.2849E+072.8416E+022.9334E+022.6908E+024.3439E+026.1655E+027.3385E+022.7347E+026.2899E+025.4916E+02
Rank6119785121043
F17Best5.5823E+032.4359E+081.4635E+068.1939E+041.7603E+042.4134E+061.0154E+061.7058E+063.8746E+061.0686E+062.0002E+06
Mean1.5792E+046.2649E+082.9510E+061.5400E+053.6271E+046.9883E+062.7154E+063.1938E+067.4320E+063.0362E+064.0813E+06
Std6.7405E+032.0734E+086.1231E+055.4708E+041.1151E+043.8996E+061.4284E+069.9958E+053.2136E+061.5342E+061.7649E+06
Rank1115329471068
F18Best2.1620E+032.1978E+104.9815E+053.6823E+045.9842E+031.7404E+066.0233E+035.0827E+043.1849E+071.8310E+047.5135E+05
Mean2.5742E+033.4442E+101.1954E+061.1958E+051.0889E+049.8199E+061.5620E+051.1335E+051.1486E+084.6588E+042.5222E+06
Std5.8195E+025.3839E+092.5174E+055.0477E+043.2431E+035.2220E+061.6908E+054.7776E+045.4582E+071.9119E+041.5209E+06
Rank1117529641038
F19Best5.4619E+037.4799E+035.9137E+035.6594E+036.4142E+033.6402E+034.0073E+035.0120E+037.1349E+034.1843E+035.0990E+03
Mean6.6378E+038.4735E+037.2558E+036.5595E+037.3112E+035.1300E+035.0291E+037.0399E+037.5837E+035.2535E+035.9544E+03
Std3.3192E+024.2787E+023.4993E+025.9728E+022.6479E+025.7097E+024.6037E+025.2714E+022.2483E+025.0979E+024.2577E+02
Rank6118592171034
F20Best2.9730E+034.6856E+033.0790E+032.9175E+033.0559E+032.7736E+032.6847E+032.9463E+033.3409E+033.0479E+032.9842E+03
Mean3.0369E+035.0808E+033.2159E+033.0310E+033.1277E+032.9441E+032.8131E+033.1630E+033.4260E+033.2314E+033.0832E+03
Std2.7201E+011.6133E+024.8394E+014.4675E+012.6831E+016.4723E+017.8292E+011.0070E+024.0333E+019.7268E+015.6106E+01
Rank4118362171095
F21Best2.6611E+043.1184E+043.2979E+042.8966E+043.2107E+041.8578E+041.3726E+044.3499E+033.3217E+042.0156E+042.9348E+04
Mean2.8066E+043.3962E+043.4045E+043.2062E+043.4017E+042.1706E+041.6985E+042.9588E+043.4046E+042.3821E+043.1126E+04
Std6.5354E+021.6898E+034.2626E+021.4972E+035.7174E+021.4694E+031.6378E+039.6311E+034.1340E+022.4045E+031.0010E+03
Rank4810792151136
F22Best3.2917E+036.3739E+033.6917E+033.4780E+033.5852E+033.2571E+033.1788E+033.8314E+033.9714E+033.8453E+033.5059E+03
Mean3.4768E+037.2035E+033.7715E+033.5989E+033.6495E+033.4058E+033.2992E+034.0536E+034.0920E+034.0494E+033.5918E+03
Std6.3651E+013.6756E+024.0248E+015.4635E+012.6604E+017.6410E+019.0792E+019.0025E+014.8070E+011.3431E+026.5157E+01
Rank3117562191084
F23Best3.4257E+031.0259E+044.0767E+033.8864E+033.8809E+033.7490E+033.7149E+034.4364E+034.6004E+034.4583E+033.8561E+03
Mean3.8404E+031.2160E+044.1710E+034.0282E+034.0436E+033.9611E+033.8646E+034.7078E+034.7680E+034.9988E+034.1086E+03
Std1.7943E+027.5770E+025.4600E+015.8159E+014.7968E+011.0300E+021.0616E+021.5237E+028.0013E+012.3621E+028.5560E+01
Rank1117453289106
F24Best3.2107E+033.5072E+044.0130E+033.4843E+033.3492E+033.6022E+033.2535E+033.8445E+036.7517E+034.2522E+034.5991E+03
Mean3.3364E+033.5190E+044.1584E+033.5901E+033.4472E+033.9110E+033.3324E+034.1443E+038.5113E+034.8992E+035.2514E+03
Std4.4704E+012.8393E+028.0259E+014.5029E+013.5417E+011.3813E+024.5147E+011.5060E+027.9161E+023.6275E+023.0451E+02
Rank2117435161089
F25Best7.5090E+035.8927E+041.3554E+041.1051E+041.2033E+041.1329E+042.9093E+031.4576E+041.8088E+041.7904E+041.3352E+04
Mean1.0466E+045.9128E+041.4982E+041.2740E+041.3078E+041.2961E+041.1075E+041.7094E+041.9747E+042.2545E+041.5816E+04
Std1.5928E+032.8464E+026.1984E+026.8543E+024.5939E+029.8637E+022.9500E+031.4330E+039.1925E+022.1674E+031.4620E+03
Rank1116354289107
F26Best3.4145E+031.1040E+043.5954E+033.4616E+033.3259E+033.5830E+033.2000E+033.8978E+034.6568E+034.0930E+033.7876E+03
Mean3.5102E+031.4078E+043.6787E+033.5132E+033.3865E+033.8099E+033.4104E+034.1924E+035.0614E+034.4765E+033.9900E+03
Std4.5557E+011.0569E+034.9431E+014.2008E+013.5469E+011.1238E+029.9408E+011.5809E+022.0915E+022.3876E+027.8490E+01
Rank3115416281097
F27Best3.4018E+033.3561E+044.2417E+033.6196E+033.4565E+033.8013E+033.3000E+034.0923E+039.4709E+034.8327E+035.6504E+03
Mean3.4740E+033.3676E+044.7669E+033.7329E+033.5146E+034.3922E+033.3829E+034.4410E+031.1528E+046.0752E+036.9347E+03
Std3.7747E+011.7309E+021.9307E+027.8632E+013.6432E+013.3406E+024.8152E+012.9596E+021.2756E+037.0412E+027.0042E+02
Rank2117435161089
F28Best6.4399E+035.1267E+059.1981E+037.4407E+037.7059E+036.8929E+035.2296E+036.9089E+031.0621E+046.7636E+036.7368E+03
Mean7.6775E+032.5900E+069.6933E+038.3053E+038.5328E+038.0339E+036.6144E+037.9841E+031.1761E+048.4543E+037.8698E+03
Std5.6542E+021.5417E+063.1795E+025.0628E+023.2060E+025.2575E+025.8245E+026.1511E+024.7623E+026.3440E+026.5880E+02
Rank2119685141073
F29Best1.6410E+043.1111E+101.3787E+078.3148E+051.5889E+054.9164E+078.3244E+054.0824E+062.1821E+082.6460E+061.5559E+07
Mean2.4630E+045.3962E+101.8034E+071.7651E+062.7604E+051.2455E+083.0859E+067.5934E+063.7668E+086.1551E+063.9944E+07
Std5.7492E+037.5814E+093.0011E+066.4832E+056.9520E+045.1296E+072.0484E+062.6471E+061.2285E+082.9525E+061.6127E+07
Rank1117329461058

References

  1. Jin, B.; Vai, M.I. An Adaptive Ultrasonic Backscattered Signal Processing Technique for Accurate Object Localization Based on the Instantaneous Energy Density Level. J. Med. Imaging Heal. Inform. 2015, 5, 1059–1064. [Google Scholar] [CrossRef]
  2. Slowik, A.; Kwasnicka, H. Nature Inspired Methods and Their Industry Applications-Swarm Intelligence Algorithms. IEEE Trans. Ind. Inform. 2018, 14, 1004–1015. [Google Scholar] [CrossRef]
  3. 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]
  4. Jin, B.; Gonçalves, N.; Cruz, L.; Medvedev, I.; Yu, Y.; Wang, J. Simulated Multimodal Deep Facial Diagnosis. Expert Syst. Appl. 2024, 252, 123881. [Google Scholar] [CrossRef]
  5. Tang, A.-D.; Tang, S.Q.; Han, T.; Zhou, H.; Xie, L. A Modified Slime Mould Algorithm for Global Optimization. Comput. Intell. Neurosci. 2021, 2021, 2298215. [Google Scholar] [CrossRef] [PubMed]
  6. Dai, M.; Tang, D.; Giret, A.; Salido, M.A. Multi-Objective Optimization for Energy-Efficient Flexible Job Shop Scheduling Problem with Transportation Constraints. Robot. Comput. Integr. Manuf. 2019, 59, 143–157. [Google Scholar] [CrossRef]
  7. Tang, A.; Zhou, H.; Han, T.; Xie, L. A Chaos Sparrow Search Algorithm with Logarithmic Spiral and Adaptive Step for Engineering Problems. Comput. Model. Eng. Sci. 2021, 130, 331–364. [Google Scholar] [CrossRef]
  8. Shen, X.; Du, S.C.; Sun, Y.N.; Sun, P.Z.H.; Law, R.; Wu, E.Q. Advance Scheduling for Chronic Care Under Online or Offline Revisit Uncertainty. IEEE Trans. Autom. Sci. Eng. 2023, 21, 5297–5310. [Google Scholar] [CrossRef]
  9. Cao, B.; Fan, S.; Zhao, J.; Tian, S.; Zheng, Z.; Yan, Y.; Yang, P. Large-Scale Many-Objective Deployment Optimization of Edge Servers. IEEE Trans. Intell. Transp. Syst. 2021, 22, 3841–3849. [Google Scholar] [CrossRef]
  10. Zeng, N.; Wang, Z.; Liu, W.; Zhang, H.; Hone, K.; Liu, X. A Dynamic Neighborhood-Based Switching Particle Swarm Optimization Algorithm. IEEE Trans. Cybern. 2022, 52, 9290–9301. [Google Scholar] [CrossRef]
  11. Wang, C.; Koh, J.M.; Yu, T.; Xie, N.G.; Cheong, K.H. Material and Shape Optimization of Bi-Directional Functionally Graded Plates by GIGA and an Improved Multi-Objective Particle Swarm Optimization Algorithm. Comput. Methods Appl. Mech. Eng. 2020, 366, 113017. [Google Scholar] [CrossRef]
  12. Zhao, W.; Du, C.; Jiang, S. An Adaptive Multiscale Approach for Identifying Multiple Flaws Based on XFEM and a Discrete Artificial Fish Swarm Algorithm. Comput. Methods Appl. Mech. Eng. 2018, 339, 341–357. [Google Scholar] [CrossRef]
  13. 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]
  14. Hu, G.; Huang, F.Y.; Shu, B.; Wei, G. MAHACO: Multi-Algorithm Hybrid Ant Colony Optimizer for 3D Path Planning of a Group of UAVs. Inf. Sci. 2025, 694, 121714. [Google Scholar] [CrossRef]
  15. Sowmya, R.; Premkumar, M.; Jangir, P. Newton-Raphson-Based Optimizer: A New Population-Based Metaheuristic Algorithm for Continuous Optimization Problems. Eng. Appl. Artif. Intell. 2024, 128, 107532. [Google Scholar] [CrossRef]
  16. Houssein, E.H.; Saad, M.R.; Çelik, E.; Hu, G.; Ali, A.A.; Shaban, H. An Enhanced Sea-Horse Optimizer for Solving Global Problems and Cluster Head Selection in Wireless Sensor Networks. Clust. Comput. J. Netw. Softw. Tools Appl. 2024, 27, 7775–7802. [Google Scholar] [CrossRef]
  17. Abualigah, L.; Habash, M.; Hanandeh, E.S.; Hussein, A.M.A.; Shinwan, M.A.; Zitar, R.A.; Jia, H. Improved Reptile Search Algorithm by Salp Swarm Algorithm for Medical Image Segmentation. J. Bionic Eng. 2023, 20, 1766–1790. [Google Scholar] [CrossRef]
  18. Hu, G.; Zheng, Y.X.; Houssein, E.H.; Wei, G. GSRPSO: A Multi-Strategy Integrated Particle Swarm Algorithm for Multi-Threshold Segmentation of Real Cervical Cancer Images. Swarm Evol. Comput. 2024, 91, 101766. [Google Scholar] [CrossRef]
  19. Seyyedabbasi, A.; Hu, G.; Shehadeh, H.A.; Wang, X.P.; Canatalay, P.J. V-Shaped and S-Shaped Binary Artificial Protozoa Optimizer (APO) Algorithm for Wrapper Feature Selection on Biological Data. Clust. Comput. J. Netw. Softw. Tools Appl. 2025, 28, 1–32. [Google Scholar] [CrossRef]
  20. Jia, H.; Sun, K.; Li, Y.; Cao, N. Improved Marine Predators Algorithm for Feature Selection and SVM Optimization. KSII Trans. Internet Inf. Syst. 2022, 16, 1128–1145. [Google Scholar] [CrossRef]
  21. Holland, J.H. Genetic Algorithms. Sci. Am. 1992, 267, 66–72. [Google Scholar] [CrossRef]
  22. Beyer, H.-G.; Schwefel, H.-P. Evolution Strategies—A Comprehensive Introduction. Nat. Comput. 2002, 1, 3–52. [Google Scholar] [CrossRef]
  23. Opara, K.R.; Arabas, J. Differential Evolution: A Survey of Theoretical Analyses. Swarm Evol. Comput. 2019, 44, 546–558. [Google Scholar] [CrossRef]
  24. Hansen, N.; Ostermeier, A. Completely Derandomized Self-Adaptation in Evolution Strategies. Evol. Comput. 2001, 9, 159–195. [Google Scholar] [CrossRef] [PubMed]
  25. Lian, J.; Hui, G. Human Evolutionary Optimization Algorithm. Expert Syst. Appl. 2024, 241, 122638. [Google Scholar] [CrossRef]
  26. Dong, Y.C.; Zhang, S.H.; Zhang, H.L.; Zhou, X.J.; Jiang, J.D. Chaotic Evolution Optimization: A Novel Metaheuristic Algorithm Inspired by Chaotic Dynamics. Chaos Solitons Fractals 2025, 192, 116049. [Google Scholar] [CrossRef]
  27. Mirjalili, S.; Mirjalili, S.M.; Hatamlou, A. Multi-Verse Optimizer: A Nature-Inspired Algorithm for Global Optimization. Neural Comput. Appl. 2016, 27, 495–513. [Google Scholar] [CrossRef]
  28. Hashim, F.A.; Mostafa, R.R.; Hussien, A.G.; Mirjalili, S.; Sallam, K.M. Fick’s Law Algorithm: A Physical Law-Based Algorithm for Numerical Optimization. Knowl.-Based Syst. 2023, 260, 110146. [Google Scholar] [CrossRef]
  29. 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]
  30. Yuan, C.; Zhao, D.; Heidari, A.A.; Liu, L.; Chen, Y.; Chen, H. Polar Lights Optimizer: Algorithm and Applications in Image Segmentation and Feature Selection. Neurocomputing 2024, 607, 128427. [Google Scholar] [CrossRef]
  31. Goodarzimehr, V.; Shojaee, S.; Hamzehei-Javaran, S.; Talatahari, S. Special Relativity Search: A Novel Metaheuristic Method Based on Special Relativity Physics. Knowl.-Based Syst. 2022, 257, 109484. [Google Scholar] [CrossRef]
  32. He, J.H.; Zhao, S.J.; Ding, J.Y.; Wang, Y.M. Mirage Search Optimization: Application to Path Planning and Engineering Design Problems. Adv. Eng. Softw. 2025, 203, 103883. [Google Scholar] [CrossRef]
  33. Abdel-Basset, M.; Mohamed, R.; Azeem, S.A.A.; Jameel, M.; Abouhawwash, M. Kepler Optimization Algorithm: A New Metaheuristic Algorithm Inspired by Kepler’s Laws of Planetary Motion. Knowl.-Based Syst. 2023, 268, 110454. [Google Scholar] [CrossRef]
  34. Mirjalili, S. SCA: A Sine Cosine Algorithm for Solving Optimization Problems. Knowl.-Based Syst. 2016, 96, 120–133. [Google Scholar] [CrossRef]
  35. Abualigah, L.; Diabat, A.; Mirjalili, S.; Abd Elaziz, M.; Gandomi, A.H. The Arithmetic Optimization Algorithm. Comput. Methods Appl. Mech. Eng. 2021, 376, 113609. [Google Scholar] [CrossRef]
  36. Beltran, L.A.; Navarro, M.A.; Oliva, D.; Campos-Peña, D.; Ramos-Frutos, J.; Zapotecas-Martínez, S. Quasi-Random Fractal Search (QRFS): A Dynamic Metaheuristic with Sigmoid Population Decrement for Global Optimization. Expert Syst. Appl. 2024, 254, 124400. [Google Scholar] [CrossRef]
  37. Cheng, J.; De Waele, W. Weighted Average Algorithm: A Novel Meta-Heuristic Optimization Algorithm Based on the Weighted Average Position Concept. Knowl.-Based Syst. 2024, 305, 112564. [Google Scholar] [CrossRef]
  38. Zhao, S.J.; Zhang, T.R.; Cai, L.; Yang, R.H. Triangulation Topology Aggregation Optimizer: A Novel Mathematics-Based Meta-Heuristic Algorithm for Continuous Optimization and Engineering Applications. Expert Syst. Appl. 2024, 238, 121744. [Google Scholar] [CrossRef]
  39. Luan, T.M.; Khatir, S.; Tran, M.T.; De Baets, B.; Cuong-Le, T. Exponential-Trigonometric Optimization Algorithm for Solving Complicated Engineering Problems. Comput. Methods Appl. Mech. Eng. 2024, 432, 117411. [Google Scholar] [CrossRef]
  40. Huang, W.; Xu, J. Particle Swarm Optimization. In Springer Tracts in Civil Engineering; Springer: Berlin/Heidelberg, Germany, 2023. [Google Scholar]
  41. Dorigo, M.; Di Caro, G. Ant Colony Optimization: A New Meta-Heuristic. In Proceedings of the 1999 Congress on Evolutionary Computation, CEC, Washington, DC, USA, 6–9 July 1999. [Google Scholar]
  42. Mirjalili, S.; Mirjalili, S.M.; Lewis, A. Grey Wolf Optimizer. Adv. Eng. Softw. 2014, 69, 46–61. [Google Scholar] [CrossRef]
  43. Xiao, Y.N.; Cui, H.; Abu Khurma, R.; Castillo, P.A. Artificial Lemming Algorithm: A Novel Bionic Meta-Heuristic Technique for Solving Real-World Engineering Optimization Problems. Artif. Intell. Rev. 2025, 58, 84. [Google Scholar] [CrossRef]
  44. Jia, H.; Rao, H.; Wen, C.; Mirjalili, S. Crayfish Optimization Algorithm. Artif. Intell. Rev. 2023, 56, 1919–1979. [Google Scholar] [CrossRef]
  45. Agushaka, J.O.; Ezugwu, A.E.; Abualigah, L. Dwarf Mongoose Optimization Algorithm. Comput. Methods Appl. Mech. Eng. 2022, 391, 114570. [Google Scholar] [CrossRef]
  46. Hu, G.; Cheng, M.; Houssein, E.H.; Hussien, A.G.; Abualigah, L. SDO: A Novel Sled Dog-Inspired Optimizer for Solving Engineering Problems. Adv. Eng. Inform. 2024, 62, 102783. [Google Scholar] [CrossRef]
  47. Li, S.; Chen, H.; Wang, M.; Heidari, A.A.; Mirjalili, S. Slime Mould Algorithm: A New Method for Stochastic Optimization. Futur. Gener. Comput. Syst. 2020, 111, 300–323. [Google Scholar] [CrossRef]
  48. Wang, W.C.; Tian, W.C.; Xu, D.M.; Zang, H.F. Arctic Puffin Optimization: A Bio-Inspired Metaheuristic Algorithm for Solving Engineering Design Optimization. Adv. Eng. Softw. 2024, 195, 103694. [Google Scholar] [CrossRef]
  49. Hu, G.; Guo, Y.; Wei, G.; Abualigah, L. Genghis Khan Shark Optimizer: A Novel Nature-Inspired Algorithm for Engineering Optimization. Adv. Eng. Inform. 2023, 58, 102210. [Google Scholar] [CrossRef]
  50. Ezugwu, A.E.; Agushaka, J.O.; Abualigah, L.; Mirjalili, S.; Gandomi, A.H. Prairie Dog Optimization Algorithm. Neural Comput. Appl. 2022, 34, 20017–20065. [Google Scholar] [CrossRef]
  51. Fu, Y.F.; Liu, D.; Chen, J.D.; He, L. Secretary Bird Optimization Algorithm: A New Metaheuristic for Solving Global Optimization Problems. Artif. Intell. Rev. 2024, 57, 123. [Google Scholar] [CrossRef]
  52. Wolpert, D.H.; Macready, W.G. No Free Lunch Theorems for Optimization. IEEE Trans. Evol. Comput. 1997, 1, 67–82. [Google Scholar] [CrossRef]
  53. Duankhan, P.; Sunat, K.; Chiewchanwattana, S.; Nasa-ngium, P. The Differentiated Creative Search (DCS): Leveraging Differentiated Knowledge-Acquisition and Creative Realism to Address Complex Optimization Problems. Expert Syst. Appl. 2024, 252, 123734. [Google Scholar] [CrossRef]
  54. Chermite, C.; Douiri, M.R. A Novel Hybrid Approach Combining Differentiated Creative Search with Adaptive Refinement for Photovoltaic Parameter Extraction. Renew. Energy 2025, 245, 122764. [Google Scholar] [CrossRef]
  55. Zhang, H.; Li, G.L.; Guo, C.Y.; Li, M.; Wang, Y.; Luo, J.H. Rapid Identification of Liubao Tea Vintage Based on Terahertz Spectroscopy Combined with Improved Differentiated Creative Search Algorithm. Spectrosc. Lett. 2025. online. [Google Scholar] [CrossRef]
  56. Liu, J.; Lin, Y.; Zhang, X.; Yin, J.B.; Zhang, X.L.; Feng, Y.; Qian, Q. Agricultural UAV Path Planning Based on a Differentiated Creative Search Algorithm with Multi-Strategy Improvement. Machines 2024, 12, 591. [Google Scholar] [CrossRef]
  57. Gao, H.; Zhang, Q.K. Alpha Evolution: An Efficient Evolutionary Algorithm with Evolution Path Adaptation and Matrix Generation. Eng. Appl. Artif. Intell. 2024, 137, 109202. [Google Scholar] [CrossRef]
  58. Tanabe, R.; Fukunaga, A.S. Improving the Search Performance of SHADE Using Linear Population Size Reduction. In Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC, Beijing, China, 6–11 July.
  59. Li, Y.; Han, T.; Zhou, H.; Wei, Y.; Wang, Y.; Tan, M.; Huang, C. APSM-JSO: A Novel JSO Variant with an Adaptive Parameter Selection Mechanism and a New External Archive Updating Mechanism. Swarm Evol. Comput. 2023, 78, 101283. [Google Scholar] [CrossRef]
  60. 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]
  61. Otair, M.; Alhmoud, A.; Jia, H.; Altalhi, M.; Hussein, A.M.A.; Abualigah, L. Optimized Task Scheduling in Cloud Computing Using Improved Multi-Verse Optimizer. Comput. Clust. 2022, 25, 4221–4232. [Google Scholar] [CrossRef]
  62. Zhao, W.; Wang, L.; Zhang, Z.; Mirjalili, S.; Khodadadi, N.; Ge, Q. Quadratic Interpolation Optimization (QIO): A New Optimization Algorithm Based on Generalized Quadratic Interpolation and Its Applications to Real-World Engineering Problems. Comput. Methods Appl. Mech. Eng. 2023, 417, 116446. [Google Scholar] [CrossRef]
  63. Nadimi-Shahraki, M.H.; Taghian, S.; Javaheri, D.; Sadiq, A.S.; Khodadadi, N.; Mirjalili, S. MTV-SCA: Multi-Trial Vector-Based Sine Cosine Algorithm. Clust. Comput. J. Netw. Softw. Tools Appl. 2024, 27, 13471–13515. [Google Scholar] [CrossRef]
  64. Zhao, W.; Zhang, Z.; Wang, L. Manta Ray Foraging Optimization: An Effective Bio-Inspired Optimizer for Engineering Applications. Eng. Appl. Artif. Intell. 2020, 87, 103300. [Google Scholar] [CrossRef]
  65. Yin, S.; Luo, Q.; Zhou, Y. EOSMA: An Equilibrium Optimizer Slime Mould Algorithm for Engineering Design Problems. Arab. J. Sci. Eng. 2022, 47, 10115–10146. [Google Scholar] [CrossRef]
Figure 1. Classification of metaheuristic algorithm.
Figure 1. Classification of metaheuristic algorithm.
Biomimetics 10 00260 g001
Figure 2. Sketch for collaborative development mechanism.
Figure 2. Sketch for collaborative development mechanism.
Biomimetics 10 00260 g002
Figure 3. The flowchart of MSDCS.
Figure 3. The flowchart of MSDCS.
Biomimetics 10 00260 g003
Figure 4. Friedman rankings of MSDCS with different N min (α = 0.05).
Figure 4. Friedman rankings of MSDCS with different N min (α = 0.05).
Biomimetics 10 00260 g004
Figure 5. Friedman rankings of MSDCS with different N c (α = 0.05).
Figure 5. Friedman rankings of MSDCS with different N c (α = 0.05).
Biomimetics 10 00260 g005
Figure 6. Friedman rankings of MSDCS with different strategy (α = 0.05).
Figure 6. Friedman rankings of MSDCS with different strategy (α = 0.05).
Biomimetics 10 00260 g006
Figure 7. The ranking heatmaps of MSDCS and comparison algorithms solving CEC2017 test suite.
Figure 7. The ranking heatmaps of MSDCS and comparison algorithms solving CEC2017 test suite.
Biomimetics 10 00260 g007
Figure 8. Friedman rankings of MSDCS and comparison algorithms (α = 0.05).
Figure 8. Friedman rankings of MSDCS and comparison algorithms (α = 0.05).
Biomimetics 10 00260 g008
Figure 9. The Nemenyi test results of MSEDO and comparison algorithms.
Figure 9. The Nemenyi test results of MSEDO and comparison algorithms.
Biomimetics 10 00260 g009
Figure 10. Visualization of Wilcoxon rank sum test results of MSDCS and comparison algorithms (α = 0.05).
Figure 10. Visualization of Wilcoxon rank sum test results of MSDCS and comparison algorithms (α = 0.05).
Biomimetics 10 00260 g010aBiomimetics 10 00260 g010b
Figure 11. Node deployment of MSDCS and its competitors.
Figure 11. Node deployment of MSDCS and its competitors.
Biomimetics 10 00260 g011
Figure 12. Convergence graph and boxplots of MSDCS and its competitors.
Figure 12. Convergence graph and boxplots of MSDCS and its competitors.
Biomimetics 10 00260 g012
Figure 13. The ranking heatmaps of MSDCS and comparison algorithms solving constrained engineering optimization problems.
Figure 13. The ranking heatmaps of MSDCS and comparison algorithms solving constrained engineering optimization problems.
Biomimetics 10 00260 g013
Table 1. Parameters setting of MSDCS and other selected algorithms.
Table 1. Parameters setting of MSDCS and other selected algorithms.
AlgorithmParameters Setting
MSDCS p c = 0.5 , γ = 0.6 , N s = max 6 , r o u n d 2 N 3 + 3 5 N min = max N s + 4 , r o u n d 0.2 N , N c = 0.5 N
DCS m = 3
AE [57] w = 4
LSHADE [58] F = 0.5 , C r = 0.5 , p = 0 . 11 , N min = 4
APSM-jSO [59] k = 3 , F = 0.3 , C R = 0.8 , H = 6
RIME [60] W = 5
RDGMVO [61] w max = 1 , w min = 0.2 , p = 0.6 , α = 0.1
QIO [62] α 1 = 0.7 , α 2 = 0.15 , w = 3
MTVSCA [63] λ = 0.25 , n = 20 , a = 2
MRFO [64] S = 2
EOSMA [65] V = 1 , a 1 = 2 , a 2 = 1 , G P = 0.5 , z = 0.6 , q = 0.2
Table 2. Rankings of MSDCS with different N min (α = 0.05).
Table 2. Rankings of MSDCS with different N min (α = 0.05).
DimensionDCS0.1N0.2N0.3N0.4N0.5N0.6N0.7N0.8N0.9N
D = 1010.0002.3792.3792.8974.1724.5525.9666.5867.3107.759
D = 3010.0001.9311.9312.2413.3795.0695.8976.8288.1038.621
D = 5010.0001.8281.8282.5173.7594.9315.6217.0007.6908.828
D = 10010.0001.9311.9312.6213.3454.7245.6556.9668.0698.759
Average ranking10.0002.0172.0172.5693.6644.8195.7846.8457.7938.491
Table 3. Rankings of MSDCS with different N c (α = 0.05).
Table 3. Rankings of MSDCS with different N c (α = 0.05).
DimensionDCS0.1N0.2N0.3N0.4N0.5N0.6N0.7N0.8N0.9N0.10N
D = 1011.0006.8625.3105.1035.4145.4834.9664.9315.3455.6555.931
D = 3011.0007.7246.0005.4485.2764.2764.5525.1724.7595.4146.379
D = 5011.0006.5525.2764.4144.5174.7245.2415.8975.4146.1036.862
D = 10011.0005.5524.4144.2764.4144.6555.6215.4146.0697.0007.586
Average ranking11.0006.6725.2504.8104.9054.7845.0955.3535.3976.0436.690
Table 4. Descriptions of MSDCS with different strategies.
Table 4. Descriptions of MSDCS with different strategies.
StrategyDCSDCS-PESDCS-LPSRDCS-CDMMSDCS
PESNoYesNoNoYes
LPSRNoNoYesNoYes
CDMNoNoNoYesYes
Table 5. Rankings of MSDCS with different strategy (α = 0.05).
Table 5. Rankings of MSDCS with different strategy (α = 0.05).
Test suiteDimensionDCSDCS-PESDCS-LPSRDCS-CDMMSDCSp-Value
CEC 2017105.0002.4833.6552.2761.5862.79E-17
305.0002.4483.8972.3791.2762.37E-20
505.0002.4833.8622.2071.4482.55E-19
1005.0002.7593.9311.8971.4147.92E-21
Average ranking5.0002.5433.8362.1901.431N/A
Ranking53421N/A
Table 6. Rankings of MSDCS and comparison algorithms (α = 0.05).
Table 6. Rankings of MSDCS and comparison algorithms (α = 0.05).
AlgorithmCEC-2017 Test Suite
10D30D50D100DAverage RankingRank
MSDCS1.6211.6902.3102.2761.9741
DCS11.00011.00010.93110.79310.93111
AE8.1727.9317.7937.1387.7599
LSHADE6.0345.3104.8284.0695.0604
APSM-jSO4.3794.4484.5174.4144.4403
RIME5.1725.0694.9315.3795.1385
RDGMVO4.8623.2762.7592.5173.3532
QIO4.4835.4145.5526.2075.4146
MTVSCA8.8629.7249.8979.7249.55210
MRFO5.6906.0006.3106.7596.1907
EOSMA5.7246.1386.1726.7246.1907
Friedman P-value4.10E-318.69E-362.49E-352.39E-35N/AN/A
Table 7. The Wilcoxon rank sum test results of MSDCS and comparison algorithms (α = 0.05).
Table 7. The Wilcoxon rank sum test results of MSDCS and comparison algorithms (α = 0.05).
MSDCS vs.10D (+/=/−)30D (+/=/−)50D (+/=/−)100D (+/=/−)Total (+/=/−)
DCS29/0/029/0/029/0/029/0/0116/0/0
AE29/0/029/0/029/0/029/0/0116/0/0
LSHADE28/1/029/0/029/0/022/7/0108/8/0
APSM-jSO26/1/229/0/028/0/127/1/1108/2/4
RIME22/4/320/2/718/2/920/0/980/8/28
RDGMVO19/5/518/4/712/3/1413/4/1262/16/38
QIO27/2/025/3/123/3/326/1/2101/9/6
MTVSCA29/0/029/0/029/0/029/0/0116/0/0
MRFO27/2/024/5/023/2/424/0/595/9/9
EOSMA27/1/127/2/025/1/325/1/3104/5/7
Table 8. The statistical results of MSDCS and competition algorithms for solving WSN.
Table 8. The statistical results of MSDCS and competition algorithms for solving WSN.
AlgorithmBestMeanStd
MSDCS85.95%83.64%0.026
DCS64.46%60.08%0.025
RDGMVO80.99%78.93%0.018
APSM-jSO71.90%68.51%0.022
Table 9. Ten constrained engineering optimization problems.
Table 9. Ten constrained engineering optimization problems.
ProblemNameD
CE01Tension/compression spring design problem3
CE02Pressure vessel design problem4
CE03Three-bar truss design problem2
CE04Welded beam design problem4
CE05Speed reducer design problem7
CE06Gear train design problem4
CE07Rolling element bearing design10
CE08Cantilever beam design problem5
CE09Multiple disk clutch brake design problem5
CE10Step-cone pulley problem5
Table 10. The statistics results of MSDCS and competition algorithms solving constrained engineering optimization problems.
Table 10. The statistics results of MSDCS and competition algorithms solving constrained engineering optimization problems.
FunctionIndexMSDCSDCSAELSHADEAPSM-jSORIMERDGMVOQIOMTVSCAMRFOEOSMA
CE1Best1.2671E-022.4083E-021.3191E-021.2907E-021.2871E-021.3529E-021.3044E-021.2921E-021.3906E-021.3057E-021.2846E-02
Mean1.2860E-027.3531E+031.4128E-021.3296E-021.3054E-021.6235E-021.3356E-021.3383E-021.6551E-021.3777E-021.3695E-02
Std2.8359E-041.6442E+041.0954E-033.2821E-041.4931E-042.9673E-034.1936E-044.1607E-042.4984E-037.4353E-049.4204E-04
Rank1118329451076
CE2Best5.8701E+031.7715E+056.6293E+036.3630E+036.0647E+036.0556E+037.6793E+036.3236E+031.2028E+046.5909E+037.1900E+03
Mean5.9511E+033.2762E+058.0280E+036.5037E+036.5380E+036.9088E+038.3425E+036.8454E+031.3060E+047.0169E+038.3431E+03
Std1.6259E+021.9473E+051.1292E+032.4059E+024.8136E+027.6999E+021.1312E+033.2487E+021.1049E+035.8863E+021.0649E+03
Rank1117235841069
CE3Best2.6389E+022.6395E+022.6391E+022.6390E+022.6390E+022.6394E+022.6389E+022.6389E+022.6405E+022.6389E+022.6390E+02
Mean2.6389E+022.6468E+022.6393E+022.6390E+022.6392E+022.6442E+022.6394E+022.6390E+022.6433E+022.6394E+022.6402E+02
Std2.8422E-141.0184E+001.4357E-025.1566E-032.7481E-027.0931E-015.5071E-022.6617E-032.9947E-014.1346E-021.6598E-01
Rank1115341072968
CE4Best1.6928E+002.2522E+001.8755E+001.7093E+001.7255E+001.7528E+001.8060E+001.7362E+001.8941E+001.7390E+001.7520E+00
Mean1.6928E+003.1607E+001.9597E+001.7362E+001.7744E+001.9554E+001.9708E+001.7493E+002.0044E+001.7759E+001.8056E+00
Std6.0366E-077.2634E-015.6745E-022.1821E-027.5693E-022.3237E-012.3252E-011.4943E-028.2997E-024.0763E-024.0271E-02
Rank1118247931056
CE5Best2.9936E+033.1674E+032.8842E+032.9955E+032.9937E+033.0006E+033.0000E+033.0179E+033.0581E+033.0126E+033.0136E+03
Mean2.9936E+033.6127E+032.9817E+032.9964E+032.9937E+033.0081E+033.0054E+033.0395E+033.0836E+033.0205E+033.0196E+03
Std1.2705E-085.4941E+028.1403E+015.7719E-014.6451E-021.4537E+013.5675E+001.7883E+012.8303E+016.8185E+004.7228E+00
Rank2111436591087
CE6Best2.7009E-126.5257E-082.7009E-122.7009E-122.7009E-122.3078E-113.0676E-102.7009E-129.7457E-102.3078E-112.3078E-11
Mean2.5107E-102.9280E-041.6136E-091.3787E-091.8025E-091.6091E-091.8218E-096.9316E-101.5824E-081.0321E-091.4391E-09
Std5.2127E-102.6088E-041.0773E-099.9970E-102.8168E-091.6964E-091.6550E-096.3136E-103.1042E-089.6274E-101.2581E-09
Rank1117486921035
CE7Best-2.4358E+05-1.2042E+05-1.1897E+03-2.4358E+05-2.4358E+05-2.4358E+05-2.4358E+05-2.3030E+05-2.2659E+05-2.3612E+05-2.4144E+05
Mean-2.4358E+051.5159E+06-1.0860E+03-2.4356E+05-2.4358E+05-2.4314E+05-2.4358E+05-2.2349E+05-2.2243E+05-2.3002E+05-2.4025E+05
Std5.8147E-071.8087E+065.8056E+012.7780E+011.2992E-094.4409E+025.3962E+008.2081E+034.6563E+037.9789E+038.0731E+02
Rank2111041538976
CE8Best1.3400E+002.0342E+001.4263E+001.3467E+001.3511E+001.3525E+001.4144E+001.3409E+001.4359E+001.3426E+001.3554E+00
Mean1.3400E+003.1656E+001.4467E+001.3601E+001.3577E+001.4106E+001.6551E+001.3430E+001.5526E+001.3496E+001.3609E+00
Std1.2511E-071.1175E+001.9849E-021.4979E-027.8764E-034.2675E-022.0798E-012.9635E-039.4868E-029.2797E-034.3679E-03
Rank1118547102.0000E+009.0000E+003.0000E+006.0000E+00
CE9Best3.9247E+083.9247E+082.5199E+083.9247E+083.9247E+083.9247E+083.9247E+083.9247E+083.9247E+083.9247E+083.9247E+08
Mean3.9247E+083.9474E+082.5245E+083.9247E+083.9247E+083.9247E+083.9247E+083.9247E+083.9247E+083.9247E+083.9247E+08
Std0.0000E+004.5209E+068.8091E+050.0000E+000.0000E+000.0000E+000.0000E+009.2258E-021.8781E+033.4870E-010.0000E+00
Rank2111222281092
CE10Best1.6086E+011.7337E+042.2769E+011.7146E+011.6594E+011.6282E+011.6886E+011.6576E+017.8319E+011.6735E+011.7144E+01
Mean1.6086E+017.0920E+088.0915E+011.7397E+011.7053E+011.6967E+011.9526E+011.6696E+011.4682E+021.7109E+011.7557E+01
Std4.8761E-071.3571E+091.0977E+023.2555E-014.5030E-015.6418E-013.9405E+001.1886E-017.2506E+013.1909E-014.4901E-01
Rank1119643821057
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

Cai, X.; Zhang, C. An Innovative Differentiated Creative Search Based on Collaborative Development and Population Evaluation. Biomimetics 2025, 10, 260. https://doi.org/10.3390/biomimetics10050260

AMA Style

Cai X, Zhang C. An Innovative Differentiated Creative Search Based on Collaborative Development and Population Evaluation. Biomimetics. 2025; 10(5):260. https://doi.org/10.3390/biomimetics10050260

Chicago/Turabian Style

Cai, Xinyu, and Chaoyong Zhang. 2025. "An Innovative Differentiated Creative Search Based on Collaborative Development and Population Evaluation" Biomimetics 10, no. 5: 260. https://doi.org/10.3390/biomimetics10050260

APA Style

Cai, X., & Zhang, C. (2025). An Innovative Differentiated Creative Search Based on Collaborative Development and Population Evaluation. Biomimetics, 10(5), 260. https://doi.org/10.3390/biomimetics10050260

Article Metrics

Back to TopTop