Next Article in Journal
Stress Analysis and Stiffness Degradation of Open Cracks Composite Laminates Subjected to External Loads
Next Article in Special Issue
Three-Dimensional UAV Path Planning Based on Multi-Strategy Integrated Artificial Protozoa Optimizer
Previous Article in Journal
Comparing Biomechanical Properties of Bioabsorbable Suture Anchors: A Comprehensive Review
Previous Article in Special Issue
GOHBA: Improved Honey Badger Algorithm for Global Optimization
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

EDECO: An Enhanced Educational Competition Optimizer for Numerical Optimization Problems

1
School of Computer Science and Information Security, Guilin University of Electronic Technology, Guilin 541000, China
2
School of Information Science and Engineering, Southeast University, Nanjing 210096, China
3
Ruijie Networks Co., Ltd., Fuzhou 350000, China
*
Authors to whom correspondence should be addressed.
Biomimetics 2025, 10(3), 176; https://doi.org/10.3390/biomimetics10030176
Submission received: 17 February 2025 / Revised: 5 March 2025 / Accepted: 6 March 2025 / Published: 12 March 2025

Abstract

:
The Educational Competition Optimizer (ECO) is a newly proposed human-based metaheuristic algorithm. It derives from the phenomenon of educational competition in society with good performance. However, the basic ECO is constrained by its limited exploitation and exploration abilities when tackling complex optimization problems and exhibits the drawbacks of premature convergence and diminished population diversity. To this end, this paper proposes an enhanced educational competition optimizer, named EDECO, by incorporating estimation of distribution algorithm and replacing some of the best individual(s) using a dynamic fitness distance balancing strategy. On the one hand, the estimation of distribution algorithm enhances the global exploration ability and improves the population quality by establishing a probabilistic model based on the dominant individuals provided by EDECO, which solves the problem that the algorithm is unable to search the neighborhood of the optimal solution. On the other hand, the dynamic fitness distance balancing strategy increases the convergence speed of the algorithm and balances the exploitation and exploration through an adaptive mechanism. Finally, this paper conducts experiments on the proposed EDECO algorithm with 29 CEC 2017 benchmark functions and compares EDECO with four basic algorithms as well as four advanced improved algorithms. The results show that EDECO indeed achieves significant improvements compared to the basic ECO and other compared algorithms, and performs noticeably better than its competitors. Next, this study applies EDECO to 10 engineering constrained optimization problems, and the experimental results show the significant superiority of EDECO in solving real engineering optimization problems. These findings further support the effectiveness and usefulness of our proposed algorithm in solving complex engineering optimization challenges.

1. Introduction

The optimization problem is an important challenge that we need to face in various scientific and engineering disciplines. These problems require identifying the most suitable solution from a large number of possible options, according to particular objective functions and under specific constraints [1]. The inherent characteristics of optimization problems often include high dimensionality, non-linearity, multimodality, and complexity, making them difficult to tackle with conventional approaches [2,3]. Traditional optimization methods, such as gradient based techniques and linear programming, have been widely used in the past [4]. However, they face significant limitations when dealing with complex optimization problems. Gradient-based methods, for instance, require the objective function to be differentiable and continuous, and they are prone to getting stuck in local optima and unable to jump out, especially in multimodal optimization landscapes [5]. Linear programming is effective for linear problems but struggles with the nonlinear relationships that are common in many real-world scenarios. As a result, there is an urgent need for more powerful and flexible optimization tools. Over recent years, continuously growing metaheuristic algorithms have become increasingly important in solving various types of complex optimizations [6]. These algorithms are inspired by animal behavior, evolution of species and physical processes in nature. They have several distinct benefits over traditional methods. First, MAs are usually more robust and less sensitive to problem characteristics. They can effectively handle nonlinear, nondifferentiable and discontinuous objective functions [7]. Second, due to the use of stochastic and population search mechanisms, MAs have a strong ability to explore the search space and avoid local optima. This enables them to find high-quality solutions in a wider solution space. In addition, MAs are usually easy to implement and can be adapted to different problem domains with relative ease [8].
The applications of MAs are wide and varied. In the field of engineering design, they have been used to optimize the parameters of mechanical structures [9], circuits [10], and communication systems [11], thereby improving performance and cost-effectiveness. In the field of machine learning, metaheuristic algorithms have been used for feature selection [12], neural network training [13], and hyperparameter tuning [14], resulting in improved model accuracy and efficiency [15]. In addition, they have been applied to optimization problems such as task planning [16], image segmentation [17] and cloud resource scheduling [18]. MAs can be categorized into two main types based on the number of solutions generated in each iteration: single-solution-based algorithms and population-based algorithms [19].
In single-solution-based algorithms, only a single individual is utilized to search the solution space. Single-solution-based algorithms relies on iterative improvement to progressively refine the initial solution. Such algorithms aim to find optimal or near-optimal solutions by exploring and exploiting the neighborhood of the current candidate solution, e.g., Taboo Search (TS) [20], Large Neighborhood Search (LNS) [21], and Non-monopolize Search (NS) [22].
Population-based algorithms derived their inspiration from a variety of behaviors in nature, including animals and plants engaging in foraging, mating, and pollination. It can be further categorized into evolutionary-based algorithms (EbA), swarm-based algorithm, physics-based algorithm (PbA), mathematical-based algorithm (MbA), and human-based algorithms (HbA) [23]. Evolutionary-based algorithms are a class of optimization and search algorithms that impersonate the process of natural selection and evolution observed in biological systems. These algorithms mimic genetic variation, selection, and reproduction mechanisms to iteratively evolve a population of candidate solutions toward optimal or near-optimal solutions for a given problem. In the 1970s, Genetic Algorithm (GA) gained popularity with Holland’s work, relying on efficient encoding, decoding, and proper parameter configuration [24]. Other algorithms in this category also include Differential Evolution (DE) [25], Evolutionary Strategies (ES) [26], Alpha evolution (AE) [27] and Evolutionary Mating Algorithm (EMA) [28]. Swarm-based algorithms, which emulate the natural behaviors observed in various biological entities, are characterized by their decentralized control and inherent self-organizational capabilities. Their versatility in different fields, effective utilization of solution space information, and fewer parameters to tune reassure the audience about their wide applicability. Particle Swarm Optimization (PSO) is one of the classical instances in which the foraging behavioral patterns of bird flocks are simulated to locate the ideal solution [29]. Other prominent algorithms in this category comprise Artificial Bee Colony (ABC) [30], Crayfish Optimization Algorithm (COA) [31], Secretary bird optimization algorithm (SBOA) [32], Remora Optimization Algorithm (ROA) [33], Tuna Swarm Optimization (TSO) [34] and Sea Horse Optimizer (SHO) [35]. Physics-based algorithms are nature-inspired optimization techniques that imitate physical and chemical law phenomena inspired by electromagnetic forces, gravity, inertia, river systems, chemical changes, and other natural phenomena. Gravitational Search Algorithm (GSA) is the best example of the applicability of physics-based algorithms which simulate mass interactions based on the law of gravity [36]. Other notable physics-based algorithms include Multi-Verse Optimizer (MVO) [37], Kepler optimization algorithm (KOA) [38], Fick’s Law Algorithm (FLA) [39], Polar Lights Optimization (PLO) [40], Equilibrium Optimizer (EO) [41], Newton-Raphson-based Optimizer (NRBO) [42] and Snow Ablation Optimizer (SAO) [43]. Mathematical-based algorithms 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), which applies the concept of trigonometric functions to create an algorithmic model [44]. Generalized Normal Distribution Optimization (GNDO) [45], Gold Sine Algorithm (GSA) [46], Quadratic Interpolation Optimization (QIO) [47], Quasi-Random Fractal Search (QRFS) [48], Four Vector Intelligent Metaheuristic (FVIM) [49] and Exponential Distribution Optimizer (EDO) [50] are other instances in this category. Human-based algorithms have drawn inspiration from human societal behaviors, such as political campaigns, competition, learning, and cultural influence. The examples of human-based algorithms are Teaching-Learning-Based Optimization (TLBO) [51], Group Teaching Optimization Algorithm (GTOA) [52], Catch Fish Optimization Algorithm (CFOA) [53], Preschool Education Optimization Algorithm (PEOA) [54], Hiking Optimization Algorithm (HOA) [55] and Student Psychology Based Optimization (SPBO) [56].
Educational Competition Optimizer (ECO) is a new human-based MAs proposed by Lian et al. in 2024 [57]. The algorithm divides the population into two groups: school population and student population, and uses a roulette-based iterative framework to guide the search process. In initial studies, ECO demonstrated strong convergence and superior search capabilities, achieving the best performance on the CEC 2021 benchmark suite. However, by analyzing the updating method and results in test functions of ECO, it is found that it faces some limitations, such as reduced population diversity, low convergence accuracy, and the tendency to converge to a local optimum when solving complex optimization problems. In order to improve ECO, some suitable strategies must be chosen to overcome these limitations. Generally, improving the existing one and hybridizing different MAs are two enhancing strategies. In the improvement process, one or more methods are introduced in the existing MAs to obtain better results.
In this work, an enhanced educational competition optimizer is proposed with an improved core containing the above two enhancing strategies. Firstly, we combine the basic ECO and the estimation of distribution algorithm (EDA) to ultimately enhance the global search capability, improve the population quality, and address the problem of the algorithm’s inability to search for the neighborhood of the optimal solution through modeling the EDA’s probability distribution with the ECO’s dominant population as well as replacing the ECO’s population with the EDA’s sampling. In addition, we propose a dynamic fitness–distance-balanced strategy (DFS) to balance the exploitation and exploration of ECO for its own deficiency, which improves the convergence speed of the algorithm through an adaptive mechanism. In summary, the work presented and contributions made in this paper are shown below.
(1)
We propose a hybrid search framework to combine ECO and EDA, which effectively improves the performance.
(2)
We propose a dynamic fitness distance balancing strategy, which promotes convergence accuracy and balances the exploitation and exploration capabilities.
(3)
We conduct a series of numerical experiments using the CEC2017 test suite to verify the superiority of the improved strategy and the proposed EDECO.
(4)
We further evaluate the performance and potential of EDECO in real-world applications using ten engineering constrained optimization problems.
The organization of this paper is outlined as follows: Section 2 offers an overview of the foundational principles and mathematical formulation underlying the basic ECO. Section 3 elaborates on the core ideas behind the proposed EDECO, accompanied by detailed pseudo-code, flowcharts, and an in-depth analysis of its computational complexity. Section 4 evaluates the optimization capabilities of EDECO using the CEC2017 benchmark suites, while also examining the contributions of each enhancement strategy to its overall performance. Section 4 also applies EDECO to ten engineering constrained optimization problems. Finally, Section 5 summarizes the principal findings of this research and highlights potential directions for future research.

2. Educational Competition Optimizer (ECO)

The ECO is designed to simulate competitive strategies at the elementary, middle, and high school levels. As competitive pressures increase and the number of schools decreases, the optimization process of ECO is divided into three successive phases. These phases achieve a smooth transition from exploration to exploitation. The mathematical model of ECO is representing as follows.
At this stage, schools determine their best educational location based on the average location of their population. In turn, students compete by aiming for proximity to the nearest school. This approach reflects the initial stage of exploration, where schools and students search for a favorable location without many constraints.
Middle School Stage: During this phase, the number of schools declined, leading them to assess their location based on the average location of the population and the most recognizable locations. Students compete by targeting the nearest school, reinforcing the concept of proximity. This phase introduced a balance between exploration and utilization, and schools became more insightful in their location strategies.
High School Stage: At this stage, the school implements a more refined assessment process that considers the average, best and worst position of the population to determine their educational location. With only one school to choose from, students strive to compete for this single goal, emphasizing proximity. This phase represents the transition to the development phase, where strategic precision is critical and competition becomes more intense.

2.1. Population Initialization

ECO, as a meta-heuristic algorithm, has a different method of population initialization than other algorithms. It utilizes logical chaos mapping to generate initial populations to model social disorder due to lack of education. In this paper, the number of populations is N and the upper and lower boundaries of the problem space are U b and L b . The formula for the logical chaos mapping is shown below.
x i = α × x i 1 × 1 x i 1 , 0 x 0 1 , i = 1 ,   2 , , N
where x i represents the i t h value and x i 1 represents the previous value. The parameter α is defined as a constant, with its value set to 4 in this work. The chaotic value x i can be mapped to the search space:
X i = L b + U b L b × x i

2.2. Primary School Stage

ECO divides populations into school population and student population at the primary level. The top 20% of individuals ranked in terms of fitness comprise the school population and the rest comprise the student population. At this stage, individuals in the school population utilize the average position of the population to adjust their position, and individuals in the student population decide the direction of movement based on proximity to the school population. Equations (4) and (5) provide the updating methods for the school population and the student population, respectively.
ω = 0.1 × ln 2 t t max
S c h o o l : X i t + 1 = X i t + ω × X i m e a n t X i t × L e v y D
S t u d e n t s : X i t + 1 = X i t + ω × c l o s e X i t X i t × r a n d n
where t and t max denote the current iteration number and the maximum iteration number. X i t represents the current position and X i t + 1 denotes the position after the next update. X i m e a n t represents the average position of the vector for the i t h school agent in the t t h iteration. L e v y D is a random vector that follows the Lévy distribution. c l o s e X i t indicates the location of the school closest to X i t . r a n d n represents a random variable following a normal distribution.

2.3. Middle School Stage

At the middle school stage, ECO selects the top 10 percent of individuals in terms of fitness to form the school population and the remainder to form the student population. Unlike the primary stage, where ECO utilizes the average and optimal positions to move the school population, the student population is divided into two groups based on their academic potential to move their positions separately. Thus, the mathematical formulation of the school population and the student population is shown below.
S c h o o l : X i t + 1 = X i t + X b e s t t X m e a n t × e t t max 1 × L e v y D
S t u d e n t s : X i t + 1 = X i t ω × c l o s e X i t P × E × ω × c l o s e X i t X i t
P = 4 × r a n d n × 1 t t max
E = π P × t t max , R t > H 1 , R t H
where X b e s t t denotes the position of the best school agent from now on. X m e a n t represents the average position of whole agents the t t h iteration. The talent values of different students are simulated using the random number R t , which takes on a value within the range of [0, 1]. The parameter H is set to 0.5.

2.4. High School Stage

