Next Article in Journal
Analyticity of the Cauchy Problem for a Three-Component Generalization of Camassa–Holm Equation
Previous Article in Journal
RISOPA: Rapid Imperceptible Strong One-Pixel Attacks in Deep Neural Networks
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Enhanced Dung Beetle Optimization Algorithm for Practical Engineering Optimization

School of Mechanical and Vehicle Engineering, Changchun University, Changchun 130022, China
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(7), 1084; https://doi.org/10.3390/math12071084
Submission received: 14 March 2024 / Revised: 30 March 2024 / Accepted: 2 April 2024 / Published: 3 April 2024

Abstract

:
An enhanced dung beetle optimization algorithm (EDBO) is proposed for nonlinear optimization problems with multiple constraints in manufacturing. Firstly, the dung beetle rolling phase is improved by removing the worst value interference and coupling the current solution with the optimal solution to each other, while retaining the advantages of the original formulation. Subsequently, to address the problem that the dung beetle dancing phase focuses only on the information of the current solution, which leads to the overly stochastic and inefficient exploration of the problem space, the globally optimal solution is introduced to steer the dung beetle, and a stochastic factor is added to the optimal solution. Finally, the dung beetle foraging phase introduces the Jacobi curve to further enhance the algorithm’s ability to jump out of the local optimum and avoid the phenomenon of premature convergence. The performance of EDBO in optimization is tested using the CEC2017 function set, and the significance of the algorithm is verified by the Wilcoxon rank-sum test and the Friedman test. The experimental results show that EDBO has strong optimization-seeking accuracy and optimization-seeking stability. By solving four engineering optimization problems of varying degrees, EDBO has proven to have good adaptability and robustness.

1. Introduction

As society and the economy evolve swiftly, numerous optimization challenges have surfaced across various disciplines including engineering, economics, logistics, and operations research, focusing on the distribution of resources, scheduling, and enhancing engineering efficiency [1,2,3]. The core challenge is to find the most favorable outcome in a complex solution space while considering the trade-offs between conflicting objectives and constraints. The engineering optimization problem is one of the most important classes of optimization problems in engineering and manufacturing. Optimizing it can efficiently allocate resources, minimize costs, maximize performance, and satisfy design requirements to achieve the desired results and objectives [1,4,5].
Population-based intelligent optimization algorithms have the potential for global search capability, allowing them to efficiently find the optimal solution to optimization problems, and thus have become a hotspot for scholarly research today [6,7,8]. Li et al. proposed an enhanced snake optimization algorithm (ESO) that has the capability of fast convergence when solving four real engineering optimization problems [9]. Teng and colleagues suggested an enhanced multi-strategy Sparrow Search Algorithm (ISSA) to address the Sparrow Search Algorithm’s limitations, and its application in channel estimation frequency optimization significantly lowers the Bit Error Rate (BER), showcasing the algorithm’s efficacy in engineering [10]. Chao et al. formulated a new Sparrow Search Algorithm (MSSA) by introducing an elite inverse learning strategy and verify the excellence and competitiveness of the proposed algorithm by solving three classical engineering problems [11]. Zeng and colleagues integrated a differential evolution algorithm and a whale optimization algorithm to enhance population diversity, demonstrating that the latter’s convergence was markedly more effective in addressing three engineering challenges [12]. Li et al. has proposed an improved Balanced Optimizer Algorithm (MEO), and the MEO demonstrates good optimization efficiency and application potential in solving seven engineering design problems with varying degrees of complexity [13]. Wang and colleagues suggested an enhanced multi-strategy Hunter Optimization Algorithm (IHPO) to tackle the challenges of sluggish convergence and the tendency to settle into local optima. This algorithm exhibits enhanced practicality and steadiness in resolving engineering optimization challenges [14].
Proposed in 2022, the dung beetle optimization (DBO) algorithm represents a novel approach to population intelligence optimization. Primarily, it mimics the movements, dances, foraging, theft, and mating rituals of dung beetles [15]. Although Xun proved the superiority of the DBO algorithm, it still has shortcomings, such as easily falling into local optima and poor global search ability. Therefore, many scholars have improved the DBO accordingly [16,17,18]. Fang et al. suggested a DBO algorithm that merges quantum computing with multi-strategy (QHDBO), designed to prevent the algorithm from hitting local peaks through the t-distribution mutation approach in quantum computing, enhancing its convergence speed and optimization precision [19]. Wang et al.’s suggested approach leverages the current population’s ideal directional shift and the best value derived from the Opposition-Based Learning (OBL) multi-strategy DBO algorithm (GODBO). Experimental findings from CEC2017 reveal that the enhanced algorithm achieves quicker convergence rates and greater accuracy [20]. Li et al. proposed a multi-strategy-improved DBO algorithm (MSIDBO) to shorten the path planning of mobile robots. Simulation experiments show that the MSIDBO algorithm effectively solves problems in practical applications [17]. Zhang and colleagues propose the development of a DBO algorithm, utilizing the Extreme Learning Machine (ELM) and Adaptive Spiral (ASDBO) to improve the predictive precision of photovoltaic (PV) power production. When conducting predictive tests in diverse climatic scenarios, the outcomes revealed ASDBO’s superior efficiency and predictive power in PV systems [21].
In order to explore a better way to solve engineering optimization problems and expand the application space of DBO, this paper proposes an enhanced dung beetle optimization algorithm. First, it improves the rolling phase by removing interference from the worst values and coupling the current and optimal solutions while retaining the advantages of the original formulation. Secondly, it addresses the problem of focusing solely on the information of the current solution in the dancing phase, which leads to overly stochastic and inefficient exploration of the problem space. The global optimal solution is introduced to guide it, and a stochastic factor is added to the optimal solution. Finally, the Jacobi curve is introduced during the foraging phase to further enhance the algorithm’s ability to escape local optima and avoid premature maturity. By comparing EDBO with the pigeon-inspired optimization algorithm (PIO) [22], whale optimization algorithm (WOA) [23], butterfly optimization algorithm (BOA) [24], sine cosine algorithm (SCA) [25], coati optimization algorithm (COA) [26], simulated annealing (SA) [27], and the original DBO algorithm in different dimensions of the CEC2017 test function for optimization comparison and conducting Wilcoxon rank sum test and Friedman test, we verify the advantages of the EDBO algorithm with strong optimization ability and fast convergence speed. EDBO is used in the solution of four real engineering optimization problems, showing the adaptability of EDBO to solving engineering optimization problems.

2. Preliminary Preparation

2.1. Engineering Optimization Problem Description

In this paper, four types of engineering optimization problems with different levels of complexity are selected, including the three-bar diffraction frame problem [28], the tension/compression spring design problem [29], the pressure vessel design problem [30], and the cantilever beam design problem [31].

2.1.1. Three Pole Truss Design Issues

In civil engineering, the challenge of creating a three-bar truss with the least weight, known as the three-bar truss design problem, is a prevalent nonlinear fractional optimization issue. This issue comprises two variables and three limitations, with its mathematical framework outlined as follows:
Dimension:
D i m = 2
Objective function:
min f 1 ( x ) = ( 2 2 x 1 + x 2 ) × L
Restrictive functions:
g 1 = 2 x 1 + x 2 2 x 1 2 + 2 x 1 x 2 P σ 0
g 2 = x 2 2 x 1 2 + 2 x 1 x 2 P σ 0
g 3 = 1 x 1 + 2 x 2 P σ 0
Domain of variables:
L b = 0 U b = 1
The constants are L = 100 cm, P = 2 KN/cm2, and σ = 2 KM/cm2.

2.1.2. Tension/Compression Spring Design

The issue of extension/compression springs represents a traditional design challenge in structural engineering, involving three variables. The goal is to reduce the spring’s weight while adhering to four key conditions: bending, shear stress, rate of fluctuation, and external diameter. The following is the given expression:
Dimension:
D i m = 3
Objective function:
min f 2 ( x ) = ( x 3 + 2 ) x 2 x 1 2
Restrictive functions:
g 1 = 1 x 2 3 x 3 71785 x 1 4 0
g 2 = 4 x 2 2 x 1 x 2 12566 ( x 2 x 1 3 x 1 4 ) + 1 5108 x 1 2 1 0
g 3 = 1 140.45 x 1 x 2 2 x 3 0
g 4 = x 1 + x 2 1.5 1 0
Domain of variables:
L b = [ 0.05 0.25 2 ] U b = [ 2 1.3 15 ]

2.1.3. Pressure Vessel Design Issues

The goal in designing a pressure vessel is to reduce the overall expense (in terms of material, formation, and welding) of the cylindrical pressure vessel, involving four variables and four constraints. Below is the mathematical depiction of the issue:
Dimension:
D i m = 4
Objective function:
min f 3 ( x ) = 0.6224 x 1 x 3 x 4 + 1.7781 x 2 x 3 2 + 3.1661 x 1 2 x 4 + 19.84 x 1 2 x 3
Restrictive functions:
g 1 = x 1 + 0.0193 x 3 0
g 2 = x 2 + 0.00954 x 3 0
g 3 = π x 3 2 x 4 4 3 π x 3 2 + 1296000 0
g 4 = x 4 240 0
Domain of variables:
L b = [ 0 0 10 10 ] U b = [ 99 99 200 200 ]

2.1.4. Cantilever Beam Design Issues

Designing a cantilever beam involves a structural engineering challenge focused on determining the optimal weight for a cantilever beam, considering five different beam heights (or widths) as key variables. The mathematical formula for it is provided underneath.
Dimension:
D i m = 5
Objective function:
min f 4 ( x ) = 0.0624 ( x 1 + x 2 + x 3 + x 4 + x 5 )
Restrictive functions:
g ( x ) = 61 x 1 3 + 37 x 2 3 + 19 x 3 3 + 7 x 4 3 + 1 x 5 3 1 0
Domain of variables:
L b = 0.01 U b = 100

2.2. Dung Beetle Optimization Algorithm

2.2.1. Population Initialization

Through randomization, the DBO algorithm creates a starting population, with each dung beetle’s placement aligning with a resolution of the optimization issue. In the context of the D-dimensional optimization issue, the location of the i-th dung beetle is indicated as xi = [xi,1, xi,2, …, xi,D], while the group of dung beetles with a size N is represented as X = [x1, x2, …, xN]T, as depicted in Equation (1).
X = x 1 , 1 x 1 , D x N , 1 x N , D

2.2.2. Rolling Dung Beetles

Dung beetles in the wild utilize heavenly signals while rolling to maintain the straightness of their dung balls. As it rolls, the dung beetle’s location is modified based on Equation (2).
z i ( t + 1 ) = z i ( t ) + α × k × z i ( t 1 ) + b × Δ z Δ z = z i ( t ) Z w
where t denotes the current iteration number, zi(t) denotes the position information of the i-th dung beetle at the t-th iteration, k∈(0, 0.2] is a constant denoting the deflection coefficient, b∈(0, 1),α is the natural coefficient taken as 1 or −1, Zw is the global worst position, and Δz simulates the variation of light intensity. The pseudo-code for this section is shown in Algorithm 1.
Algorithm 1: α selection strategy
Require: The probability value λ
Ensure: The natural coefficient α
1: η = rand (1)
2: if η > λ then
3:   α = 1
4: else
5:   α = −1
6: end if

2.2.3. Dancing Dung Beetle

Faced with a hindrance that prevents its progression, the dung beetle engages in a dance to alter its rolling trajectory. To mimic the dung beetle’s dance movements, the DBO employs the tangent function to determine the updated rolling direction. As depicted in Equation (3), the location of the dancing dung beetle has been recalibrated.
z i ( t + 1 ) = z i ( t ) + tan ( θ ) z i ( t ) z i ( t 1 )
where θ is the deflection angle belonging to [0,π], and |zi(t) − zi(t − 1)| is the difference between the t-th and (t − 1)-th iterations of the i-th dung beetle, so the update of the dung beetle’s position is closely related to current and historical information.

