Next Article in Journal
Estimation of Physical Stellar Parameters from Spectral Models Using Deep Learning Techniques
Previous Article in Journal
Relationships among Various Chaos for Linear Semiflows Indexed with Complex Sectors
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Adaptive Differential Evolution with the Stagnation Termination Mechanism

1
College of Cyber Security, Jinan University, Guangzhou 510632, China
2
College of Information Science and Technology, Jinan University, Guangzhou 510632, China
*
Authors to whom correspondence should be addressed.
Mathematics 2024, 12(20), 3168; https://doi.org/10.3390/math12203168
Submission received: 11 September 2024 / Revised: 28 September 2024 / Accepted: 1 October 2024 / Published: 10 October 2024

Abstract

:
Differential evolution is capable of searching for the optimum for different types of optimization problems with a few inputs, which has gained worldwide popularity. In this paper, we propose a parameters adaptation scheme based on the stagnation ratio (PASR), which regards the stagnation ratio (STR) as the indicator for adjusting the control parameters and greediness parameter. To be specific, when the STR is larger than the predefined threshold, exploration is advocated. In this circumstance, larger control parameters and a greediness parameter are adopted. However, when the STR is smaller than the predefined threshold, exploitation is preferred. In this case, smaller control parameters and a greediness parameter are utilized. Further, when the stagnation lasts for a long period, a generation-based selection (GBS) scheme is developed to help it escape from the local optimum and stagnation. Comparative experiments have been implemented on the CEC2017 to testify the effectiveness of adaptive differential evolution with the stagnation termination mechanism (STMDE) and its components. The competitiveness of the STMDE is also verified via comparing it to top-performing DE variants in the practical optimization problem selected from the CEC2011.

1. Introduction

Differential evolution (DE) [1] has been demonstrated to be a simple and competitive optimization method in dealing with real-world problems. Four operators are included in the DE, namely, initialization, mutation, crossover and selection. The initial population is generated first, which goes through the other three processes iteratively until the stopping criterion is met. In the mutation, new genetic materials derive from the perturbation of the current population via the differential vector(s). In the crossover, the offspring inherits the genes from the parent or the mutant vector, which is affected by the crossover rate. In the selection, the one with better fitness between the parent and the offspring can enter into the next round of evolution. There is no doubt that DE can handle a large number of optimization problems effectively. However, premature convergence and stagnation cannot be neglected. To address this problem, researchers have become devoted to developing top-performing DE variants via adjusting control parameters adaptively [2,3,4,5,6,7,8,9,10,11,12,13] and modifying the classic selection [14,15,16,17,18,19,20].
On the one hand, the adaptive adjustment of control parameters is beneficial in producing promising offspring according to the evolutionary requirement [2,3,4,5,6,7,8,9,10,11,12,13]. Plenty of works pay more attention to fitness in the adjustment of control parameters. For example, fitness is regarded as one of the effective metrics in [2,3,4,5,6,7]. Moreover, information from the solution space is also included in the adaptation of control parameters [8,9,10,11]. Finally, some powerful techniques are combined with the production of control parameters to achieve better the performance of DE, such as genetic programming [12], chaotic local search [13] and so on.
On the other hand, appropriate selection ensures that potential individuals can be included in the next round of evolution. However, classic selection regards fitness as the only metric for filtering out superior individuals, which may cause premature convergence and stagnation. During the past few decades, researchers have put forward some reasonable selection operators with the utilization of selection thresholds [14,15], advanced techniques like neural networks [20] and so on.
To enhance the DE, we propose adaptive differential evolution with the stagnation termination mechanism (STMDE), which focuses on both the mutation and selection processes. First, an adaptation scheme for control parameters is developed. Moreover, the greediness parameter of the mutation strategy is adjusted according to the evolutionary state. Finally, a generation-based selection (GBS) is put forward to confront the stagnation. Substantial experiments on CEC2017 [21] verify the effectiveness of the proposed STMDE. The real-world optimization problem from the CEC2011 [22] is also included to testify the effectiveness of the STMDE.
The organization of this paper is as follows. Section 2 states a brief review of classic and recent works related to the parameter adaptation and selection of DE. Section 3 illustrates the proposed STMDE concretely. Section 4 shows the experimental results and performance analysis of the STMDE. Section 5 draws the conclusion of the paper.

2. Background

2.1. Differential Evolution

In this section, the initialization, mutation, crossover and selection of the DE are described in detail.
  • Initialization: Before evolution, an initial population with the size of NP is produced. Each individual is generated according to the following equation.