The grouping of populations at the high school stage is the same as at the middle school stage. The school population achieves better search by referring to the average position, the optimal position. Student populations move closer to the optimal position.
S c h o o l : X i t + 1 = X i t + X b e s t t X m e a n t × r a n d n X b e s t t X m e a n t × r a n d n
S t u d e n t s : X i t + 1 = X i t P × E × X b e s t t X i t
The pseudo-code of ECO is represented as shown in Algorithm 1.
Algorithm 1: Pseudo-code of the ECO
1: Initialize the ECO parameters
2: Initialize the solutions’ positions randomly Equation (2)
3: While t < tmax
4: Calculate the fitness function
5: Find the best position and worst position
6: Calculate Rt, P, E
7: For i = 1: N do
8: Stage 1: Primary school competition
9:  If mod (t, 3) == 1 Then
10:   Update school position by Equation (4)
11:   Update student position by Equation (5)
12:  End if
13: Stage 2: middle school competition
14:  If mod (t, 3) == 2 Then
15:   Update school position by Equation (6)
16:   Update student position by Equation (7)
17:  End if
18: Stage 3: High school competition
19:  If mod (t, 3) == 3 Then
20:   Update school position by Equation (10)
21:   Update student position by Equation (11)
22:  End if
23: End for
24: t = t + 1
24: End while
25: Return the best solution and fitness

3. Enhanced Educational Competition Optimizer

Although ECO shows promising prospects as a metaheuristic algorithm, it faces significant challenges in complex optimization scenarios. The ECO exhibits inherent limitations, including difficulties in balancing exploitation and exploration, and a tendency to converge to local optima. These weaknesses hinder its effectiveness in dealing with complex and demanding optimization problems. To address these restrictions, this paper proposes the Enhanced Educational Competition Optimizer (EDECO), which improves performance through hybrid estimation of distribution algorithm and the introduction of a dynamic fitness distance balancing strategy. In this section, the improved techniques of the proposed EDECO are first described in detail. Subsequently, pseudo-code and flowcharts are presented. Finally, this section analyzes the time complexity of the proposed EDECO algorithm.

3.1. Hybrid Search Framework for EDA

The quality of the ECO’s population decreases progressively with the depth of the search, and its global exploration capability is limited. To solve this concern, this paper proposes a hybrid search framework to incorporate the EDA method. Unlike other hybrid algorithms, the novelty of this work is reflected in the harmonious synergy between the ECO and EDA methods. Common hybrid algorithms are embedding multiple algorithms into different search stages or reusing multiple algorithms for the same population. The hybrid search framework proposed in this paper realizes a new hybrid technique, and the process is shown in Figure 1.
Specifically, the solution space is first searched using the ECO method to generate new populations. Then, some individuals with better fitness values are screened from the new population to form a dominant group, and a probability distribution model is constructed. The EDA method generates new individuals by sampling according to this probability distribution model. The population that proceeds to the next iteration is filtered from these individuals and the individuals generated by ECO through a greedy strategy. On the one hand, the dominant population that creates the probabilistic model is composed of both ECO and EDA individuals, which mitigates the shortcoming of orthogonality in the evolutionary direction of EDA. On the other hand, EDA utilizes the powerful exploration ability to boost the population diversity of ECO, which compensates for its inability to search the optimal solution domain. The application of greedy strategy accelerates the convergence speed of EDECO. The EDA algorithm contains three steps: selecting the dominant individuals, modeling the probability distribution, and sampling to generate new individuals. In this paper, a Gaussian probability model is used. The joint Gaussian probability density function for a random vector X with D dimensions can be parameterized by the mean μ and the covariance matrix C as follows.
G X μ , C = 1 2 π D det C × e X μ T × C 1 × X μ 2
μ = 1 N d × d o = 1 N d X d o
C = 1 N d × i = 1 N d X i μ × X i μ T
where N d is the number of dominant individuals selected from the new population generated by ECO. X d o denotes the d o t h dominant individual with better fitness. The EDA generates new individuals based on a Gaussian probability distribution model with mean μ and covariance matrix C as follows.
X i t + 1 = μ + g , g N 0 , C

3.2. Dynamic Fitness Distance Balancing Strategy

ECO exhibits a weak exploitation in the later stages of the search, limiting further accurate search of the optimal solution domain. To address this issue, this paper uses a dynamic fitness distance balancing strategy (DFS) to modify the update strategy at the high school level. The DFS is leveraged to select the optimal individual X D F S to guide the student population at the high school stage towards the optimal position, and to achieve a relative balance between exploitation and exploration through adaptive parameters. The DFS strategy is an adaptive variant of the fitness distance balancing strategy. The basic fitness distance balancing strategy selects the optimal solution based on a weighted score of fitness and distance. When considering the two metrics, distance and fitness, it is assumed that both contribute to the search equally. However, for metaheuristic algorithms, the proper choice of exploitation or exploration at the suitable time is significant. Algorithms need to avoid local optima through strong exploration capability and need intensive exploitation ability to search accurately. Thus, it is necessary to implement an adaptive mechanism to dynamically adjust the weights of fitness and distance. The details of the DFS strategy are described below.
S i = ω × n o r m F i t i + 1 ω × n o r m D i s i
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 , D X b e s t , D 2
ω = mod t max α , t t max × 1 β + β
where S i is the DFS score of the i t h individual, weighted by the normalized value n o r m F i t i of fitness and the normalized value n o r m D i s i of distance for this individual. Before the start of each iteration, X D F S t is selected based on the scores of each individual. Thus, Equation (7) can be modified as follows.
S t u d e n t s : X i t + 1 = X D F S t ω × c l o s e X i t P × E × ω × c l o s e X i t X i t

3.3. The Framework of EDECO

This study proposes EDECO, which combines ECO with the above two mechanisms. The pseudo-code of the proposed EDECO algorithm is shown in Algorithm 2. In each iteration, EDECO first generates new individuals using the ECO method and then samples new individuals using the EDA method, and the new individuals of both methods are selected by a greedy strategy to select N individuals for the next iteration. The flowchart of the algorithm is shown in Figure 2.
Algorithm 2: Pseudo-code of the EDECO
1: Initialize the ECO parameters
2: Initialize the solutions’ positions randomly Equation (2)
3: While t < tmax
4: Calculate the fitness function
5: Find the best position and worst position
6: Calculating Rt, P, E, C, S
7: For i = 1: N do
8: Stage 1: Primary school competition
9:  If mod (t, 3) == 1 Then
10:   Updating school position by Equation (4)
11:   Updating student position by Equation (5)
12:  End if
13: Stage 2: middle school competition
14:  If mod (t, 3) == 2 Then
15:   Updating school position by Equation (6)
16:   Updating student position by Equation (7)
17:  End if
18: Stage 3: High school competition
19:  If mod (t, 3) == 3 Then
20:   Updating school position by Equation (10)
21:   Updating student position by Equation (19)
22:  End if
23: End for
24: Selecting dominant group and construct G(X)(u, C) by Equations (12)–(14)
25: Sampling according to this probability distribution model by Equation (15)
26: Selecting the next iteration population by greedy strategy
27: t = t + 1
28: End while
29: Return the best solution

3.4. Computational Complexity Analysis

In this paper, the EDECO algorithm is obtained by combining EDA and DFS. From Algorithm 2 and Figure 2, EDECO contains population initialization, fitness calculation, generation of new individuals by ECO method and generation of new individuals by EDA method. We assume that N is the number of search agents, D is the problem size, and the maximum number of iterations is T . Then, the time complexity of initializing the populations is O N × D . At each iteration, the ECO method updates N individuals, and the EDA method updates N E individuals, so the time complexity of the ECO method is O T × N × D , and the time complexity of the EDA method is O T × N E × D . Since the DFS strategy is a selection strategy that does not generate additional individuals, hence, DFS does not increase the time complexity in the whole process. In conclusion, the ECO is approximately O T × N × D and the EDECO is approximately O T × N + N E × D . EDECO has a higher time complexity than basic ECO due to the existence of the EDA phase. However, in this paper, the maximum number of function evaluations is used as a stopping criterion to achieve a fair comparison.

4. Numerical Experiment and Analysis

Since the original paper has already thoroughly compared the ECO algorithms against various algorithms using the CEC 2021 benchmark function, we focused on more challenging optimization scenarios for our study. Specifically, we validate the proposed EDECO algorithm through three experiments. A total of 29 CEC2017 benchmark test functions and 10 engineering constrained optimization problems were utilized to check the performance of EDECO. Section 4.1 contains comprehensive details of the CEC2017 test suite and parameter configurations of the compared algorithms. In Section 4.2, we discuss the impact of each improvement strategy on EDECO. Section 4.3 shows the results of comparing EDECO with the basic algorithm and the improved algorithms. Section 4.4 confirms the ability of EDECO to solve constrained optimization problems.

4.1. Experiment Setting and Evaluation Criteria

The proposed EDECO algorithm has been implemented in MATLAB R2023a on a computer system equipped with an AMD R9 7940HX processor running at 2.130 GHz and 32 GB of RAM.
The CEC test function suite is a widely recognized and authoritative benchmark suite in the field of computational intelligence, particularly for evaluating the performance of optimization algorithms. Introduced by the IEEE Congress on Evolutionary Computation (CEC), these test functions are carefully designed to cover a wide range of optimization challenges, including unimodal, multimodal, separable, non-separable, and rotated problems. This study employs the CEC2017 benchmark suite (30-dimensional, 50-dimensional, and 100-dimensional). Detailed parameter configurations of the CEC2017 test suite are presented in Table 1. In this work, the maximum number of function evaluations ( F e s max ) is used instead of the maximum number of iterations as a stopping criterion to fairly compare the performance of each algorithm. The F e s max is 5000 times the problem dimensions, i.e., 50,000 (10D), 150,000 (30D), 250,000 (50D), and 500,000 (100D). All experimental results were obtained by running each algorithm independently 30 times.
In order to fully demonstrate the superiority of EDECO, two derived algorithms and eight advanced algorithms were chosen for comparison with EDECO. The derived algorithms were designed to perform ablation experiments and include: EECO and DECO. The advanced competitors include the basic algorithms: SAO [43], CFOA [53], DBO [58], and MRFO [59], as well as the improved algorithms: ISGTOA [52], EMTLBO [60], TERIME [61], and AFDB-ARO [62]. The detailed parameter settings for the relevant algorithms are provided in Table 2.

4.2. Analysis of the Performance of Each Strategy on EDECO

As mentioned earlier, the proposed EDECO incorporates two improvement strategies: the hybrid search framework (HSF) and the dynamic fitness distance balancing strategy (DFS). The purpose of the experiments in this subsection is to examine the impact of these added optimization mechanisms on the performance of the basic EDECO. Therefore, in this study, the ECO integrated with HSF (EECO) and the ECO integrated with DFS (DECO) are subjected to ablation experiments with EDECO as well as the basic ECO under the CEC2017 benchmark functions. The parameter settings for these ECO variants and EDECO are the same. These results are reported using the nonparametric Wilcoxon rank sum test with a significance level of 0.05 and the Friedman test as shown in Table 3 and Table 4.
Based on the p-values in the last column of Table 3, we can know that there are performance differences between these four algorithms. Specifically, EDECO, which incorporates two strategies, achieves the first place in all four cases with rankings of 1.28, 1.14, 1.07 and 1.28, EECO ranks second on 30D,50D and 100D, DECO ranks second on 10D, and ECO is at the bottom of the list in all cases. Based on the rankings of EECO and EDCO, we can see that the HSF strategy enhances ECO more than the DFS enhances the performance of ECO. Table 4 records the wins and losses of EDECO, EECO, DECO and basic ECO. We can observe that the number of functions in which EDECO significantly outperforms ECO is the largest, with EECO and EDCO decreasing in that order, which matches the results of the Friedman test. Furthermore, we used the Nemenyi test as a post hoc test to further demonstrate the differences between EDECO, EECO, DECO, and ECO based on Friedman rankings. Figure 3 presents the magnitude of differences among ECO, EDECO and its two variants, in which the algorithms with no significant difference in terms of performance can be connected using CDV.
When the ranking difference between the two algorithms is less than the CDV, then the difference between the two algorithms is considered insignificant, and vice versa, the difference is significant. As shown in Figure 3, EDECO significantly outperforms ECO and the two variants, and the two variants similarly significantly outperform ECO. This indicates that a single improvement mechanism significantly improves the performance of ECO. The greatest degree of ECO performance improvement occurs when the two mechanisms are combined. Therefore, we can conclude that the proposed improvement strategies significantly enhance the performance of ECO and EDECO is a promising ECO variant.

4.3. Analysis of the Results of CEC2017 Test Suite