2.2.4. Breeding Dung Beetles

The dung balls are rolled to a safe place and hidden by the dung beetles, these dung balls are partly used as food and partly used for laying eggs and reproducing the next generation as brood balls. DBO proposes a boundary selection strategy to define the area of brood balls, as shown in Equation (4).
L b = max ( Z × ( 1 R ) , L b ) U b = max ( Z × ( 1 + R ) , U b )
where Z* denotes the current local optimum position, Lb* and Ub* denote the lower and upper bounds of the spawning region, respectively, R = 1 − t/Tmax, Tmax denotes the maximum number of iterations, and Ub and Lb denote the upper and lower bounds of the optimization problem, respectively.
Once the brood ball is moved to the designated breeding zone, the female dung beetle proceeds to deposit eggs within. Within the DBO environment, every female dung beetle is limited to laying a single egg. Equation (4) reveals that the spawning area’s boundary range varies dynamically with R’s value, leading to a dynamic shift in the spawning location, as depicted in the Equation (5).
B i ( t + 1 ) = Z + b 1 × ( B i ( t ) L b ) + b 2 × ( B i ( t ) U b )
where Bi(t) is the position information of the i-th sphere at the t-th iteration, b1 and b2 are two independent random vectors of size 1 × D, and D is the dimension of the optimization problem. The pseudo-code for this section is shown in Algorithm 2.
Algorithm 2: The brood ball position updating strategy
Require: The maximum iteration number Tmax, the brood ball number n, and the present iteration number t.
Ensure: The position of the i-th brood ball Bi
1: R = 1 − t/Tmax
2: for i ← 1 to n do
3: Update the brood ball’s position by Equation (5)
4:    for j ← 1 to D do
5:      if Bij > Ub* then
6:          BijUb*
7:      end if
8:      if Bij < Lb* then
9:          BijLb*
10:     end if
11:    end for
12: end for

2.2.5. Foraging Dung Beetle

As the small dung beetles in the brood ball develop and mature, they will burrow out to forage, and the boundary of the optimal foraging area is shown in Equation (6):
L b b = max ( Z b × ( 1 R ) , L b ) U b b = min ( Z b × ( 1 + R ) , U b )
where Zb denotes the global optimal position, and Ubb and Lbb denote the upper and lower bounds of the optimal foraging area. The small dung beetle position is updated as shown in Equation (7).
z i ( t + 1 ) = z i ( t ) + C 1 × ( z i ( t ) L b b ) + C 2 × ( z i ( t ) U b b )
where zi(t) denotes the position information of the i-th small dung beetle at the t-th iteration, C1 denotes a random number obeying a normal distribution, and C2 is a random vector in the range of (0, 1).

2.2.6. Stealing Dung Beetles

Within populations of dung beetles, certain beetles pilfer dung balls from those propelling balls, known as thieves. Equation (6) reveals that Zb serves as the ideal food source, leading to the presumption that Zb is the prime site for competing food. Consequently, the thief’s location during the iteration is depicted in Equation (8).
z i ( t + 1 ) = Z b + S × g × ( z i ( t ) Z + z i ( t ) Z b )
where zi(t) denotes the position information of the t-th iteration of the i-th thief, g is a random vector of size 1 × D obeying a normal distribution, and S is a constant.

3. Improving the Dung Beetle Optimization Algorithm

3.1. Reasons for Improvements

While the initial DBO algorithm excels in optimization, it suffers from shortcomings, such as insufficient global search capabilities, poor convergence precision, and a tendency to gravitate towards local optimal solutions. For practical engineering optimization challenges, the algorithm must possess strong capabilities in both global search and local development. Consequently, this document suggests three enhancement tactics to rectify the limitations of the initial DBO algorithm and to bolster its overall search capabilities and local exploitation prowess. These tactics consider the investigation and utilization of the algorithm, thereby improving its capability to search for optimization.

3.2. Improved Rolling Dung Beetles

In Equation (2), α models the fact that natural factors (wind and uneven ground) can cause dung beetles to deviate from their original direction, when α = 1 represents no deviation, and α = −1 represents deviation from the original direction; k is the deflection coefficient. Δz is the absolute value of the position of the i-th dung beetle at the current iteration compared to the position of the global worst, which interferes with the quality of the solution. Therefore, in this paper, the perturbation of the worst value is removed, and the perturbation of the global optimal solution is newly added to couple the current solution with the optimal solution, while retaining α × k × zi(t − 1) to keep its deflection unchanged and retain the advantages of the original formula. The improved formula is shown in Equation (9).
z i ( t + 1 ) = r 1 × z i ( t ) r 2 × Z b + α × k × z i ( t 1 )
where r1 and r2 are random numbers between (0, 1) and Zb is the global optimal position.

3.3. Improved Dancing Dung Beetles

In Equation (3), from |zi(t) − zi(t − 1)|, it can be seen that the DBO only focuses on the information of the current solution and has little guidance for updating the next solution, which leads to the exploration of the problem space being too random and inefficient during the global search. Therefore, in this paper, the global optimal solution is introduced to guide Equation (3), the stochastic factor is added to the optimal solution, and the exploration around the optimal solution is carried out to improve the quality of the solution. The improved formula is shown in Equation (10).
z i ( t + 1 ) = r 3 × z i ( t ) ( z i ( t ) r 4 × Z b )
where r3 and r4 are random numbers between (0, 1).

3.4. Improved Foraging Dung Beetles

In order to improve the searching ability of the DBO algorithm in the dung beetle foraging phase, the Jacobi curve is added to the foraging phase of the original DBO algorithm. Jacobi curve is named after the mathematician Carl Jacobi, who proposed it in the early 19th century. The improved Jacobi curve is shown in Equation (11).
z i ( t + 1 ) = r 5 × z i ( t ) + ( e θ 2 × Z b × sin θ ) / ( sin θ cos θ )
where r5 is a random number between (0, 1) and θ ∈ (0, π).
Different from the original algorithm, in this strategy, the position update of the small dung beetle in the foraging phase will be determined by the random number generated pseudo-randomly in the interval (0, 1), and when the random number is less than 0.5, the position strategy is carried out according to Equation (11); vice versa, the position update is carried out according to Equation (7). This strategy not only improves global search efficiency, but also helps the algorithm to jump out of the local optimum, which lays the foundation for exact optimality search.

3.5. EDBO Algorithm Implementation Steps

Algorithm 3 displays the pseudo-code used in the EDBO algorithm.
Algorithm 3: The framework of the EDBO algorithm.
Require: The largest iteration, Tmax, represents the particle’s population size N.
Ensure: Ideal location Zb and its corresponding fitness measure fb.
1: Begin by setting the particle’s population i ← 1, 2, ……, N and establish its pertinent parameters
2:   while t ≤ Tmax do
3:     for i = 1 to Number of rolling dung beetles do
4:       a = rand (1)
5:       if a ≤ 0.9 then
6:          Select α value by Algorithm 1
7:          Update rolling dung beetle location by Equation (9).
8:       else
9:          Update dancing dung beetle location by Equation (10).
10:       end if
11:     end for
12:     for i = 1 to Number of breeding dung beetles do
13:          Update the brood ball’s position by using Algorithm 2
14:    end for
15:    for i = 1 to Number of foraging dung beetles do
16:          Determination of the optimal foraging area according to Equation (6)
17:       if rand < 0.5 then
18:          Update the improved Jacobi position update curve according to Equation (11)
19:       else
20:          Update foraging dung beetle location by Equation (7).
21:       end if
22:    end for
23:    for i = 1 to Number of stealing dung beetles do
24:          Update stealing dung beetle location by Equation (8).
25:    end for
26:    if the newly generated position is better than before then
27:          Update it
28:    end if
29:    t = t + 1
30:   end while
31:   Provide Zb along with its corresponding fitness value fb;

4. Experimental Results and Discussion

4.1. Experimental Design

In order to verify the convergence speed and optimization ability of the EDBO algorithm, this paper uses the CEC2017 test function set. All the functions in the test set are rotated and shifted, which increases the optimization difficulty of the algorithm [32]. Every function within the test set undergoes rotation and adjustment, thereby amplifying the complexity of the algorithm’s optimization quest. The primary components of CEC2017 are 30 testing functions; however, owing to F2’s instability, not all experiments involving F2 were conducted. Within this group, F1 and F3 represent single-peak functions characterized solely by global minima and lacking local minima, primarily serving to evaluate the algorithm’s proficiency in identifying the optimal solution; F4–F10 are multi-peak functions featuring local extreme points, assessing the algorithm’s capacity to deviate from the local optimum; F11–F20 are hybrid functions that include at least three CEC2017 benchmark functions post-rotation or shift, with each subfunction assigned specific weights; F21–F30 are composite functions comprising a minimum of three hybrid or CEC2017 benchmark functions post-rotation and displacement, where each subfunction carries an extra bias value and weight, collectively heightening the algorithm’s optimization complexity.
Comparison algorithms: In addition to the standard DBO algorithm, six other widely used optimization algorithms are selected for comparison in this paper, namely: pigeon-inspired optimization algorithm (PIO), whale optimization algorithm (WOA), butterfly optimization algorithm (BOA), sine cosine algorithm (SCA), coati optimization algorithm (COA), and simulated annealing (SA). The parameters of the comparison algorithms are set as shown in Table 1 and run independently for 100 times.

4.2. Results and Analysis

In order to verify the performance of EDBO in different dimensions, 30, 50, and 100 dimensions are used for the test function for a more comprehensive comparison. The experimental results of 30, 50, and 100 dimensions are shown in Table 2, Table 3 and Table 4, where the mean, standard deviation, and optimal value are the evaluation indexes of the algorithm’s performance. The smaller the mean, the higher the algorithm’s convergence accuracy, and the smaller the standard deviation, the more superior the algorithm stability is [33,34,35].
From the data results in Table 2, Table 3 and Table 4, it can be seen that EDBO has good local development capability and solution accuracy. In the experiments of 30, 50, and 100 dimensions, EDBO outperforms the other seven algorithms on F1 and F3 with high convergence accuracy, and its search stability is slightly inferior to SCA, but much higher than DBO. For the multi-peaked functions F4–F10, EDBO has good global exploration ability, with the ability to jump out of the local optimum. In three different dimensions of the experiment, EDBO finds better optimal solutions than the other seven algorithms in seven functions and shows excellent performance in F4, albeit slightly weaker than BOA in F5–F9 in terms of variance, and slightly weaker than DBO in terms of performance on the F10 function. From the data results of the hybrid functions F11–F20, it can be seen that EDBO has significant performance in dealing with hybrid problems. In the experiments of 30 dimensions, EDBO shows superior performance in F12, F14, F15, and F19. The evaluation index is in the leading position, and the optimal values of other functions are higher than those of other comparative algorithms. In the experiments of 50 and 100 dimensions, EDBO’s performance advantage is more obvious. For the more complex hybrid functions F21–F30, the optimal values of EDBO are better than those of other algorithms across three different dimensions, which is highly competitive.
The convergence trajectories of eight optimization methods for the 30-dimensional CEC2017 test function are depicted in Figure 1, while Figure 2 shows the box-and-line diagrams of the eight optimization algorithms for solving the 30-dimensional CEC2017 test function.
This is evident from Figure 1, where EDBO’s optimization outcomes significantly improve. With equivalent precision, EDBO maintains the lowest iteration count, suggesting that eliminating the worst value’s interference and merging the present solution with the optimal one can elevate the population’s quality and boost convergence speed, thereby showcasing EDBO’s enhanced local optimality search prowess. The convergence speed of EDBO surpasses that of other algorithms in F1, F8, F9, F11–F14, F16, F18, F21, F26, and F30, simplifying the discovery and convergence to the optimal global solution, suggesting that bettering the dancing behavior boosts overall search efficiency and robust global search efficiency. In F5–F7, F11, F17, F23–F27, and F30, EDBO’s convergence curves at the initial iteration phase align with DBO’s, and during the central convergence phase, they significantly outpace the original DBO algorithm due to the inclusion of the Jacobi curve, which augments the population diversity and elevates the search capability and solution quality. From the results in Figure 2, it can be seen that the EDBO box is narrower in most functions, which represents a small fluctuation of all its optimal values, i.e., the algorithm converges faster, resulting in a smaller span between the optimal solutions in each generation.
Figure 3 shows the convergence curves of the eight optimization algorithms for solving the 50-dimensional CEC2017 test function. Figure 4 shows the box-and-line plot of the eight optimization algorithms for solving the 50-dimensional CEC2017 test function.
From Figure 3, it can be seen that EDBO outperforms the other seven algorithms in solving the 50-dimensional CEC2017 test functions, showing good convergence speed and optimal searching ability. From the boxplots in Figure 4, it can be seen that, except for F6 and F27, the EDBO algorithm exhibits lower bounds of the boxes in the rest of the test functions than the comparative algorithms, indicating higher search accuracy and the ability to find better quality solutions.
Figure 5 shows the convergence curves of the eight optimization algorithms for solving the 100-dimensional CEC2017 test function, and Figure 6 shows the box plots of the eight optimization algorithms for solving the 100-dimensional CEC2017 test function.
From Figure 5, it can be seen that the EDBO algorithm obtains the best results in solving the 100-dimensional CEC2017 test functions, except for functions F10, F23, and F24, which are highly competitive. From Figure 6, it can be seen that EDBO is consistently lower than the comparison algorithm in most of the test functions in terms of upper edge, lower edge, and median, showing significant stability and superiority. The median in F6 and F20 is ranked second among the comparison algorithms, being better than that of the original DBO algorithm. EDBO’s performance in F10, F23, and F24 are not as good as the comparison algorithms, but they are not at the bottom of the list.
In conclusion, EDBO achieves the best results in many evaluation metrics. The superiority of the algorithm, its ability to solve complex problems, and its better robustness are proven.