x i , j , 0 = x j , min + r a n d i , j [ 0 , 1 ] ( x j , max x j , min )
where xj,min and xj,max limit the minimal and maximal values of the j-th element of the i-th individual.
2.
Mutation: New genetic materials are introduced into the current population via differential vectors. Researchers have put forward plenty of mutation strategy with different searching characteristics. Several of the mutation strategies that are frequently used are displayed as follows.
DE/rand/1:
v i , g = x r 1 i , g + F ( x r 2 i , g x r 3 i , g )
DE/best/1:
v i , g = x b e s t , g + F ( x r 1 i , g x r 2 i , g )
DE/rand/2:
v i , g = x r 1 i , g + F ( x r 2 i , g x r 3 i , g ) + F ( x r 4 i , g x r 5 i , g )
DE/best/2:
v i , g = x b e s t , g + F ( x r 1 i , g x r 2 i , g ) + F ( x r 3 i , g x r 4 i , g )
where r 1 i , r 2 i , r 3 i , r 4 i and r 5 i are randomly generated integers. They are different from each other and the index i. In addition, xbest,g represents the best individual of the g-th generation.
3.
Crossover: The offspring inherits genes from both the parent and the mutant vector via the crossover. The crossover rate determines how many genes are from the parent and how many genes are from the mutant vector.
u j , i , g = { v j , i , g if   rand ( 0 , 1 ) C R i   or   j = j r a n d x j , i , g otherwise
where CRi is the crossover rate of the i-th individual; rand(0,1) denotes a random number between 0 and 1; jrand represents a random integer between one and the problem size.
4.
Selection: Each offspring competes with its parent to be enrolled into the next generation based on their fitness. For the minimization problems, the smaller the fitness is, the better the individual is. The mathematical expression is given by
x i , g + 1 = { u i , g if   f ( u i , g ) f ( x i , g ) x i , g o t h e r w i s e
where f(xi,g) and f(ui,g) denote the fitness of the i-th individual xi,g and its corresponding trial vector ui,g.
For the completeness of the paper, some special features of the SHADE [3] are also included here due to the fact that the SHADE is adopted as the baseline of the proposed STMDE in the following section.
Firstly, the SHADE adjusts the control parameters with the successful update of fitness considered, which is disclosed as follows.
  • The generation of scale factor F
F i = randc ( μ F , 0.1 )
where the mean value μ F of the distribution is 0.5 initially and changes with evolution when the historical set is not empty.
μ F = ( 1 c ) μ F + c mean L ( S F )
where c is a constant between 0 and 1. The meanL(SF) denotes the Lehmer mean of the historical set of the scale factor F.
mean L ( S F ) = k = 1 | S F | ω k F 2 k = 1 | S F | ω k F
where ω k is a weighted factor and the calculation method of it is given in the following part.
2.
The generation of the crossover rate CR
C R i = randn i ( μ C R , 0.1 )
where the mean value μ C R of the distribution is 0.5 initially and is updated in each generation on the condition that the historical set is not empty. The update rule is shown as follows.
μ C R = ( 1 c ) μ C R + c mean A ( S C R )
where c is a constant between 0 and 1. The meanA(SCR) denotes the arithmetic mean of the historical set of the crossover rate CR.
mean A ( S C R ) = k = 1 | S C R | ω k S C R , k
The weighted factor ω k in the Equations (10) and (13) is determined by fitness improvements, which can be obtained by,
ω k = Δ f k k = 1 | S q | Δ f k , q = { C R , F }
where the fitness improvement is calculated by Δ f k = | f ( u k , G ) f ( x k , G ) | .
In addition, SHADE adopts a mutation strategy called “current-to-pbest”, which make use of the p × NP best individuals from the perspective of fitness to guide evolution. The mathematical form of “current-to-pbest” is given by,
v i , g = x i , g + F i ( x b e s t , g p x i , g ) + F i ( x r 1 , g x ˜ r 2 , g )
where x b e s t , g p denotes a randomly selected individual from the first p × NP individuals.

2.2. Related Works

The simpleness and competitiveness of DE attract worldwide attention. However, its performance is heavily affected by the control parameters and selection. Therefore, researchers have put forward plenty of methods to generate appropriate parameters [2,3,4,5,6,7,8,9,10,11,12,13]. Further, the selection operator is also improved in order to filter out promising individuals [14,15,16,17,18,19,20]. Some works concerning the parameters adaptation and enhanced selection are listed as follows.
On the one hand, a brief review of adaptive parameters schemes is given. In general, fitness serves as an important guideline for tuning control parameters. JADE [2] takes advantage of successful control parameters achieving smaller fitness to lead evolution. SHADE [3] makes use of fitness improvements to enhance the parameters adaptation. Hip-DE [4] achieves effective adjustment for the distribution of control parameters by utilizing those parameters, obtaining better fitness. Li et al. introduced crossover rate sorting into the selection of control parameters to figure out the appropriate crossover rate for each individual based on fitness [5]. In [6], IMPEDE performs parameter adaptation via adding the weighed Lehmer mean strategy with the fitness improvements considered. In [7], the control parameters were obtained by fitness. Apart from fitness, researchers also introduced other information into the adaptive adjustment for control parameters, such as distance to the optimum [8], fitness differences between individuals [9] and so on. In [10], the control parameters are modified along with Euclidean distance. In [11], PFI-SHADE adjusts the control parameters to both the deviation of fitness and the dimension of the population. In addition, some powerful techniques are combined with parameter adaptation to enhance the DE [12,13]. For example, Stanovov et al. utilized genetic programming to obtain a top-performing parameter adaptation scheme [12]. In [13], Gao et al. incorporated a chaotic local search with JADE to address the premature convergence. Though researchers have become devoted to adjusting the control parameters based on fitness, fitness improvements, Euclidean distance and so on, the stagnation ratio of the population has not been fully considered. The stagnation ratio of the population can reflect its evolutionary state to some extent. Stagnation frequently happens, especially in the later evolutionary stage or in handling complex optimization problems. Capturing the stagnation ratio of the population may be beneficial to tuning the control parameters more reasonably and therefore attaining better performance.
On the other hand, some enhanced selection operators have been developed to accelerate convergence and cease stagnation. To get rid of stagnation, threshold-based selection was proposed [14,15]. Different from greedy selection, which is only determined by fitness, threshold-based selection may pick some inferior offspring for the next generation. Tian et al. proposed enhanced selection by taking both fitness and the position of individuals into consideration [16]. In addition, different from one-by-one selection, the current population and offspring are separated into several subsets and top-ranking individuals from each subset are selected [17]. In [18], the selection metric includes fitness ranking and Euclidean distance. In [19], the poor individual may be allowed to participate in the next generation. Apart from the information from the objective space and the solution space, Chen et al. proposed enhanced selection with the aid of a trained neural network [20]. Though plenty of competitive selection operators have been put forward, they pay more attention to filter out promising individuals from existing ones. However, the existing ones may not satisfy the optimization requirement when stagnation happens.

3. Proposed Method

In this section, we introduce the adaptive parameters scheme first, followed by generation-based selection, which can cease stagnation effectively and therefore improve the performance of DE.

3.1. Parameters Adaptation Based on the Stagnation Ratio

The parameters adaptation based on the stagnation ration (PASR) consists of two schemes, namely the adaptive control parameters scheme (CPSR) and the adaptive greediness parameter scheme (GPSR).

3.1.1. Adaptive Control Parameters Scheme

Adjusting the scale factor F and the crossover rate CR to the evolutionary status is beneficial to enhancing the performance of DE. In this section, we propose an adaptive control parameters scheme based on the stagnation ratio (CPSR). The pseudocode of it is shown in Algorithm 1.
Algorithm 1 CPSR
1Generate a group of CR and a group of F with the size of NP, respectively;
2Sort the CR in descending order and denote it as CRsort and divide it into two parts of equal size, namely CRL (the larger part) and CRS (the smaller part);
3Sort the F in descending order and denote it as Fsort and divide it into two parts of equal size, namely FL (the larger part) and FS (the smaller part);
4If STR > 0.5
5  Generate two groups of CR with the size of 0.55 × NP and 0.45 × NP via selecting randomly from CRL and CRS, respectively;
6  Generate two groups of F with the size of 0.6 × NP and 0.4 × NP via selecting randomly from FL and FS, respectively;
7Else
8  Generate two groups of CR with the size of 0.45 × NP and 0.55 × NP via selecting randomly from CRL and CRS, respectively;
9  Generate two groups of F with the size of 0.6 × NP and 0.4 × NP via selecting randomly from FL and FS, respectively;
10End If
Firstly, a group of CR and F with the size of NP are generated the same way as the SHADE (line 1). Afterwards, the group of CR is sorted in descending order and it is denoted as CRsort, which is separated into two groups of equal size in the sequence (lines 2). The group of F is sorted in descending order and it is denoted as Fsort, which is separated into two groups of equal size in the sequence (line 3). If the stagnation ratio (STR) of the current population is larger than 0.5, the current evolutionary status may lack exploration. In this case, a group of CR with the size of 0.55 × NP is generated by sampling from the CRL, while the group of CR with the size of 0.45 × NP is generated by sampling from the CRS (line 5). The 0.55/0.45 in line 05 is the decomposition coefficient for CR (DCcr). Similarly, a group of F with the size of 0.60 × NP is generated by sampling from the FL, while the group of F with the size of 0.40 × NP is generated by sampling from the FS (line 6). The 0.55/0.45 in line 06 is the decomposition coefficient for F (DCf).
However, if the STR is smaller than 0.5, the evolutionary status may lack exploitation. In this circumstance, a group of CR with the size of 0.45 × NP is generated by sampling from the CRL, while the group of CR with the size of 0.55 × NP is generated by sampling from the CRS (line 8). Similarly, a group of F with the size of 0.40 × NP is generated by sampling from the FL, while the group of F with the size of 0.60 × NP is generated by sampling from the FS (line 9).
The reason why the CPSR adjusts control parameters in this way can be summarized as follows. On the one hand, when the population tends to be stagnant, exploration should be advocated and larger CR and F may be preferred. To this end, more CR and F values are obtained by randomly sampling from the CRL and FL subsets, respectively. On the other hand, exploitation is preferred if not many individuals are trapped into stagnation and smaller control parameters are appropriate. Therefore, more CR and F values are derived from CRS and FS subsets, respectively.

3.1.2. Adaptive Greediness Parameter Scheme

In this subsection, we propose an adaptive greediness parameter scheme based on the stagnation ratio (GPSR). When the STR of the current population is larger than the 0.5, exploration is advocated for (lines 1~2). Therefore, a larger greediness parameter p is adopted in this case, while exploitation is preferred in the opposite case (lines 3~4). To this end, a smaller greediness parameter p is considered to enhance exploitation. The concrete adjustment rules are displayed as follows (Algorithm 2).
Algorithm 2 GPSR
1If STR > 0.5
2  p = 0.7
3Else
4  p = 0.1
5End If

3.2. Generation-Based Selection

Premature convergence and stagnation are two important factors that deteriorate the searching capability of DE. To tackle the aforementioned problems, generation-based selection (GBS) is developed, which comes into effect only when the stagnation counter Us reaches the predefined threshold. The pseudocode of the GBS mechanism is displayed in Algorithm 3.
Algorithm 3 GBS
Input:The population size NP; the threshold of stagnation t3; the stagnation counter for the population at the g-th generation Us = [Us(x1,g), Us(x2,g), …, Us(xNP,g)]; the fitness of the current population Xg is represented as f(Xg) = {f(x1,g), f(x2,g), …, f(xNP,g)} and the fitness of its offspring Ug is denoted as f(Ug) = {f(u1,g), f(u2,g), …, f(uNP,g)};
Output:  The population for the next generation Xg+1;
1Sort the fitness f(Xg) of the current population Xg in ascending order and find the best solution xbest, g of the g-th generation;
2For i = 1:NP
3  If Us(xi,g) > T and f(xi,g) < f(ui,g) Then
4    xi,g+1 = xi,g + gp × (xbest,gxi,g);
5    Us(xi,g) = 0;
6  Else If
7    Select the individual for the next generation according to Equation (7)
8  End If
9End For
Firstly, sort the fitness of the whole population and distinguish the best individual xbest,g of the current generation (line 1). When the number of stagnations of the i-th individual xi,g is larger than the threshold T and the offspring is still inferior to its parent at the g-th generation, a new offspring is produced to replace the stagnant individual, but without evaluating its fitness (lines 3~4) the stagnation counter is reset to be 0 (line 5). Otherwise, the classic selection is carried out to figure out the promising individual for the next generation (line 7). It is worth mentioning that the predefined parameter gp in line 04 ranges from 0 to 1 to generate potential offspring.

3.3. STMDE

The integrated STMDE is shown in Algorithm 4. Firstly, the initial population is produced according to Equation (1) (line 1), which is followed by iterations of mutation, crossover and selection until the optimization requirement is met (line 2). The current evolution status is disclosed by the STR, which guides the adjustment for control parameters and the greediness parameter p. To be specific, the scale factor F and the crossover rate CR for each individual are tuned according to Algorithm 1 (line 3). Other than the two control parameters, the greediness parameter p in the mutation strategy “current-to-pbest” also plays a core role in enhancing the performance of offspring generation. To this end, the greediness parameter p is also adaptive to the current evolution status as shown in Algorithm 2 (line 4). With suitable control parameters and greediness parameters selected, potential mutant vectors are produced via Equation (15) (line 5). In this paper, the binomial crossover operator as shown in Equation (6) is adopted to generate trial vectors (line 6). Afterwards, promising individuals will pass onto the next generation via Algorithm 3 (line 7). Finally, we update the STR in each generation via STR = Num_STG/NP, where Num_STG denotes the number of stagnant individuals in the current generation and NP represents the population size (line 8).
Algorithm 4 STMDE
Input:Population size NP; the problem dimension D; the initial STR = 0;
Output:The final population X;
1Generate the initial population via Equation (1);
2While the stopping condition is not met Do
3  Obtain the CR and F for each individual via Algorithm 1;
4  Select the appropriate p to achieve a better performance of the mutation strategy “current-to-pbest” via Algorithm 2;
5Obtain the mutant vectors via Equation (15);
6Obtain the offspring via the binomial crossover operator as shown in Equation (6);
7Select the promising individual for the next generation via Algorithm 3;
8Update STR via STR = Num_STG/NP;
9End While

3.4. Time Complexity

The time complexity of sorting fitness, the crossover rate and the scale factor is O(3 × NP × log2NP). The time complexity of calculating the STR is O(NP). Therefore, the overall overhead of the proposed mechanisms is O(3 × NP × log2NP + NP).

4. Experimental Results

To better disclose the effectiveness of the STMDE, comprehensive experiments with the baseline and five competitive DE variants are implemented. Further, each component of the STMDE is also investigated to distinguish their contribution. All the comparative tests are carried out on the testsuite CEC2017 [21] with 51 independent runs to obtain the mean value and the standard deviation of solution error (SR). The measurement of performance is defined as the fitness difference between the best solution xb found with 104 × D function evaluations and the global optimum x*, which can be described as SR = f(xb) − f(x*). Apart from the experiments on CEC2017, the competitiveness of handling a practical optimization problem from the CEC2011 [22] is also investigated.
To demonstrate the efficacy of the STMDE straightforwardly, a Wilcoxon rank-sum test [19] with a 5% significance level is introduced, in which the symbols “+”, “=” and “−” denote that the STMDE is superior (i.e., win, W), similar (i.e., tie, T) and inferior (i.e., lose, L) to the compared algorithm, respectively. All the experiments are carried out via MATLAB R2022b (MathWorks Inc., Natick, MA, USA) on a 3.6 GHz PC with 32GB RAM and an AMD Ryzen 7 3700X 8-Core processor in the Windows 10 edition.

4.1. Performance Comparison with Baseline

The performance comparison with the baseline on 30-D, 50-D and 100-D CEC2017 is shown in Table 1. On the whole, the STMDE performs better than the baseline on the 30-D, 50-D and 100-D test functions with the metric “W/T/L” of “19/10/0”, “19/10/0” and “14/12/3”, respectively. It can be observed that the STMDE does not lose to any test functions when the problem size is 30 or 50. With the problem size increasing, the performance of the STMDE degrades slightly. To be specific, the STMDE is inferior to three benchmark functions, namely F3, F12 and F15. When the stagnation lasts for a long period, the GBS may encourage the population to approach the best individual in the current generation. Therefore, the STMDE may converge to the local optimum on some test functions with multiple local optima that are far from the global optimum.
From the perspective of function properties, the STMDE excels in simple multi-modal (F4~F10), hybrid (F11~F20) and composition (F21~F30) functions. To be specific, the STMDE is superior to SHADE on five, five and four simple multi-modal functions and performs similarly on others when the problem size is 30, 50 and 100, respectively. The STMDE is advantaged over all 30-D hybrid functions other than F12. In the 50-D hybrid functions, the STMDE shows a similar performance with SHADE on F12 and F18, while it is better than SHADE on the rest of hybrid functions. With the problem size increasing, the STMDE can search for better solutions on F11, F17 and F20 and lose to SHADE on F12 and F15. On all considered composition functions, the STMDE is more competitive than SHADE in 16 functions and is similar on the others.
The reason why the STMDE can achieve a better performance than SHADE on complicated optimization problems is that the STMDE can identify the stagnation in a timely manner and adjust the control parameters and the greediness parameter to produce promising offspring. Further, when the individual traps into the stagnation for a long period, the GBS scheme takes effect to cease the stagnation, which enables limited computational resources to be allocated to potential individuals. However, stagnation seldom happens on unimodal functions, especially when the problem size is relatively small. Therefore, the proposed STMDE shows no advantage over SHADE on 30-D unimodal functions while the superiority can be observed on 50-D F1 and 100-D F1.

4.2. Performance Comparison with State-of-the-Art DEs

To investigate the performance of the proposed STMDE, performance comparisons with five state-of-the-art (SOTA) DEs on 30-D, 50-D and 100-D CEC2017 benchmark functions are given in Table 2, Table 3 and Table 4. The five SOTA DEs are ACos-JADE, IMPEDE, Db-SHADE, PFI-SHADE and CUSDE, which are described briefly as follows.
  • ACos-JADE [23]: This this DE variant incorporates the original and eigen coordinate systems to enhance the JADE.
  • IMPEDE [6]: this DE variant is based on multiple swarms and takes advantage of inferior individuals to produce promising offspring.
  • Db-SHADE [10]: this DE variant adjusts the weighted factor for control parameters based on the Euclidean distance to enhance the SHADE.
  • PFI-SHADE [11]: This this DE variant takes the population feature information into account to achieve effective adjustment for control parameters.
  • CUSDE [24]: This this DE variant utilize the number of consecutively fail updates to lead the following evolution.

4.2.1. Performance Comparison with SOTA DEs on 30-D Test Functions

We investigate the performance of the STMDE on 30-D CEC2017 functions. It can be observed that the STMDE prevails over compared DE variants with the metric “W/L” of “18/5”, “19/2”, “12/1”, “20/0” and “19/7”, respectively. It is worth mentioning that the STMDE does not lose to PFI-SHADE in any cases. Compared with ACos-JADE, the STMDE shows advantages in dealing with hybrid functions with eight cases winning and none of the cases losing. In comparison to IMPEDE, the STMDE can achieve better or at least similar performance, except for with the F6 and F9. Compared to Db-SHADE, the STMDE is more competitive in handling simple multi-modal functions with five of the cases winning and none of the cases losing out of the seven cases. Compared with PFI-SHADE, the STMDE shows superiority in each kind of test function, especially in unimodal function, simple multi-modal functions and hybrid functions. To be specific, the STMDE achieves a better performance than PFI-SHADE in all unimodal functions. Further, the STMDE performs more competitively than PFI-SHADE in five multi-modal functions, eight hybrid functions and five composition functions. Compared with CUSDE, the STMDE is more advantaged on hybrid functions. Concretely, the STMDE achieves a better performance than CUSDE on all hybrid functions other than F20.
Overall, the STMDE performs better when encountering optimization problems that are difficult to handle, such as hybrid functions and composition functions. In complex optimization problems, the probability of trapping into stagnation is relatively high, while the STMDE can avoid stagnation via enhanced mutation and selection operators.
Table 2. Performance comparison with the SOTA DEs on 30-D CEC2017.
Table 2. Performance comparison with the SOTA DEs on 30-D CEC2017.
ACos-JADEIMPEDEDb-SHADEPFI-SHADECUSDESTMDE
meanstdsigmeanstdsigmeanstdsigmeanstdsigmeanstdsigmeanstd
30-DF15.57 × 10−162.79 × 10−159.47 × 10−156.77 × 10−15=7.24 × 10−157.17 × 10−15=1.23 × 10−144.94 × 10−15+9.47 × 10−156.77 × 10−15=8.36 × 10−157.06 × 10−15
F30.00 × 1000.00 × 1001.19 × 10−68.35 × 10−6+6.80 × 10−142.55 × 10−14=1.40 × 1031.00 × 104+1.16 × 1018.79 × 100+6.58 × 10−142.38 × 10−14
F45.34 × 1011.94 × 101=4.67 × 1012.42 × 101=5.56 × 1011.41 × 101=5.53 × 1011.40 × 101=5.92 × 1011.81 × 100=5.66 × 1011.16 × 101
F52.50 × 1013.96 × 100+4.09 × 1015.16 × 100+1.43 × 1013.02 × 100+1.41 × 1012.49 × 100+1.79 × 1021.02 × 101+1.17 × 1013.48 × 100
F64.57 × 10−137.47 × 10−131.75 × 10−81.83 × 10−87.95 × 10−61.43 × 10−5+3.20 × 10−58.74 × 10−5+1.15 × 10−82.09 × 10−84.95 × 10−61.22 × 10−5
F75.42 × 1014.19 × 100+7.51 × 1015.59 × 100+4.55 × 1013.24 × 100+4.44 × 1012.70 × 100+2.08 × 1021.17 × 101+4.08 × 1013.88 × 100
F82.37 × 1014.44 × 100+3.99 × 1014.33 × 100+1.56 × 1012.70 × 100+1.55 × 1012.66 × 100+1.76 × 1027.26 × 100+1.13 × 1013.33 × 100
F91.59 × 10−26.95 × 10−21.24 × 10−26.55 × 10−22.12 × 10−28.01 × 10−2=4.25 × 10−21.19 × 10−1=4.46 × 10−152.23 × 10−141.23 × 10−23.11 × 10−2
F101.95 × 1032.33 × 102+3.14 × 1032.62 × 102+1.71 × 1032.47 × 102+1.68 × 1032.05 × 102+6.80 × 1032.80 × 102+1.38 × 1033.65 × 102
F112.43 × 1011.94 × 101+2.95 × 1011.89 × 101+2.98 × 1012.73 × 101=2.94 × 1012.36 × 101+5.25 × 1012.39 × 101+2.27 × 1012.31 × 101
F121.26 × 1034.59 × 102=1.06 × 1033.47 × 102=1.24 × 1033.69 × 102=1.14 × 1033.74 × 102=7.15 × 1036.20 × 103+1.10 × 1034.10 × 102
F136.62 × 1014.98 × 101+5.20 × 1013.59 × 101+2.67 × 1011.05 × 101=3.60 × 1011.80 × 101+8.01 × 1019.57 × 100+2.39 × 1019.97 × 100
F142.47 × 1015.16 × 100+3.34 × 1013.40 × 100+2.59 × 1012.62 × 100+2.94 × 1016.02 × 100+6.21 × 1015.86 × 100+2.37 × 1014.49 × 100
F151.97 × 1011.28 × 101+1.36 × 1011.02 × 101+1.18 × 1018.57 × 100=2.21 × 1011.48 × 101+3.73 × 1014.45 × 100+9.05 × 1004.56 × 100
F162.76 × 1021.56 × 102=4.34 × 1021.43 × 102+2.95 × 1021.31 × 102=2.35 × 1021.41 × 102=5.86 × 1024.12 × 102+2.52 × 1021.38 × 102
F176.38 × 1012.61 × 101+1.02 × 1021.53 × 101+5.28 × 1012.61 × 101+4.64 × 1011.04 × 101+7.38 × 1017.69 × 100+3.55 × 1019.66 × 100
F183.36 × 1011.20 × 101+2.67 × 1012.79 × 100=3.55 × 1012.37 × 101=7.27 × 1015.90 × 101+3.65 × 1013.94 × 100+2.80 × 1018.17 × 100
F191.24 × 1014.58 × 100+1.39 × 1011.97 × 100+8.27 × 1001.97 × 100+1.41 × 1011.02 × 101+1.33 × 1015.01 × 100+7.39 × 1002.12 × 100
F201.10 × 1025.54 × 101+1.22 × 1024.13 × 101+7.68 × 1015.11 × 101+5.15 × 1012.93 × 101+2.92 × 1013.16 × 1015.64 × 1015.42 × 101
F212.26 × 1024.40 × 100+2.40 × 1025.29 × 100+2.17 × 1023.56 × 100+2.16 × 1023.28 × 100+3.65 × 1021.06 × 101+2.13 × 1024.01 × 100
F221.01 × 1024.14 × 100=1.00 × 1021.24 × 10−13=1.00 × 1028.92 × 10−14=1.00 × 1021.37 × 10−13=1.00 × 1021.75 × 10−13=1.00 × 1026.39 × 10−14
F233.72 × 1026.46 × 100+3.89 × 1025.95 × 100+3.63 × 1024.70 × 100+3.64 × 1025.35 × 100+5.19 × 1021.07 × 101+3.60 × 1024.91 × 100
F244.39 × 1025.17 × 100+4.55 × 1025.28 × 100+4.36 × 1023.73 × 100=4.35 × 1023.45 × 100=5.88 × 1029.15 × 100+4.35 × 1026.18 × 100
F253.87 × 1027.56 × 10−2=3.87 × 1021.15 × 10−1+3.87 × 1023.85 × 10−23.87 × 1023.63 × 10−1+3.87 × 1022.19 × 10−23.87 × 1025.10 × 10−2
F261.18 × 1038.10 × 101+1.14 × 1033.37 × 102+1.06 × 1035.53 × 101=1.08 × 1035.60 × 101=2.46 × 1031.52 × 102+1.08 × 1038.15 × 101
F274.99 × 1029.69 × 1005.02 × 1026.58 × 100=5.04 × 1026.13 × 100=5.05 × 1026.91 × 100=4.88 × 1027.73 × 1005.05 × 1025.52 × 100
F283.38 × 1025.73 × 101=3.30 × 1024.90 × 101=3.26 × 1025.18 × 101=3.47 × 1025.73 × 101=3.17 × 1024.00 × 1013.41 × 1025.41 × 101
F294.77 × 1023.32 × 101+5.20 × 1022.71 × 101+4.57 × 1022.00 × 101+4.60 × 1023.11 × 101+5.35 × 1021.07 × 102+4.47 × 1021.90 × 101
F302.16 × 1031.67 × 102+2.06 × 1031.63 × 102=2.06 × 1031.32 × 102=2.13 × 1031.39 × 102+2.00 × 1036.46 × 1012.04 × 1037.55 × 101
W/T/L18/6/519/8/212/16/120/9/019/3/7

4.2.2. Performance Comparison with SOTA DEs on 50-D Test Functions

The performance of the STMDE on 50-D CEC2017 functions is investigated in this subsection. On the whole, the STMDE is advantaged over the five SOTA DEs. To be specific, the STMDE shows superiority over ACos-JADE, IMPEDE, Db-SHADE, PFI-SHADE and CUSDE on 22, 19, 10, 16 and 21 functions while performing worse on 4, 6, 4, 0, 8 functions. With respect to the function properties, the advantage is more significant in simple multi-modal functions and composition functions. On the one hand, the STMDE can achieve a better performance on 5, 5, 4, 5 and 5 functions compared to ACos-JADE, IMPEDE, Db-SHADE, PFI-SHADE and CUSDE out of seven simple multi-modal functions. On the other hand, the STMDE does not lose in any composition functions in comparison to ACos-JADE, IMPEDE and PFI-SHADE.
In summary, the STMDE shows advantages over compared DE variants in optimization problems with high complexity. When a large number of local optima exist, the searching process is hindered and stagnation happens, while the STMDE can generate appropriate control parameters and greediness parameters for each individual, which is beneficial to avoid the stagnation. In addition, the STMDE can also cease stagnation effectively by abandoning the stagnant one and generating a new one to replace it. It is worth noting that the new offspring may approach the best individual of the current population, which ensures their convergence.
Table 3. Performance comparison with the SOTA DEs on 50-D CEC2017.
Table 3. Performance comparison with the SOTA DEs on 50-D CEC2017.
ACos-JADEIMPEDEDb-SHADEPFI-SHADECUSDESTMDE
meanstdsigmeanstdsigmeanstdsigmeanstdsigmeanstdsigmeanstd
50-DF11.25 × 10−144.62 × 10−153.91 × 10−81.09 × 10−7+3.85 × 10−141.80 × 10−14=4.54 × 10−141.73 × 10−14+1.90 × 1025.43 × 102+3.76 × 10−141.33 × 10−14
F34.68 × 10−142.19 × 10−142.09 × 10−11.03 × 100+3.07 × 10−137.80 × 10−142.56 × 1031.83 × 104=5.60 × 1041.13 × 104+4.24 × 10−132.50 × 10−13
F44.79 × 1014.59 × 101=6.48 × 1014.70 × 101+4.79 × 1014.82 × 101=5.85 × 1015.12 × 101=7.53 × 1014.82 × 101+4.63 × 1014.26 × 101
F55.77 × 1018.60 × 100+1.16 × 1028.73 × 100+3.15 × 1014.16 × 100+3.10 × 1014.92 × 100=3.51 × 1021.43 × 101+2.83 × 1018.71 × 100
F67.00 × 10−54.54 × 10−42.79 × 10−62.76 × 10−62.04 × 10−41.78 × 10−45.47 × 10−34.11 × 10−3+2.55 × 10−89.14 × 10−86.67 × 10−46.68 × 10−4
F79.96 × 1018.73 × 100+1.85 × 1021.14 × 101+8.03 × 1014.76 × 100+8.10 × 1015.14 × 100+4.01 × 1021.50 × 101+7.50 × 1017.02 × 100
F85.38 × 1019.13 × 100+1.19 × 1027.36 × 100+3.27 × 1015.13 × 100+3.06 × 1015.15 × 100+3.53 × 1021.40 × 101+2.92 × 1011.12 × 101
F97.99 × 10−17.29 × 10−1+2.83 × 10−14.49 × 10−14.28 × 10−14.23 × 10−1=1.93 × 1001.39 × 100+5.87 × 10−22.55 × 10−14.82 × 10−14.95 × 10−1
F103.82 × 1033.62 × 102+6.88 × 1032.99 × 102+3.34 × 1032.91 × 102+3.38 × 1032.64 × 102+1.30 × 1043.27 × 102+2.73 × 1034.26 × 102
F111.54 × 1023.79 × 101+1.05 × 1022.92 × 101=9.54 × 1012.82 × 1011.41 × 1023.88 × 101+1.34 × 1023.36 × 101+1.08 × 1022.65 × 101
F123.89 × 1033.31 × 1031.66 × 1041.43 × 104+7.13 × 1034.70 × 103=5.02 × 1033.21 × 103=5.61 × 1043.32 × 104+6.13 × 1034.55 × 103
F137.62 × 1026.12 × 102+2.04 × 1024.24 × 101+1.33 × 1025.37 × 101=2.57 × 1022.20 × 102+2.63 × 1026.90 × 101+1.38 × 1028.51 × 101
F142.34 × 1026.21 × 101+7.15 × 1011.19 × 1011.00 × 1024.30 × 101=2.07 × 1026.68 × 101+1.27 × 1026.95 × 100+8.87 × 1013.36 × 101
F154.03 × 1021.32 × 102+6.30 × 1013.18 × 1011.66 × 1028.70 × 101=3.09 × 1021.56 × 102+1.07 × 1028.50 × 1001.43 × 1027.94 × 101
F167.11 × 1022.08 × 102=1.13 × 1031.61 × 102+7.70 × 1021.46 × 102+6.71 × 1021.67 × 102=2.32 × 1037.56 × 102+6.31 × 1022.22 × 102
F175.73 × 1021.20 × 102+8.31 × 1021.16 × 102+5.02 × 1021.20 × 102+5.33 × 1021.44 × 102+1.22 × 1035.33 × 102+4.42 × 1021.35 × 102
F183.18 × 1021.06 × 102+9.22 × 1018.88 × 1011.75 × 1021.08 × 102=2.08 × 1021.17 × 102=4.90 × 1023.99 × 102+1.74 × 1021.10 × 102
F191.52 × 1025.57 × 101+4.06 × 1011.11 × 1011.16 × 1024.33 × 101+1.47 × 1024.00 × 101+6.15 × 1018.63 × 1009.69 × 1013.87 × 101
F204.58 × 1021.35 × 102+6.22 × 1021.04 × 102+3.19 × 1021.11 × 102=3.17 × 1021.19 × 102=7.94 × 1024.66 × 102+3.16 × 1021.57 × 102
F212.55 × 1029.74 × 100+3.16 × 1028.85 × 100+2.33 × 1027.25 × 100+2.32 × 1023.83 × 100+5.54 × 1021.59 × 101+2.31 × 1028.33 × 100
F223.86 × 1031.56 × 103+4.32 × 1033.27 × 103+2.79 × 1031.76 × 103+3.30 × 1031.60 × 103+1.10 × 1044.78 × 103+2.44 × 1031.52 × 103
F234.77 × 1021.23 × 101+5.44 × 1021.14 × 101+4.58 × 1028.58 × 100=4.56 × 1027.65 × 100=7.70 × 1021.77 × 101+4.57 × 1021.32 × 101
F245.45 × 1028.57 × 100+5.98 × 1027.56 × 100+5.30 × 1027.22 × 100=5.30 × 1025.90 × 100=8.37 × 1021.40 × 101+5.33 × 1029.59 × 100
F255.26 × 1023.75 × 101=5.19 × 1023.29 × 101=5.02 × 1023.38 × 1015.13 × 1023.53 × 101=4.92 × 1022.82 × 1015.25 × 1023.43 × 101
F261.63 × 1031.17 × 102+2.10 × 1031.30 × 102+1.40 × 1039.28 × 101=1.41 × 1039.73 × 101=4.16 × 1035.53 × 102+1.44 × 1031.10 × 102
F275.67 × 1023.96 × 101+5.78 × 1026.19 × 101+5.41 × 1023.40 × 101=5.58 × 1023.20 × 101+5.07 × 1021.11 × 1015.33 × 1021.31 × 101
F284.90 × 1022.19 × 101+4.89 × 1022.29 × 101=4.82 × 1022.41 × 101=4.87 × 1022.36 × 101=4.70 × 1022.07 × 1014.80 × 1022.40 × 101
F294.86 × 1027.34 × 101+6.27 × 1027.21 × 101+4.23 × 1027.72 × 101+4.45 × 1028.37 × 101+7.39 × 1024.12 × 102+4.04 × 1027.97 × 101
F307.73 × 1051.53 × 105+6.91 × 1059.01 × 104=6.93 × 1058.73 × 104=6.93 × 1058.62 × 104=5.86 × 1051.45 × 1046.68 × 1058.37 × 104
W/T/L22/3/419/4/610/15/416/13/021/0/8

4.2.3. Performance Comparison with SOTA DEs on 100-D Test Functions

We investigate the performance of the STMDE on 100-D CEC2017 functions and the experimental results are given in Table 4. It can be observed that the STMDE is still superior in handling high-dimension optimization problems on the whole. When compared to ACos-JADE, IMPEDE, Db-SHADE, PFI-SHADE and CUSDE, the performance metric “W/L” is “19/6”, “21/7”, “8/7”, “16/2” and “23/4”, respectively. From the perspective of the function property, the STMDE shows advantages in handling simple multi-modal functions and composition function. On the one hand, with respect to simple multi-modal functions, the STMDE outperforms ACos-JADE, IMPEDE and CUSDE in five simple multi-modal functions. When compared with PFI-SHADE, the STMDE shows superiority in four test functions and loses in none of them. In comparison to Db-SHADE, the searching capacity is similar. On the other hand, with respect to composition functions, the STMDE shows advantages over compared DE variants on eight, nine, five, five, and seven test functions successively. Especially, the performance of the STMDE is not inferior to IMPEDE and PFI-SHADE on any benchmark functions.
Table 4. Performance comparison with the SOTA DEs on 100-D CEC2017.
Table 4. Performance comparison with the SOTA DEs on 100-D CEC2017.
ACos-JADEIMPEDEDb-SHADEPFI-SHADECUSDESTMDE
meanstdsigmeanstdsigmeanstdsigmeanstdsigmeanstdsigmeanstd
100-DF12.70 × 10−143.82 × 10−141.84 × 10−53.20 × 10−5+2.44 × 10−118.79 × 10−112.50 × 10−104.58 × 10−10+7.05 × 1036.93 × 103+4.94 × 10−111.59 × 10−10
F35.68 × 10−140.00 × 1005.11 × 1029.94 × 102+1.05 × 1047.53 × 1048.03 × 1035.73 × 1043.13 × 1053.55 × 104+2.62 × 10−31.14 × 10−2
F42.42 × 1015.72 × 1011.60 × 1024.77 × 101+1.32 × 1027.56 × 101=1.28 × 1026.61 × 101=2.07 × 1022.70 × 101+1.27 × 1026.95 × 101
F51.89 × 1022.34 × 101+3.38 × 1022.26 × 101+9.43 × 1011.14 × 101=9.92 × 1011.43 × 101=8.19 × 1021.80 × 101+9.98 × 1011.52 × 101
F66.09 × 10−29.80 × 10−2=4.66 × 10−39.42 × 10−31.31 × 10−29.87 × 10−37.24 × 10−12.80 × 10−1+6.11 × 10−41.30 × 10−32.77 × 10−22.29 × 10−2
F72.97 × 1022.24 × 101+4.83 × 1022.61 × 101+1.99 × 1021.35 × 101=2.33 × 1022.27 × 101+9.31 × 1022.40 × 101+1.94 × 1021.79 × 101
F81.85 × 1022.55 × 101+3.22 × 1021.50 × 101+9.53 × 1011.40 × 101=9.89 × 1011.09 × 101=8.20 × 1021.81 × 101+9.63 × 1011.76 × 101
F91.50 × 1021.63 × 102+7.75 × 1003.76 × 1001.35 × 1014.84 × 100=1.40 × 1026.21 × 101+6.35 × 1009.73 × 1001.46 × 1017.64 × 100
F101.10 × 1046.54 × 102+1.79 × 1044.20 × 102+9.24 × 1035.10 × 102+9.31 × 1035.91 × 102+2.95 × 1045.43 × 102+8.27 × 1039.30 × 102
F111.08 × 1032.10 × 102+7.78 × 1022.33 × 1021.03 × 1032.24 × 102+1.08 × 1032.77 × 102+6.07 × 1026.17 × 1018.81 × 1022.42 × 102
F121.60 × 1048.46 × 1037.39 × 1043.14 × 104+1.89 × 1041.01 × 1041.97 × 1041.25 × 1042.39 × 1058.78 × 104+2.37 × 1049.06 × 103
F133.65 × 1033.76 × 103+2.52 × 1032.04 × 103+1.01 × 1031.65 × 103=7.38 × 1024.29 × 102+4.40 × 1035.59 × 103+3.31 × 1021.69 × 102
F145.65 × 1021.22 × 102=4.37 × 1028.94 × 1016.01 × 1022.02 × 102=6.35 × 1021.82 × 102+7.62 × 1039.63 × 103+5.50 × 1021.17 × 102
F153.66 × 1026.95 × 101=3.29 × 1028.72 × 1013.76 × 1021.45 × 102=3.62 × 1028.15 × 101=2.01 × 1032.52 × 103+4.49 × 1022.28 × 102
F162.49 × 1033.31 × 102+3.70 × 1032.64 × 102+2.33 × 1033.47 × 102=2.30 × 1033.97 × 102=7.39 × 1032.98 × 102+2.34 × 1034.31 × 102
F171.94 × 1032.69 × 102+2.67 × 1032.83 × 102+1.77 × 1032.42 × 102=1.83 × 1032.53 × 102+4.44 × 1037.76 × 102+1.65 × 1033.72 × 102
F183.01 × 1029.51 × 1014.92 × 1023.13 × 1022.13 × 1032.70 × 103=1.51 × 1039.10 × 102=1.08 × 1056.64 × 104+2.08 × 1032.04 × 103
F191.39 × 1032.41 × 103+2.22 × 1024.99 × 1012.47 × 1025.05 × 101=3.29 × 1023.45 × 102+3.03 × 1033.78 × 103+2.41 × 1025.01 × 101
F202.05 × 1032.74 × 102+2.73 × 1032.12 × 102+1.73 × 1032.25 × 102+1.70 × 1032.35 × 102+4.41 × 1037.05 × 102+1.57 × 1033.65 × 102
F214.01 × 1021.93 × 101+5.44 × 1021.94 × 101+3.28 × 1021.36 × 101=3.24 × 1021.02 × 101=1.05 × 1032.74 × 101+3.25 × 1021.51 × 101
F221.24 × 1045.77 × 102+1.86 × 1042.14 × 103+1.03 × 1041.53 × 103+1.07 × 1045.61 × 102+3.02 × 1044.16 × 102+9.78 × 1031.27 × 103
F236.53 × 1021.73 × 101+8.08 × 1021.56 × 101+6.08 × 1021.52 × 101+6.04 × 1021.48 × 101+7.31 × 1022.40 × 102+5.98 × 1021.95 × 101
F241.04 × 1033.06 × 101+1.18 × 1031.98 × 101+9.83 × 1022.30 × 1019.92 × 1022.38 × 101=1.44 × 1032.99 × 102+1.00 × 1032.20 × 101
F257.51 × 1026.06 × 101=7.49 × 1024.90 × 101=7.22 × 1024.90 × 101=7.39 × 1025.76 × 101=7.45 × 1024.27 × 101=7.40 × 1024.27 × 101
F264.82 × 1033.48 × 102+6.02 × 1032.98 × 102+4.15 × 1032.00 × 1024.26 × 1032.42 × 102=6.34 × 1033.30 × 103=4.28 × 1032.47 × 102
F277.58 × 1024.31 × 101+6.72 × 1022.76 × 101+6.58 × 1022.38 × 101+6.88 × 1023.15 × 101+5.94 × 1021.97 × 1016.47 × 1022.51 × 101
F284.02 × 1021.22 × 1025.52 × 1022.28 × 101+5.13 × 1024.99 × 1015.20 × 1022.42 × 101=5.50 × 1023.51 × 101+5.32 × 1023.00 × 101
F292.36 × 1032.71 × 102+2.78 × 1032.42 × 102+2.09 × 1032.96 × 102+2.08 × 1032.71 × 102+3.96 × 1031.47 × 103+1.91 × 1032.94 × 102
F304.06 × 1032.29 × 103+3.03 × 1038.21 × 102+2.63 × 1032.05 × 102+3.12 × 1031.04 × 103+3.66 × 1031.54 × 103+2.53 × 1031.86 × 102
W/T/L19/4/621/1/78/14/716/11/223/2/4
From Table 2, Table 3 and Table 4, we can observe that the performance advantages degrade to some extend when the problem size increases. However, the STMDE is still better than the compared DE variants on the whole when the problem size is relatively high. Obviously, the STMDE benefits from the reasonable adjustment for parameters and the enhanced selection operation, which does not treat fitness as the only metric when the stagnation lasts for a long period.

4.2.4. Performance Rankings of STMDE and Compared DE Variants

We deploy the Friedman test [25] to verify the performance of the STMDE in this subsection, which is shown in Figure 1. It can be observed that the proposed STMDE performs best among all compared algorithms with the smallest performance ranking, namely 2.21. To show the statistical significance more clearly, we also present the critical difference diagram [26]. The critical difference diagram as shown in Figure 2 discloses that the STMDE is the most powerful optimization algorithm among all compared DE variants.

4.2.5. Experimental Time Complexity

The experimental time complexity is disclosed in this subsection. Firstly, the running time for the standard program T0 is recorded. Further, the evaluation time of F18 for 200,000 times is denoted as T1. Thirdly, the optimization time for F18 via the STMDE and its compared DE variants with the FES of 20,000 is denoted as T2. To make the time complexity convinced, we implement five independent runs to obtain the average optimization time T ¯ 2 . Finally, the experimental time complexity can be calculated by ( T ¯ 2 T 1 ) / T 0 . Herein, the 30-D optimization problems are adopted to investigate the experimental time complexity.
For completeness, the standard program for obtaining T0 is given as follows.
For i = 1:1,000,000
 x = 0.55;
 x = x + x; x = x/2; x = x ∗ x; x = sqrt(x);
 x = log(x); x = exp(x); x = x/(x + 2);
End For
T0 and T1 are 0.01 s and 0.87 s, respectively. From Figure 3, we can observe that ACos-JADE is the most time-consuming while CUSDE requires the least running time. The time complexity of the proposed STMDE is 31, which is second to IMPEDE with 85. The optimization time of Db-SHADE and PFI-SHADE are 20 and 27, respectively.

4.2.6. Effectiveness of Mechanisms

We develop three variants to investigate the effectiveness of the three novel mechanisms, which are illustrated as follows.
(1)
Variant 1: deactivate the CPSR scheme and other processes are the same as the STMDE;
(2)
Variant 2: deactivate the GPSR scheme and other processes are the same as the STMDE;
(3)
Variant 3: deactivate the GBS scheme and other processes are the same as the STMDE.
The overall experimental results of comparing the STMDE with three variants in the 30-D CEC2017 test suite are given in Table 5. In comparison with Variant1, Variant2 and Variant3, the performance metric “W/L” of the STMDE are “15/1”, “13/1” and “12/1”, respectively, which illustrates the effectiveness of the CPSR, GPSR and GBS schemes. From the perspective of function property, the CPSR, GPSR and GBS schemes are beneficial for accelerating the optimization of simple multi-modal functions, hybrid functions and composition functions. To be specific, the CPSR scheme contributes more greatly to hybrid functions with the metric “W/L” of “7/0”. Further, the GPSR and GBS schemes are more powerful in handling simple multi-modal functions with six and five cases winning respectively out of seven test functions and none of the cases losing.
The performance of three proposed schemes in unimodal functions is relatively insignificant due to the fact that such kinds of optimization problems are tractable and stagnation hardly happens.

4.2.7. Convergence Graphics

The convergence graphics of the STMDE and five SOTA DEs in 30-D test functions are given in Figure 4, which includes simple multi-modal function (F5), hybrid functions (F15 and F17) and composition function (F29). On the whole, the STMDE can obtain smaller error values than compared DE variants. On the 30-D F5, the STMDE shows advantage over others when the FES is larger than 1 × 105 while ACos-JADE, Db-SHADE and PFI-SHADE can achieve better performance in the early evolutionary stage. On the 30-D F15, the STMDE achieves similar performance to Db-SHADE while PFI-SHADE, CUSDE and PaDE outperform the STMDE in the preliminary stage. Along with evolution, the STMDE converges more effectively. On the 30-D F17, the STMDE ranks fourthly when the FES is less than 1.5 × 105, while it achieves a better converged population than any DE variant when the FES increases to 2.5 × 105. On the 30-D F29, the STMDE shows competitiveness when the FES is more abundant. To be specific, the STMDE achieves the smallest error value when the FES is larger than 1.5 × 105.
In general, the STMDE is more competitive in the later evolutionary stage. The reason can be summarized as follows. On the one hand, the adaptation of control parameters can be more appropriate with the successful memory considered. On the other hand, stagnation may occur frequently in the later evolutionary stage. The STMDE can adjust both control parameters and the greediness parameter to meet the optimization requirement disclosed by the stagnation ratio. In addition, the GBS scheme of the STMDE can cease the stagnation effectively. To this end, the STMDE can converge fast during the later evolution period.

4.2.8. Box Plots of Error

To show the performance comparisons of the proposed STMDE and its compared DE variants more straightforwardly, the box plots of error on four simple multi-modal functions (30-D F5, 30-D F7, 30-D F8 and 30-D F10), three hybrid functions (30-D F14, 30-D F17 and 30-D F19) and three composition functions (30-D F21, 30-D F23 and 30-D F29) are shown in Figure 5. It can be observed that the proposed STMDE converges better on F5, F8, F14, F21 and F29. In addition, the mean error and median error achieved by the STMDE is smaller than that of other DE variants. The reason why the STMDE achieves better performance is that it adopts effective parameter adaptation schemes based on the detection of stagnation. When most of the individuals tend to be stagnant, exploration is preferred. To this end, larger control parameters and greediness parameter are advocated. In addition, when the individual is trapped into stagnation for a long time, new offspring is generated to replace the stagnant one, which can terminate the stagnation and force evolution, but without the extra consumption of fitness evaluation.

4.2.9. The Analysis of Parameter Sensitivity

In this subsection, the parameter sensitivity is analyzed, including DCcr (as shown in Figure 6), DCf (as shown in Figure 7), T (as shown in Figure 8) and gp (as shown in Figure 9). 30-D benchmark functions from the CEC2017 test suite are utilized to investigate the parameter sensitivity. In addition, the Friedman test is implemented to figure out the performance rankings for different settings of parameters.
(1)
To investigate the parameter sensitivity of DCcr, the GBS scheme is deactivated. From Figure 6, it can be observed that a similar performance is achieved when the DCcr is 0.55/0.45, 0.60/0.40 and 0.65/0.35 (Note: the DCcr is 0.55/0.45 when the STR is larger than 0.5. And the setting is 0.45/0.55 when the STR is smaller than 0.5). Therefore, it is feasible to select one of the settings from 0.55/0.45, 0.60/0.40 and 0.65/0.35. It is worth mentioning that 0.55/0.45 is adopted in the STMDE.
(2)
Similarly, the parameter sensitivity of DCf is investigated via deactivating the GBS scheme. From Figure 7, similar performances can be observed when the DCf is 0.60/0.40, 0.65/0.35 and 0.70/0.30 (Note: the DCf is 0.60/0.40 when the STR is larger than 0.5. And the setting is 0.40/0.60 when the STR is smaller than 0.5). Therefore, it is reasonable to select one of the settings from 0.60/0.40, 0.65/0.35 and 0.70/0.30. It is worth mentioning that 0.60/0.40 is adopted in the STMDE.
(3)
To investigate the parameter sensitivity of threshold T, the PASR is deactivated. From Figure 8, it can be observed that the best performance is obtained when the threshold T is 128.
(4)
Apart from the threshold T, the parameter gp of the GBS scheme is also discussed in this subsection. It can be observed from Figure 9 that the performance rankings are similar when the values of gp are 0.5 and 0.7. In this paper, we set the gp as 0.7 when implementing the STMDE.

4.3. Performance Comparison on the Real-World Optimization Problem

The performance of the STMDE and its compared DE variants on handling the real-world optimization problem from the CEC2011 test suite [22] is investigated. The selected practical problem is spread spectrum radar polly phase code design (Problem No. 7 of the CEC2011 test suite), which includes numerous local optima and is piecewise smooth. The simulation results are presented as follows.
From Table 6, it can be observed that the STMDE can achieve a better performance than all the other compared DE variants when the maximal number of the fitness evaluation is 1 × 105 or 1.5 × 105. In the preliminary evolution period, stagnation hardly happens, while both the mutation and selection of the STMDE focuses on eliminating the stagnation and forcing evolution. Therefore, the advantage of the STMDE may not be significant in the early stage. However, the population may tend to be stagnant or be trapped into premature convergence along with the increase of generation. Therefore, the STMDE outperforms other competitive DE variants.

5. Conclusions

Aiming to cope with the stagnation frequently happening in the DE, we propose the CPSR scheme first, which includes the adjustment for the scale factor F and the crossover rate CR. Further, we propose the GPSR scheme to tune the greediness parameter p. The reasonable parameters adaptation benefits from the acquisition of the evolutionary state, which is revealed by the stagnation ratio STR. Apart from the effective mutation process, sensible selection can also help it to avoid stagnation. However, some parents may not be capable of producing promising offspring anymore. To this end, reproducing offspring for such kinds of parent can allow the skipping of greedy selection, in that the newly generated offspring can enter into the next generation without fitness evaluation. With the CPSR, GPSR and GBS schemes, the STMDE can achieve a more competitive performance, which has been verified via the substantial experiments implemented in the CEC2017. The effectiveness of the STMDE in handling a real-world optimization problem has also been testified by comparing it to competitive DE variants on the spread spectrum radar polly phase code design.

Author Contributions

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

Funding

This research was funded by the Applied Science and Technology Research and Development Special Fund Project of Guangdong Province (No. 2016B010126004) and the National Special Project Number for International Cooperation (No. 2015DFR11050).

Data Availability Statement

No data supporting reported results are disclosed.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Storn, R.; Price, K. Differential evolution—A simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optm. 1997, 11, 341–359. [Google Scholar] [CrossRef]
  2. Zhang, J.; Sanderson, A.C. JADE: Adaptive differential evolution with optional external archive. IEEE Trans. Evol. Comput. 2009, 13, 945–958. [Google Scholar] [CrossRef]
  3. Tanabe, R.; Fukunaga, A. Success-history based parameter adaptation for differential evolution. In Proceedings of the 2013 IEEE Congress on Evolutionary Computation, Cancun, Mexico, 20–23 June 2013; pp. 71–78. [Google Scholar]
  4. Meng, Z.; Yang, C. Hip-DE: Historical population based mutation strategy in differential evolution with parameter adaptive mechanism. Inf. Sci. 2021, 562, 44–77. [Google Scholar] [CrossRef]
  5. Li, S.; Gu, Q.; Gong, W.; Ning, B. An enhanced adaptive differential evolution algorithm for parameter extraction of photovoltaic models. Energy Convers. Manag. 2020, 205, 112443. [Google Scholar] [CrossRef]
  6. Tong, L.; Dong, M.; Jing, C. An improved multi-population ensemble differential evolution. Neurocomputing 2018, 290, 130–147. [Google Scholar] [CrossRef]
  7. Gupta, S.; Su, R. An efficient differential evolution with fitness-based dynamic mutation strategy and control parameters. Knowl.-Based Syst. 2022, 251, 109280. [Google Scholar] [CrossRef]
  8. Yu, W.J.; Shen, M.; Chen, W.N.; Zhan, Z.H.; Gong, Y.J.; Lin, Y.; Zhang, J. Differential evolution with two-level parameter adaptation. IEEE Trans. Cybern. 2013, 44, 1080–1099. [Google Scholar] [CrossRef]
  9. Tang, L.; Dong, Y.; Liu, J. Differential evolution with an individual-dependent mechanism. IEEE Trans. Evol. Comput. 2014, 19, 560–574. [Google Scholar] [CrossRef]
  10. Viktorin, A.; Senkerik, R.; Pluhacek, M.; Kadavy, T.; Zamuda, A. Distance based parameter adaptation for success-history based differential evolution. Swarm Evol. Comput. 2019, 50, 100462. [Google Scholar] [CrossRef]
  11. Cao, Z.; Wang, Z.; Fu, Y.; Jia, H.; Tian, F. An adaptive differential evolution framework based on population feature information. Inf. Sci. 2022, 608, 1416–1440. [Google Scholar] [CrossRef]
  12. Stanovov, V.; Akhmedova, S.; Semenkin, E. The automatic design of parameter adaptation techniques for differential evolution with genetic programming. Knowl.-Based Syst. 2022, 239, 108070. [Google Scholar] [CrossRef]
  13. Gao, S.; Yu, Y.; Wang, Y.; Wang, J.; Cheng, J.; Zhou, M. Chaotic local search-based differential evolution algorithms for optimization. IEEE Trans. Syst. Man Cybern. Syst. 2019, 51, 3954–3967. [Google Scholar] [CrossRef]
  14. Zhao, F.; Zhao, L.; Wang, L.; Song, H. An ensemble discrete differential evolution for the distributed blocking flowshop scheduling with minimizing makespan criterion. Expert Syst. Appl. 2020, 160, 113678. [Google Scholar] [CrossRef]
  15. Zhang, G.; Xing, K.; Cao, F. Discrete differential evolution algorithm for distributed blocking flowshop scheduling with makespan criterion. Eng. Appl. Artif. Intel. 2018, 76, 96–107. [Google Scholar] [CrossRef]
  16. Tian, M.; Gao, X.; Dai, C. Differential evolution with improved individual-based parameter setting and selection strategy. Appl. Soft Comput. 2017, 56, 286–297. [Google Scholar] [CrossRef]
  17. Guo, J.; Li, Z.; Yang, S. Accelerating differential evolution based on a subset-to-subset survivor selection operator. Soft Comput. 2019, 23, 4113–4130. [Google Scholar] [CrossRef]
  18. Zhang, S.X.; Chan, W.S.; Peng, Z.K.; Zheng, S.Y.; Tang, K.S. Selective-candidate framework with similarity selection rule for evolutionary optimization. Swarm Evol. Comput. 2020, 56, 100696. [Google Scholar] [CrossRef]
  19. Zeng, Z.; Zhang, M.; Chen, T.; Hong, Z. A new selection operator for differential evolution algorithm. Knowl.-Based Syst. 2021, 226, 107150. [Google Scholar] [CrossRef]
  20. Chen, F.; Shi, J.; Ma, Y.; Lei, Y.; Gong, M. Differential evolution algorithm with learning selection strategy for SAR image change detection. In Proceedings of the 2017 IEEE Congress on Evolutionary Computation, Donostia, Spain, 5–8 June 2017; pp. 450–457. [Google Scholar]
  21. Liang, J.J.; Qu, B.Y.; Suganthan, P.N. Problem Definitions and Evaluation Criteria for the CEC 2017 Special Session and Competition on Single Objective Bound Constrained Real-Parameter Numerical Optimization; Technical Report; Nanyang Technological University Singapore: Singapore, 2016; pp. 1–34. [Google Scholar]
  22. Das, S.; Suganthan, P.N. Problem Definitions and Evaluation Criteria for CEC 2011 Competition on Testing Evolutionary Algorithms on Real World Optimization Problems; Jadavpur University: Kolkata, India; Nanyang Technological University: Singapore, 2010; pp. 341–359. [Google Scholar]
  23. Liu, Z.Z.; Wang, Y.; Yang, S.; Tang, K. An adaptive framework to tune the coordinate systems in nature-inspired optimization algorithms. IEEE Trans. Cybern. 2018, 49, 1403–1416. [Google Scholar] [CrossRef]
  24. Zou, L.; Pan, Z.; Gao, Z.; Gao, J. Improving the search accuracy of differential evolution by using the number of consecutive unsuccessful updates. Knowl.-Based Syst. 2022, 250, 109005. [Google Scholar] [CrossRef]
  25. Sheskin, D.J. Handbook of Parametric and Nonparametric Statistical Procedures; Chapman and Hall/CRC: New York, NY, USA, 2003. [Google Scholar]
  26. Demšar, J. Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 2006, 7, 1–30. [Google Scholar]
Figure 1. Performance rankings of STMDE and compared DE variants.
Figure 1. Performance rankings of STMDE and compared DE variants.
Mathematics 12 03168 g001
Figure 2. Performance comparison of STMDE with five SOTA DEs on all 30-D, 50-D and 100-D test functions with critical difference value.
Figure 2. Performance comparison of STMDE with five SOTA DEs on all 30-D, 50-D and 100-D test functions with critical difference value.
Mathematics 12 03168 g002
Figure 3. Time complexity of STMDE and its compared DE variants.
Figure 3. Time complexity of STMDE and its compared DE variants.
Mathematics 12 03168 g003
Figure 4. Convergence graphics of STMDE and compared DE variants; (a) convergence graphic on 30-D F5; (b) convergence graphic on 30-D F15; (c) convergence graphic on 30-D F17; (d) convergence graphic on 30-D F29.
Figure 4. Convergence graphics of STMDE and compared DE variants; (a) convergence graphic on 30-D F5; (b) convergence graphic on 30-D F15; (c) convergence graphic on 30-D F17; (d) convergence graphic on 30-D F29.
Mathematics 12 03168 g004aMathematics 12 03168 g004b
Figure 5. Box plots of error for STMDE and compared DE variants (a) on 30-D F5; (b) on 30-D F7; (c) on 30-D F8; (d) on 30-D F10; (e) on 30-D F14; (f) on 30-D F17; (g) on 30-D F19; (h) on 30-D F21; (i) on 30-D F23; (j) on 30-D F29.
Figure 5. Box plots of error for STMDE and compared DE variants (a) on 30-D F5; (b) on 30-D F7; (c) on 30-D F8; (d) on 30-D F10; (e) on 30-D F14; (f) on 30-D F17; (g) on 30-D F19; (h) on 30-D F21; (i) on 30-D F23; (j) on 30-D F29.
Mathematics 12 03168 g005aMathematics 12 03168 g005bMathematics 12 03168 g005c
Figure 6. Performance rankings for different settings of DCcr.
Figure 6. Performance rankings for different settings of DCcr.
Mathematics 12 03168 g006
Figure 7. Performance rankings for different settings of DCf.
Figure 7. Performance rankings for different settings of DCf.
Mathematics 12 03168 g007
Figure 8. Performance rankings for different settings of T.
Figure 8. Performance rankings for different settings of T.
Mathematics 12 03168 g008
Figure 9. Performance rankings for different settings of gp.
Figure 9. Performance rankings for different settings of gp.
Mathematics 12 03168 g009
Table 1. Performance comparison with the baseline on 30-D, 50-D and 100-D CEC2017.
Table 1. Performance comparison with the baseline on 30-D, 50-D and 100-D CEC2017.
30-D50-D100-D
SHADESTMDESHADESTMDESHADESTMDE
meanstdsigmeanstdmeanstdsigmeanstdmeanstdsigmeanstd
F11.00 × 10−146.54 × 10−15=8.36 × 10−157.06 × 10−153.82 × 10−141.38 × 10−14=3.76 × 10−141.33 × 10−148.13 × 10−111.82 × 10−10+4.94 × 10−111.59 × 10−10
F36.80 × 10−142.28 × 10−14=6.58 × 10−142.38 × 10−145.98 × 10−121.70 × 10−11+4.24 × 10−132.50 × 10−137.96 × 10−81.96 × 10−72.62 × 10−31.14 × 10−2
F44.88 × 1012.27 × 101=5.66 × 1011.16 × 1015.25 × 1014.58 × 101=4.63 × 1014.26 × 1011.24 × 1026.22 × 101=1.27 × 1026.95 × 101
F51.54 × 1012.89 × 100+1.17 × 1013.48 × 1003.84 × 1015.82 × 100+2.83 × 1018.71 × 1001.00 × 1021.21 × 101=9.98 × 1011.52 × 101
F62.44 × 10−58.52 × 10−5+4.95 × 10−61.22 × 10−58.37 × 10−41.20 × 10−3=6.67 × 10−46.68 × 10−48.07 × 10−25.36 × 10−2+2.77 × 10−22.29 × 10−2
F74.47 × 1012.63 × 100+4.08 × 1013.88 × 1008.28 × 1015.07 × 100+7.50 × 1017.02 × 1002.08 × 1021.48 × 101+1.94 × 1021.79 × 101
F81.68 × 1013.06 × 100+1.13 × 1013.33 × 1003.90 × 1015.91 × 100+2.92 × 1011.12 × 1019.99 × 1011.39 × 101=9.63 × 1011.76 × 101
F92.30 × 10−26.98 × 10−2=1.23 × 10−23.11 × 10−21.36 × 1001.07 × 100+4.82 × 10−14.95 × 10−12.74 × 1011.15 × 101+1.46 × 1017.64 × 100
F101.70 × 1032.11 × 102+1.38 × 1033.65 × 1023.44 × 1032.92 × 102+2.73 × 1034.26 × 1029.18 × 1035.39 × 102+8.27 × 1039.30 × 102
F113.46 × 1012.64 × 101+2.27 × 1012.31 × 1011.25 × 1022.93 × 101+1.08 × 1022.65 × 1011.13 × 1031.96 × 102+8.81 × 1022.42 × 102
F121.26 × 1033.11 × 102=1.10 × 1034.10 × 1027.36 × 1037.49 × 103=6.13 × 1034.55 × 1031.92 × 1041.24 × 1042.37 × 1049.06 × 103
F134.15 × 1012.76 × 101+2.39 × 1019.97 × 1002.27 × 1021.54 × 102+1.38 × 1028.51 × 1011.93 × 1033.84 × 103=3.31 × 1021.69 × 102
F142.77 × 1014.70 × 100+2.37 × 1014.49 × 1001.88 × 1023.81 × 101+8.87 × 1013.36 × 1015.84 × 1021.83 × 102=5.50 × 1021.17 × 102
F151.81 × 1011.03 × 101+9.05 × 1004.56 × 1002.21 × 1021.03 × 102+1.43 × 1027.94 × 1013.19 × 1028.06 × 1014.49 × 1022.28 × 102
F163.28 × 1021.20 × 102+2.52 × 1021.38 × 1027.67 × 1021.97 × 102+6.31 × 1022.22 × 1022.41 × 1033.32 × 102=2.34 × 1034.31 × 102
F175.20 × 1011.26 × 101+3.55 × 1019.66 × 1005.87 × 1021.25 × 102+4.42 × 1021.35 × 1021.82 × 1032.99 × 102+1.65 × 1033.72 × 102
F184.11 × 1013.52 × 101+2.80 × 1018.17 × 1001.78 × 1021.22 × 102=1.74 × 1021.10 × 1021.39 × 1039.44 × 102=2.08 × 1032.04 × 103
F191.29 × 1013.52 × 100+7.39 × 1002.12 × 1001.30 × 1024.53 × 101+9.69 × 1013.87 × 1013.18 × 1024.89 × 102=2.41 × 1025.01 × 101
F209.09 × 1015.54 × 101+5.64 × 1015.42 × 1013.95 × 1029.93 × 101+3.16 × 1021.57 × 1021.70 × 1032.29 × 102+1.57 × 1033.65 × 102
F212.18 × 1023.12 × 100+2.13 × 1024.01 × 1002.36 × 1025.09 × 100+2.31 × 1028.33 × 1003.32 × 1021.43 × 101+3.25 × 1021.51 × 101
F221.00 × 1023.44 × 10−1=1.00 × 1026.39 × 10−141.85 × 1032.01 × 103=2.44 × 1031.52 × 1031.05 × 1045.00 × 102+9.78 × 1031.27 × 103
F233.64 × 1024.52 × 100+3.60 × 1024.91 × 1004.61 × 1026.82 × 100+4.57 × 1021.32 × 1016.12 × 1021.44 × 101+5.98 × 1021.95 × 101
F244.35 × 1023.76 × 100=4.35 × 1026.18 × 1005.31 × 1025.88 × 100=5.33 × 1029.59 × 1009.92 × 1022.13 × 101=1.00 × 1032.20 × 101
F253.87 × 1022.04 × 10−1+3.87 × 1025.10 × 10−25.38 × 1023.22 × 101=5.25 × 1023.43 × 1017.43 × 1025.48 × 101=7.40 × 1024.27 × 101
F261.11 × 1035.44 × 101+1.08 × 1038.15 × 1011.45 × 1039.00 × 101=1.44 × 1031.10 × 1024.23 × 1032.13 × 102=4.28 × 1032.47 × 102
F275.05 × 1026.01 × 100=5.05 × 1025.52 × 1005.43 × 1022.59 × 101+5.33 × 1021.31 × 1016.70 × 1023.48 × 101+6.47 × 1022.51 × 101
F283.43 × 1025.83 × 101=3.41 × 1025.41 × 1014.97 × 1021.68 × 101+4.80 × 1022.40 × 1015.34 × 1023.77 × 101=5.32 × 1023.00 × 101
F294.63 × 1021.10 × 101+4.47 × 1021.90 × 1014.99 × 1028.17 × 101+4.04 × 1027.97 × 1012.13 × 1032.94 × 102+1.91 × 1032.94 × 102
F302.07 × 1039.51 × 101=2.04 × 1037.55 × 1016.53 × 1056.51 × 104=6.68 × 1058.37 × 1042.75 × 1037.83 × 102+2.53 × 1031.86 × 102
W/T/L19/10/019/10/014/12/3
Table 5. Performance comparison of STMDE with three variants on 30-D CEC2017.
Table 5. Performance comparison of STMDE with three variants on 30-D CEC2017.
VariantUnimodal FunctionsSimple Multi-Modal FunctionsHybrid FunctionsComposition FunctionsOverall
Variant 11/13/07/04/015/1
Variant 21/16/04/02/013/1
Variant 31/15/03/03/012/1
Table 6. Performance comparison in the practical optimization problem from the CEC2011.
Table 6. Performance comparison in the practical optimization problem from the CEC2011.
FES5.00 × 1041.00 × 1051.50 × 105
DEsmeanstdsigmeanstdsigmeanstdsig
SHADE1.36 × 1001.02 × 10−1=1.24 × 1001.05 × 10−1+1.24 × 1008.13 × 10−2+
ACos-JADE1.37 × 1001.07 × 10−1=1.19 × 1009.03 × 10−2+1.14 × 1009.27 × 10−2+
IMPEDE1.37 × 1005.39 × 10−2=1.19 × 1001.00 × 10−1+1.13 × 1009.57 × 10−2+
Db-SHADE1.36 × 1001.03 × 10−1=1.25 × 1001.12 × 10−1+1.22 × 1001.11 × 10−1+
PFI-SHADE1.40 × 1009.90 × 10−2=1.25 × 1001.03 × 10−1+1.22 × 1009.48 × 10−2+
CUSDE1.84 × 1009.68 × 10−2+1.77 × 1001.15 × 10−1+1.71 × 1001.08 × 10−1+
STMDE1.37 × 1001.12 × 10−1 1.00 × 1002.93 × 10−1 8.95 × 1012.47 × 10−1
      
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

Liu, Y.; Zheng, L.; Cai, B. Adaptive Differential Evolution with the Stagnation Termination Mechanism. Mathematics 2024, 12, 3168. https://doi.org/10.3390/math12203168

AMA Style

Liu Y, Zheng L, Cai B. Adaptive Differential Evolution with the Stagnation Termination Mechanism. Mathematics. 2024; 12(20):3168. https://doi.org/10.3390/math12203168

Chicago/Turabian Style

Liu, Yuhong, Liming Zheng, and Bohan Cai. 2024. "Adaptive Differential Evolution with the Stagnation Termination Mechanism" Mathematics 12, no. 20: 3168. https://doi.org/10.3390/math12203168

APA Style

Liu, Y., Zheng, L., & Cai, B. (2024). Adaptive Differential Evolution with the Stagnation Termination Mechanism. Mathematics, 12(20), 3168. https://doi.org/10.3390/math12203168

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

Article Metrics

Back to TopTop