In this subsection, the performance of the proposed EDECO is evaluated using the CEC2017 test suite and eight advanced basic and improved algorithms are compared including the basic algorithms: SAO, CFOA, DBO, and MRFO, as well as the improved algorithms: ISGTOA, EMTLBO, TERIME, and AFDB-ARO. To ensure a fair comparison, the maximum number of function evaluations is employed as a stopping criterion for all the experiments in this subsection, and the parameter settings for all the algorithms follow the recommended values from the source literature. Table A1, Table A2, Table A3 and Table A4 in Appendix A provide detailed results obtained by EDECO and the compared algorithms, including the optimal value, average value, standard deviation and ranking. Here, the performance of EDECO and competitors on each function is visualized initially through radar plots, as shown in Figure 4. In the radar plot, the ranking of each algorithm on each function is connected into a polygon whose area size reflects how much better or worse the algorithm performs. The smaller the area, the better the performance of this algorithm. Based on Figure 4, we can roughly conclude that EDECO achieves the best overall results in all dimensions and outperforms the comparison algorithms. In the following, the experimental results of EDECO and the comparison algorithms will be further analyzed using statistical methods to avoid experimental bias caused by relying only on the average value.
Table 5 summarizes the results of Wilcoxon rank sum test for 30 independent results obtained by EDECO, ECO and eight competitors with significance level a = 0.05. In Table 5, the symbols “+/=/−” mean that EDECO is superior/similar/inferior to its competitors in terms of performance, respectively. The winners and losers of EDECO and its competitors are visualized in Figure 4. According to Figure 5 and Table 5, we observe that the total number of “+” obtained by the proposed EDECO in each dimension is more than “−”, which indicates that EDECO significantly outperforms both ECO and the competitors in terms of overall performance. Details of the analysis are given below.
For 10D, EDECO is superior (inferior) to SAO, CFOA, DBO, MRFO, ISGTOA, EMTLBO, TERIME, AFDB-ARO on 27(0), 28(0), 22(1), 25(0), 22(1), 22(1), 25(1), 24(0) and 23(2) test functions. That is, EDECO beats all competitors on 10D.
For 30D, EDECO is superior (inferior) to SAO, CFOA, DBO, MRFO, ISGTOA, EMTLBO, TERIME, AFDB-ARO on 29(0), 29(0), 28(0), 27(0), 19(3), 13(4), 20(5), 26(0) and 27(1) test functions. That is, EDECO beats all competitors on 30D.
For 50D, EDECO is superior (inferior) to SAO, CFOA, DBO, MRFO, ISGTOA, EMTLBO, TERIME, AFDB-ARO on 26(0), 27(1), 27(0), 27(0), 21(2), 10(10), 18(4), 27(0) and 25(3) test functions. That is, EDECO beats all competitors except ISGTOA on 50D.
For 100D, EDECO is superior (inferior) to SAO, CFOA, DBO, MRFO, ISGTOA, EMTLBO, TERIME, AFDB-ARO on 26(0), 29(0), 29(0), 28(1), 23(2), 12(8), 17(3), 28(0) and 21(6) test functions. That is, EDECO beats all competitors on 100D.
According to the “Total” in the last column of Table 5, EDECO is superior (inferior) to SAO, CFOA, DBO, MRFO, ISGTOA, EMTLBO, TERIME, AFDB-ARO on 108(0), 113(0), 106(1), 107(0), 85(8), 57(23), 80(13), 105(0) and 96(12) functions. That is to say, compared to the four basic algorithms and the 4 improved algorithms, EDECO has more “+” than “−”, which implies that EDECO has the best performance. Thus, we can conclude that the proposed EDECO has the best overall performance compared to SAO, CFOA, DBO, MRFO, ISGTOA, EMTLBO, TERIME, AFDB-ARO.
The Freidman test was next used to compare the difference in performance between EDECO and its competitors. The rankings and p-values obtained through the Friedman test are summarized in Table 6 and visually depicted in Figure 6. According to Table 6, all p-values are less than 0.05, which indicates that there is a performance difference between EDECO and ECO as well as the other competitors on all dimensions of the CEC2017 test suite. Figure 6 shows that EDECO achieves the smallest Friedman rankings of 1.8276, 1.9655, 2.2069, and 2.0690, respectively. That is, EDECO outperforms all the competing algorithms on all dimensions, which is consistent with the analysis results of the Wilcoxon rank sum test. Furthermore, EDECO’s ranking does not float significantly with the change in dimensions, showing its superior stability and scalability.
Based on the Friedman test, the Nemenyi test was used to further quantify the magnitude of the difference between EDECO and its competitors. In the Nemenyi test, q is obtained by querying a statistical table of the F distribution. The critical difference value (CDV) is obtained from Equation (4) and is applied to quantify the difference between EDECO and the nine compared algorithms based on the Friedman rankings.
C D V = q a × K × K + 1 6 N f
where q a is equal to 3.164. K is set to 10 and N f is set to 29. C D V is equal to 2.3291 in this subsection. Based on the Friedman rankings and CDV, Figure 7 illustrates the magnitude of the differences between EDECO and competing algorithms, where there is no significant difference between the CDV-connected algorithms. As shown in Figure 7, EDECO significantly outperforms all algorithms on 10D, and shows a significant difference with the other compared algorithms other than ISGTOA/MRFO on 30D. For 50D and 100D, there is no significant difference between EDECO and ISGTOA, EMTLBO, MRFO, but it is significantly better than the remaining algorithms. Notably, the proposed EDECO is significantly better than the basic ECO in all dimensions, which shows the effectiveness of our work.

4.4. Analysis of the Results of Engineering Design Problems

To further check the performance of the EDECO algorithm in the face of constrained optimization problems, ten engineering design optimization problems were selected as challenges. These engineering problems are summarized in Table 7. EDECO, ECO, and other competitors are involved in the challenges. The maximum number of function evaluations is again 5000 times the problem dimension. The penalty function method was used to transform the constrained problems into unconstrained optimization problems. The results of 30 independent runs are recorded in Table 8.
According to Table 8, we can observe that EDECO gives the best solutions to 5 problems (RW03, RW05, RW07, RW09, RW10) and ranks in the top 4 for the rest of these problems. basic ECO is ranked in the bottom 5 except for RW08. Similarly, this work created a Friedman test, as shown in Figure 8, which shows that EDECO achieves the best average ranking of 2.35 and that of ECO is 7.35. The Wilcoxon rank sum test also shows that EDECO achieves more “+” than “−”. In conclusion, EDECO successfully addresses a variety of real-world problems, demonstrating satisfactory performance. Its overall performance is highly competitive compared to other algorithms.

5. Conclusions

This work presents EDECO, a promising variant of ECO. The proposed EDECO combines an estimation of distribution algorithm through a hybrid search framework and incorporates a dynamic fitness distance balancing strategy to achieve a significant performance improvement. The excellent performance of EDECO is confirmed by a thorough comparison with advanced basic and improved algorithms. Experimental results on the CEC 2017 benchmarking functions show that EDECO outperforms SAO, CFOA, DBO, MRFO, ISGTOA, EMTLBO, TERIME, AFDB-ARO, and that there is a significant difference between it and the EDECO variants incorporating a single improvement technique. These results fully demonstrate that EDECO is a competitive metaheuristic variant that can efficiently face complex optimization problems with excellent convergence and robustness.
Although EDECO demonstrates promising optimization capabilities, as optimization problems continue to grow in complexity, there are still aspects of its design principles and methodologies that can be further enhanced. (1) Application to complex optimization problems: Future work could extend its application to areas such as mission planning (trajectory planning and target allocation), medical image segmentation, automated artistic design, and large-scale model architecture optimization. (2) Development of additional versions: Real-world problems are diverse and complex, necessitating the development of multi-objective versions of EDECO. Additionally, a binary version represents another promising research direction. (3) Further performance enhancement: While the proposed EDECO exhibits excellent overall performance, its suboptimal performance on certain functions motivates further improvements. We plan to refine the existing framework and explore integrating EDECO with other artificial intelligence techniques, such as reinforcement learning and deep learning. (4) Generalization of hybrid search framework: The hybrid search framework proposed in this work have proven effective in enhancing ECO’s performance. However, exploring their applicability to other metaheuristic algorithms may yield deeper insights and advancements.

Author Contributions

Conceptualization, W.T., Z.L. and M.L.; Data curation, S.S.; Formal analysis, S.S. and H.C.; Funding acquisition, H.C.; Methodology, W.T.; Project administration, Z.L. and M.L.; Resources, Z.L.; Software, W.T. and S.S.; Supervision, Z.L. and M.L.; Visualization, Z.L.; Writing—original draft, W.T. and S.S.; Writing—review and editing, W.T., S.S., Z.L., M.L. and H.C. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Natural Science Foundation of China, grant number 82272075.

Institutional Review Board Statement

Not applicable.

Data Availability Statement

Data will be made available on request.

Acknowledgments

The authors would like to thank their anonymous reviewers and editors for helping them improve this paper’s quality.

Conflicts of Interest

Author Zengtong Lu and Mengying Lin were employed by the company Ruijie Networks Co. Ltd. The remaining authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

Appendix A