4.3. Wilcoxon Rank Sum Test

To further validate the optimization performance of EDBO, the Wilcoxon rank sum test is used in this paper to detect whether there are statistically significant differences between EDBO and PIO, SCA, BOA, WOA, COA, CA, and DBO [36]. The results of seven algorithms running 100 times on each of 29 test functions are taken as samples. The results of Wilcoxon rank sum detection in different dimensions are shown in Table 5, Table 6 and Table 7.
It is assumed that the probability of the compared data yielding better results than EDBO is p. If the value of p is small, it means that the probability of the original hypothetical situation is small. When p < 0.05, it indicates that the difference between the two algorithms being compared is significant. Conversely, when p < 0.05, it indicates that the search results of the two algorithms are comparable. As can be seen from Table 5, Table 6 and Table 7, 79% of the rank sum statistics of EDBO and other algorithms are less than 0.05, indicating that, statistically speaking, the superiority of EDBO for the search results of the test function is obvious, further verifying the superiority of EDBO.

4.4. Friedman Test

To deepen the comparison of the algorithms’ performance disparities, their outcomes underwent a Friedman test [37]. The outcomes of the Friedman tests for the aforementioned eight algorithms are presented in Table 8. Table 8 reveals that the average rank of the EDBO algorithm is less than that of the other algorithms compared, demonstrating the enhancement’s efficacy.

5. Engineering Optimization Issues

The merit of the algorithm also depends on its performance in solving engineering optimization problems. Therefore, in this paper, we use the EDBO algorithm to solve four engineering optimization problems with different levels of complexity, based on the objective function, restriction function, and the variable domains listed in Section 2.1. We then compare their optimization results with those of the PIO, SCA, BOA, WOA, COA, SA, and DBO algorithms.
Algorithms tackling engineering optimization challenges with limitations split the problem’s decision-making realm into achievable and unachievable areas. In scenarios where the solution vector falls within these infeasible zones, the generalized penalty function approach is applied to infeasible solutions that fail to meet the constraints. The technique transforms a restricted optimization issue into an unrestricted one by imposing a penalty on the non-viable solution. Below is the displayed formula for penalties:
V ( x ) = f i ( x ) + P
P = i = 1 m ( λ ( g i ( x ) 2 ) H ( i ) )
where P denotes the penalty value, m denotes the number of constraints in the problem, λ is the penalty constant, and H(i) is used to identify whether the ith constraint is satisfied or not. From Equations (12) and (13), it can be seen that once the solution violates the constraints, resulting in a non-feasible solution, the penalty constant will significantly increase the value of the fitness function as a way of rejecting the non-feasible solution.
The algorithm follows the following three principles in the iterative process to select candidate solutions in preference to the original solution:
  • In the realm of viable and impractical solutions, the viable one is favored;
  • When both options are viable, choose the one with the lower fitness score;
  • Should both options prove impractical, choose the one that minimally breaches the constraints.

5.1. Three Pole Truss Design Issues

Table 9 presents the best outcomes achieved by the eight algorithms, encompassing the values of pertinent decision variables, with convergence curves illustrated in Figure 7. The findings indicate that EDBO is capable of identifying superior control parameters and objective function values.

5.2. Tension/Compression Spring Design

From Table 10 and Figure 8, it can be seen that the EDBO algorithm obtains the spring weight to reach the optimal value of 0.012718751 when the values of the parameters x1, x2, and x3 are 0.0500156, 0.31777, and 13.7778, respectively. Overall, when dealing with the extension/compression spring problem, the EDBO algorithm has a superior performance.

5.3. Pressure Vessel Design Issues

From Table 11 and Figure 9, it can be seen that EDBO has better optimization results and saves engineering design costs compared to other algorithms.

5.4. Cantilever Beam Design Issues

As can be seen from Table 12 and Figure 10, the optimal value of EDBO is ranked first, compared to the other seven compared algorithms, which indicates that EDBO has a good ability to find the optimal value in solving the cantilever beam design problem.
In summary, after comparing eight algorithms for solving the aforementioned four engineering problems, we found that the EDBO algorithm proposed in this paper is an efficient algorithm that can solve engineering optimization problems with good stability and practicability.

6. Conclusions

In this paper, an enhanced dung beetle optimization algorithm is designed for solving complex engineering optimization problems. The following three main improvements are carried out: (1) The dung beetle rolling phase is improved to remove the worst value interference and couple the current solution with the optimal solution, while retaining the advantages of the original formulation. (2) Aiming to address the problem that the dung beetle dancing stage focuses only on the information of the current solution, which leads to excessively random and inefficient exploration of the problem space, the global optimal solution is introduced to guide it, and a random factor is added to the optimal solution. (3) The Jacobi curve is introduced in the dung beetle foraging phase to further enhance the algorithm’s ability to jump out of the local optimum and avoid the phenomenon of premature maturity.
EDBO is used to solve CEC2017, a complex set of functions with different characteristics. From the solution results, EDBO shows strong optimality-seeking ability and robustness. To further verify the effectiveness of the improvement, Wilcoxon rank sum test and Friedman test are conducted in this paper. The test results demonstrate the superiority of the EDBO algorithm from a statistical point of view. Finally, the EDBO algorithm is used to solve four complex engineering optimization problems and is compared with algorithms that have demonstrated excellent performance in recent years. The experimental results show that EDBO has good optimization efficiency when dealing with complex engineering optimization problems, proving its capability for engineering applications.
In future work, the next research focus is to improve the EDBO algorithm to function as a multi-objective optimization algorithm and apply it to more complex multi-objective optimization and practical engineering applications, such as the optimal design problem of industrial refrigeration systems.

Author Contributions

H.S.: writing the manuscripts, charting, data collection, literature retrieval; W.Z.: document retrieval, data collection, data analysis; C.M.: data collection, data analysis; Q.L.: research ideas, experimental design, and data analysis. All authors have read and agreed to the published version of the manuscript.

Funding

Here, we need to thank the following organizations for their strong support: the “Natural Science Foundation of Jilin Province-General Project, Study on the Machinability of Milling Titanium Alloy with Micro-texture Milling Cutter” (20220101227JC).

Data Availability Statement

Data are contained within the article.

Acknowledgments