Table A1. Results of CEC2017 10D functions obtained by EDECO and its competitors.
Table A1. Results of CEC2017 10D functions obtained by EDECO and its competitors.
FunctionIndexEDECOECOSAOCFOADBOMRFOISGTOAEMTLBOTERIMEAFDB-ARO
F1Best1.0000E+021.6664E+021.9038E+072.7621E+053.2279E+026.0470E+021.1085E+022.4813E+021.5648E+065.8734E+03
Mean4.2957E+021.0700E+045.3372E+071.4643E+074.4217E+062.6891E+031.9579E+032.2673E+031.0659E+072.0313E+05
Std6.2647E+021.1597E+042.6754E+071.5378E+071.6834E+072.4956E+032.7804E+032.3118E+036.5850E+061.6624E+05
F3Best3.0000E+023.0007E+024.6260E+023.0394E+023.0868E+023.0011E+024.1405E+023.0078E+023.4832E+021.7321E+03
Mean3.0000E+023.2631E+026.5598E+027.6556E+028.5396E+023.0168E+026.8141E+024.3992E+025.8486E+024.5160E+03
Std8.6380E−047.5387E+011.2294E+025.0501E+026.2468E+021.1112E+002.0294E+023.5523E+021.7054E+021.4564E+03
F4Best4.0083E+024.0001E+024.0796E+024.0163E+024.0000E+024.0010E+024.0433E+024.0157E+024.0391E+024.0354E+02
Mean4.0302E+024.0668E+024.0987E+024.0625E+024.1696E+024.0522E+024.0743E+024.0450E+024.0964E+024.1974E+02
Std1.1668E+001.0929E+017.7098E−012.0550E+002.4834E+011.2324E+019.2394E+001.4797E+001.2395E+011.2834E+01
F5Best5.0205E+025.0897E+025.2317E+025.0724E+025.0982E+025.0601E+025.0504E+025.2007E+025.0643E+025.1335E+02
Mean5.0886E+025.2259E+025.3303E+025.1714E+025.2661E+025.1760E+025.1545E+025.2994E+025.2007E+025.2326E+02
Std4.2109E+008.1581E+004.5427E+005.7959E+008.5577E+008.3764E+007.0016E+004.4260E+007.2650E+005.6912E+00
F6Best6.0000E+026.0012E+026.0272E+026.0362E+026.0000E+026.0003E+026.0001E+026.0037E+026.0167E+026.0005E+02
Mean6.0002E+026.0601E+026.0485E+026.0793E+026.0094E+026.0007E+026.0001E+026.0057E+026.0375E+026.0085E+02
Std1.4928E−026.2573E+001.2954E+002.8036E+001.9655E+005.3539E−026.5965E−031.0889E−011.6294E+008.0903E−01
F7Best7.1297E+027.1539E+027.4139E+027.1608E+027.1373E+027.1541E+027.1794E+027.3063E+027.2433E+027.2238E+02
Mean7.1959E+027.3383E+027.5167E+027.2427E+027.3068E+027.3133E+027.3312E+027.3967E+027.4657E+027.3581E+02
Std3.7326E+001.0140E+016.3675E+004.7256E+001.1252E+011.0544E+018.0637E+004.1249E+009.8485E+007.0266E+00
F8Best8.0207E+028.0598E+028.1490E+028.0540E+028.0796E+028.0597E+028.0485E+028.1366E+028.1103E+028.0970E+02
Mean8.1035E+028.1797E+028.2523E+028.1346E+028.2270E+028.1615E+028.1618E+028.3007E+028.2427E+028.2193E+02
Std4.5733E+007.5822E+005.6420E+005.3749E+001.0380E+015.9493E+007.2464E+005.0655E+008.5204E+006.1574E+00
F9Best9.0000E+029.0011E+029.0261E+029.0200E+029.0000E+029.0000E+029.0000E+029.0002E+029.0114E+029.1127E+02
Mean9.0002E+029.4177E+029.0655E+029.2348E+029.0076E+029.0002E+029.0000E+029.0006E+029.1843E+029.2992E+02
Std8.4016E−027.7080E+012.6248E+001.4525E+012.6067E+003.5700E−021.2697E−033.6407E−022.5649E+011.2864E+01
F10Best1.1763E+031.3355E+031.2980E+031.2881E+031.1949E+031.1263E+031.4615E+031.5430E+031.0808E+031.3045E+03
Mean1.5839E+031.6756E+031.8609E+031.6783E+031.7094E+031.6669E+031.8856E+032.0739E+031.6977E+031.6604E+03
Std2.3352E+022.0139E+022.6603E+022.0948E+022.8601E+022.9769E+022.3528E+022.1640E+022.6144E+021.2447E+02
F11Best1.1005E+031.1099E+031.1219E+031.1110E+031.1020E+031.1034E+031.1038E+031.1037E+031.1028E+031.1162E+03
Mean1.1049E+031.1463E+031.1327E+031.1362E+031.1477E+031.1090E+031.1089E+031.1102E+031.1274E+031.1276E+03
Std2.0791E+004.7048E+016.4853E+001.8116E+016.7728E+013.2771E+003.4521E+003.2839E+003.6658E+017.8775E+00
F12Best1.2273E+033.2310E+032.6652E+055.6445E+032.6847E+033.3395E+036.2037E+031.7274E+038.0496E+041.5557E+04
Mean1.9576E+038.3363E+041.5718E+061.1211E+059.3190E+052.1834E+043.3965E+041.6690E+042.7915E+069.0221E+04
Std7.7352E+022.7194E+051.8713E+061.5945E+052.3340E+061.7449E+042.2321E+041.6265E+042.6210E+069.3890E+04
F13Best1.3059E+031.5457E+032.8950E+031.9407E+031.3609E+031.3623E+031.5193E+031.3172E+031.5933E+031.4298E+03
Mean1.3478E+032.3046E+031.1363E+043.0314E+031.2106E+042.5061E+032.0692E+031.6346E+031.6372E+041.6666E+03
Std4.8201E+013.5032E+026.9110E+037.3297E+021.2162E+041.6506E+034.1559E+027.9352E+021.1418E+041.5366E+02
F14Best1.4008E+031.4290E+031.4760E+031.4389E+031.4343E+031.4394E+031.4346E+031.4257E+031.4221E+031.4138E+03
Mean1.4168E+031.4769E+031.5483E+031.4680E+031.5093E+031.4845E+031.4559E+031.4709E+031.4706E+031.4303E+03
Std1.0433E+012.8275E+015.2516E+011.6764E+015.1298E+012.9414E+011.2335E+011.1109E+025.9134E+015.7099E+00
F15Best1.5006E+031.5386E+031.6127E+031.5468E+031.5133E+031.5582E+031.5365E+031.5067E+031.5251E+031.5252E+03
Mean1.5080E+031.6551E+031.8152E+031.6344E+031.9052E+031.6985E+031.5995E+031.6425E+032.1907E+031.5583E+03
Std9.6205E+008.6561E+012.2347E+025.7593E+014.0463E+021.1731E+023.9219E+014.3228E+028.1787E+021.7649E+01
F16Best1.6015E+031.6020E+031.6152E+031.6025E+031.6020E+031.6017E+031.6031E+031.6031E+031.6036E+031.6033E+03
Mean1.6138E+031.6832E+031.6642E+031.6681E+031.7351E+031.6792E+031.6259E+031.6551E+031.6702E+031.6757E+03
Std2.0573E+018.5165E+015.4847E+016.6510E+011.1525E+027.9501E+012.9800E+014.2808E+017.5269E+016.4833E+01
F17Best1.7175E+031.7231E+031.7334E+031.7240E+031.7216E+031.7068E+031.7304E+031.7076E+031.7087E+031.7189E+03
Mean1.7418E+031.7529E+031.7592E+031.7436E+031.7586E+031.7386E+031.7527E+031.7442E+031.7393E+031.7347E+03
Std1.1004E+011.5976E+011.0842E+011.1883E+013.1297E+011.5425E+011.1949E+013.6363E+011.1835E+019.1603E+00
F18Best1.8071E+031.8742E+038.4281E+032.1484E+032.1990E+031.9932E+032.1726E+031.8453E+034.2416E+031.9191E+03
Mean1.8384E+035.1728E+033.4097E+044.7255E+031.6523E+047.7965E+034.3282E+036.0126E+032.4234E+042.5527E+03
Std2.7479E+014.7343E+031.3868E+042.2810E+031.4014E+045.7300E+032.8115E+036.5034E+031.4291E+048.8030E+02
F19Best1.9008E+031.9091E+031.9390E+031.9200E+031.9078E+031.9170E+031.9111E+031.9058E+031.9123E+031.9113E+03
Mean1.9041E+031.9516E+032.8731E+031.9632E+033.5221E+032.0876E+031.9438E+032.5114E+033.1538E+031.9264E+03
Std1.3937E+003.6330E+011.7041E+033.8064E+015.6984E+031.8673E+022.7025E+012.3483E+032.4763E+038.8024E+00
F20Best2.0225E+032.0226E+032.0468E+032.0268E+032.0003E+032.0040E+032.0121E+032.0488E+032.0243E+032.0026E+03
Mean2.0427E+032.0675E+032.0599E+032.0472E+032.0393E+032.0236E+032.0371E+032.0617E+032.0458E+032.0229E+03
Std1.4418E+012.2512E+016.7939E+001.3437E+013.0802E+011.6200E+011.2079E+018.4457E+001.8892E+019.2740E+00
F21Best2.2000E+032.2004E+032.2026E+032.2031E+032.1000E+032.1006E+032.2006E+032.2033E+032.2028E+032.2025E+03
Mean2.2009E+032.2122E+032.2185E+032.2070E+032.2058E+032.2095E+032.2486E+032.2095E+032.2044E+032.2182E+03
Std1.2701E+003.4297E+013.8974E+013.0528E+002.9369E+014.0516E+015.7567E+012.0731E+011.0412E+001.8449E+01
F22Best2.2000E+032.2001E+032.2452E+032.2214E+032.2258E+032.2002E+032.2000E+032.2096E+032.2329E+032.2443E+03
Mean2.2484E+032.2592E+032.3049E+032.3043E+032.2988E+032.2900E+032.2866E+032.2898E+032.2849E+032.2786E+03
Std3.9288E+014.0937E+012.4568E+012.1868E+012.9958E+013.1154E+013.3905E+013.3679E+013.3443E+011.9401E+01
F23Best2.6039E+032.6104E+032.6247E+032.3057E+032.6112E+032.6081E+032.6073E+032.6148E+032.6116E+032.3054E+03
Mean2.6135E+032.6256E+032.6333E+032.5791E+032.6304E+032.6179E+032.6164E+032.6288E+032.6244E+032.6242E+03
Std5.0863E+001.1549E+014.9813E+001.0848E+021.0260E+016.3946E+006.6986E+005.2466E+009.3523E+006.0964E+01
F24Best2.5000E+032.5002E+032.5091E+032.4619E+032.5000E+032.5000E+032.5004E+032.5492E+032.4548E+032.4878E+03
Mean2.6513E+032.6684E+032.6843E+032.5621E+032.6660E+032.6584E+032.6888E+032.7003E+032.5866E+032.5564E+03
Std1.1707E+021.1922E+021.1885E+024.8869E+011.1388E+021.1772E+021.0547E+029.2779E+011.1624E+025.0899E+01
F25Best2.8977E+032.8978E+032.8984E+032.8985E+032.8981E+032.8978E+032.8979E+032.8980E+032.8993E+032.6677E+03
Mean2.9212E+032.9242E+032.9361E+032.9042E+032.9350E+032.9217E+032.9219E+032.9146E+032.9315E+032.8863E+03
Std2.3397E+012.3309E+012.0725E+016.8861E+002.7293E+012.3395E+012.3470E+012.1658E+012.4599E+017.3027E+01
F26Best2.9000E+032.9001E+032.9251E+032.9143E+032.9000E+032.9000E+032.9000E+032.9002E+032.8986E+032.7746E+03
Mean2.9000E+032.9496E+032.9508E+032.9626E+033.0151E+032.9063E+032.9125E+032.9012E+032.9334E+032.9420E+03
Std2.9357E−038.7581E+011.5971E+014.0287E+014.3364E+012.2587E+012.4017E+016.0566E−013.1184E+017.3499E+01
F27Best3.0892E+033.0894E+033.0903E+033.0899E+033.0904E+033.0901E+033.0890E+033.0904E+033.0908E+033.1064E+03
Mean3.0914E+033.0938E+033.0953E+033.0955E+033.0964E+033.0981E+033.0902E+033.0914E+033.0965E+033.1135E+03
Std2.5005E+003.0748E+001.5795E+003.0515E+003.4404E+004.8215E+009.8906E−016.4803E−013.1208E+004.2835E+00
F28Best3.1000E+033.1003E+033.1614E+033.1208E+033.1691E+033.1001E+033.1003E+033.1050E+033.1208E+033.0258E+03
Mean3.2417E+033.3182E+033.2439E+033.1868E+033.2769E+033.1762E+033.2228E+033.1616E+033.1841E+033.2103E+03
Std1.2722E+021.2387E+021.0220E+022.8216E+011.0483E+021.1853E+021.1112E+028.1973E+012.2536E+017.1913E+01
F29Best3.1382E+033.1379E+033.1725E+033.1433E+033.1581E+033.1463E+033.1486E+033.1487E+033.1513E+033.1526E+03
Mean3.1613E+033.2046E+033.1970E+033.1831E+033.2039E+033.1890E+033.1867E+033.1937E+033.1825E+033.2028E+03
Std1.6949E+015.4528E+011.6699E+012.3472E+014.8482E+012.9891E+011.8095E+013.2183E+011.9909E+011.9113E+01
F30Best3.5310E+034.0582E+031.5663E+044.0153E+033.7068E+034.2384E+036.5611E+033.7827E+037.7210E+031.6514E+04
Mean1.7054E+041.5101E+053.8045E+054.7171E+045.6042E+053.0943E+051.4982E+051.9457E+051.2525E+053.1662E+05
Std5.4232E+042.6223E+054.6557E+056.5635E+044.7247E+055.9605E+052.0978E+053.3016E+051.8985E+052.8525E+05
Table A2. Results of CEC2017 30D functions obtained by EDECO and its competitors.
Table A2. Results of CEC2017 30D functions obtained by EDECO and its competitors.
FunctionIndexEDECOECOSAOCFOADBOMRFOISGTOAEMTLBOTERIMEAFDB-ARO
F1Best3.5853E+031.8798E+081.5334E+091.4219E+091.1622E+051.4842E+054.5167E+024.4013E+041.9993E+085.3758E+04
Mean4.9269E+046.0544E+092.2325E+092.5321E+096.6359E+073.1884E+053.9321E+031.4834E+055.7717E+082.4551E+05
Std4.7262E+046.0700E+093.8007E+086.7906E+084.2155E+071.0483E+053.5069E+031.2583E+052.2459E+082.5486E+05
F3Best4.7261E+023.9840E+032.1904E+041.1979E+043.1055E+043.2941E+031.6652E+049.3023E+031.7843E+045.3358E+04
Mean1.4839E+032.0230E+043.8791E+042.5105E+046.0561E+047.6418E+032.9248E+042.3871E+043.0373E+046.8846E+04
Std1.1725E+031.3013E+046.7160E+038.1251E+031.2430E+042.3586E+035.6130E+031.0428E+047.4690E+037.4843E+03
F4Best4.7390E+024.9456E+026.0635E+026.0970E+025.0414E+024.7704E+024.7324E+024.0530E+025.2611E+024.8858E+02
Mean5.0551E+021.0444E+036.6682E+028.0685E+025.5655E+025.1327E+025.0931E+024.9537E+025.8357E+025.8445E+02
Std1.9095E+016.6393E+023.5430E+011.1865E+024.5631E+012.3040E+012.3799E+012.7206E+014.1930E+015.5177E+01
F5Best5.4094E+026.0573E+026.9230E+026.3193E+025.9806E+025.6223E+025.4172E+026.6241E+025.9825E+026.1479E+02
Mean5.8542E+027.1637E+027.2215E+026.5977E+026.6218E+026.2209E+025.7493E+026.8169E+026.4807E+026.5841E+02
Std2.8339E+016.1073E+011.1111E+011.6024E+013.5511E+013.3567E+012.2021E+011.1742E+012.7103E+012.2357E+01
F6Best6.0106E+026.2603E+026.1583E+026.2499E+026.0190E+026.0108E+026.0015E+026.0131E+026.0795E+026.0028E+02
Mean6.0475E+026.4938E+026.2051E+026.3385E+026.1638E+026.0723E+026.0108E+026.0239E+026.1435E+026.0401E+02
Std3.9282E+001.0213E+012.7081E+004.7430E+009.1168E+006.2859E+008.9407E−016.3896E−013.5540E+001.8552E+00
F7Best7.6834E+029.4425E+029.6284E+028.7955E+027.8856E+028.0939E+027.9933E+028.9880E+028.8523E+028.2939E+02
Mean8.4154E+021.0388E+039.9582E+029.2468E+028.8444E+028.9657E+028.6537E+029.1698E+029.5985E+029.2549E+02
Std3.1560E+017.7198E+011.7530E+012.4418E+015.7465E+014.6704E+013.4335E+018.9337E+003.7372E+013.3806E+01
F8Best8.3509E+028.6123E+029.7549E+028.8974E+028.9655E+028.7124E+028.4981E+029.5806E+028.9688E+028.9611E+02
Mean8.7371E+029.7668E+021.0081E+039.3058E+029.6214E+029.1229E+028.9826E+029.8264E+029.5883E+029.4937E+02
Std2.2744E+015.3143E+011.4282E+011.7267E+014.1875E+012.9953E+014.1726E+011.0425E+013.2728E+012.9174E+01
F9Best9.0433E+023.2233E+031.5184E+032.0071E+031.8011E+039.7482E+029.0642E+029.0232E+021.6121E+031.4160E+03
Mean1.1556E+034.7235E+031.9180E+032.6645E+034.1434E+032.2691E+039.2449E+029.0617E+022.9295E+033.5874E+03
Std3.6346E+021.1065E+032.2971E+023.3270E+021.7601E+031.0866E+031.5994E+013.1675E+001.0727E+038.4869E+02
F10Best4.2899E+034.6992E+036.6048E+034.4764E+034.0126E+033.3620E+034.5943E+036.8829E+034.7262E+033.1511E+03
Mean5.4251E+036.8069E+037.8792E+035.7604E+035.2110E+034.6535E+037.1802E+037.9964E+035.3581E+034.4002E+03
Std4.8742E+021.2070E+034.3006E+024.8723E+021.0125E+038.3787E+029.6906E+023.1933E+023.8398E+024.9661E+02
F11Best1.1516E+031.3029E+031.4707E+031.4554E+031.2425E+031.1692E+031.2184E+031.1846E+031.2422E+031.3013E+03
Mean1.2058E+031.7200E+031.5712E+032.0863E+031.4768E+031.2524E+031.2883E+031.2435E+031.3030E+031.3891E+03
Std3.8199E+014.3220E+026.4426E+014.2008E+021.1410E+023.8805E+013.3773E+013.6881E+013.3278E+015.3945E+01
F12Best8.4870E+048.8398E+061.2822E+081.6513E+072.6367E+051.3412E+051.0270E+055.6330E+045.8909E+061.0669E+06
Mean1.1786E+062.3229E+081.9003E+084.3437E+072.0950E+079.1000E+056.3194E+054.6360E+052.9142E+073.7432E+06
Std1.1725E+062.7811E+084.6227E+072.1107E+072.2789E+076.1352E+055.5558E+055.2563E+051.9110E+071.8801E+06
F13Best4.2787E+032.9940E+041.1349E+071.9964E+049.0004E+031.7716E+031.9850E+033.1097E+032.6020E+052.8668E+04
Mean1.7099E+041.5274E+054.7321E+073.8128E+052.5876E+061.3795E+041.6967E+041.8384E+042.3864E+068.3025E+04
Std1.0988E+041.1931E+052.2350E+074.0397E+051.1126E+071.4773E+041.5633E+041.7343E+042.0286E+064.7870E+04
F14Best1.4692E+031.7132E+037.6594E+033.2079E+035.1374E+031.9696E+032.2725E+031.5551E+034.1630E+032.6925E+03
Mean1.5381E+031.0688E+045.7076E+041.3681E+047.0775E+048.9148E+035.6761E+031.0653E+045.5694E+041.6611E+04
Std4.0604E+012.2994E+043.2445E+049.6129E+037.2087E+041.0114E+043.6488E+031.4796E+045.1384E+042.1909E+04
F15Best1.7917E+038.0654E+031.8656E+055.0579E+035.6375E+031.6862E+031.9668E+031.8370E+034.9155E+043.5552E+03
Mean2.6605E+033.8155E+046.4030E+054.2980E+045.2732E+041.3594E+048.4133E+035.9693E+034.2753E+051.0271E+04
Std1.1536E+032.5747E+044.5952E+058.5200E+044.4799E+041.1359E+046.9659E+038.0073E+035.8961E+058.5133E+03
F16Best1.8764E+032.4560E+032.5964E+032.3083E+032.1511E+031.9740E+031.8135E+032.2495E+032.0119E+032.3131E+03
Mean2.3550E+033.2266E+033.0932E+032.6917E+032.8233E+032.4829E+032.5431E+032.9768E+032.6158E+032.8355E+03
Std2.0524E+024.2048E+022.3477E+022.3150E+022.5899E+022.6349E+023.5624E+023.3758E+022.6273E+022.1094E+02
F17Best1.7752E+031.8233E+031.9310E+031.8474E+031.9575E+031.7622E+031.8091E+031.8461E+031.8045E+031.8066E+03
Mean1.8665E+032.4374E+032.0905E+031.9948E+032.3040E+031.9995E+031.9514E+032.0727E+032.1190E+032.1496E+03
Std5.5747E+012.9224E+021.0785E+021.1028E+021.9838E+021.5034E+028.7658E+011.4285E+021.6418E+021.6868E+02
F18Best2.0216E+033.3520E+042.3171E+053.5239E+046.3540E+043.9240E+043.9583E+042.0502E+046.9762E+043.8799E+04
Mean4.4653E+031.4280E+051.0518E+061.7164E+051.0691E+062.3526E+051.4651E+051.8297E+051.0907E+062.4321E+05
Std4.1174E+031.2811E+056.6436E+059.0793E+041.6016E+062.1715E+059.5910E+042.1689E+051.0467E+061.4595E+05
F19Best1.9578E+037.3817E+038.2549E+054.3255E+032.3272E+031.9680E+032.0895E+032.1009E+034.5360E+043.0313E+03
Mean2.3392E+036.9921E+053.0986E+064.6557E+042.5519E+051.1806E+046.7214E+037.4914E+035.7122E+059.6765E+03
Std7.4841E+021.4884E+062.1506E+064.4514E+045.2710E+051.1027E+046.8501E+036.5254E+036.3471E+055.8900E+03
F20Best2.1398E+032.3796E+032.2267E+032.1611E+032.1074E+032.1354E+032.0708E+032.4872E+032.0876E+032.2057E+03
Mean2.2998E+032.7301E+032.3706E+032.3951E+032.4172E+032.3597E+032.3705E+032.6765E+032.3045E+032.4704E+03
Std8.1987E+011.6670E+029.9238E+011.0307E+021.6437E+021.5060E+021.5837E+029.3655E+011.4405E+021.2810E+02
F21Best2.3294E+032.3802E+032.4792E+032.2712E+032.4013E+032.3588E+032.3397E+032.4519E+032.4056E+032.4247E+03
Mean2.3717E+032.4880E+032.5030E+032.4282E+032.4694E+032.3944E+032.3921E+032.4753E+032.4423E+032.4742E+03
Std2.2960E+014.3173E+011.1959E+013.3935E+013.4156E+012.2091E+013.0322E+011.2087E+012.1659E+013.0114E+01
F22Best2.3011E+032.6138E+032.5181E+032.4980E+032.3331E+032.3043E+032.3000E+032.3114E+032.3592E+032.3753E+03
Mean2.5841E+036.9933E+032.6302E+032.7315E+033.5236E+032.3082E+032.3009E+032.3170E+033.2830E+033.7056E+03
Std1.0617E+032.3481E+034.7988E+011.2306E+021.8174E+033.2849E+002.5812E+007.7546E+001.7647E+037.5454E+02
F23Best2.6871E+032.7892E+032.8429E+032.7697E+032.7630E+032.7216E+032.6702E+032.7831E+032.7607E+032.7231E+03
Mean2.7302E+033.0693E+032.8767E+032.8174E+032.8258E+032.7707E+032.7270E+032.8307E+032.8108E+032.8776E+03
Std3.0587E+011.5218E+021.5796E+012.2455E+013.2286E+013.1139E+013.5226E+011.4477E+012.9073E+014.0662E+01
F24Best2.8477E+032.9981E+033.0135E+032.9160E+032.9314E+032.8796E+032.8518E+032.9819E+032.9438E+032.9449E+03
Mean2.8937E+033.2848E+033.0403E+032.9712E+033.0139E+032.9490E+032.8973E+032.9983E+033.0064E+033.0613E+03
Std2.3362E+012.6656E+021.2813E+012.3655E+014.1297E+014.7133E+012.9738E+019.8678E+003.0880E+014.3458E+01
F25Best2.8837E+032.9523E+032.9525E+033.0171E+032.8836E+032.8854E+032.8838E+032.8864E+032.9093E+032.8925E+03
Mean2.8930E+033.1020E+032.9840E+033.0752E+032.9278E+032.9080E+032.8973E+032.8981E+032.9688E+032.9471E+03
Std1.1365E+011.3885E+021.9704E+012.6449E+012.7584E+011.6994E+011.3843E+011.3010E+013.4831E+013.2337E+01
F26Best2.9026E+033.9479E+035.6661E+033.6904E+033.5683E+032.8151E+032.9005E+032.8971E+033.6141E+033.2338E+03
Mean4.2223E+036.6306E+035.8661E+034.5460E+035.3572E+034.4276E+034.2369E+035.0101E+035.2988E+034.8218E+03
Std6.7182E+021.3141E+031.2924E+027.1305E+027.6308E+021.1087E+034.2625E+028.5062E+024.5702E+026.6758E+02
F27Best3.1981E+033.2259E+033.2299E+033.2497E+033.2144E+033.2275E+033.1920E+033.1967E+033.2297E+033.2395E+03
Mean3.2287E+033.4130E+033.2472E+033.2838E+033.2463E+033.2622E+033.2231E+033.2183E+033.2468E+033.2861E+03
Std1.5952E+011.3752E+029.1073E+002.0281E+011.9538E+012.5217E+011.2978E+019.9354E+001.1614E+012.7234E+01
F28Best3.2036E+033.3439E+033.3620E+033.3355E+033.2783E+033.2054E+033.2057E+033.2044E+033.2564E+033.2517E+03
Mean3.2358E+033.8122E+033.4150E+033.4571E+033.3696E+033.2387E+033.2381E+033.2395E+033.3282E+033.3048E+03
Std2.0493E+013.5926E+022.8925E+015.2352E+015.8336E+011.9556E+012.2474E+012.6919E+013.4461E+014.4028E+01
F29Best3.4413E+034.1395E+033.6585E+033.6709E+033.4487E+033.4508E+033.4773E+033.5604E+033.4460E+033.9445E+03
Mean3.7831E+034.7846E+034.0276E+034.0191E+033.8829E+033.7543E+033.7063E+033.9275E+033.7678E+034.2511E+03
Std2.0069E+023.8145E+021.9800E+021.9051E+022.3622E+021.7281E+021.5409E+022.2096E+022.0310E+021.8549E+02
F30Best7.0601E+033.7739E+054.0037E+067.0087E+048.7955E+031.0040E+041.1231E+047.7881E+031.4603E+057.4578E+04
Mean2.6531E+047.7681E+061.1103E+079.3399E+057.1791E+053.2885E+042.5177E+042.1048E+041.1605E+061.3491E+05
Std1.2868E+048.4947E+063.3596E+067.0461E+051.5598E+062.4483E+041.3490E+041.0263E+048.1768E+055.5937E+04
Table A3. Results of CEC2017 50D functions obtained by EDECO and its competitors.
Table A3. Results of CEC2017 50D functions obtained by EDECO and its competitors.
FunctionIndexEDECOECOSAOCFOADBOMRFOISGTOAEMTLBOTERIMEAFDB-ARO
F1Best1.4571E+065.6577E+076.9231E+099.5444E+093.2487E+085.1922E+064.0229E+047.6106E+051.9259E+092.2990E+06
Mean3.5528E+061.8317E+089.3995E+091.4547E+101.3196E+091.1478E+072.5893E+053.4394E+064.1220E+096.5651E+06
Std1.4347E+061.2870E+081.3249E+092.9557E+096.8850E+084.1979E+062.2062E+051.5875E+061.1922E+093.1512E+06
F3Best3.0061E+038.6664E+036.6131E+044.5934E+048.4925E+043.5865E+046.6214E+042.8709E+046.0095E+041.3451E+05
Mean1.1319E+042.6586E+041.0712E+057.1119E+041.5901E+056.7079E+048.5481E+045.9353E+041.0348E+051.6300E+05
Std4.4909E+031.0144E+041.4259E+041.2932E+042.5369E+041.5212E+048.7477E+031.8463E+041.6173E+041.1859E+04
F4Best4.9273E+024.9158E+021.1474E+031.3540E+036.1612E+025.1473E+025.0293E+024.7347E+027.7844E+025.7754E+02
Mean6.0056E+026.7618E+021.4520E+032.1145E+038.8836E+026.3204E+025.7501E+025.9728E+029.8306E+027.1280E+02
Std4.8819E+016.0625E+011.7027E+023.3981E+021.7182E+025.4772E+014.3377E+014.6562E+011.9798E+026.4158E+01
F5Best6.3297E+026.7207E+028.9488E+027.9229E+026.9434E+027.2676E+026.0359E+028.3962E+027.5360E+027.4068E+02
Mean7.0237E+027.7635E+029.4910E+028.4085E+028.5440E+027.8957E+026.7864E+028.7298E+028.2588E+028.1373E+02
Std4.3790E+014.7648E+012.2381E+012.7446E+016.4625E+013.4239E+016.0281E+011.4400E+013.9934E+014.0320E+01
F6Best6.0578E+026.3479E+026.2785E+026.3827E+026.1516E+026.1000E+026.0292E+026.0236E+026.1576E+026.0198E+02
Mean6.1694E+026.4996E+026.3288E+026.4797E+026.3491E+026.3005E+026.0658E+026.0417E+026.2450E+026.0570E+02
Std7.5902E+008.0826E+002.7969E+004.4560E+008.5352E+001.4432E+012.5376E+009.4614E−014.9206E+002.0383E+00
F7Best9.1220E+021.1344E+031.2276E+031.1674E+039.9536E+021.0107E+038.7259E+021.1104E+031.1241E+039.5697E+02
Mean1.0335E+031.2648E+031.3052E+031.2558E+031.1415E+031.1562E+031.0068E+031.1384E+031.2832E+031.1418E+03
Std8.8554E+019.4668E+013.0312E+014.4444E+011.1124E+029.5887E+017.4750E+011.6057E+016.4815E+016.5160E+01
F8Best9.3147E+021.0026E+031.2144E+031.0687E+031.0298E+039.7591E+028.8803E+021.1343E+031.0215E+031.0093E+03
Mean9.9433E+021.1059E+031.2508E+031.1468E+031.1652E+031.0917E+039.7380E+021.1756E+031.1331E+031.1115E+03
Std4.0889E+014.8825E+012.1391E+013.7597E+017.3935E+014.3284E+014.4825E+011.5611E+014.6594E+014.0203E+01
F9Best1.6079E+034.9280E+034.2648E+036.4620E+036.3920E+034.3773E+031.0310E+039.2793E+024.2940E+039.9808E+03
Mean3.0381E+031.1144E+046.1216E+031.0011E+041.5787E+041.1545E+041.6295E+031.0162E+038.7111E+031.4154E+04
Std1.1013E+033.0185E+039.3311E+021.7321E+035.5372E+034.3055E+036.0065E+027.9423E+012.6925E+032.1460E+03
F10Best7.3194E+037.0215E+031.2577E+049.1524E+036.4686E+036.1631E+031.1259E+041.3361E+047.7493E+036.0613E+03
Mean8.8318E+039.1607E+031.3564E+041.0522E+049.0607E+037.7242E+031.3501E+041.4194E+049.3570E+037.2025E+03
Std9.6066E+021.1235E+035.7587E+028.0518E+021.9612E+031.0677E+039.9227E+023.8259E+028.3628E+026.4934E+02
F11Best1.2156E+031.3403E+032.3599E+032.2379E+031.6858E+031.3214E+031.5665E+031.3444E+031.4841E+031.5422E+03
Mean1.3152E+031.4850E+033.5760E+036.1667E+032.1549E+031.4012E+031.7418E+031.4964E+031.7287E+031.8904E+03
Std5.2322E+017.4516E+016.2601E+022.1994E+033.4170E+027.1460E+011.0656E+021.3680E+021.5074E+022.4726E+02
F12Best1.6262E+054.0213E+061.2047E+094.0234E+082.2107E+072.0031E+066.8412E+058.5532E+057.7370E+075.9556E+06
Mean5.7692E+062.7218E+072.0328E+099.6952E+083.7227E+086.2400E+064.2419E+065.7091E+063.1533E+082.2375E+07
Std4.6743E+061.9095E+074.0748E+083.6970E+083.4082E+083.1370E+062.8463E+065.4459E+061.5261E+081.3337E+07
F13Best5.7030E+031.3468E+042.0973E+086.3440E+067.3659E+043.0417E+036.5961E+032.8226E+033.8572E+063.3551E+04
Mean2.1805E+044.4932E+043.9510E+083.6781E+072.1890E+079.1735E+031.5998E+041.1332E+041.8464E+072.3006E+05
Std1.1430E+042.5659E+041.0329E+082.3831E+073.3136E+076.1190E+039.4381E+037.7613E+031.2079E+072.2370E+05
F14Best1.5360E+031.9063E+031.9055E+052.1165E+041.2970E+041.5200E+041.5649E+042.1553E+035.2986E+043.8584E+04
Mean1.8077E+036.5826E+046.4809E+051.6101E+055.7000E+057.6210E+047.1461E+042.9783E+044.6576E+052.3939E+05
Std1.8956E+025.5929E+043.1268E+059.8685E+045.7977E+054.3757E+044.7562E+043.3252E+043.8850E+051.6627E+05
F15Best2.1615E+033.5936E+038.4871E+062.2841E+042.6372E+041.8441E+032.3422E+032.0106E+031.7056E+052.5278E+03
Mean6.4379E+032.2461E+042.6119E+074.4362E+052.5828E+069.3681E+031.0743E+048.7553E+032.8011E+062.6350E+04
Std3.9671E+031.4666E+041.3965E+075.7830E+057.7912E+066.2748E+037.7850E+036.5189E+032.1062E+062.5135E+04
F16Best2.1354E+032.9226E+033.7299E+032.7202E+032.8484E+032.6576E+032.5314E+033.6980E+032.6821E+033.3207E+03
Mean3.0779E+033.6648E+034.5635E+033.2883E+033.7882E+033.2520E+033.2719E+034.5149E+033.7340E+033.9394E+03
Std3.4244E+023.9041E+023.5518E+023.0553E+024.5251E+023.9062E+024.5172E+023.2194E+024.9631E+023.5738E+02
F17Best2.3775E+032.6270E+032.7748E+032.3838E+033.0036E+032.2286E+032.1686E+032.0017E+032.4424E+032.8230E+03
Mean2.7994E+033.3434E+033.8192E+032.9952E+033.6013E+033.0171E+032.8593E+033.1160E+033.1397E+033.4096E+03
Std2.4619E+022.9163E+022.8520E+022.7802E+023.3359E+022.5309E+023.3731E+025.1167E+023.8048E+022.2994E+02
F18Best3.7954E+037.3458E+041.4138E+061.2752E+056.2889E+051.4027E+051.0878E+054.9158E+041.9874E+053.8207E+05
Mean5.8613E+045.9098E+056.0765E+061.4581E+063.5497E+068.5259E+058.6838E+053.7656E+054.5622E+062.7442E+06
Std7.7921E+045.5627E+054.3362E+061.0569E+063.5171E+066.1322E+055.1368E+053.1220E+053.2993E+061.5239E+06
F19Best2.2174E+036.1925E+035.6395E+063.2375E+041.7300E+042.8185E+032.1579E+032.0688E+031.3366E+057.5472E+03
Mean7.3595E+032.5497E+042.4370E+071.6139E+051.7929E+061.4697E+041.6694E+041.2260E+041.3489E+061.9150E+04
Std3.9523E+038.1732E+031.0652E+079.5140E+042.7954E+069.0050E+039.7398E+031.0314E+041.2465E+069.5367E+03
F20Best2.5180E+032.3742E+032.7325E+032.4865E+032.7722E+032.5964E+032.5909E+033.5232E+032.5817E+032.7475E+03
Mean2.8774E+033.0968E+033.2717E+032.9780E+033.3338E+033.0316E+033.3161E+033.8074E+033.0464E+033.2122E+03
Std1.9984E+023.3144E+022.6393E+022.0589E+022.5965E+023.0114E+023.6145E+021.3175E+023.0076E+022.6898E+02
F21Best2.3680E+032.4905E+032.6925E+032.5781E+032.5768E+032.4393E+032.3761E+032.6140E+032.5560E+032.5637E+03
Mean2.4631E+032.5907E+032.7319E+032.6195E+032.6802E+032.5244E+032.4385E+032.6626E+032.6239E+032.6544E+03
Std4.3196E+015.2773E+011.9844E+012.1787E+015.7542E+014.4399E+013.5296E+011.8541E+013.9873E+014.8311E+01
F22Best6.7987E+032.3447E+033.2003E+035.4288E+034.8107E+032.3313E+032.3089E+032.5429E+039.4390E+037.0214E+03
Mean1.0087E+041.0069E+047.6308E+039.4152E+031.1526E+049.7564E+031.3245E+041.4771E+041.1140E+048.8594E+03
Std1.1371E+031.8858E+035.8083E+032.4111E+032.5523E+031.8027E+033.9421E+032.8428E+039.5129E+028.4583E+02
F23Best2.8479E+033.0072E+033.1786E+033.0237E+033.0416E+032.9000E+032.8393E+033.0404E+032.9939E+033.0919E+03
Mean2.9338E+033.1453E+033.2088E+033.1393E+033.1748E+033.0500E+032.8932E+033.0965E+033.0824E+033.2264E+03
Std4.7904E+018.5304E+012.0915E+013.8963E+016.1739E+019.6164E+013.6843E+012.1783E+014.2069E+017.4182E+01
F24Best3.0125E+033.1681E+033.3146E+033.2174E+033.1874E+033.1031E+032.9912E+033.2323E+033.2070E+033.2221E+03
Mean3.0902E+033.3262E+033.3532E+033.2983E+033.3282E+033.2142E+033.0572E+033.2651E+033.2928E+033.4096E+03
Std4.8379E+011.2271E+021.5142E+013.8169E+017.5584E+017.5636E+014.6080E+011.4946E+015.5279E+017.1777E+01
F25Best3.0322E+033.0574E+033.6429E+033.7371E+033.0755E+033.0424E+033.0377E+033.0448E+033.2080E+032.9806E+03
Mean3.1110E+033.1584E+033.8005E+034.2779E+033.2609E+033.1456E+033.1056E+033.0990E+033.3671E+033.1301E+03
Std3.5737E+015.6819E+011.1913E+022.9234E+029.5714E+014.1801E+012.5326E+012.5660E+018.5678E+014.5933E+01
F26Best2.9860E+033.6398E+038.0625E+034.8993E+033.8068E+033.0963E+034.8921E+036.9757E+036.8200E+034.6792E+03
Mean5.5483E+037.7332E+038.5635E+037.4666E+038.0673E+036.3767E+035.5010E+037.2866E+037.6992E+037.5752E+03
Std9.8548E+021.3803E+032.1426E+021.1438E+031.2007E+032.0040E+034.8579E+021.6993E+025.7225E+021.0166E+03
F27Best3.2660E+033.3398E+033.4380E+033.5595E+033.3393E+033.4570E+033.2864E+033.2629E+033.3605E+033.5924E+03
Mean3.4936E+033.5701E+033.5116E+033.7629E+033.5513E+033.6681E+033.4236E+033.3481E+033.4969E+033.7463E+03
Std1.3416E+021.5752E+025.1577E+019.1196E+011.1520E+021.3683E+029.7737E+016.4026E+019.0940E+011.1915E+02
F28Best3.2761E+033.3520E+033.7543E+034.3455E+033.3636E+033.3500E+033.3137E+033.2745E+033.3966E+033.3281E+03
Mean3.3613E+033.5025E+033.9405E+034.8506E+034.2937E+033.4423E+033.3817E+033.3499E+033.6407E+033.4142E+03
Std4.1062E+019.0431E+011.3177E+022.9620E+021.3669E+035.7332E+013.5195E+013.6448E+011.0751E+025.5563E+01
F29Best3.5775E+034.0253E+034.5959E+034.6803E+034.3264E+033.7351E+033.5819E+034.1589E+033.6850E+034.4702E+03
Mean4.2611E+034.6943E+035.5336E+035.4406E+034.8183E+034.4037E+034.2100E+034.7933E+034.4121E+035.0798E+03
Std3.4768E+023.8582E+023.3499E+024.1664E+023.4596E+023.0366E+022.7398E+023.3744E+023.5888E+023.3495E+02
F30Best7.8209E+051.3797E+066.8969E+073.0117E+072.4684E+062.3959E+068.6368E+051.1290E+065.6045E+062.7514E+06
Mean1.4393E+063.7645E+061.3771E+085.5311E+071.2973E+074.3730E+061.3741E+061.9651E+061.4093E+074.2771E+06
Std6.2791E+052.4260E+063.7086E+071.7702E+078.0992E+061.3638E+063.7860E+059.6758E+056.0105E+061.1205E+06
Table A4. Results of CEC2017 100D functions obtained by EDECO and its competitors.
Table A4. Results of CEC2017 100D functions obtained by EDECO and its competitors.
FunctionIndexEDECOECOSAOCFOADBOMRFOISGTOAEMTLBOTERIMEAFDB-ARO
F1Best6.4093E+076.0811E+083.5632E+105.4419E+109.0795E+094.6751E+089.9740E+079.1571E+072.1991E+104.5955E+06
Mean1.4361E+081.6215E+094.6462E+106.6144E+104.0977E+108.9030E+082.6073E+081.6669E+083.1931E+101.1789E+07
Std7.8703E+077.4915E+084.2203E+096.0628E+093.1955E+104.4942E+081.5579E+085.2449E+075.9902E+095.8211E+06
F3Best4.0463E+046.6301E+042.4806E+051.5671E+052.8620E+051.5744E+051.9993E+051.3521E+052.4960E+053.1429E+05
Mean6.1024E+041.1645E+052.8120E+052.0870E+053.6571E+052.0055E+052.2948E+052.0759E+053.4402E+053.3288E+05
Std1.3122E+042.5409E+041.4935E+042.1433E+045.1842E+042.0904E+041.1920E+044.8423E+044.8397E+041.0476E+04
F4Best7.6212E+029.4142E+024.5433E+035.4287E+031.5645E+031.0202E+037.8019E+027.9924E+022.2109E+037.2445E+02
Mean8.8858E+021.1599E+035.5153E+038.4545E+032.9785E+031.1847E+039.2100E+029.2000E+023.3919E+038.2946E+02
Std7.3712E+011.6728E+026.7475E+021.2564E+031.5163E+031.4424E+027.8512E+016.5828E+015.8852E+024.5782E+01
F5Best8.5002E+021.0185E+031.5643E+031.3647E+031.2312E+031.1118E+038.4750E+021.3914E+031.2981E+031.0625E+03
Mean1.0275E+031.2708E+031.6158E+031.4657E+031.5057E+031.2595E+039.3635E+021.4372E+031.4114E+031.2890E+03
Std1.0774E+021.2176E+022.3377E+014.1069E+011.2239E+027.9360E+016.5141E+012.8196E+016.6943E+019.7417E+01
F6Best6.1763E+026.4768E+026.4894E+026.5933E+026.4245E+026.3969E+026.1626E+026.0931E+026.2868E+026.0570E+02
Mean6.3915E+026.6007E+026.5363E+026.6782E+026.6146E+026.5400E+026.2490E+026.1172E+026.4324E+026.1032E+02
Std8.2945E+006.1166E+002.8516E+003.7147E+008.0898E+007.5418E+005.3530E+001.3589E+007.1420E+002.4438E+00
F7Best1.4940E+031.8708E+032.2571E+032.0971E+031.5914E+031.8735E+031.3469E+031.6680E+032.2462E+031.5950E+03
Mean1.8011E+032.4316E+032.3744E+032.4179E+032.0263E+032.2564E+031.4935E+031.7402E+032.6407E+031.8356E+03
Std1.9682E+022.4183E+026.2421E+011.1261E+021.6821E+022.8758E+021.1602E+023.0045E+012.3334E+021.3959E+02
F8Best1.1644E+031.3980E+031.8549E+031.7396E+031.5839E+031.3472E+031.1418E+031.6358E+031.5582E+031.3971E+03
Mean1.3591E+031.6245E+031.9207E+031.8359E+031.8703E+031.5863E+031.2519E+031.7240E+031.7214E+031.6172E+03
Std9.8046E+011.1160E+023.1367E+015.1949E+011.2464E+021.1414E+021.0182E+024.0498E+019.5055E+019.1618E+01
F9Best6.4841E+032.0204E+042.4678E+042.8417E+042.7954E+042.5934E+047.3478E+031.9319E+032.5362E+042.0557E+04
Mean1.6538E+042.7902E+043.5242E+043.3004E+046.2106E+043.3334E+041.5419E+043.5161E+034.1077E+043.0685E+04
Std6.5364E+034.3580E+035.5667E+033.1879E+031.3189E+046.8115E+034.0988E+031.8623E+031.1121E+044.5494E+03
F10Best1.4943E+041.4207E+042.9421E+042.0445E+041.5559E+041.2625E+042.4677E+042.9213E+041.9660E+041.3310E+04
Mean1.8405E+041.8867E+043.0418E+042.4330E+042.2372E+041.7040E+042.9320E+043.0748E+042.2291E+041.4707E+04
Std2.4196E+032.5409E+034.9822E+021.3768E+036.1053E+032.4499E+031.9333E+034.6133E+021.3058E+039.0095E+02
F11Best2.6776E+033.1419E+033.1504E+042.7488E+044.3360E+041.4914E+041.8090E+044.1607E+031.1006E+043.5813E+04
Mean3.1285E+035.3797E+034.7227E+044.6798E+046.9393E+042.3603E+042.8114E+041.2780E+042.3087E+046.4962E+04
Std3.3494E+021.3946E+037.2536E+038.1994E+032.2234E+044.2792E+034.9756E+038.1886E+038.5232E+031.6572E+04
F12Best1.3646E+077.1724E+078.6900E+096.2214E+097.8804E+083.1173E+071.2097E+071.7337E+071.5451E+093.3473E+07
Mean4.8815E+072.3802E+081.2173E+109.7865E+092.3839E+098.7579E+074.1293E+074.3574E+073.4930E+091.0621E+08
Std2.5076E+071.0824E+081.4290E+092.0611E+098.7968E+083.6325E+071.7645E+072.0526E+079.9177E+084.1603E+07
F13Best6.4394E+032.6385E+049.1054E+089.1188E+072.2712E+051.0386E+041.4118E+046.6219E+033.5726E+071.4415E+04
Mean1.3939E+049.2609E+041.3446E+095.8024E+087.5769E+071.8477E+042.3862E+041.1945E+048.8798E+074.2557E+05
Std9.9074E+036.6426E+042.4487E+082.2919E+086.8310E+078.0874E+035.7207E+033.8850E+035.2428E+073.4788E+05
F14Best3.2207E+039.8429E+042.8928E+063.6465E+059.0888E+052.7660E+052.9125E+057.0233E+042.1120E+062.5136E+05
Mean6.5823E+045.3485E+055.4714E+062.6675E+064.7113E+068.5821E+059.4091E+054.1067E+058.4961E+062.4644E+06
Std5.3852E+042.7186E+051.4656E+069.4721E+053.0285E+064.9473E+053.7929E+053.0308E+054.4363E+061.4171E+06
F15Best2.3150E+034.8222E+032.3791E+083.8192E+066.4001E+042.4095E+034.7605E+032.4786E+032.8956E+061.4789E+04
Mean7.2317E+032.5925E+043.4627E+083.5469E+074.5170E+064.9756E+038.6631E+036.4260E+031.1330E+077.5247E+04
Std5.5274E+031.6154E+047.0196E+072.4602E+079.8311E+063.2721E+034.2534E+036.0441E+037.1382E+065.1243E+04
F16Best4.7424E+034.7474E+039.7048E+036.5083E+035.3172E+034.6752E+033.6894E+037.4613E+035.3675E+034.9856E+03
Mean5.5830E+036.3978E+031.0476E+047.9632E+037.7569E+035.8261E+035.3651E+038.6555E+037.4023E+036.3867E+03
Std5.6509E+027.0682E+023.7297E+026.1990E+028.7524E+026.4629E+028.0469E+025.5024E+028.2011E+025.3963E+02
F17Best3.8551E+034.5805E+037.3927E+034.8945E+035.6912E+034.2075E+033.3422E+033.2757E+035.0000E+035.1547E+03
Mean4.5337E+035.6151E+038.1467E+035.7177E+036.9405E+034.8591E+034.6841E+034.9468E+035.5768E+035.8943E+03
Std4.2414E+025.3745E+023.8130E+024.4822E+026.6657E+024.7794E+025.8098E+021.0638E+034.5075E+024.5471E+02
F18Best4.3418E+043.0406E+055.5141E+061.1565E+061.5655E+064.1188E+054.5790E+052.2056E+053.7643E+061.4942E+06
Mean1.4338E+059.0488E+051.2158E+072.2582E+068.5901E+061.4103E+061.8148E+066.2667E+051.5943E+073.4406E+06
Std7.3365E+047.7698E+054.9804E+066.0869E+053.3367E+066.0317E+051.2761E+064.9173E+058.2148E+061.4594E+06
F19Best2.1407E+038.1980E+031.9383E+087.9498E+061.6328E+062.3924E+032.3973E+032.2590E+033.3597E+067.1631E+03
Mean5.0396E+036.0871E+043.3563E+083.8904E+072.2604E+076.0791E+037.5209E+036.7378E+031.4327E+071.1509E+05
Std2.9285E+038.0844E+047.4788E+072.3203E+072.5585E+075.1265E+035.7939E+036.4609E+037.1633E+061.2569E+05
F20Best3.7956E+034.1226E+034.8723E+034.3659E+034.3748E+034.1083E+033.6959E+036.5424E+034.1070E+034.3926E+03
Mean4.9623E+035.1888E+036.5603E+035.2178E+035.7324E+034.9617E+036.2439E+037.0705E+035.2824E+035.1608E+03
Std3.7074E+026.2052E+025.6847E+023.9827E+027.2338E+025.2654E+027.2337E+022.0211E+025.0263E+023.8231E+02
F21Best2.6194E+032.9237E+033.3190E+033.1841E+033.3325E+032.7405E+032.6411E+033.1862E+033.1202E+033.0421E+03
Mean2.8083E+033.2018E+033.4089E+033.2673E+033.5474E+033.0409E+032.7383E+033.2268E+033.2604E+033.1906E+03
Std1.0277E+021.5398E+023.2660E+015.3679E+019.9253E+011.1397E+026.9729E+012.1495E+017.0566E+018.3527E+01
F22Best1.7614E+041.9499E+047.4025E+031.6604E+041.8554E+041.7447E+042.4826E+043.0568E+042.1620E+041.5437E+04
Mean2.2725E+042.2688E+042.4609E+042.7098E+042.2372E+042.0620E+043.1464E+043.2649E+042.4806E+041.7425E+04
Std2.4022E+031.9610E+031.1631E+042.4908E+034.2882E+031.5848E+032.1144E+036.3771E+021.3441E+031.1396E+03
F23Best3.1682E+033.5303E+033.9090E+033.8556E+033.7089E+033.4956E+033.1559E+033.4709E+033.5583E+033.4100E+03
Mean3.3771E+033.8586E+034.0133E+033.9695E+033.9365E+033.6897E+033.3083E+033.6690E+033.6609E+033.5250E+03
Std1.1487E+021.7642E+024.4756E+016.8572E+011.1981E+021.0000E+028.1744E+015.8575E+017.5736E+017.5286E+01
F24Best3.7263E+034.0586E+034.4380E+034.4667E+034.2727E+034.2481E+033.5457E+034.0783E+034.1346E+034.2543E+03
Mean3.9355E+034.6301E+034.5658E+034.6656E+034.6140E+034.5428E+033.7692E+034.1699E+034.3724E+034.4724E+03
Std1.2929E+022.7836E+026.9515E+018.8737E+011.7135E+021.8692E+029.3922E+014.6972E+019.7893E+011.1071E+02
F25Best3.4223E+033.6827E+035.7920E+036.9568E+034.0796E+033.6645E+033.4618E+033.4474E+034.9998E+033.3405E+03
Mean3.5806E+033.9365E+036.9471E+037.9971E+036.2492E+033.8484E+033.6179E+033.6168E+036.0505E+033.4439E+03
Std7.9968E+011.8347E+024.8499E+025.6848E+022.7327E+038.8690E+017.1202E+016.1172E+016.5654E+025.5448E+01
F26Best1.0533E+048.5487E+031.7934E+041.8823E+041.5170E+041.3860E+049.7523E+031.2915E+041.4236E+041.1040E+04
Mean1.2744E+041.7401E+041.8936E+042.1379E+041.9009E+041.9604E+041.1189E+041.4550E+041.6705E+041.7907E+04
Std1.3238E+033.0059E+034.2890E+022.1401E+031.9271E+033.1054E+031.0519E+035.6074E+028.9228E+022.2523E+03
F27Best3.5303E+033.5501E+033.8565E+034.2956E+033.5366E+033.7935E+033.5249E+033.4047E+033.6293E+033.6656E+03
Mean3.6733E+033.8081E+034.1141E+034.6228E+033.7682E+034.0820E+033.6646E+033.5011E+033.8731E+033.8970E+03
Std1.0819E+021.4572E+021.4381E+021.7352E+021.6798E+021.7284E+021.0799E+025.7106E+011.0054E+021.0671E+02
F28Best3.5166E+033.7497E+037.1696E+039.4069E+035.5837E+033.8265E+033.6324E+033.5310E+035.4898E+033.4881E+03
Mean3.6374E+034.5645E+038.0727E+031.0781E+041.5105E+044.2162E+033.7474E+033.6600E+036.8604E+034.1791E+03
Std6.4295E+012.3610E+035.7234E+027.4127E+024.5069E+032.5532E+026.8253E+015.8586E+011.2241E+032.3644E+03
F29Best5.9190E+036.9693E+031.0007E+049.5806E+037.1834E+035.9217E+035.8411E+037.4655E+036.2682E+037.1984E+03
Mean6.7814E+037.9910E+031.1244E+041.0430E+048.7717E+037.3753E+036.9994E+038.6778E+037.6190E+037.8121E+03
Std6.8647E+025.8233E+024.4027E+024.6823E+028.8805E+025.9343E+026.5606E+025.8396E+025.4083E+024.2690E+02
F30Best3.2533E+045.1093E+058.6458E+082.3485E+087.6644E+061.6746E+051.3255E+057.1824E+041.3486E+071.7498E+05
Mean9.0560E+043.9727E+061.1898E+094.6489E+084.7662E+074.2200E+054.8348E+052.6844E+056.2636E+075.5747E+05
Std6.0173E+042.7152E+061.8612E+081.6817E+083.1427E+072.2887E+052.6316E+051.2535E+052.9629E+072.1458E+05