Authors would like to thank the members of the project team for their dedication and efforts, as well as the teachers and schools for their help.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Wang, S.; Jia, H.; Abualigah, L.; Liu, Q.; Zheng, R. An improved hybrid aquila optimizer and harris hawks algorithm for solving industrial engineering optimization problems. Processes 2021, 9, 1551. [Google Scholar] [CrossRef]
  2. Kalananda, V.K.R.A.; Komanapalli, V.L.N. A combinatorial social group whale optimization algorithm for numerical and engineering optimization problems. Appl. Soft Comput. 2021, 99, 106903. [Google Scholar] [CrossRef]
  3. Kamboj, V.K.; Nandi, A.; Bhadoria, A.; Sehgal, S. An intensify Harris Hawks optimizer for numerical and engineering optimization problems. Appl. Soft Comput. 2020, 89, 106018. [Google Scholar] [CrossRef]
  4. Han, X.; Yue, L.; Dong, Y.; Xu, Q.; Xie, G.; Xu, X. Efficient hybrid algorithm based on moth search and fireworks algorithm for solving numerical and constrained engineering optimization problems. J. Supercomput. 2020, 76, 9404–9429. [Google Scholar] [CrossRef]
  5. Kumar, D.; Gandhi, B.R.; Bhattacharjya, R.K. Firefly algorithm and its applications in engineering optimization. In Nature-Inspired Methods for Metaheuristics Optimization: Algorithms and Applications in Science and Engineering; Springer: Berlin/Heidelberg, Germany, 2020; pp. 93–103. [Google Scholar]
  6. Castellanos, A.; Cruz-Reyes, L.; Fernández, E.; Rivera, G.; Gomez-Santillan, C.; Rangel-Valdez, N. Hybridisation of swarm intelligence algorithms with multi-criteria ordinal classification: A strategy to address many-objective optimisation. Mathematics 2022, 10, 322. [Google Scholar] [CrossRef]
  7. Emambocus, B.A.S.; Jasser, M.B.; Amphawan, A. A survey on the optimization of artificial neural networks using swarm intelligence algorithms. IEEE Access 2023, 11, 1280–1294. [Google Scholar] [CrossRef]
  8. Tang, J.; Liu, G.; Pan, Q. A review on representative swarm intelligence algorithms for solving optimization problems: Applications and trends. IEEE/CAA J. Autom. Sin. 2021, 8, 1627–1643. [Google Scholar] [CrossRef]
  9. Yao, L.; Yuan, P.; Tsai, C.Y.; Zhang, T.; Lu, Y.; Ding, S. ESO: An Enhanced Snake Optimizer for Real-world Engineering Problems. Expert Syst. Appl. 2023, 230, 120594. [Google Scholar] [CrossRef]
  10. Fei, T.; Wang, H.; Liu, L.; Zhang, L.; Wu, K.; Guo, J. Research on multi-strategy improved sparrow search optimization algorithm. Math. Biosci. Eng. MBE 2023, 20, 17220–17241. [Google Scholar] [CrossRef] [PubMed]
  11. Yang, C.; Yang, H.; Zhu, D.; Hu, Y.; Zhang, Y.; Ma, H.; Huang, Z. Chaotic sparrow search algorithm with manta ray spiral foraging for engineering optimization. Syst. Sci. Control Eng. 2023, 11, 2249021. [Google Scholar] [CrossRef]
  12. Zeng, N.; Song, D.; Li, H.; You, Y.; Liu, Y.; Alsaadi, F.E. A competitive mechanism integrated multi-objective whale optimization algorithm with differential evolution. Neurocomputing 2021, 432, 170–182. [Google Scholar] [CrossRef]
  13. Li, Y.; Liang, X.; Liu, J.; Zhou, H. Solving engineering optimization problems based on improved balanced optimizer algorithm. Comput. Integr. Manuf. Syst. 2023, 1–34. [Google Scholar]
  14. Wang, K.; Liu, J.; Li, W.; Tan, W.; Qin, T.; Yang, J. Multi-strategy Improved Hunter Prey Optimization Algorithm. Comput. Eng. Sci. 2024, 1–13. [Google Scholar]
  15. Xue, J.; Shen, B. Dung beetle optimizer: A new meta-heuristic algorithm for global optimization. J. Supercomput. 2023, 79, 7305–7336. [Google Scholar] [CrossRef]
  16. Qin, G.U.O.; Qiaoxian, Z.H.E.N.G. Multi-strategy improved dung beetle optimizer and its application. J. Front. Comput. Sci. Technol. 2024, 1–22. [Google Scholar]
  17. Li, L.; Liu, L.; Shao, Y.; Zhang, X.; Chen, Y.; Guo, C.; Nian, H. Enhancing Swarm Intelligence for Obstacle Avoidance with Multi-Strategy and Improved Dung Beetle Optimization Algorithm in Mobile Robot Navigation. Electronics 2023, 12, 4462. [Google Scholar] [CrossRef]
  18. Zhang, H.; Zhang, R. A Multi-Strategy Enhanced Dung Beetle Optimization Algorithm and Its Application in Engineering. Preprints 2024, 2024020368. [Google Scholar] [CrossRef]
  19. Zhu, F.; Li, G.; Tang, H.; Li, Y.; Lv, X.; Wang, X. Dung beetle optimization algorithm based on quantum computing and multi-strategy fusion for solving engineering problems. Expert Syst. Appl. 2024, 236, 121219. [Google Scholar] [CrossRef]
  20. Zilong, W.; Peng, S. A multi-strategy dung beetle optimization algorithm for optimizing constrained engineering problems. IEEE Access 2023, 11, 98805–98817. [Google Scholar] [CrossRef]
  21. Zhang, Y.; Li, T.; Ma, T.; Yang, D.; Sun, X. Short-Term Photovoltaic Power Prediction Based on Extreme Learning Machine with Improved Dung Beetle Optimization Algorithm. Energies 2024, 17, 960. [Google Scholar] [CrossRef]
  22. Cui, Z.; Zhang, J.; Wang, Y.; Cao, Y.; Cai, X.; Zhang, W.; Chen, J. A pigeon-inspired optimization algorithm for many-objective optimization problems. Sci. China Inf. Sci. 2019, 62, 70212. [Google Scholar] [CrossRef]
  23. Mirjalili, S.; Lewis, A. The whale optimization algorithm. Adv. Eng. Softw. 2016, 95, 51–67. [Google Scholar] [CrossRef]
  24. Arora, S.; Singh, S. Butterfly optimization algorithm: A novel approach for global optimization. Soft Comput. 2019, 23, 715–734. [Google Scholar] [CrossRef]
  25. Mirjalili, S. SCA: A sine cosine algorithm for solving optimization problems. Knowl.-Based Syst. 2016, 96, 120–133. [Google Scholar] [CrossRef]
  26. Dehghani, M.; Montazeri, Z.; Trojovská, E.; Trojovský, P. Coati Optimization Algorithm: A new bioinspired metaheuristic algorithm for solving optimization problems. Knowl.-Based Syst. 2023, 259, 110011. [Google Scholar] [CrossRef]
  27. Bertsimas, D.; Tsitsiklis, J. Simulated annealing. Stat. Sci. 1993, 8, 10–15. [Google Scholar] [CrossRef]
  28. Yildirim, A.E.; Karci, A. Application of three bar truss problem among engineering design optimization problems using artificial atom algorithm. In Proceedings of the 2018 International Conference on Artificial Intelligence and Data Processing (IDAP), Malatya, Turkey, 28–30 September 2018; pp. 1–5. [Google Scholar]
  29. Tzanetos, A.; Blondin, M. A qualitative systematic review of metaheuristics applied to tension/compression spring design problem: Current situation, recommendations, and research direction. Eng. Appl. Artif. Intell. 2023, 118, 105521. [Google Scholar] [CrossRef]
  30. Moss, D.R. Pressure Vessel Design Manual; Elsevier: Amsterdam, The Netherlands, 2004. [Google Scholar]
  31. Friswell, M.I.; Adhikari, S. Sensor shape design for piezoelectric cantilever beams to harvest vibration energy. J. Appl. Phys. 2010, 108, 014901. [Google Scholar] [CrossRef]
  32. Wu, G.; Mallipeddi, R.; Suganthan, P.N. Problem definitions and evaluation criteria for the CEC 2017 competition on constrained real-parameter optimization. In National University of Defense Technology, Changsha, Hunan, PR China and Kyungpook National University, Daegu, South Korea and Nanyang Technological University, Singapore, Technical Report; 2017. Available online: https://www.researchgate.net/publication/317228117_Problem_Definitions_and_Evaluation_Criteria_for_the_CEC_2017_Competition_and_Special_Session_on_Constrained_Single_Objective_Real-Parameter_Optimization (accessed on 1 March 2024).
  33. Salgotra, R.; Singh, U.; Saha, S. Improved cuckoo search with better search capabilities for solving CEC2017 benchmark problems. In Proceedings of the 2018 IEEE Congress on Evolutionary Computation (CEC), Rio de Janeiro, Brazil, 8–13 July 2018; pp. 1–7. [Google Scholar]
  34. Kreischer, V.; Magalhães, T.T.; Barbosa, H.J.C.; Krempser, E. Evaluation of bound constraints handling methods in differential evolution using the cec2017 benchmark. In Proceedings of the XIII Brazilian Congress on Computational Intelligence, Rio de Janeiro, Brazil, 30 October–1 November 2017. [Google Scholar]
  35. Cheng, R.; Li, M.; Tian, Y.; Zhang, X.; Yang, S.; Jin, Y.; Yao, X. Benchmark functions for CEC’2017 competition on evolutionary many-objective optimization. In Proceedings of the 2017 IEEE Congress on Evolutionary Computation (CEC), Donostia/San Sebastian, Spain, 5–8 June 2017; pp. 1–20. [Google Scholar]
  36. Wilcoxon, F.; Katti, S.K.; Wilcox, R.A. Critical values and probability levels for the Wilcoxon rank sum test and the Wilcoxon signed rank test. Sel. Tables Math. Stat. 1970, 1, 171–259. [Google Scholar]
  37. Zimmerman, D.W.; Zumbo, B.D. Relative power of the Wilcoxon test, the Friedman test, and repeated-measures ANOVA on ranks. J. Exp. Educ. 1993, 62, 75–86. [Google Scholar] [CrossRef]