References

  1. 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]
  2. 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]
  3. 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 Health Inform. 2015, 5, 1059–1064. [Google Scholar] [CrossRef]
  4. 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, 24, 5297–5310. [Google Scholar] [CrossRef]
  5. Hinton, G.E.; Salakhutdinov, R.R. Reducing the Dimensionality of Data with Neural Networks. Science 2006, 313, 504–507. [Google Scholar] [CrossRef] [PubMed]
  6. Yang, X.S. Nature-Inspired Optimization Algorithms: Challenges and Open Problems. J. Comput. Sci. 2020, 46, 101104. [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. CMES—Comput. Model. Eng. Sci. 2022, 130, 331–364. [Google Scholar] [CrossRef]
  8. 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]
  9. Ficarella, E.; Lamberti, L.; Degertekin, S.O. Mechanical Identification of Materials and Structures with Optical Methods and Metaheuristic Optimization. Materials 2019, 12, 2133. [Google Scholar] [CrossRef]
  10. Ascencion-Mestiza, H.; Maximov, S.; Mezura-Montes, E.; Olivares-Galvan, J.C.; Ocon-Valdez, R.; Escarela-Perez, R. Estimation of the Equivalent Circuit Parameters in Transformers Using Evolutionary Algorithms. Math. Comput. Appl. 2023, 28, 36. [Google Scholar] [CrossRef]
  11. Sharma, A. Antenna Array Pattern Synthesis Using Metaheuristic Algorithms: A Review. IETE Tech. Rev. (Inst. Electron. Telecommun. Eng. India) 2023, 40, 90–115. [Google Scholar] [CrossRef]
  12. Wu, D.; Jia, H.; Abualigah, L.; Xing, Z.; Zheng, R.; Wang, H.; Altalhi, M. Enhance Teaching-Learning-Based Optimization for Tsallis-Entropy-Based Feature Selection Classification Approach. Processes 2022, 10, 360. [Google Scholar] [CrossRef]
  13. Wu, D.; Zhang, W.; Jia, H.; Leng, X. Simultaneous Feature Selection and Support Vector Machine Optimization Using an Enhanced Chimp Optimization Algorithm. Algorithms 2021, 14, 282. [Google Scholar] [CrossRef]
  14. Tan, M.; Tang, A.; Ding, D.; Xie, L.; Huang, C. Autonomous Air Combat Maneuvering Decision Method of UCAV Based on LSHADE-TSO-MPC under Enemy Trajectory Prediction. Electronics 2022, 11, 3383. [Google Scholar] [CrossRef]
  15. Jin, B.; Gonçalves, N.; Cruz, L.; Medvedev, I.; Yu, Y.Y.; Wang, J.J. Simulated Multimodal Deep Facial Diagnosis. Expert Syst. Appl. 2024, 252, 123881. [Google Scholar] [CrossRef]
  16. 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]
  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] [PubMed]
  18. 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. Clust. Comput. 2022, 25, 4221–4232. [Google Scholar] [CrossRef]
  19. Ma, Z.; Wu, G.; Suganthan, P.N.; Song, A.; Luo, Q. Performance Assessment and Exhaustive Listing of 500+ Nature-Inspired Metaheuristic Algorithms. Swarm Evol. Comput. 2023, 77, 101248. [Google Scholar] [CrossRef]
  20. Glover, F. Future Paths for Integer Programming and Links to Artificial Intelligence. Comput. Oper. Res. 1986, 13, 533–549. [Google Scholar] [CrossRef]
  21. Windras Mara, S.T.; Norcahyo, R.; Jodiawan, P.; Lusiantoro, L.; Rifai, A.P. A Survey of Adaptive Large Neighborhood Search Algorithms and Applications. Comput. Oper. Res. 2022, 146, 105903. [Google Scholar] [CrossRef]
  22. Abualigah, L.; Al-qaness, M.A.A.; Abd Elaziz, M.; Ewees, A.A.; Oliva, D.; Cuong-Le, T. The Non-Monopolize Search (NO): A Novel Single-Based Local Search Optimization Algorithm. Neural Comput. Appl. 2024, 36, 5305–5332. [Google Scholar] [CrossRef]
  23. 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]
  24. Holland, J.H. Genetic Algorithms. Sci. Am. 1992, 267, 66–72. [Google Scholar] [CrossRef]
  25. Opara, K.R.; Arabas, J. Differential Evolution: A Survey of Theoretical Analyses. Swarm Evol. Comput. 2019, 44, 546–558. [Google Scholar] [CrossRef]
  26. Beyer, H.-G.; Schwefel, H.-P. Evolution Strategies—A Comprehensive Introduction. Nat. Comput. 2002, 1, 3–52. [Google Scholar] [CrossRef]
  27. 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]
  28. Sulaiman, M.H.; Mustaffa, Z.; Saari, M.M.; Daniyal, H.; Mirjalili, S. Evolutionary Mating Algorithm. Neural Comput. Appl. 2023, 35, 487–516. [Google Scholar] [CrossRef]
  29. Huang, W.; Xu, J. Particle Swarm Optimization. In Springer Tracts in Civil Engineering; Springer: Berlin, Germany, 2023. [Google Scholar]
  30. Karaboga, D.; Akay, B. A Comparative Study of Artificial Bee Colony Algorithm. Appl. Math. Comput. 2009, 214, 108–132. [Google Scholar] [CrossRef]
  31. Jia, H.; Rao, H.; Wen, C.; Mirjalili, S. Crayfish Optimization Algorithm. Artif. Intell. Rev. 2023, 56, 1919–1979. [Google Scholar] [CrossRef]
  32. 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]
  33. Jia, H.; Peng, X.; Lang, C. Remora Optimization Algorithm. Expert Syst. Appl. 2021, 185, 115665. [Google Scholar] [CrossRef]
  34. Xie, L.; Han, T.; Zhou, H.; Zhang, Z.-R.; Han, B.; Tang, A. Tuna Swarm Optimization: A Novel Swarm-Based Metaheuristic Algorithm for Global Optimization. Comput. Intell. Neurosci. 2021, 2021, 9210050. [Google Scholar] [CrossRef] [PubMed]
  35. Aribowo, W. A Novel Improved Sea-Horse Optimizer for Tuning Parameter Power System Stabilizer. J. Robot. Control 2023, 4, 12–22. [Google Scholar] [CrossRef]
  36. Rashedi, E.; Nezamabadi-pour, H.; Saryazdi, S. GSA: A Gravitational Search Algorithm. Inf. Sci. 2009, 179, 2232–2248. [Google Scholar] [CrossRef]
  37. 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]
  38. 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]
  39. 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]
  40. 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]
  41. Faramarzi, A.; Heidarinejad, M.; Stephens, B.; Mirjalili, S. Equilibrium Optimizer: A Novel Optimization Algorithm. Knowl.-Based Syst. 2020, 191, 105190. [Google Scholar] [CrossRef]
  42. 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]
  43. 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]
  44. Mirjalili, S. SCA: A Sine Cosine Algorithm for Solving Optimization Problems. Knowl.-Based Syst. 2016, 96, 120–133. [Google Scholar] [CrossRef]
  45. Abualigah, L.; Altalhi, M. A Novel Generalized Normal Distribution Arithmetic Optimization Algorithm for Global Optimization and Data Clustering Problems. J. Ambient Intell. Humaniz. Comput. 2024, 15, 389–417. [Google Scholar] [CrossRef]
  46. Tanyildizi, E.; Demir, G. Golden Sine Algorithm: A Novel Math-Inspired Algorithm. Adv. Electr. Comput. Eng. 2017, 17, 71–78. [Google Scholar] [CrossRef]
  47. Zhao, W.G.; Wang, L.Y.; Zhang, Z.X.; 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]
  48. 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]
  49. Fakhouri, H.N.; Awaysheh, F.M.; Alawadi, S.; Alkhalaileh, M.; Hamad, F. Four Vector Intelligent Metaheuristic for Data Optimization. Computing 2024, 106, 2321–2359. [Google Scholar] [CrossRef]
  50. Abdel-Basset, M.; El-Shahat, D.; Jameel, M.; Abouhawwash, M. Exponential Distribution Optimizer (EDO): A Novel Math-Inspired Algorithm for Global Optimization and Engineering Problems. Artif. Intell. Rev. 2023, 56, 9329–9400. [Google Scholar] [CrossRef]
  51. Rao, R.V.; Savsani, V.J.; Vakharia, D.P. Teaching-Learning-Based Optimization: A Novel Method for Constrained Mechanical Design Optimization Problems. CAD Comput. Aided Des. 2011, 43, 303–315. [Google Scholar] [CrossRef]
  52. Zhang, Y.; Chi, A. Group Teaching Optimization Algorithm with Information Sharing for Numerical Optimization and Engineering Optimization. J. Intell. Manuf. 2023, 34, 1547–1571. [Google Scholar] [CrossRef]
  53. Jia, H.; Wen, Q.; Wang, Y.; Mirjalili, S. Catch Fish Optimization Algorithm: A New Human Behavior Algorithm for Solving Clustering Problems. Clust. Comput. 2024, 27, 13295–13332. [Google Scholar] [CrossRef]
  54. Trojovský, P. A New Human-Based Metaheuristic Algorithm for Solving Optimization Problems Based on Preschool Education. Sci. Rep. 2023, 13, 21472. [Google Scholar] [CrossRef] [PubMed]
  55. Oladejo, S.O.; Ekwe, S.O.; Mirjalili, S. The Hiking Optimization Algorithm: A Novel Human-Based Metaheuristic Approach. Knowl.-Based Syst. 2024, 296, 111880. [Google Scholar] [CrossRef]
  56. Das, B.; Mukherjee, V.; Das, D. Student Psychology Based Optimization Algorithm: A New Population Based Optimization Algorithm for Solving Optimization Problems. Adv. Eng. Softw. 2020, 146, 102804. [Google Scholar] [CrossRef]
  57. Lian, J.B.; Zhu, T.; Ma, L.; Wu, X.C.; Heidari, A.A.; Chen, Y.; Chen, H.L.; Hui, G.H. The Educational Competition Optimizer. Int. J. Syst. Sci. 2024, 55, 3185–3222. [Google Scholar] [CrossRef]
  58. Xue, J.; Shen, B. Dung Beetle Optimizer: A New Meta-Heuristic Algorithm for Global Optimization. J. Supercomput. 2023, 79, 7305–7336. [Google Scholar] [CrossRef]
  59. 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]
  60. Jiang, Z.; Zou, F.; Chen, D.; Cao, S.; Liu, H.; Guo, W. An Ensemble Multi-Swarm Teaching–Learning-Based Optimization Algorithm for Function Optimization and Image Segmentation. Appl. Soft Comput. 2022, 130, 109653. [Google Scholar] [CrossRef]
  61. Chen, S.-S.; Jiang, Y.-T.; Chen, W.; Li, X.-Y. TERIME: An Improved RIME Algorithm with Enhanced Exploration and Exploitation for Robust Parameter Extraction of Photovoltaic Models. arXiv 2024, arXiv:2407.18986. [Google Scholar]
  62. Ozkaya, B.; Duman, S.; Kahraman, H.T.; Guvenc, U. Optimal Solution of the Combined Heat and Power Economic Dispatch Problem by Adaptive Fitness-Distance Balance Based Artificial Rabbits Optimization Algorithm. Expert Syst. Appl. 2024, 238, 122272. [Google Scholar] [CrossRef]