Figure 1. Convergence curves of 8 algorithms on CEC2017-30Dim.
Figure 1. Convergence curves of 8 algorithms on CEC2017-30Dim.
Mathematics 12 01084 g001aMathematics 12 01084 g001b
Figure 2. Boxplots of 8 algorithms on CEC2017-30Dim.
Figure 2. Boxplots of 8 algorithms on CEC2017-30Dim.
Mathematics 12 01084 g002aMathematics 12 01084 g002b
Figure 3. Convergence curves of 8 algorithms on CEC2017-50Dim.
Figure 3. Convergence curves of 8 algorithms on CEC2017-50Dim.
Mathematics 12 01084 g003aMathematics 12 01084 g003b
Figure 4. Boxplots of 8 algorithms on CEC2017-50Dim.
Figure 4. Boxplots of 8 algorithms on CEC2017-50Dim.
Mathematics 12 01084 g004
Figure 5. Convergence curves of 8 algorithms on CEC2017-100Dim.
Figure 5. Convergence curves of 8 algorithms on CEC2017-100Dim.
Mathematics 12 01084 g005aMathematics 12 01084 g005b
Figure 6. Boxplots of 8 algorithms on CEC2017-100Dim.
Figure 6. Boxplots of 8 algorithms on CEC2017-100Dim.
Mathematics 12 01084 g006aMathematics 12 01084 g006b
Figure 7. Convergence curve of three pole truss design issues.
Figure 7. Convergence curve of three pole truss design issues.
Mathematics 12 01084 g007
Figure 8. Convergence curve of tension/compression spring design.
Figure 8. Convergence curve of tension/compression spring design.
Mathematics 12 01084 g008
Figure 9. Convergence curve of pressure vessel design issues.
Figure 9. Convergence curve of pressure vessel design issues.
Mathematics 12 01084 g009
Figure 10. Convergence curve of cantilever beam design issues.
Figure 10. Convergence curve of cantilever beam design issues.
Mathematics 12 01084 g010
Table 1. Comparison algorithm parameter settings.
Table 1. Comparison algorithm parameter settings.
AlgorithmPopulation SizeNumber of IterationsParameters
DBO30500k = λ = 0.1, b = 0.3, S = 0.5
PIO30500R = 0.3, Vmax = 0.5, T1 = 290, T2 = 10
SCA30500a = 2, b = 5, h = 0.05
BOA30500α = 0.1, c = 0.01, p = 0.8
WOA30500a = 2 × (1 − t/tmax), k = 1
COA30500Consistent with the original
SA30500T0 = 1000, α = 0.9, Tend = 0.001, k = 0
EDBO30500k = λ = 0.1; b = 0.3; S = 0.5
Table 2. CEC2017 test results 30-dimension.
Table 2. CEC2017 test results 30-dimension.
DBOPIOSCABOAWOACOASAEDBO
F1mean2.48E+082.32E+102.12E+105.44E+105.67E+095.92E+109.31E+084.31E+07
std1.71E+085.74E+093.92E+097.53E+091.87E+096.93E+097.32E+088.98E+07
best3.81E+041.29E+109.86E+093.99E+102.92E+093.74E+101.49E+083.36E+04
F3mean9.50E+049.23E+048.33E+048.15E+042.66E+058.56E+043.42E+057.65E+04
std3.14E+041.10E+041.53E+047.72E+036.87E+045.57E+037.84E+041.06E+04
best5.67E+045.60E+045.95E+046.58E+041.45E+056.52E+041.80E+055.28E+04
F4mean6.46E+022.96E+033.09E+032.11E+041.37E+031.53E+047.44E+025.49E+02
std1.06E+027.47E+021.14E+033.85E+033.86E+022.98E+031.32E+025.58E+01
best4.41E+022.09E+031.22E+031.39E+048.43E+029.04E+035.90E+024.07E+02
F5mean7.51E+028.69E+028.34E+029.21E+028.46E+029.23E+027.28E+026.77E+02
std6.39E+014.57E+012.82E+012.43E+014.86E+012.80E+015.12E+014.97E+01
best6.22E+027.76E+027.81E+028.77E+027.39E+028.41E+026.50E+026.00E+02
F6mean6.48E+026.67E+026.64E+026.91E+026.83E+026.90E+026.47E+026.35E+02
std1.37E+019.97E+007.54E+005.51E+001.13E+015.48E+001.01E+019.48E+00
best6.22E+026.47E+026.52E+026.81E+026.63E+026.79E+026.21E+026.20E+02
F7mean1.02E+031.46E+031.25E+031.41E+031.31E+031.41E+031.07E+039.89E+02
std6.88E+017.14E+015.85E+015.10E+019.42E+014.80E+018.23E+016.37E+01
best8.94E+021.30E+031.14E+031.27E+031.08E+031.31E+039.18E+028.60E+02
F8mean1.03E+031.15E+031.09E+031.15E+031.07E+031.14E+031.03E+039.47E+02
std5.88E+011.80E+012.39E+011.48E+015.34E+012.48E+014.77E+013.82E+01
best9.09E+021.12E+031.02E+031.12E+039.82E+021.08E+039.40E+028.91E+02
F9mean6.66E+031.22E+048.35E+031.14E+041.23E+041.11E+041.27E+046.39E+03
std2.32E+032.53E+032.03E+031.35E+034.52E+031.19E+034.17E+032.24E+03
best2.89E+038.07E+035.79E+038.64E+034.60E+038.74E+035.93E+031.53E+03
F10mean6.57E+039.02E+038.85E+039.21E+037.70E+039.03E+035.50E+037.00E+03
std1.17E+033.09E+022.59E+023.75E+028.14E+024.47E+026.09E+021.30E+03
best4.52E+038.32E+038.18E+038.26E+035.88E+038.20E+034.44E+034.31E+03
F11mean1.97E+034.75E+034.03E+038.85E+038.55E+038.97E+031.63E+041.40E+03
std1.15E+031.18E+031.20E+032.57E+033.96E+032.28E+038.84E+031.17E+02
best1.36E+032.86E+032.49E+034.69E+033.09E+034.12E+035.35E+031.22E+03
F12mean6.75E+072.01E+092.40E+091.34E+105.95E+081.33E+106.69E+071.16E+07
std1.16E+084.36E+085.96E+083.70E+092.97E+083.77E+097.65E+072.23E+07
best2.43E+061.07E+091.37E+094.81E+091.34E+085.23E+091.20E+072.45E+05
F13mean1.53E+077.39E+081.35E+091.19E+101.47E+071.02E+101.99E+081.03E+07
std2.60E+072.17E+087.53E+085.87E+092.13E+074.44E+097.24E+084.09E+07
best7.32E+043.09E+083.63E+083.55E+091.25E+061.51E+093.27E+051.19E+04
F14mean2.80E+057.78E+057.62E+055.98E+061.89E+064.24E+066.74E+062.61E+05
std4.02E+056.38E+054.79E+058.38E+061.95E+063.87E+065.35E+063.44E+05
best5.17E+041.68E+051.72E+052.43E+055.04E+043.71E+052.95E+059.15E+03
F15mean8.70E+041.55E+085.94E+076.49E+089.09E+067.39E+082.17E+075.22E+04
std1.02E+057.55E+075.99E+074.63E+081.22E+075.15E+084.27E+075.04E+04
best7.10E+033.42E+074.77E+063.53E+071.09E+054.49E+072.33E+044.37E+03
F16mean3.42E+034.08E+034.19E+037.79E+034.39E+036.51E+033.30E+033.25E+03
std4.65E+021.76E+022.78E+022.26E+037.54E+021.19E+033.61E+024.41E+02
best2.37E+033.70E+033.44E+035.41E+033.38E+034.13E+032.30E+032.23E+03
F17mean2.71E+032.84E+032.82E+039.41E+032.88E+036.42E+032.70E+032.53E+03
std2.79E+021.55E+022.01E+027.20E+033.25E+024.78E+033.52E+022.58E+02
best2.12E+032.56E+032.41E+033.77E+032.13E+032.93E+032.06E+031.96E+03
F18mean3.55E+061.23E+071.40E+076.11E+071.21E+075.75E+071.38E+072.80E+06
std4.91E+066.57E+066.68E+066.14E+071.12E+074.62E+071.56E+075.15E+06
best1.42E+052.57E+062.49E+067.44E+061.07E+063.97E+068.22E+056.04E+04
F19mean2.41E+062.05E+089.07E+078.11E+082.53E+079.08E+081.34E+066.88E+05
std4.86E+061.25E+085.68E+075.42E+082.05E+074.37E+082.43E+061.34E+06
best6.10E+034.24E+071.44E+074.12E+071.67E+061.43E+081.78E+042.80E+03
F20mean2.72E+032.98E+032.88E+033.13E+032.87E+033.10E+032.93E+032.68E+03
std2.61E+021.42E+021.51E+021.25E+021.83E+021.71E+023.26E+022.01E+02
best2.30E+032.58E+032.51E+032.81E+032.54E+032.69E+032.26E+032.25E+03
F21mean2.54E+032.62E+032.60E+032.75E+032.65E+032.74E+032.51E+032.47E+03
std5.11E+012.49E+012.48E+016.22E+016.90E+015.27E+013.92E+015.66E+01
best2.43E+032.58E+032.55E+032.59E+032.50E+032.65E+032.43E+032.38E+03
F22mean5.21E+035.31E+039.96E+037.22E+038.55E+039.74E+037.13E+033.51E+03
std2.31E+031.89E+031.50E+031.27E+031.37E+036.47E+021.14E+032.14E+03
best2.41E+033.77E+034.08E+034.32E+033.77E+038.02E+032.42E+032.31E+03
F23mean3.02E+032.99E+033.09E+033.53E+033.15E+033.59E+032.97E+032.94E+03
std8.21E+012.55E+013.88E+011.47E+021.21E+021.56E+026.06E+019.82E+01
best2.88E+032.94E+033.01E+033.12E+032.92E+033.31E+032.79E+032.79E+03
F24mean3.21E+033.13E+033.25E+034.07E+033.29E+033.85E+033.15E+033.15E+03
std1.29E+022.78E+014.18E+011.92E+021.04E+021.50E+029.31E+011.02E+02
best2.96E+033.08E+033.19E+033.72E+033.03E+033.55E+033.03E+032.92E+03
F25mean2.99E+034.60E+033.57E+036.08E+033.20E+035.13E+033.17E+032.92E+03
std5.05E+014.58E+022.07E+026.62E+021.04E+025.05E+023.06E+022.31E+01
best2.89E+033.78E+033.27E+034.75E+033.06E+033.95E+032.98E+032.88E+03
F26mean6.89E+037.22E+037.83E+031.21E+048.44E+031.18E+046.17E+036.09E+03
std6.28E+029.48E+024.19E+027.39E+021.18E+038.82E+026.65E+028.39E+02
best5.57E+035.39E+037.13E+031.09E+046.03E+031.00E+045.11E+034.93E+03
F27mean3.33E+033.40E+033.55E+034.52E+033.50E+034.59E+033.27E+033.34E+03
std6.40E+014.99E+019.15E+012.96E+021.29E+024.50E+023.06E+017.42E+01
best3.23E+033.31E+033.40E+034.02E+033.32E+033.68E+033.21E+033.21E+03
F28mean3.47E+034.59E+034.51E+038.08E+033.89E+037.67E+033.78E+033.32E+03
std2.09E+022.91E+023.35E+025.66E+022.63E+025.78E+024.88E+027.33E+01
best3.24E+034.05E+033.96E+037.07E+033.57E+036.12E+033.31E+033.21E+03
F29mean4.62E+035.12E+035.30E+031.54E+045.36E+038.66E+034.39E+034.38E+03
std4.33E+022.60E+023.43E+021.55E+045.23E+022.32E+033.04E+024.15E+02
best3.79E+034.69E+034.79E+036.69E+034.24E+035.82E+033.87E+033.78E+03
F30mean3.65E+061.41E+081.94E+081.75E+098.07E+071.76E+093.88E+061.30E+06
std7.32E+065.13E+076.05E+071.04E+097.42E+071.18E+091.25E+072.67E+06
best1.87E+042.75E+075.34E+071.88E+081.15E+074.05E+081.97E+046.40E+03
Table 3. CEC2017 test results 50-dimension.
Table 3. CEC2017 test results 50-dimension.
DBOPIOSCABOAWOACOASAEDBO
F1mean5.64E+099.56E+106.77E+101.07E+112.19E+101.15E+115.72E+099.44E+08
std1.12E+101.29E+109.01E+098.32E+095.18E+098.52E+092.86E+091.20E+09
best1.21E+097.04E+105.12E+108.90E+101.37E+109.58E+102.04E+097.28E+07
F3mean2.96E+052.59E+052.22E+054.03E+053.32E+052.88E+056.30E+052.88E+05
std7.25E+043.77E+043.72E+041.84E+051.08E+052.05E+041.31E+051.09E+05
best1.74E+051.90E+051.55E+051.78E+051.76E+051.65E+053.98E+051.50E+05
F4mean1.97E+031.42E+041.41E+044.03E+045.00E+034.24E+041.40E+037.89E+02
std2.55E+034.60E+032.09E+033.77E+031.33E+035.25E+036.47E+021.33E+02
best7.66E+028.33E+039.82E+033.29E+042.59E+033.22E+048.60E+025.87E+02
F5mean9.95E+021.23E+031.14E+031.19E+031.12E+031.19E+039.58E+028.64E+02
std1.10E+024.24E+014.06E+012.83E+016.88E+013.23E+017.44E+016.73E+01
best7.71E+021.14E+031.07E+031.10E+031.01E+031.14E+038.21E+027.35E+02
F6mean6.70E+026.92E+026.85E+027.04E+027.00E+027.01E+026.56E+026.49E+02
std1.16E+019.67E+006.01E+005.07E+001.31E+015.11E+008.10E+008.65E+00
best6.42E+026.71E+026.74E+026.90E+026.80E+026.91E+026.31E+026.30E+02
F7mean1.51E+032.15E+031.89E+032.01E+031.89E+032.04E+031.48E+031.39E+03
std1.43E+023.82E+011.14E+023.93E+019.11E+016.11E+011.14E+029.88E+01
best1.28E+032.08E+031.59E+031.93E+031.72E+031.86E+031.24E+031.18E+03
F8mean1.30E+031.56E+031.46E+031.52E+031.40E+031.49E+031.27E+031.13E+03
std9.49E+014.82E+013.51E+012.51E+015.98E+013.14E+016.69E+015.66E+01
best1.13E+031.46E+031.38E+031.44E+031.30E+031.44E+031.11E+031.04E+03
F9mean2.72E+044.16E+043.35E+043.96E+043.97E+043.83E+043.32E+042.92E+04
std8.02E+037.38E+035.52E+032.50E+039.77E+033.47E+031.03E+048.06E+03
best1.10E+042.38E+042.44E+043.48E+042.46E+042.93E+041.67E+041.08E+04
F10mean1.08E+041.57E+041.55E+041.57E+041.36E+041.51E+048.97E+031.23E+04
std2.16E+034.34E+025.38E+023.96E+027.83E+024.51E+029.25E+022.34E+03
best6.95E+031.46E+041.35E+041.50E+041.18E+041.43E+047.21E+036.43E+03
F11mean5.21E+031.59E+041.25E+042.42E+049.04E+032.58E+044.08E+042.86E+03
std4.20E+034.92E+032.23E+032.24E+032.18E+033.26E+031.53E+048.35E+02
best1.89E+038.27E+037.90E+031.96E+045.55E+031.83E+041.17E+041.74E+03
F12mean1.38E+091.44E+102.40E+108.22E+104.22E+098.76E+108.15E+082.32E+08
std1.05E+093.11E+096.37E+091.43E+101.68E+091.54E+105.17E+084.80E+08
best3.47E+087.65E+091.34E+105.64E+101.83E+095.84E+102.46E+088.82E+06
F13mean1.10E+084.67E+096.19E+094.64E+105.00E+085.00E+102.88E+082.13E+07
std1.09E+088.71E+082.51E+091.60E+102.92E+081.42E+102.31E+085.70E+07
best2.18E+052.96E+093.02E+091.39E+101.10E+082.22E+102.52E+078.00E+04
F14mean5.52E+064.91E+068.02E+061.52E+081.05E+078.70E+072.63E+077.36E+06
std6.95E+062.28E+063.35E+061.09E+081.03E+075.76E+072.12E+071.83E+07
best8.55E+048.50E+051.50E+063.61E+075.62E+051.58E+072.59E+067.79E+04
F15mean1.58E+071.81E+091.16E+098.25E+096.26E+079.11E+091.62E+086.05E+05
std5.80E+075.81E+085.34E+083.09E+097.68E+073.66E+093.42E+082.83E+06
best3.69E+048.48E+082.42E+081.01E+097.27E+064.18E+091.17E+066.33E+03
F16mean4.88E+036.38E+036.23E+031.10E+046.38E+031.02E+044.54E+034.45E+03
std5.74E+025.02E+024.50E+021.48E+031.08E+031.66E+035.10E+027.52E+02
best3.62E+035.51E+035.06E+038.08E+033.87E+037.17E+033.71E+032.66E+03
F17mean4.11E+035.77E+035.18E+031.65E+044.65E+031.32E+044.06E+033.66E+03
std4.75E+024.53E+026.25E+028.95E+035.11E+028.89E+036.09E+023.74E+02
best3.11E+034.87E+034.48E+035.32E+033.66E+035.11E+032.90E+032.87E+03
F18mean1.12E+075.75E+075.87E+072.38E+086.89E+072.23E+085.68E+076.74E+06
std1.32E+072.13E+072.81E+071.37E+084.00E+078.10E+074.20E+076.76E+06
best6.03E+051.85E+071.59E+072.92E+071.74E+069.39E+076.23E+063.28E+05
F19mean1.29E+077.32E+087.12E+084.54E+092.29E+074.57E+091.40E+072.54E+06
std1.87E+072.40E+084.52E+081.93E+092.22E+071.81E+092.88E+074.46E+06
best5.63E+043.52E+082.60E+081.70E+091.48E+061.28E+095.26E+042.65E+03
F20mean3.84E+034.35E+034.32E+034.38E+033.93E+034.25E+033.79E+033.54E+03
std3.65E+022.03E+021.84E+021.70E+023.61E+022.71E+024.15E+023.85E+02
best3.12E+033.89E+033.93E+033.91E+033.07E+033.62E+033.00E+032.78E+03
F21mean2.88E+033.00E+032.96E+033.25E+033.08E+033.27E+032.79E+032.67E+03
std8.31E+014.65E+015.69E+016.85E+011.29E+021.17E+028.80E+017.77E+01
best2.70E+032.90E+032.81E+033.11E+032.86E+033.08E+032.67E+032.53E+03
F22mean1.29E+041.72E+041.72E+041.70E+041.48E+041.71E+041.07E+041.27E+04
std3.05E+033.00E+023.63E+021.38E+031.14E+034.78E+028.44E+023.37E+03
best2.96E+031.66E+041.65E+041.16E+041.29E+041.60E+048.89E+032.53E+03
F23mean3.56E+033.50E+033.71E+034.76E+033.83E+034.55E+033.46E+033.34E+03
std1.36E+026.36E+017.24E+012.06E+021.88E+022.26E+027.33E+011.77E+02
best3.29E+033.37E+033.55E+034.35E+033.56E+034.07E+033.07E+033.07E+03
F24mean3.70E+033.60E+033.91E+035.37E+033.91E+034.85E+033.72E+033.62E+03
std1.37E+025.05E+017.43E+013.64E+021.57E+022.85E+021.90E+021.99E+02
best3.49E+033.51E+033.74E+034.65E+033.57E+034.43E+033.41E+033.31E+03
F25mean4.27E+031.37E+048.91E+031.61E+045.27E+031.56E+044.04E+033.25E+03
std1.78E+032.04E+031.19E+031.17E+034.89E+021.38E+038.56E+028.63E+01
best3.14E+038.82E+036.41E+031.39E+044.50E+031.09E+043.32E+033.12E+03
F26mean1.08E+041.66E+041.40E+041.77E+041.56E+041.72E+048.85E+038.28E+03
std1.07E+031.95E+037.91E+026.78E+021.46E+036.89E+021.05E+032.42E+03
best8.61E+031.25E+041.25E+041.62E+041.25E+041.57E+046.78E+033.99E+03
F27mean3.92E+034.26E+034.85E+037.14E+034.87E+037.11E+034.67E+033.97E+03
std2.00E+021.12E+022.63E+026.34E+027.43E+026.63E+021.08E+023.43E+02
best3.60E+034.00E+034.36E+036.15E+033.71E+035.81E+033.44E+033.38E+03
F28mean6.51E+039.54E+038.60E+031.43E+046.06E+031.41E+045.95E+033.62E+03
std2.05E+031.10E+038.82E+021.02E+036.78E+021.29E+031.39E+031.29E+02
best3.87E+037.69E+037.35E+031.13E+045.03E+031.16E+043.83E+033.42E+03
F29mean6.16E+037.95E+038.90E+033.51E+059.18E+031.90E+055.11E+035.71E+03
std6.67E+026.06E+021.04E+033.30E+051.54E+031.98E+053.78E+026.73E+02
best4.84E+036.94E+036.66E+033.44E+046.33E+032.45E+044.40E+034.11E+03
F30mean5.35E+071.38E+091.26E+097.61E+092.94E+088.13E+095.30E+073.40E+07
std6.44E+072.93E+082.83E+083.28E+091.25E+082.96E+091.31E+083.66E+07
best5.01E+067.66E+088.26E+083.03E+097.10E+072.69E+097.21E+082.78E+06
Table 4. CEC2017 test results 100-dimension.
Table 4. CEC2017 test results 100-dimension.
DBOPIOSCABOAWOACOASAEDBO
F1mean1.09E+112.72E+112.12E+112.61E+111.10E+112.72E+113.90E+102.59E+10
std7.37E+101.48E+101.23E+101.38E+101.18E+109.96E+091.20E+109.91E+09
best2.48E+102.31E+111.91E+112.30E+117.84E+102.50E+112.14E+101.14E+10
F3mean7.56E+054.77E+056.11E+055.69E+058.94E+053.56E+051.20E+064.39E+05
std3.14E+051.68E+051.02E+053.41E+052.02E+051.39E+041.42E+051.04E+05
best3.62E+053.67E+054.65E+053.45E+053.56E+053.21E+058.20E+053.21E+05
F4mean1.39E+047.01E+045.34E+041.16E+052.23E+041.10E+054.88E+033.21E+03
std1.27E+041.50E+041.04E+041.09E+044.76E+031.47E+041.50E+038.59E+02
best3.40E+034.92E+043.42E+049.67E+041.36E+047.77E+042.90E+031.85E+03
F5mean1.70E+032.21E+032.07E+032.10E+031.98E+032.13E+031.81E+031.56E+03
std2.08E+025.48E+015.66E+013.49E+011.01E+024.45E+011.39E+021.69E+02
best1.42E+032.10E+031.95E+032.00E+031.79E+032.03E+031.50E+031.35E+03
F6mean6.81E+027.17E+027.06E+027.13E+027.08E+027.13E+026.53E+026.68E+02
std1.25E+014.96E+005.43E+002.37E+009.95E+003.42E+005.66E+006.06E+00
best6.63E+027.04E+026.97E+027.07E+026.91E+027.06E+026.63E+026.57E+02
F7mean3.02E+034.13E+034.06E+033.97E+033.82E+034.02E+033.23E+032.85E+03
std2.49E+027.04E+012.62E+026.42E+011.41E+027.13E+013.01E+021.87E+02
best2.55E+033.94E+033.54E+033.79E+033.52E+033.85E+032.67E+032.47E+03
F8mean2.15E+032.66E+032.41E+032.58E+032.41E+032.59E+032.11E+031.94E+03
std2.39E+024.98E+017.51E+012.98E+011.09E+025.04E+011.31E+022.30E+02
best1.75E+032.53E+032.30E+032.50E+032.18E+032.49E+031.85E+031.56E+03
F9mean7.91E+041.02E+059.08E+048.32E+048.19E+048.00E+049.72E+047.53E+04
std9.84E+034.67E+039.65E+033.86E+031.80E+044.77E+031.61E+041.08E+04
best4.17E+049.22E+047.42E+047.54E+046.04E+046.89E+047.07E+043.94E+04
F10mean2.96E+043.32E+043.31E+043.32E+042.96E+043.28E+042.07E+042.98E+04
std3.65E+036.96E+026.05E+027.63E+021.49E+036.37E+021.36E+033.40E+03
best2.07E+043.08E+043.18E+043.12E+042.67E+043.13E+042.80E+042.03E+04
F11mean2.21E+052.39E+051.77E+054.28E+052.83E+052.69E+052.39E+052.93E+05
std5.01E+045.02E+043.67E+042.01E+051.18E+056.36E+044.66E+048.77E+04
best1.40E+051.04E+051.03E+052.09E+051.42E+051.48E+051.73E+059.14E+04
F12mean6.96E+099.56E+101.03E+111.98E+113.01E+102.02E+117.86E+092.29E+09
std2.35E+091.20E+101.38E+102.13E+106.02E+092.62E+104.24E+091.55E+09
best3.17E+097.59E+107.95E+101.42E+111.82E+101.19E+111.74E+096.68E+08
F13mean2.32E+081.54E+101.86E+104.69E+102.73E+094.94E+105.06E+081.96E+07
std1.71E+083.89E+093.31E+095.54E+099.33E+085.97E+092.96E+083.83E+07
best1.69E+076.77E+091.28E+102.77E+101.30E+093.75E+101.24E+081.67E+05
F14mean1.63E+077.60E+076.49E+071.26E+081.74E+071.01E+087.72E+074.15E+06
std1.41E+072.14E+072.64E+076.85E+078.92E+063.97E+074.32E+072.39E+06
best9.95E+052.67E+071.86E+073.35E+077.47E+065.15E+071.88E+079.05E+05
F15mean7.69E+075.02E+096.86E+092.27E+104.09E+082.58E+101.25E+081.16E+06
std8.72E+071.26E+091.85E+094.88E+092.32E+084.70E+091.33E+083.11E+06
best1.57E+052.64E+093.77E+091.12E+101.16E+081.60E+101.37E+074.12E+04
F16mean9.34E+031.43E+041.51E+042.66E+041.69E+042.53E+048.06E+037.48E+03
std1.47E+036.09E+029.51E+022.29E+032.49E+033.10E+039.71E+021.41E+03
best7.15E+031.32E+041.35E+041.97E+041.32E+041.89E+046.20E+036.20E+03
F17mean9.06E+032.58E+047.76E+041.60E+073.12E+041.00E+071.46E+046.94E+03
std1.39E+031.31E+046.90E+041.05E+073.67E+048.20E+061.69E+048.61E+02
best6.35E+031.20E+041.25E+042.44E+068.41E+034.67E+056.09E+035.09E+03
F18mean2.56E+071.21E+081.33E+082.87E+082.12E+073.30E+087.60E+071.02E+07
std1.48E+073.45E+075.72E+071.31E+089.63E+061.13E+085.10E+076.26E+06
best7.57E+066.05E+076.59E+078.25E+073.66E+061.35E+081.02E+076.93E+05
F19mean8.94E+075.42E+095.40E+092.56E+104.93E+082.71E+101.79E+088.19E+06
std8.17E+071.34E+091.46E+094.97E+092.21E+084.90E+092.04E+081.35E+07
best1.92E+072.94E+092.29E+091.07E+102.02E+081.49E+107.79E+061.03E+05
F20mean7.49E+038.11E+038.03E+038.17E+037.19E+037.79E+037.33E+037.05E+03
std6.77E+023.73E+023.67E+022.97E+026.37E+023.09E+025.69E+027.25E+02
best5.99E+036.98E+037.27E+037.29E+035.82E+036.99E+035.93E+035.39E+03
F21mean4.03E+034.11E+034.21E+034.92E+034.44E+035.07E+033.68E+033.50E+03
std1.65E+021.03E+021.05E+021.80E+021.95E+022.01E+021.89E+022.11E+02
best3.71E+033.95E+034.01E+034.60E+034.04E+034.57E+033.40E+033.12E+03
F22mean3.10E+043.56E+043.55E+043.57E+043.21E+043.50E+042.28E+043.05E+04
std3.68E+037.51E+025.56E+025.87E+021.48E+038.55E+021.37E+034.56E+03
best2.29E+043.34E+043.43E+043.43E+042.84E+043.34E+042.26E+042.20E+04
F23mean4.75E+034.69E+035.23E+036.62E+035.30E+036.71E+034.70E+034.59E+03
std2.51E+021.13E+021.05E+022.09E+022.98E+023.57E+027.67E+013.81E+02
best4.30E+034.46E+035.04E+036.29E+034.76E+035.83E+034.57E+033.85E+03
F24mean6.13E+035.90E+037.42E+031.24E+046.74E+031.03E+044.52E+036.25E+03
std4.60E+022.23E+023.05E+021.51E+034.07E+029.95E+021.51E+027.80E+02
best5.24E+035.45E+036.90E+039.44E+035.88E+038.59E+035.24E+034.96E+03
F25mean9.79E+033.02E+042.27E+042.95E+041.10E+042.98E+048.57E+035.67E+03
std6.85E+032.30E+033.86E+031.60E+031.27E+031.90E+031.84E+037.02E+02
best4.88E+032.56E+041.66E+042.68E+049.10E+032.51E+045.95E+034.63E+03
F26mean2.66E+044.59E+044.07E+045.76E+043.78E+045.30E+042.92E+042.12E+04
std3.36E+031.04E+042.38E+032.39E+033.06E+032.17E+031.19E+033.46E+03
best2.13E+042.94E+043.73E+045.29E+043.21E+044.83E+041.70E+041.66E+04
F27mean4.84E+036.42E+038.76E+031.51E+046.38E+031.55E+043.92E+033.63E+03
std4.85E+025.35E+026.27E+021.35E+031.21E+031.34E+031.15E+026.49E+02
best4.13E+035.54E+037.58E+031.25E+044.87E+031.29E+043.68E+033.59E+03
F28mean1.84E+043.29E+042.76E+043.67E+041.48E+043.06E+041.58E+046.41E+03
std5.75E+031.45E+032.26E+031.63E+031.08E+031.28E+032.48E+037.82E+02
best7.36E+032.76E+042.33E+043.31E+041.22E+042.73E+049.42E+035.27E+03
F29mean1.22E+043.25E+043.88E+049.64E+052.13E+048.02E+051.01E+048.78E+03
std1.55E+031.43E+041.72E+045.43E+054.03E+033.66E+052.91E+038.14E+02
best9.56E+032.19E+041.73E+041.78E+051.43E+041.73E+056.77E+036.67E+03
F30mean2.90E+087.39E+091.27E+104.09E+103.26E+094.51E+103.45E+087.58E+07
std1.86E+081.67E+092.53E+096.81E+091.01E+095.36E+093.38E+081.17E+08
best7.44E+074.52E+098.10E+092.86E+101.85E+093.26E+106.36E+072.67E+06
Table 5. CEC2017 D = 30 Wilcoxon rank sum test.
Table 5. CEC2017 D = 30 Wilcoxon rank sum test.
DBOPIOSCABOAWOASACOA
F16.53E-08 < 0.052.12E-11 < 0.052.12E-11 < 0.053.02E-11 < 0.053.02E-11 < 0.051.96E-10 < 0.053.02E-11 < 0.05
F33.78E-02 < 0.056.53E-07 < 0.054.33E-014.55E-013.02E-11 < 0.051.70E-08 < 0.051.91E-01
F41.85E-08 < 0.051.82E-11 < 0.057.02E-10 < 0.053.02E-11 < 0.053.69E-11 < 0.057.69E-08 < 0.053.02E-11 < 0.05
F57.12E-09 < 0.052.92E-11 < 0.055.11E-10 < 0.058.02E-09 < 0.051.02E-11 < 0.056.36E-05 < 0.051.55E-09 < 0.05
F69.52E-04 < 0.053.01E-10 < 0.052.69E-09 < 0.051.77E-10 < 0.054.02E-08 < 0.051.25E-05 < 0.054.04E-08 < 0.05
F77.73E-03 < 0.053.02E-11 < 0.057.39E-11 < 0.053.02E-11 < 0.054.50E-11 < 0.051.63E-02 < 0.053.02E-11 < 0.05
F84.11E-07 < 0.055.02E-09 < 0.053.02E-11 < 0.053.02E-11 < 0.051.21E-10 < 0.055.09E-08 < 0.053.02E-11 < 0.05
F91.76E-011.29E-09 < 0.051.24E-03 < 0.051.41E-09 < 0.056.01E-08 < 0.052.60E-08 < 0.052.03E-09 < 0.05
F107.01E-03 < 0.052.23E-09 < 0.051.41E-09 < 0.059.92E-11 < 0.052.89E-03 < 0.051.73E-07 < 0.051.17E-09 < 0.05
F111.87E-07 < 0.052.02E-11 < 0.052.02E-11 < 0.052.02E-11 < 0.052.02E-11 < 0.052.02E-11 < 0.053.02E-11 < 0.05
F121.05E-014.08E-11 < 0.053.42E-10 < 0.056.88E-10 < 0.056.70E-11 < 0.051.89E-04 < 0.053.02E-11 < 0.05
F131.50E-02 < 0.054.08E-11 < 0.053.69E-11 < 0.053.02E-11 < 0.051.47E-07 < 0.052.39E-08 < 0.053.02E-11 < 0.05
F149.82E-03 < 0.056.20E-04 < 0.052.39E-04 < 0.051.43E-08 < 0.052.32E-06 < 0.051.10E-08 < 0.051.43E-08 < 0.05
F154.06E-02 < 0.057.52E-09 < 0.056.24E-08 < 0.059.25E-10 < 0.052.02E-11 < 0.055.46E-09 < 0.053.02E-11 < 0.05
F164.84E-02 < 0.054.08E-11 < 0.051.21E-10 < 0.053.02E-11 < 0.052.23E-09 < 0.052.17E-013.02E-11 < 0.05
F176.10E-011.37E-03 < 0.052.40E-014.50E-11 < 0.052.07E-02 < 0.057.17E-012.87E-10 < 0.05
F182.06E-02 < 0.055.09E-06 < 0.051.10E-08 < 0.055.07E-10 < 0.051.11E-04 < 0.051.49E-06 < 0.051.78E-10 < 0.05
F191.17E-04 < 0.052.02E-10 < 0.053.02E-11 < 0.053.02E-11 < 0.052.92E-09 < 0.058.15E-05 < 0.053.02E-11 < 0.05
F201.26E-011.16E-07 < 0.052.32E-06 < 0.058.48E-09 < 0.052.25E-04 < 0.053.83E-05 < 0.051.29E-09 < 0.05
F211.87E-07 < 0.053.69E-11 < 0.055.49E-11 < 0.059.92E-11 < 0.051.21E-10 < 0.057.96E-03 < 0.053.02E-11 < 0.05
F221.68E-04 < 0.055.46E-06 < 0.051.61E-10 < 0.055.53E-08 < 0.058.10E-10 < 0.051.47E-07 < 0.051.09E-10 < 0.05
F232.34E-02 < 0.056.31E-011.03E-06 < 0.053.02E-11 < 0.051.10E-08 < 0.051.17E-04 < 0.053.02E-11 < 0.05
F247.84E-012.97E-013.83E-05 < 0.053.02E-11 < 0.051.24E-03 < 0.056.84E-013.02E-11 < 0.05
F252.32E-06 < 0.055.14E-10 < 0.052.62E-10 < 0.057.58E-10 < 0.052.12E-11 < 0.055.49E-11 < 0.053.02E-11 < 0.05
F261.64E-05 < 0.051.32E-04 < 0.051.96E-10 < 0.053.02E-11 < 0.051.10E-08 < 0.051.33E-02 < 0.053.02E-11 < 0.05
F275.69E-014.08E-05 < 0.052.37E-10 < 0.053.02E-11 < 0.053.81E-07 < 0.051.49E-04 < 0.053.02E-11 < 0.05
F283.96E-08 < 0.052.37E -11 < 0.052.37E -11 < 0.055.02E-09 < 0.053.02E-11 < 0.052.61E-10 < 0.053.02E-11 < 0.05
F291.26E-02 < 0.054.18E-09 < 0.052.15E-10 < 0.055.32E-10 < 0.058.10E-10 < 0.055.20E-03 < 0.053.02E-11 < 0.05
F301.49E-02 < 0.057.88E-09 < 0.051.25E-10 < 0.052.04E-11 < 0.055.49E-11 < 0.052.58E-04 < 0.053.02E-11 < 0.05
Table 6. CEC2017 D = 50 Wilcoxon rank sum test.
Table 6. CEC2017 D = 50 Wilcoxon rank sum test.
DBOPIOSCABOAWOASACOA
F11.46E-10 < 0.052.63E-11 < 0.052.98E-10 < 0.056.74E-10 < 0.053.02E-11 < 0.053.02E-11 < 0.053.02E-11 < 0.05
F32.58E-011.58E-013.79E-012.39E-04 < 0.055.83E-03 < 0.051.29E-09 < 0.053.37E-04 < 0.05
F45.00E-09 < 0.053.02E-11 < 0.055.33E-10 < 0.053.02E-11 < 0.053.02E-11 < 0.052.83E-08 < 0.053.02E-11 < 0.05
F51.49E-06 < 0.053.02E-11 < 0.058.15E-11 < 0.053.34E-11 < 0.058.99E-11 < 0.057.69E-08 < 0.053.02E-11 < 0.05
F68.20E-07 < 0.053.02E-11 < 0.052.95E-10 < 0.058.33E-10 < 0.053.02E-11 < 0.055.60E-07 < 0.053.02E-11 < 0.05
F71.08E-02 < 0.053.02E-11 < 0.057.66E-10 < 0.052.12E-10 < 0.053.02E-11 < 0.053.03E-03 < 0.053.02E-11 < 0.05
F82.39E-08 < 0.053.01E-11 < 0.053.02E-11 < 0.059.13E-10 < 0.054.88E-10 < 0.052.00E-06 < 0.053.02E-11 < 0.05
F96.84E-011.41E-09 < 0.051.12E-011.69E-09 < 0.051.68E-03 < 0.052.89E-03 < 0.052.02E-08 < 0.05
F103.40E-02 < 0.051.21E-10 < 0.052.15E-10 < 0.051.09E-10 < 0.055.09E-06 < 0.053.16E-05 < 0.053.47E-10 < 0.05
F111.11E-06 < 0.053.02E-11 < 0.052.99E-11 < 0.053.02E-11 < 0.052.99E-11 < 0.053.02E-11 < 0.053.02E-11 < 0.05
F121.07E-07 < 0.058.36E-10 < 0.052.99E-11 < 0.053.02E-11 < 0.052.63E-11 < 0.052.39E-08 < 0.053.02E-11 < 0.05
F131.07E-07 < 0.056.45E-10 < 0.053.02E-11 < 0.051.88E-10 < 0.051.96E-10 < 0.051.55E-09 < 0.053.02E-11 < 0.05
F145.49E-03 < 0.054.22E-04 < 0.051.29E-06 < 0.053.34E-11 < 0.052.75E-03 < 0.052.57E-07 < 0.053.69E-11 < 0.05
F152.39E-04 < 0.056.35E-11 < 0.053.02E-11 < 0.057.41E-11 < 0.053.02E-11 < 0.056.33E-11 < 0.053.02E-11 < 0.05
F163.04E-014.98E-11 < 0.051.09E-10 < 0.053.02E-11 < 0.054.62E-10 < 0.054.83E-013.02E-11 < 0.05
F171.11E-06 < 0.052.36E-10 < 0.053.02E-11 < 0.056.54E-10 < 0.051.86E-09 < 0.051.17E-04 < 0.053.02E-11 < 0.05
F183.67E-03 < 0.056.07E-11 < 0.053.02E-11 < 0.053.02E-11 < 0.051.78E-10 < 0.051.78E-10 < 0.053.02E-11 < 0.05
F191.08E-02 < 0.053.02E-11 < 0.056.02E-10 < 0.053.02E-11 < 0.051.69E-09 < 0.051.44E-03 < 0.053.02E-11 < 0.05
F206.67E-03 < 0.053.50E-09 < 0.058.89E-10 < 0.051.41E-09 < 0.054.84E-02 < 0.052.40E-014.62E-10 < 0.05
F217.09E-08 < 0.055.49E-11 < 0.058.99E-11 < 0.053.02E-11 < 0.054.98E-11 < 0.051.34E-05 < 0.053.02E-11 < 0.05
F221.71E-016.28E-06 < 0.052.92E-09 < 0.056.12E-10 < 0.059.63E-022.77E-05 < 0.055.09E-08 < 0.05
F231.08E-02 < 0.052.27E-03 < 0.057.77E-09 < 0.053.02E-11 < 0.056.12E-10 < 0.054.06E-02 < 0.053.02E-11 < 0.05
F242.17E-011.44E-02 < 0.053.39E-02 < 0.053.02E-11 < 0.053.03E-02 < 0.051.99E-02 < 0.053.02E-11 < 0.05
F255.57E-03 < 0.053.02E-11 < 0.059.35E-10 < 0.053.02E-11 < 0.054.33E-10 < 0.057.38E-10 < 0.053.02E-11 < 0.05
F264.74E-06 < 0.053.34E-11 < 0.053.69E-11 < 0.053.02E-11 < 0.055.49E-11 < 0.051.05E-013.02E-11 < 0.05
F276.95E-011.25E-04 < 0.054.08E-11 < 0.053.02E-11 < 0.057.77E-09 < 0.051.11E-03 < 0.053.02E-11 < 0.05
F288.10E-10 < 0.059.35E-10 < 0.058.18E-10 < 0.053.02E-11 < 0.056.25E-10 < 0.053.02E-11 < 0.052.14E-10 < 0.05
F294.36E-02 < 0.053.69E-11 < 0.053.69E-10 < 0.055.25E-10 < 0.056.23E-10 < 0.054.86E-03 < 0.053.02E-11 < 0.05
F308.77E-03 < 0.053.02E-11 < 0.051.18E-11 < 0.052.02E-11 < 0.054.50E-11 < 0.054.73E-04 < 0.053.02E-11 < 0.05
Table 7. CEC2017 D = 100 Wilcoxon rank sum test.
Table 7. CEC2017 D = 100 Wilcoxon rank sum test.
DBOPIOSCABOAWOASACOA
F11.10E-08 < 0.053.02E-11 < 0.053.02E-11 < 0.053.02E-11 < 0.053.02E-11 < 0.051.04E-04 < 0.053.02E-11 < 0.05
F31.08E-02 < 0.054.84E-02 < 0.055.57E-10 < 0.051.19E-011.78E-10 < 0.053.69E-11 < 0.052.19E-08 < 0.05
F44.20E-10 < 0.053.02E-11 < 0.053.02E-11 < 0.053.02E-11 < 0.053.02E-11 < 0.056.05E-07 < 0.053.02E-11 < 0.05
F59.07E-03 < 0.053.02E-11 < 0.052.15E-10 < 0.054.98E-11 < 0.054.62E-10 < 0.051.07E-09 < 0.053.69E-11 < 0.05
F64.22E-04 < 0.053.02E-11 < 0.053.02E-11 < 0.053.02E-11 < 0.053.02E-11 < 0.055.07E-10 < 0.053.02E-11 < 0.05
F76.79E-03 < 0.053.02E-11 < 0.053.34E-11 < 0.053.02E-11 < 0.054.50E-11 < 0.052.15E-06 < 0.053.02E-11 < 0.05
F83.03E-03 < 0.053.02E-11 < 0.051.96E-10 < 0.053.02E-11 < 0.052.61E-10 < 0.051.11E-06 < 0.053.02E-11 < 0.05
F95.89E-011.09E-10 < 0.058.89E-10 < 0.051.86E-06 < 0.051.22E-02 < 0.054.94E-05 < 0.051.08E-02 < 0.05
F108.77E-027.12E-09 < 0.054.18E-09 < 0.051.55E-09 < 0.054.64E-011.43E-08 < 0.051.86E-06 < 0.05
F112.46E-02 < 0.051.19E-015.97E-05 < 0.053.59E-05 < 0.052.58E-016.84E-013.87E-01
F123.69E-11 < 0.053.02E-11 < 0.053.02E-11 < 0.053.02E-11 < 0.053.02E-11 < 0.056.70E-11 < 0.053.02E-11 < 0.05
F134.20E-10 < 0.053.02E-11 < 0.053.02E-11 < 0.053.02E-11 < 0.053.02E-11 < 0.054.08E-11 < 0.053.02E-11 < 0.05
F141.86E-06 < 0.053.02E-11 < 0.054.98E-11 < 0.053.02E-11 < 0.057.77E-09 < 0.053.34E-11 < 0.056.22E-10 < 0.05
F152.19E-08 < 0.056.87E-10 < 0.053.02E-11 < 0.053.14E-10 < 0.055.49E-11 < 0.052.37E-10 < 0.053.02E-11 < 0.05
F161.60E-07 < 0.053.02E-11 < 0.056.88E-10 < 0.053.02E-11 < 0.053.02E-11 < 0.052.27E-03 < 0.055.85E-10 < 0.05
F171.29E-09 < 0.053.02E-11 < 0.053.02E-11 < 0.052.52E-10 < 0.053.34E-11 < 0.058.15E-05 < 0.053.02E-11 < 0.05
F181.60E-07 < 0.057.65E-10 < 0.051.66E-10 < 0.053.02E-11 < 0.051.34E-05 < 0.054.08E-11 < 0.052.03E-10 < 0.05
F196.12E-10 < 0.053.02E-11 < 0.052.03E-10 < 0.059.28E-10 < 0.053.02E-11 < 0.052.03E-09 < 0.053.02E-11 < 0.05
F201.67E-013.08E-08 < 0.057.69E-08 < 0.053.01E-07 < 0.053.04E-013.01E-07 < 0.051.53E-05 < 0.05
F219.76E-10 < 0.053.34E-11 < 0.053.34E-11 < 0.053.02E-11 < 0.053.02E-11 < 0.051.30E-03 < 0.053.02E-11 < 0.05
F229.35E-011.09E-10 < 0.051.21E-10 < 0.052.15E-10 < 0.053.26E-018.29E-06 < 0.052.44E-09 < 0.05
F234.51E-02 < 0.051.09E-012.57E-07 < 0.053.02E-11 < 0.053.96E-08 < 0.053.02E-11 < 0.053.02E-11 < 0.05
F245.49E-011.22E-011.47E-07 < 0.053.02E-11 < 0.051.44E-02 < 0.054.08E-11 < 0.056.12E-10 < 0.05
F252.39E-04 < 0.055.07E-10 < 0.053.02E-11 < 0.053.02E-11 < 0.053.02E-11 < 0.051.01E-08 < 0.053.02E-11 < 0.05
F261.11E-06 < 0.053.02E-11 < 0.055.21E-10 < 0.053.02E-11 < 0.053.34E-11 < 0.051.15E-019.99E-09 < 0.05
F276.20E-011.17E-09 < 0.053.02E-11 < 0.053.02E-11 < 0.051.36E-07 < 0.051.29E-09 < 0.053.02E-11 < 0.05
F283.02E-11 < 0.052.33E-10 < 0.053.02E-11 < 0.054.12E-10 < 0.053.02E-11 < 0.053.02E-11 < 0.056.54E-10 < 0.05
F291.55E-09 < 0.053.02E-11 < 0.056.33E-10 < 0.053.02E-11 < 0.053.02E-11 < 0.051.76E-013.02E-11 < 0.05
F301.03E-06 < 0.059.02E-10 < 0.053.02E-11 < 0.053.87E-10 < 0.053.69E-11 < 0.053.09E-06 < 0.053.02E-11 < 0.05
Table 8. Friedman test in different dimensions.
Table 8. Friedman test in different dimensions.
Test Functions and DimensionsAlgorithm and the Friedman Test
CEC2017-30DAlgorithmBDOPIOSCABOAWOACOASAEDBO
Friedman2.1229864.0505763.9942525.5114933.7885076.9356413.2241381.532186
CEC2017-50DAlgorithmBDOPIOSCABOAWOACOASAEDBO
Friedman2.1080414.3160793.9632145.59543.4862036.8011452.8850551.531034
CEC2017-100DAlgorithmBDOPIOSCABOAWOACOASAEDBO
Friedman2.2115034.3425284.2770075.41153.2034526.5965482.6275861.554017
Rankings26574831
Table 9. Three bar truss design issues.
Table 9. Three bar truss design issues.
AlgorithmMost Advantageous PositionBest Value
DBOX = (0.7843;0.42081)263.9154549
PIOX = (0.79892;0.38318)264.2871197
SCAX = (0.76229;0.49137)264.7455824
BOAX = (0.7957;0.41871)266.9286327
WOAX = (0.76922;0.46627)264.1942308
SAX = (0.69476;0.79537)276.0448999
COAX = (0.78732;0.41279)263.9679101
EDBOX = (0.78821;0.40958)263.8979156
Table 10. Tension/compression spring design issues.
Table 10. Tension/compression spring design issues.
AlgorithmThe most Beneficial LocationBest Value
DBOX = (0.05;0.310429;15)0.013193249
PIOX = (0.067722;0.69411;4.59)0.022283434
SCAX = (0.066288;0.79908;2.6516)0.017556138
BOAX = (0.056344;0.47512;7.8358)0.015083554
WOAX = (0.064287;0.74234;2.8655)0.015339879
SAX = (0.060185;0.596;4.6405)0.015111848
COAX = (0.0501237;0.320184;14.4667)0.012870821
EDBOX = (0.0500156;0.31777;13.7778)0.012718751
Table 11. Pressure vessel design issues.
Table 11. Pressure vessel design issues.
AlgorithmThe Most Beneficial LocationBest Value
DBOX = (0.7957831;0.4341257;40.43576;200)6176.694769
PIOX = (1.009464;1.065502;50.87082;160.2901)11,571.59679
SCAX = (1.17576;0.619755;56.9765;52.5413)7560.760675
BOAX = (5.15699;12.7202;60.0022;53.773)127,973.3055
WOAX = (1.42882;1.01459;65.2253;10)10,961.59586
SAX = (7.485178;0.8613189;45.66248;137.3964)107,552.6368
COAX = (8.130678;23.99003;42.98162;166.7742)206,360.2719
EDBOX = (0.7827496;0.3943;40.38594;200)5957.489796
Table 12. Cantilever beam design issues.
Table 12. Cantilever beam design issues.
AlgorithmThe most Beneficial LocationBest Value
DBOX = (6.0419;5.2816;4.492;3.6087;2.0708)1.341291
PIOX = (6.8658;6.435;3.4065;3.4238;4.3872)1.529946
SCAX = (5.7684;4.9723;4.8006;4.8217;3.3963)1.482581
BOAX = (6.6943;5.6047;4.6167;2.7226;7.2026)1.674873
WOAX = (20.2078;5.89624;7.51354;4.54595;1.13014)2.451924
SAX = (15.6704;20.8237;4.12633;42.0047;4.88989)5.460936
COAX = (5.0241;5.0241;5.0241;5.0241;3.7965)1.490924
EDBOX = (5.9955;5.3997;4.399;3.4997;2.1914)1.340687
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

Li, Q.; Shi, H.; Zhao, W.; Ma, C. Enhanced Dung Beetle Optimization Algorithm for Practical Engineering Optimization. Mathematics 2024, 12, 1084. https://doi.org/10.3390/math12071084

AMA Style

Li Q, Shi H, Zhao W, Ma C. Enhanced Dung Beetle Optimization Algorithm for Practical Engineering Optimization. Mathematics. 2024; 12(7):1084. https://doi.org/10.3390/math12071084

Chicago/Turabian Style

Li, Qinghua, Hu Shi, Wanting Zhao, and Chunlu Ma. 2024. "Enhanced Dung Beetle Optimization Algorithm for Practical Engineering Optimization" Mathematics 12, no. 7: 1084. https://doi.org/10.3390/math12071084

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

Article Metrics

Back to TopTop