Figure 1. Sketch for hybrid search framework.
Figure 1. Sketch for hybrid search framework.
Biomimetics 10 00176 g001
Figure 2. A flowchart of the proposed EDECO.
Figure 2. A flowchart of the proposed EDECO.
Biomimetics 10 00176 g002
Figure 3. Multiple comparisons using CDV to evaluate ECO, EDECO and its two variants.
Figure 3. Multiple comparisons using CDV to evaluate ECO, EDECO and its two variants.
Biomimetics 10 00176 g003aBiomimetics 10 00176 g003b
Figure 4. Rankings based on “Ave” of EDECO and its comparison algorithms on each benchmark function.
Figure 4. Rankings based on “Ave” of EDECO and its comparison algorithms on each benchmark function.
Biomimetics 10 00176 g004
Figure 5. The visualization of Wilcoxon rank sum test results between EDECO and its competitors (a = 0.05).
Figure 5. The visualization of Wilcoxon rank sum test results between EDECO and its competitors (a = 0.05).
Biomimetics 10 00176 g005
Figure 6. The visualization of Friedman test results between EDECO and its competitors.
Figure 6. The visualization of Friedman test results between EDECO and its competitors.
Biomimetics 10 00176 g006
Figure 7. Multiple comparisons using CDV to evaluate EDECO and its competitors.
Figure 7. Multiple comparisons using CDV to evaluate EDECO and its competitors.
Biomimetics 10 00176 g007
Figure 8. The Friedman ranking of EDECO and its competitors on constrained engineering optimization problems.
Figure 8. The Friedman ranking of EDECO and its competitors on constrained engineering optimization problems.
Biomimetics 10 00176 g008
Table 1. Detailed description of CEC2017 test functions.
Table 1. Detailed description of CEC2017 test functions.
Test SuiteTypeNo.Fmin
CEC2017Unimodal functionsF1–F3100–300
Multimodal functionsF4–F10400–1000
Hybrid functionsF11–F201100–2000
Composition functionsF21–F302100–3000
Search range [−100, 100]
Table 2. Parameter settings for ten algorithms.
Table 2. Parameter settings for ten algorithms.
AlgorithmParameter Settings
EDECO H = 0.5 , G 1 = 0.2 , G 2 = 0.1 , α = 10 , β = 0.4
ECO H = 0.5 , G 1 = 0.2 , G 2 = 0.1
SAO k = 1 , N 1 = 0.5 N
CFOA p ( 3 , 4 )
DBO P = 0.2 , r 1 = 0.9 , α = 0.3 , β = 0.1
MRFO S = 2
ISGTOA A r = 2 N
EMTLBO p i n i = 0 , p min = 0.6 , r 1 = 0.8
TERIME w max = 0.3 , w min = 0.0625
AFDB-ARO a = 2 , w = 0.5
Table 3. The rankings of EDECO and its variants in CEC 2017 test suite according to the Friedman test (a = 0.05).
Table 3. The rankings of EDECO and its variants in CEC 2017 test suite according to the Friedman test (a = 0.05).
Test SuiteDimensionECOEECODECOEDECOp-Value
CEC 2017103.902.482.341.284.75E−13
303.832.382.661.149.89E−14
504.002.212.721.071.25E−16
1003.832.142.761.285.36E−13
Mean ranking3.892.302.621.19NaN
Table 4. The results of Wilcoxon rank sum test between EDECO and its variants (a = 0.05).
Table 4. The results of Wilcoxon rank sum test between EDECO and its variants (a = 0.05).
vs. ECO
+/=/−
CEC-2017 Test Suite
10D30D50D100D
EECO22/6/119/10/020/9/021/8/0
DECO21/7/115/12/217/12/019/10/0
EDECO28/1/027/2/027/2/026/3/0
Table 5. The results of Wilcoxon rank sum test between EDECO and its competitors (a = 0.05).
Table 5. The results of Wilcoxon rank sum test between EDECO and its competitors (a = 0.05).
EDECO
vs. +/=/−
CEC-2017 Test SuiteTotal
10D30D50D100D
ECO27/2/029/0/026/3/026/3/0108/8/0
SAO28/1/029/0/027/1/129/0/0113/2/1
CFOA22/6/128/1/027/2/029/0/0106/9/1
DBO25/4/027/2/027/2/028/0/1107/8/1
MRFO22/6/119/7/321/6/223/4/285/23/8
ISGTOA22/6/113/12/410/9/1012/9/857/36/23
EMTLBO25/3/120/4/518/7/417/9/380/23/13
TERIME24/5/026/3/027/2/028/1/0105/11/0
AFDB-ARO23/4/227/1/125/1/321/2/696/8/12
Table 6. The results of Friedman test between EDECO and its competitors.
Table 6. The results of Friedman test between EDECO and its competitors.
AlgorithmCEC-2017 Test Suite
10D30D50D100DMean RankingOverall Ranking
EDECO1.82761.96552.20692.06902.01721
ECO6.44838.68975.41385.17246.43107
SAO8.31038.20698.72418.79318.508610
CFOA5.13796.37937.03458.27596.70698
DBO7.82766.75867.79317.75867.53459
MRFO4.62073.51724.00004.20694.08623
ISGTOA4.24142.41382.96553.37933.25002
EMTLBO5.27594.48284.24144.10344.52594
TERIME6.17246.24146.51726.72416.41386
AFDB-ARO5.13796.34486.10344.51725.52595
p-value5.00E−173.11E−282.81E−236.25E−27N/AN/A
Table 7. Ten real-world constrained engineering optimization problems.
Table 7. Ten real-world constrained engineering optimization problems.
ProblemNameD
RW01Tension/compression spring design problem3
RW02Pressure vessel design problem4
RW03Three-bar truss design problem2
RW04Welded beam design problem4
RW05Speed reducer design problem7
RW06Gear train design problem4
RW07Rolling element bearing design10
RW08Cantilever beam design problem5
RW09Multiple disk clutch brake design problem5
RW10Step-cone pulley problem5
Table 8. Results of ten real-world constrained optimization problems obtained by EDECO and its competitors.
Table 8. Results of ten real-world constrained optimization problems obtained by EDECO and its competitors.
No.IndexEDECOECOSAOCFOADBOMRFOISGTOAEMTLBOTERIMEAFDB-ARO
RW1Best1.2669E−021.2685E−021.2738E−021.2674E−021.2719E−021.2758E−021.2686E−021.2666E−021.2791E−021.2820E−02
Mean1.2864E−021.3817E−021.2890E−021.2727E−021.4052E−021.3242E−021.2834E−021.2728E−021.5126E−021.3139E−02
Std7.5060E−041.4828E−031.7802E−041.8317E−051.7973E−033.6082E−049.2758E−057.9627E−052.4163E−031.9551E−04
Rank48519732106
RW2Best5.8704E+035.9533E+035.8937E+035.8718E+035.8701E+035.8961E+035.9027E+035.8710E+036.1334E+035.9138E+03
Mean6.0663E+036.5032E+036.3398E+036.4378E+036.5134E+036.2741E+036.1319E+035.9778E+038.7195E+036.0595E+03
Std3.3002E+024.6657E+025.5444E+027.6231E+025.5236E+022.4423E+022.0576E+021.3536E+022.0960E+039.6526E+01
Rank38679541102
RW3Best2.6389E+022.6389E+022.6390E+022.6389E+022.6389E+022.6389E+022.6389E+022.6389E+022.6389E+022.6389E+02
Mean2.6389E+022.6409E+022.6393E+022.6389E+022.6389E+022.6389E+022.6389E+022.6389E+022.6402E+022.6393E+02
Std4.4858E−104.1803E−012.5896E−027.7140E−032.1837E−031.3741E−032.4102E−033.5728E−041.4606E−012.4251E−02
Rank11086534297
RW4Best1.6929E+001.7159E+001.7040E+001.7031E+001.6928E+001.6986E+001.7002E+001.6939E+001.7469E+001.7473E+00
Mean1.7078E+001.8940E+001.7334E+001.8028E+001.7246E+001.7098E+001.7125E+001.7018E+001.8904E+001.8253E+00
Std2.0634E−021.6516E−011.6138E−028.1996E−023.8621E−027.7329E−036.8060E−038.4140E−039.6649E−025.3845E−02
Rank2.00E+001.00E+016.00E+007.00E+005.00E+003.00E+004.00E+001.00E+009.00E+008.00E+00
RW5Best2.9936E+032.9936E+032.9953E+032.9937E+032.9936E+032.9951E+032.9936E+032.9936E+032.9943E+032.9942E+03
Mean2.9936E+032.9994E+033.0045E+033.0031E+032.9959E+032.9982E+032.9936E+032.9937E+033.0134E+032.9956E+03
Std1.0406E−046.3475E+005.2540E+007.7544E+004.6170E+001.8148E+001.4899E−042.4555E−021.6217E+011.3795E+00
Rank17985623104
RW6Best2.7009E−122.7009E−122.3078E−112.7009E−122.3078E−112.7009E−122.7009E−122.7009E−122.7009E−122.7009E−12
Mean7.7801E−111.8517E−092.6352E−093.8504E−102.4014E−096.4834E−112.7514E−107.7968E−102.0626E−093.6345E−10
Std1.6781E−104.8789E−095.3234E−094.4710E−104.8591E−092.4769E−104.0326E−101.0022E−091.7757E−094.3973E−10
Rank27105913684
RW7Best−2.4358E+05−2.4358E+05−2.4358E+05−2.4358E+05−2.4358E+05−2.4319E+05−2.4358E+05−2.4358E+05−2.4358E+05−2.4334E+05
Mean−2.4358E+05−2.4358E+05−2.4358E+05−2.4358E+05−2.4358E+05−2.4216E+05−2.4358E+05−2.4358E+05−2.3989E+05−2.4000E+05
Std6.7933E−115.2908E−023.1848E+002.4655E−021.6469E−057.1829E+027.1494E−111.1181E−103.8019E+032.3898E+03
Rank15764823109
RW8Best1.3400E+001.3405E+001.3417E+001.3402E+001.3400E+001.3400E+001.3408E+001.3405E+001.3726E+001.3437E+00
Mean1.3404E+001.3831E+001.3455E+001.4912E+001.3403E+001.3404E+001.3421E+001.3416E+001.5795E+001.3497E+00
Std7.1854E−044.2430E−022.4454E−031.9531E−012.1076E−042.5067E−048.1659E−047.9139E−041.4039E−013.8672E−03
Rank38691254107
RW9Best3.9247E+083.9247E+083.9247E+083.9247E+083.9247E+083.9247E+083.9247E+083.9247E+083.9247E+083.9247E+08
Mean3.9247E+083.9247E+083.9247E+083.9247E+083.9247E+083.9247E+083.9247E+083.9247E+083.9247E+083.9247E+08
Std1.8187E−071.8187E−071.8187E−071.8187E−071.8187E−071.8187E−071.8187E−071.8187E−071.8187E−071.8187E−07
Rank1111111111
RW10Best1.6086E+011.6115E+011.8052E+011.6090E+011.6453E+011.6137E+011.6195E+011.6090E+011.6596E+011.8704E+01
Mean1.6090E+011.6634E+012.1916E+011.6714E+012.3561E+011.6481E+011.6625E+011.6180E+011.7934E+012.6097E+01
Std8.3474E−033.4454E−013.1844E+004.3513E−012.2653E+012.2656E−012.6490E−011.8328E−011.6910E+007.8801E+00
Rank15869342710
Friedman ranking2.357.357.056.056.154.353.652.958.856.25
Wilconxon rank sum results9/1/09/1/08/2/07/3/07/1/28/1/16/4/09/1/08/1/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

Tang, W.; Shi, S.; Lu, Z.; Lin, M.; Cheng, H. EDECO: An Enhanced Educational Competition Optimizer for Numerical Optimization Problems. Biomimetics 2025, 10, 176. https://doi.org/10.3390/biomimetics10030176

AMA Style

Tang W, Shi S, Lu Z, Lin M, Cheng H. EDECO: An Enhanced Educational Competition Optimizer for Numerical Optimization Problems. Biomimetics. 2025; 10(3):176. https://doi.org/10.3390/biomimetics10030176

Chicago/Turabian Style

Tang, Wenkai, Shangqing Shi, Zengtong Lu, Mengying Lin, and Hao Cheng. 2025. "EDECO: An Enhanced Educational Competition Optimizer for Numerical Optimization Problems" Biomimetics 10, no. 3: 176. https://doi.org/10.3390/biomimetics10030176

APA Style

Tang, W., Shi, S., Lu, Z., Lin, M., & Cheng, H. (2025). EDECO: An Enhanced Educational Competition Optimizer for Numerical Optimization Problems. Biomimetics, 10(3), 176. https://doi.org/10.3390/biomimetics10030176

Article Metrics

Back to TopTop