Skip to main content
Biomimetics logoLink to Biomimetics
. 2026 Sep 4;11(9):634. doi: 10.3390/biomimetics11090634

A Multi-Strategy Enhanced Crested Porcupine Optimizer with Targeted Defense Mechanism Improvement for Global Optimization

Zhaoyong Fan 1, Xi Li 1,*, Zhenhua Xiao 1,*, Lianying Zou 1, Wangming Zhang 1
Editors: Daniel Sanin-Villa1, Luis Fernando Grisales-Noreña1
PMCID: PMC13604152  PMID: 42782660

Abstract

Metaheuristic algorithms are widely used to solve complex optimization problems, but the trade-off between exploration and exploitation often limits their performance. The Crested Porcupine Optimizer (CPO) employs four bio-inspired defense mechanisms and achieves competitive performance, but it still tends to converge prematurely, initialize populations poorly, and rely on static parameters that cannot adapt to different phases. This paper proposes a Multi-Strategy Enhanced Crested Porcupine Optimizer (MSCPO) with four phase-targeted enhancement strategies: (1) Kent Chaos Opposition-Based Learning Initialization (KCOL) improves the initial population distribution through chaotic-weighted reflection; (2) Arctic Puffin Optimization (APO)-Inspired Dual-Modal Evasion (APO-DME) reduces dependence on the global best solution and increases population diversity through dual-mode differential perturbation; (3) Adaptive Dual-Differential Perturbation (ADDP) refines the search by combining population diversity and elite guidance information; (4) Periodic Dynamic Adaptive Perturbation (PDAP) enhances exploitation through periodic trigonometric perturbation and a fitness-conditioned update rule. These strategies interact across the optimization process to strengthen each defense mechanism at the appropriate phase. On the CEC 2017 and CEC 2022 benchmark suites, MSCPO achieves the best overall mean rank among all compared algorithms, with an overall rank of 2.638 on CEC 2017 and 2.375 on CEC 2022. A full-factorial ablation over all 16 strategy combinations confirms that each strategy contributes positively: removing any single strategy degrades the overall mean rank, and the complete MSCPO achieves the best mean rank (3.34), significantly outperforming all single-strategy variants (Wilcoxon signed-rank test, p < 0.001). To verify the practical applicability of MSCPO, the algorithm is further applied to three engineering design problems: step-cone pulley design, hydrostatic thrust bearing design, and robotic gripper design. MSCPO ranks first on the hydrostatic thrust bearing problem, second on the step-cone pulley problem, and third on the robotic gripper problem. Future work will explore adaptive population sizing to further improve the scalability of MSCPO on very high-dimensional problems.

Keywords: crested porcupine optimizer, multi-strategy enhancement, chaotic initialization, dual-modal evasion, adaptive perturbation, engineering optimization

1. Introduction

Optimization is a fundamental process in science and engineering, with applications ranging from structural design [1] and resource allocation [2] to feature selection [3], hyperparameter tuning [4] and signal decomposition [5]. The core difficulty lies in finding the global optimum within a high-dimensional, multimodal, and non-convex search space [6]. Nature-inspired metaheuristic algorithms have become a popular approach to these problems because they require no derivatives, need few parameters, and can navigate complex landscapes without problem-specific mathematical models [7]. Drawing on biological evolution, physical phenomena, and swarm intelligence, these algorithms can handle non-differentiable or discontinuous objectives that are often intractable for gradient-based methods.

In 2024, Abdel-Basset et al. [8] proposed the Crested Porcupine Optimizer (CPO), inspired by the defensive behaviors of the crested porcupine. CPO models four defense mechanisms of increasing aggressiveness: visual intimidation (first defense), auditory deterrence (second defense), olfactory assault (third defense), and physical counterattack (fourth defense). The first two mechanisms serve as exploration operators that drive broad dispersive search across the solution space, while the latter two function as exploitation operators for intensive local refinement around promising regions [8]. CPO employs a cyclic population reduction technique that adjusts the number of active individuals in each iteration, reflecting that not all porcupines perceive threats simultaneously. This design preserves population diversity while still permitting convergence. CPO has performed well on CEC 2014, CEC 2017, CEC 2020, and CEC 2022 benchmark suites. On these suites, it outperforms classical metaheuristics such as the gray wolf optimizer (GWO) [9], whale optimization algorithm (WOA) [10], differential evolution (DE) [11], and salp swarm algorithm [12], as well as more recent algorithms such as gradient-based optimizer (GBO) [13], African vultures optimization algorithm (AVOA) [14], Runge–Kutta method (RUN) beyond the metaphor [15], equilibrium optimizer (EO) [16], and artificial gorilla troops optimizer (GTO) [17].

Since 2024, CPO has been applied to a growing range of engineering problems. Zhao et al. [18] employed an enhanced CPO variant for wireless sensor network deployment and achieved higher coverage rates than competing methods. Pan et al. [19] combined CPO with feature mode decomposition for bearing fault diagnosis and extracted fault characteristic frequencies reliably even under strong interference noise. Zhang et al. [20] improved CPO for unmanned aerial vehicle (UAV) path planning by incorporating the Cauchy inverse cumulative distribution and JAYA attack strategies. Cai et al. [21] optimized PID controller parameters for CO2 control in cleanrooms with an improved CPO. Luo et al. [22] applied a self-adaptive CPO variant to optimize ensemble learning models for concrete chloride concentration prediction. These applications demonstrate that CPO can be adapted to a wide range of problem domains.

Despite its strengths, CPO has several limitations. First, its standard random initialization can produce clustered or poorly distributed populations, leaving promising regions unexplored. Second, the first defense depends on a single global best solution, which risks premature convergence on multimodal landscapes. Third, the second defense employs fixed random weights without adaptation, so its exploration effectiveness varies across optimization phases. Fourth, the static convergence parameter α in the fourth defense cannot adapt to the evolving search landscape; it either exploits too little in later stages or perturbs too much, disrupting convergence. Several improved variants of CPO have been proposed to address these limitations; a mechanism-level comparison of these variants is provided in Section 6.2. However, these variants integrate multiple enhancements without establishing an explicit correspondence between each strategy and the intrinsic phases of the original CPO.

To fill this gap, this paper proposes a Multi-Strategy Enhanced Crested Porcupine Optimizer (MSCPO) that integrates four phase-targeted enhancement strategies, each targeting one weakness identified above: (1) Kent Chaos Opposition-Based Learning (KCOL) improves standard random initialization with a Kent chaotic map and opposition-based learning. The Kent map produces sequences with favorable ergodicity and near-uniform distribution properties [23,24]; the opposition-based reflection constructs complementary candidates with respect to the current population bounds, from which the better candidate is greedily retained. (2) APO-Inspired Dual-Modal Evasion (APO-DME) redesigns the first defense mechanism. Inspired by the Arctic Puffin Optimizer [25], APO-DME eliminates the single-point dependency on the global best and introduces bimodal differential perturbation: uniform random perturbation based on population differential information for local diversity, and Levy flight for long-distance global escapes. The two modes are chosen with equal probability. (3) Adaptive Dual-Differential Perturbation (ADDP) enhances the second defense by combining two different vectors, one defined by two random population members and one pointing toward the current best solution, both scaled by a random coefficient. (4) Periodic Dynamic Adaptive Perturbation (PDAP) modifies the fourth defense by adding a periodic trigonometric perturbation and a random-peer reference, where the update direction is conditioned on the relative fitness of the current individual and the reference peer.

MSCPO is evaluated on CEC 2017 (D = 10, 30, 50, and 100) and CEC 2022 (D = 10, 20) against 11 competitors: genetic algorithm (GA) [26], DE [11], WOA [10], Harris Hawks Optimization (HHO) [27], dung beetle optimizer (DBO) [28], Gekko Japonicus Algorithm (GJA) [29], sparrow search algorithm (SSA) [30], Beaver Behavior Optimizer (BBO) [31], the original CPO [8], and two high-performance CEC competition algorithms (L-SHADE [32], the CEC 2014 winner, and LSHADE-SPACMA [33], a top-ranked CEC 2017 entrant). Statistical analysis employs the Wilcoxon signed-rank test and the Friedman mean rank test. The ablation study covers all strategy combinations in a full-factorial design and investigates the individual and combined contributions of each strategy with Nemenyi post hoc analysis [34]. MSCPO is also validated on three engineering design problems: step-cone pulley design, hydrostatic thrust bearing design, and robotic gripper design [35]. The main contributions of this paper are summarized as follows:

  1. MSCPO achieves an overall Mean Rank of 2.638 on CEC 2017 and 2.375 on CEC 2022, surpassing the original CPO (ranks of 5 and 4, respectively) and most nature-inspired competitors at D ≤ 50.

  2. The full-factorial ablation shows that the four strategies provide complementary, phase-targeted contributions: removing any single strategy degrades the overall mean rank, the two exploration-phase strategies (APO-DME and ADDP) carry the largest individual contribution, and the complete MSCPO achieves the best mean rank (3.34), significantly outperforming all single-strategy and pairwise variants.

  3. MSCPO outperforms CPO and most competitors on moderate-to-high dimensional problems (D = 10 to D = 50), although its advantage over the strongest rivals (GJA, BBO, and LSHADE-SPACMA) weakens at D = 100, highlighting the difficulty of budget-constrained high-dimensional optimization.

  4. MSCPO also achieves highly competitive results on three engineering design problems, demonstrating that it remains effective on real-world problems beyond benchmark suites.

The remainder of this paper is organized as follows. Section 2 reviews the original CPO algorithm. Section 3 describes the MSCPO algorithm and the four improvement strategies. Section 4 reports the experimental results on the benchmark suites. Section 5 covers the engineering applications. Section 6 discusses the practical efficiency of MSCPO, compares it with prior CPO variants, and analyzes its limitations; Section 7 concludes the paper and outlines future work.

2. Original CPO Algorithm

The Crested Porcupine Optimizer (CPO) [8] is a novel metaheuristic algorithm inspired by the biological defense mechanisms of crested porcupines (CP). It mimics four defensive behaviors of CP: visual intimidation, auditory deterrence, olfactory assault, and physical attack. The first two (sight and sound) are responsible for exploration, and the latter two (odor and physical attack) govern exploitation. This division balances global and local search.

2.1. Initialization

The initial population of CPO is generated uniformly within the boundaries of the search space:

xi=L+r⋅(U−L) , i=1, 2,⋯,N′ (1)

where r is a vector of uniformly distributed random numbers in 0, 1, and U and L are the upper and lower bounds of the search range.

2.2. Cyclic Population Reduction

CPO starts with a randomly initialized population. In each iteration, it employs cyclic population reduction. This mechanism reflects the fact that not all individuals in a group perceive a threat simultaneously. Mathematically, it dynamically adjusts the number of active individuals N participating in position updates during each iteration t, as defined by the following equation:

N=Nmin+N′−Nmin⋅1−t % TmaxTTmaxT (2)

where Nmin is the minimum population size, t is the current iteration, % represents the modulus operator, Tmax is the maximum number of iterations, and T is a cyclic parameter typically set to 2. Each active individual then selects a strategy based on a preset probability model to update its position, and the better solution is retained through greedy selection.

2.3. Exploration Phase

2.3.1. First Defense Mechanism (Sight)

When a porcupine sights a predator from a distance, it adopts a cautious approach combining its own position with a reference midpoint, enabling wide-range exploration. The mathematical model is as follows:

xit+1=xit+τ1⋅2τ2xCPt−yit (3)

where the reference midpoint yit is defined as:

yit=xit+xrt2 (4)

Here, τ1∼N0,1 (standard normal distribution), τ2 ∼U0,1, xCPt is the current global best solution, and xrt is a randomly selected individual from the population (r≠i).

In the visual defense mechanism, each individual generates a midpoint between itself and a random peer and then perturbs this midpoint, guided by the crest porcupine’s position. The absolute-value operator introduces directional diversity.

2.3.2. Second Defense Mechanism (Sound)

As the predator draws closer, the porcupine emits acoustic warnings. This mechanism blends individual memory with neighborhood information, facilitating local exploitation and medium-range exploration. The position update is as follows:

xit+1=1−U1xit+U1yt+τ3xr1t−xr2t (5)

where U1  is a random value within 0, 1, τ3∼U0,1, and xr1t and xr2t are two distinct random individuals r1≠r2≠i.

This mechanism produces a convex combination of the current position and a perturbed reference point. The difference vector xr1t−xr2t introduces differential evolution-style perturbation, promoting population diversity.

2.4. Exploitation Phase

2.4.1. Third Defense Mechanism (Odor)

When the predator is very close, the porcupine releases a pungent odor. The defense intensity correlates with the perceived threat level through an adaptive sensory factor. The mathematical model is as follows:

xit+1=1−U1xit+U1xr1t+ Stxr1t−xr2t−τ3δγtSt (6)
δ=+1,   if rand≤0.5−1,   otherwise (7)
γt=2⋅rand⋅1−ttmaxttmax (8)
St=expfxit/∑k=1Nfxkt+ε (9)

where τ3 is a random value uniformly distributed in [0, 1], δ is the direction parameter, γt  is the defense factor, St is the odor diffusion factor (constrained to the interval [0.3, 2.6]), ε is a small constant to avoid division by zero, and the exponential mapping ensures St>0.

2.4.2. Fourth Defense Mechanism (Physical Attack)

As a last resort, the porcupine charges physically toward the predator. This mechanism concentrates the search around the best-known solution (the crest porcupine). The mathematical model is as follows:

xit+1=xCPt+α1−τ4+τ4δxCPt−xit−τ5δγtFit (10)

where xCPt  is the best solution obtained, α=0.1 is the convergence acceleration factor, τ4, τ5∼U0,1, and Fit is the average impact force on the i-th predator.

Fit=τ6×mivit+1−vit∆t (11)

where τ6∼U0,1, mi is the mass of the predator, vit=xit is the initial speed, vit+1=xrt is the final speed of a random solution from the population, and ∆t is the current iteration number.

After each position update, the newly generated position is evaluated, and a greedy selection step determines whether it is retained. Each crested porcupine maintains a historical best position xpi, initialized to its starting position. If fxit+1≤fxpi, the new position is accepted and xpi←xit+1; otherwise, xit+1 is discarded and reverted to xpi. Whenever an individual improves upon the global best, the global best is updated accordingly.

3. Multi-Strategy Enhanced Crested Porcupine Optimizer

Although CPO demonstrates competitive performance, subsequent research has shown that, like many population-based algorithms, it suffers from slow convergence, low accuracy, and entrapment in local optima [18,19,36,37,38]. This section presents the Multi-strategy Enhanced Crested Porcupine Optimizer (MSCPO). MSCPO introduces four strategies: Kent Chaos Opposition-Based Learning initialization (KCOL); APO-inspired Dual-Mode Evasion (APO-DME); Adaptive Dual-Differential Perturbation (ADDP); and Periodic Dynamic Adaptive Perturbation (PDAP). Each modification targets a specific weakness in the corresponding CPO defense phase.

3.1. Targeted Enhancement Framework of MSCPO

The correspondence between the original CPO defense mechanisms and the proposed enhancement strategies is summarized in Table 1. Three phases receive new strategies; the olfactory phase remains unchanged. Each enhancement strategy is designed to address specific weaknesses in the corresponding CPO defense phase.

Table 1.

Correspondence between CPO Phases and MSCPO Strategies.

CPO Phase Enhancement Strategy Modification Type Targeted Weakness
Initialization (Phase 0) KCOL Replacement Uniform randomness causes clustering and poor boundary coverage
First Defense (Phase 1) APO-DME Replacement Single-point dependency on xCP causes exploration stagnation
Second Defense (Phase 2) ADDP Replacement Single differential vector limits search direction diversity
Third Defense (Phase 3) Original preserved Unchanged —
Fourth Defense (Phase 4) PDAP Replacement Fixed α imposes a constant exploration-exploitation balance throughout the search, and the update contains no periodic perturbation component

As shown in Table 1, the third defense mechanism remains intact. The sensory factor St of the olfactory defense is computed from the fitness values of the entire population, so it already injects population-level fitness information into the exploitation phase; we therefore retain this mechanism unchanged and concentrate the modifications on the remaining phases. KCOL runs before the main loop, providing the initial population for the subsequent search. APO-DME and ADDP modify the two exploration-phase defense mechanisms, while PDAP modifies the fourth defense mechanism in the exploitation phase through periodic trigonometric perturbation and a fitness-conditioned position update.

3.2. Kent Chaos Opposition-Based Learning Initialization (KCOL)

The initial population of a metaheuristic strongly influences whether it can find global optima. A well-distributed initial population increases the probability that at least one individual starts within the basin of attraction of the global optimum, which can substantially reduce the required search effort.

The original CPO uses uniform random initialization in Equation (1). An initial population with poor coverage reduces the probability of starting near the global optimum. KCOL replaces this scheme with Kent chaotic mapping and opposition-based learning (OBL).

The Kent chaotic map is a piecewise linear transformation on the interval [0, 1], defined as:

Ki,jm+1=Ki,jmr,0≤Ki,jm≤r1−Ki,jm1−r,r<Ki,jm≤1 (12)

where Ki,jm  denotes the m-th chaotic iterate for the j-th dimension of the i-th individual, and r∈0,1 is the control parameter to balance chaotic divergence and structural stability.

After Mc chaotic iterations, the Kent-mapped value is scaled to the search space:

OBLi,j=Ki,jMc⋅Uj−Lj+Lj (13)

The control parameter is set to r=0.4, a value widely adopted in the chaotic optimization literature for producing sequences with favorable ergodicity and uniform distribution properties [23,24]. The chaotic iteration count is set to Mc=10. A sensitivity analysis varying r∈{0.3,0.4,0.5} and Mc∈{5,10,15} on the CEC 2017 suite at D = 30 did not reveal statistically significant differences among the tested configurations (Friedman test, p = 0.12 > 0.05), indicating robustness to moderate perturbations of r and Mc.

The motivation for OBL is that, when the optimum’s location is unknown, the opposite candidate is as likely as the original point to lie closer to it [39,40]. For each Kent-mapped individual OBLi, its opposite is computed as:

OBLi,jopp=Lj+Uj−OBLi,j (14)

By greedily selecting the better of the two candidates according to Equation (15), KCOL improves the expected quality of the initial population.

xi0=argminfOBLi,fOBLiopp (15)

The greedy selection then guarantees that the retained individual is never worse than the original one.

3.3. APO-Inspired Dual-Modal Evasion (APO-DME)

The first defense mechanism in CPO uses the current best solution xCP to guide exploration. This mechanism depends entirely on xCP to determine the search direction. If xCP is trapped in a local optimum, the entire population is attracted toward that suboptimal region, causing stagnation. Individuals that would otherwise explore other regions are pulled back by the best-solution guidance. Real-world optimization problems present heterogeneous local structures: some regions require fine-grained local search to exploit promising gradients, while others require long-distance jumps to escape deep basins. This observation motivates a bimodal exploration mechanism that stochastically alternates between local refinement and global escape with equal probability.

The Arctic Puffin Optimization (APO) algorithm [25] uses two predator-evasion behaviors. One is rapid directional swimming through coordinated movements, which provides local fine-grained exploration:

step=xrand1−xrand2, xinew=xi+ε⋅step (16)

where ε∼U0,1 produces step sizes distributed over the interval 0,∥step∥. This mode leverages the structural information of the population encoded in the difference vector, enabling local exploration with step sizes on the same order as the typical inter-individual distance.

The other involves sudden long-distance directional changes modeled by a Levy flight:

step=xrand1−xrand2, xinew=xi+FL⋅LLevyD⋅step (17)

where LLevyD is a D-dimensional Levy flight vector:

LLevyD=uv1/β (18)

where u∼N0,σu2 with:

σu=Γ1+βsinπβ/2Γ1+β/2⋅β⋅2β−1/21/β (19)

and v∼N0,1; the setting β=1.5 provides a balance between frequent small steps (local search) and occasional large jumps (global exploration). Levy flights produce step lengths following a heavy-tailed distribution Ps∼s−1−β, enabling occasional long-distance jumps that can escape the deep basins of local optima.

The APO-DME position update for the first defense of MSCPO is:

xit+1=xit+εc⋅xr1t−xr2t,if rand<0.5xit+FL⋅LLevyD⋅xr1t−xr2t,otherwise (20)

where εc∼U0,1 is the uniform random perturbation coefficient. FL=0.5 is the Levy flight scaling factor, and rand is a random value in [0, 1].

3.4. Adaptive Dual-Differential Perturbation (ADDP)

The second defense mechanism in CPO employs a single differential vector xr1−xr2, which provides only one search direction per update. In complex multimodal landscapes, effective exploration often requires simultaneous movement along multiple promising directions. With only one differential, the resulting search direction depends entirely on random selection. An unfavorable pair r1, r2 can produce a poor direction with no alternative. This is problematic in landscapes with narrow valleys, where the optimal direction may not align with any single random differential vector.

Moreover, the original second defense never exploits the current best solution: its search direction is built solely from random population members. Combining a population-defined direction with a direction toward the best-so-far solution provides complementary guidance within a single update.

The ADDP strategy addresses these limitations through a redesigned mechanism. The intermediate reference point is retained and computed via binary mask blending, as shown in Equation (21):

ximid=U1⋅xit+1−U1⋅yit+U2⋅xr1t−xr2t (21)

where U1 and U2 are independent binary random vectors. The binary mask enables component-wise selection: some dimensions retain their current values, while others explore new regions. The ADDP-enhanced second defense is:

xit+1=ximid+F⋅xr1t−xr2t+F⋅xCPt−xit,if rand>0.5ximid,otherwise (22)

where rand is a random value in [0, 1], and F is a random coefficient drawn uniformly from [0, 1], applied identically to both differential vectors. The ADDP-enhanced position update uses a population differential and an elite differential. The population differential xr1t−xr2t promotes diversity by exploring along population-defined directions, encoding structural information about the relative geometry of population members. The elite differential xCPt−xit points toward the current best-known solution. The perturbation is adaptive in the sense that both differential vectors are constructed from the current population: as the population converges, the magnitudes of the two differentials decrease automatically, so the perturbation scale reduces over the course of the search without any explicit parameter schedule.

3.5. Periodic Dynamic Adaptive Perturbation (PDAP)

The fourth defense mechanism in CPO uses a fixed parameter α. The balance between stochastic exploration and deterministic exploitation fundamentally changes during optimization. Early iterations need strong stochasticity to explore widely, while late iterations require deterministic refinement to converge precisely. A fixed convergence-speed factor α imposes the same balance throughout the optimization process. Moreover, many optimization landscapes contain periodic local structures in which static perturbation strategies become trapped. The original mechanism lacks a periodic oscillation component and is therefore vulnerable to such structures.

MSCPO replaces the fourth defense mechanism with PDAP, which integrates periodic trigonometric perturbation, a random-peer reference, and a fitness-conditioned update:

xit+1=xit+ηt⋅Pi−I⋅xit,if fxit>fPixit+ηt⋅xit−Pi,otherwise (23)

where ηt=sin2πU1+cos2πU2 is the periodic trigonometric perturbation, and U1,U2∼U0,1 are independent. Pi=xkt is the random-peer reference point, with k chosen uniformly at random from the current individuals excluding i. The random integer coefficient I is defined as follows:

I=round1+rand∈{1, 2} (24)

where I=1 and I=2 each occur with probability 0.5. This coefficient scales the attraction term when the current individual is worse than the reference peer, adding variability to the update magnitude.

As shown in Equation (23), the PDAP position update depends on the relative fitness of xi and Pi. If the individual xi is worse than the random peer Pi, the update term Pi−I⋅xit pulls xi toward Pi with a magnitude scaled by I∈{1,2}, thereby directing the search toward a potentially better region. Otherwise, the update term xit−Pi pushes xi away from Pi, preserving the individual’s advantageous position while still introducing diversity through the periodic perturbation ηt. The update is adaptive in the sense that both its direction and its reference point depend on the current fitness state of the population: the relative fitness comparison determines whether the individual is attracted toward or repelled from a randomly resampled peer.

3.6. Flowchart of MSCPO

The overall flowchart of MSCPO is illustrated in Figure 1.

Figure 1.

Figure 1

Flowchart of the MSCPO algorithm. The five numbered phases correspond to Table 1 in Section 3.1: Phase 0 (initialization)—KCOL; Phase 1—APO-DME replaces the first defense; Phase 2—ADDP replaces the second defense; Phase 3—original odor defense preserved; Phase 4—PDAP replaces the fourth defense.

3.7. Theoretical Analysis

The convergence of MSCPO can be analyzed within the standard probabilistic search framework [41,42]. Let Xt denote the population position matrix at iteration t, and let fXt denote the corresponding fitness values. The position update in MSCPO is governed by four stochastic mechanisms: KCOL, APO-DME, ADDP, and PDAP, among which APO-DME, ADDP, and PDAP are activated probabilistically through the CPO defense selection framework, whereas KCOL acts at initialization.

First, MSCPO satisfies the improvement condition: the greedy selection applied after every position update retains a newly generated position only when it does not worsen the current fitness, so that fxbestt+1≤fxbestt for all iterations t, where xbestt denotes the best solution found up to iteration t. The best-fitness sequence therefore forms a non-increasing stochastic process.

Second, MSCPO satisfies the reachability condition: every subset of the bounded search space S=L,U with positive volume is sampled with strictly positive probability. KCOL generates samples over S at initialization; the uniform-perturbation mode of APO-DME produces new positions with positive density over S; and the Levy-flight mode follows a heavy-tailed distribution with unbounded support, so that any neighborhood of any point in S is reached with positive probability at every iteration. Hence, for the optimality region Rε=x∈S:fx−f∗≤ε with any ε>0, every iteration has a positive probability of entering Rε, independently of the search history. All update operators produce bounded displacements on S: KCOL confines samples within L,U; the APO-DME step is scaled by the step factor and the Levy scaling parameter FL; the ADDP perturbation is scaled by F∈0, 1; and the PDAP is bounded by ηt∈[−2,2]. The search therefore remains stable on bounded domains.

Under the improvement and reachability conditions, the convergence theorem for random search algorithms [41] applies: the best-so-far solution of MSCPO converges in probability to the global optimum:

limt→∞Pfxbestt−f∗≤ε=1,  ∀ε>0 (25)

This result concerns the limit behavior of the algorithm: it guarantees that the global optimum is attained with probability one as the number of iterations grows, but it does not specify a convergence rate, which depends on the problem structure.

3.8. Computational Complexity Analysis

3.8.1. Time Complexity

The time complexity of MSCPO is determined by two components: the initialization phase and the main loop. Let N denote the initial population size, D the problem dimension, Tmax the maximum number of iterations, and Ofc the complexity of a single objective-function evaluation.

The initialization phase proceeds as follows. First, random population initialization takes OND. Second, evaluating the initial fitness of all individuals takes ONfc. Third, the Kent chaotic map iterates Mc times over the N×D matrix, taking OMcND, where Mc=10 is a fixed constant. Opposition-based learning then generates N opposite solutions and performs greedy selection, requiring OND for solution generation and ONfc for the additional fitness evaluations. KCOL therefore consumes exactly 2N objective evaluations during initialization, compared with N in the original CPO. Therefore, the total initialization complexity is OMcND+ND+Nfc=O(N(McD+fc)).

The main loop runs for Tmax iterations. Within each iteration, the algorithm processes Nt individuals, where Nt decreases from N to Nmin via cyclic population reduction, and the average population size over a run is N¯=N+Nmin/2≈0.9N. For each individual, the complexity breakdown is as follows:

  • In APO-DME, selecting two random individuals and computing the step vector takes OD Levy flight generation takes OD, and the position update takes OD;

  • In the second defense mechanism (ADDP), computing the reference point and the dual-differential perturbation takes OD;

  • For the odor defense, computing the sensory factor St requires ONt for the summation, and the position update takes OD. The summation is recomputed for each individual entering this branch, because the fitness vector changes as individuals are updated within the same iteration;

  • In PDAP, selecting a random peer via a random permutation takes ONt, computing the periodic perturbation takes OD, and updating the position takes OD. In addition, the boundary handling and fitness evaluation take OD and Ofc per individual, respectively.

Each individual enters the exploration branch (APO-DME or ADDP, costing O(D+fc)) or the exploitation branch (the odor defense or PDAP, costing O(Nt+D+fc)) with probability 0.5. The expected per-iteration complexity is therefore ONtD+fc+N(t)2, and the worst-case per-iteration complexity is ON(t)(D+fc+N(t)). With an average population size of N¯ over Tmax iterations, the total complexity of the main loop is OTmaxN¯D+N¯fc+N¯2.

Combining the initialization and the main loop, we obtain the overall time complexity of MSCPO:

OMcND+Nfc+TmaxN¯D+fc+N¯ (26)

The same ON(t)2 summation cost arises in the third and fourth defense mechanisms of the original CPO, whose overall complexity is OND+Nfc+TmaxN¯D+fc+N¯. The two algorithms thus share the same asymptotic form. For standard benchmark functions where Ofc=OD, and for engineering problems whose closed-form objectives with multiple constraint terms also cost OD per evaluation, the total time complexity simplifies to OTmaxND when D≥N¯; for low-dimensional problems with D<N¯, the complexity is OTmaxN¯2, which remains identical in asymptotic order to the original CPO.

3.8.2. Spatial Complexity

The spatial complexity is determined by the memory required to store the population and auxiliary variables:

  • Population matrix: OND;

  • Individual historical best matrix: OND which is maintained in both CPO and MSCPO;

  • Fitness vector: ON;

  • Global best solution: OD;

  • Kent chaotic matrix (initialization only): OND;

  • Intermediate variables: OD.

The overall spatial complexity is:

OND+ND+N+D+ND+D=OND (27)

Overall, MSCPO has a time complexity of OTmaxND and a spatial complexity of OND, both identical in asymptotic order to those of the original CPO. The four enhancement strategies add O(D) arithmetic operations per individual and exactly N additional objective evaluations, which are incurred once at initialization and account for about 0.1% of the total evaluation budget under the experiment settings (e.g., 30 out of approximately 27,060 evaluations for N=30, Tmax=1000) and about 0.2% on the engineering problems (N=100, Tmax=500).

4. Experimental Verification and Analysis

This section evaluates the Multi-Strategy Enhanced Crested Porcupine Optimizer (MSCPO). The primary objective is to assess the algorithm’s performance against a diverse set of established optimization methods, including classical evolutionary algorithms (GA [26], DE [11]), swarm intelligence algorithms (WOA [10], HHO [27], DBO [28], GJA [29], SSA [30], BBO [31]), the original CPO [8], and two high-performance CEC competition algorithms (L-SHADE [32], LSHADE-SPACMA [33]). The evaluation was conducted on the CEC 2017 and CEC 2022 benchmark suites across various dimensions, with a fixed population size of 30 and a maximum of 1000 iterations per run. Under this fixed-iteration protocol, the total number of objective evaluations per run may differ across algorithm families, because some competitors employ population size reduction (e.g., L-SHADE, LSHADE-SPACMA, and the CPO family) while others evaluate the full population in every iteration. All algorithms were executed over 30 independent runs to ensure statistical reliability. Statistical significance was assessed using the Wilcoxon signed-rank test and Friedman mean rank test at a significance level of α=0.05.

Section 4.1 describes the parameters and experimental environment. Section 4.2 presents the ablation study of the four enhancement strategies. Section 4.3 presents a comparative analysis on CEC 2017, including the Wilcoxon signed-rank test and the Friedman mean rank test across the tested dimensions. Section 4.4 presents a comparative analysis of CEC 2022. Detailed numerical results (mean and standard deviation for each function) are provided in Appendix A, and only the statistically aggregated results are presented here.

4.1. Experimental Settings and Comparative Algorithms

Experiments were conducted on two widely recognized benchmark suites, CEC 2017 [43] and CEC 2022 [44]. Table 2 summarizes the CEC 2017 test suite, categorizing functions into unimodal, multimodal, hybrid, and composition types. Each function is listed with its number, name, lower and upper bounds, and minimum value (fmin). Table 3 outlines the CEC 2022 test suite, detailing types (unimodal, basic, hybrid, and composition), numbers, names, bounds, and minimum values (fmin).

Table 2.

Description of the CEC 2017 test suite [43].

Function Type No. Name [lb, ub] fmin
Unimodal Functions F1 Shifted and Rotated Bent Cigar Function [−100, 100] 100
F3 Shifted and Rotated Zakharov Function [−100, 100] 300
Multimodal Functions F4 Shifted and Rotated Rosenbrock’s Function [−100, 100] 400
F5 Shifted and Rotated Rastrigin’s Function [−100, 100] 500
F6 Shifted and Rotated Expanded Scaffer’s F6 Function [−100, 100] 600
F7 Shifted and Rotated Lunacek Bi−Rastrigin Function [−100, 100] 700
F8 Shifted and Rotated Non-Continuous Rastrigin Function [−100, 100] 800
F9 Shifted and Rotated Levy Function [−100, 100] 900
F10 Shifted and Rotated Schwefel’s Function [−100, 100] 1000
Hybrid Functions F11 Hybrid Function 1 (N = 3) [−100, 100] 1100
F12 Hybrid Function 2 (N = 3) [−100, 100] 1200
F13 Hybrid Function 3 (N = 3) [−100, 100] 1300
F14 Hybrid Function 4 (N = 4) [−100, 100] 1400
F15 Hybrid Function 5 (N = 4) [−100, 100] 1500
F16 Hybrid Function 6 (N = 4) [−100, 100] 1600
F17 Hybrid Function 7 (N = 5) [−100, 100] 1700
F18 Hybrid Function 8 (N = 5) [−100, 100] 1800
F19 Hybrid Function 9 (N = 5) [−100, 100] 1900
F20 Hybrid Function 10 (N = 6) [−100, 100] 2000
Composition Functions F21 Composition Function 1 (N = 3) [−100, 100] 2100
F22 Composition Function 2 (N = 3) [−100, 100] 2200
F23 Composition Function 3 (N = 4) [−100, 100] 2300
F24 Composition Function 4 (N = 4) [−100, 100] 2400
F25 Composition Function 5 (N = 5) [−100, 100] 2500
F26 Composition Function 6 (N = 5) [−100, 100] 2600
F27 Composition Function 7 (N = 6) [−100, 100] 2700
F28 Composition Function 8 (N = 6) [−100, 100] 2800
F29 Composition Function 9 (N = 6) [−100, 100] 2900
F30 Composition Function 10 (N = 3) [−100, 100] 3000

Note: N in the function names denotes the number of component functions of the hybrid/composition function, as defined in the official technical reports [43].

Table 3.

Description of the CEC 2022 test suite [44].

Function Type No. Name [lb, ub] fmin
Unimodal Function F1 Shifted and full rotated Zakharov function [−100, 100] 300
Basic Functions F2 Shifted and full rotated Rosenbrock’s function [−100, 100] 400
F3 Shifted and full rotated expanded Schaffer’s F6 function [−100, 100] 600
F4 Shifted and full rotated non-continuous Rastrigin’s function [−100, 100] 800
F5 Shifted and full rotated Levy function [−100, 100] 900
Hybrid Functions F6 Hybrid function 1 (N = 3) [−100, 100] 1800
F7 Hybrid function 2 (N = 6) [−100, 100] 2000
F8 Hybrid function 3 (N = 5) [−100, 100] 2200
Composition Functions F9 Composition function 1 (N = 5) [−100, 100] 2300
F10 Composition function 2 (N = 4) [−100, 100] 2400
F11 Composition function 3 (N = 5) [−100, 100] 2600
F12 Composition function 4 (N = 6) [−100, 100] 2700

Note: N in the function names denotes the number of component functions of the hybrid/composition function, as defined in the official technical reports [44].

To comprehensively evaluate the proposed MSCPO from multiple perspectives, a diverse set of algorithms spanning different eras and paradigms was selected for comparison:

  • Classical evolutionary algorithms: Genetic Algorithm (GA) [26] and Differential Evolution (DE) [11].

  • Swarm intelligence algorithms: Whale Optimization Algorithm (WOA) [10] and original Crested Porcupine Optimizer (CPO) [8].

  • State-of-the-art high-performance algorithms: Harris Hawks Optimization (HHO) [27], Dung Beetle Optimizer (DBO) [28], Gekko Japonicus Algorithm (GJA) [29], Sparrow Search Algorithm (SSA) [30], and Beaver Behavior Optimizer (BBO) [31].

  • High-performance CEC competition algorithms: L-SHADE [32] and its variant LSHADE-SPACMA [33]. The former is the winner of the IEEE CEC 2014 international optimization competition, and the latter ranked among the top four of the CEC 2017 single-objective competition.

The complete parameter settings of all compared algorithms, including the proposed MSCPO, are listed in Table A1 (Appendix A). All experiments were conducted on the same computing platform, comprising a 2.60 GHz Intel i7-10750H CPU, 16 GB of RAM, and the Windows 10 operating system, and all algorithms were implemented in MATLAB R2023b.

4.2. Ablation Study Results and Analysis

To validate the effectiveness of each enhancement strategy and their interactions, we conducted a full-factorial ablation study covering all 24=16 combinations of the four strategies (KCOL, APO-DME, ADDP, and PDAP) on the 29 benchmark functions from the CEC 2017 test suite (D = 30) under 30 independent runs. Variants are named by listing the included strategies after “CPO_” (e.g., CPO_KCOL_APODME includes KCOL and APO-DME only); three-strategy variants are equivalently denoted MSCPO_woX, indicating MSCPO without strategy X. Table 4 lists the composition of all 16 variants. As the raw fitness values of different functions differ by orders of magnitude, the comparison relies on scale-invariant quantities only: the Friedman mean rank, the number of best/worst results, and the Wilcoxon signed-rank test against MSCPO.

Table 4.

Compositions of CPO, MSCPO, and the 14 intermediate variants.

Algorithms KCOL APO-DME ADDP PDAP
CPO No No No No
CPO_KCOL Yes No No No
CPO_APODME No Yes No No
CPO_ADDP No No Yes No
CPO_PDAP No No No Yes
CPO_KCOL_APODME Yes Yes No No
CPO_KCOL_ADDP Yes No Yes No
CPO_KCOL_PDAP Yes No No Yes
CPO_APODME_ADDP No Yes Yes No
CPO_APODME_PDAP No Yes No Yes
CPO_ADDP_PDAP No No Yes Yes
MSCPO_woKCOL No Yes Yes Yes
MSCPO_woAPODME Yes No Yes Yes
MSCPO_woADDP Yes Yes No Yes
MSCPO_woPDAP Yes Yes Yes No
MSCPO Yes Yes Yes Yes

All 16 variants were compared under identical settings. The single-strategy tier is summarized in Table 5, and the complete factorial comparison is reported in Table 6. The complete per-function results of all 16 variants are available from the corresponding author upon reasonable request. In Table 5 and Table 6, Mean Rank is the average Friedman rank across the 29 test functions for each variant, where a lower value indicates better overall performance; No. Best and No. Worst give the number of functions on which a variant achieves the best and worst mean fitness values, respectively. The Friedman test statistic is reported to assess whether significant performance differences exist among the variants (p < 0.05 indicates statistical significance). To further assess pairwise comparisons, the Nemenyi post hoc test with a Critical Difference (CD) threshold [34] is applied; the CD is computed using Equation (28):

CD=qαkk+1/6N (28)

where qα is the critical value from the Studentized range distribution, k is the number of algorithms, and N is the number of test functions. In this study, N=29, with k=6 (q0.05=2.850, CD = 1.40) for the single-strategy tier in Table 5 and k=16 (q0.05=3.426, CD = 4.28) for the full comparison in Table 6. The corresponding CD diagram is shown in Figure 2.

Table 5.

Ablation study results of the single-strategy tier on CEC 2017 at D = 30.

Algorithms Mean Rank No. Best No. Worst
MSCPO 1.3793 22 0
CPO_ADDP 2.8621 1 2
CPO_APODME 2.9655 3 2
CPO_PDAP 4.1034 2 5
CPO 4.8276 1 9
CPO_KCOL 4.8621 0 11

Friedman test: χF2 = 76.00, p = 5.77 × 10−15 (<0.001), indicating significant performance differences among the six variants of the single-strategy tier. CD (Nemenyi, k=6, N=29, q0.05=2.850) = 1.40.

Table 6.

Full-factorial ablation of all strategy combinations on CEC 2017 at D = 30.

Tier Variant Mean Rank No. Best No. Worst p-Value vs. MSCPO Significant
Full MSCPO 3.3448 8 0 - -
Three-strategy MSCPO_woPDAP 3.9655 8 1 6.81 × 10−1 No
Three-strategy MSCPO_woKCOL 4.0690 6 0 1.41 × 10−1 No
Pairwise CPO_APODME_ADDP 5.6552 1 0 1.48 × 10−3 Yes
Pairwise CPO_APODME_PDAP 7.1034 2 0 6.44 × 10−3 Yes
Three-strategy MSCPO_woAPODME 7.5517 0 0 3.00 × 10−5 Yes
Pairwise CPO_ADDP_PDAP 7.7931 0 0 3.31 × 10−4 Yes
Three-strategy MSCPO_woADDP 8.0690 2 0 1.27 × 10−3 Yes
Pairwise CPO_KCOL_ADDP 8.4483 0 0 8.41 × 10−6 Yes
Single- strategy CPO_ADDP 9.0345 0 1 8.31 × 10−5 Yes
Single- strategy CPO_APODME 9.2069 0 0 3.60 × 10−4 Yes
Pairwise CPO_KCOL_APODME 9.4138 0 1 1.09 × 10−4 Yes
Single- strategy CPO_PDAP 12.2069 0 3 1.54 × 10−4 Yes
Pairwise CPO_KCOL_PDAP 13.0345 1 3 1.86 × 10−5 Yes
Baseline CPO 13.4828 1 9 1.14 × 10−5 Yes
Single- strategy CPO_KCOL 13.6207 0 11 1.14 × 10−5 Yes

Friedman test: χF2 = 211.58, p = 9.32 × 10−37 (<0.001). CD (Nemenyi, k=16, N=29, q0.05=3.426) = 4.28. p-values: Wilcoxon signed-rank test against MSCPO.

Figure 2.

Figure 2

Critical difference diagram for the full factorial ablation (k=16 variants, N=29 CEC 2017 functions at D = 30). Variants are ordered by Friedman mean rank; low rank (left) indicates better performance. Blue horizontal bars connect variants that do not differ significantly at α = 0.05 according to the Nemenyi post hoc test (q0.05=3.426, CD = 4.28).

Table 5 summarizes the single-strategy tier. Consistent with the design intent, ADDP (mean rank 2.8621) and APO-DME (mean rank 2.9655) provide the largest individual contributions, and both differ significantly from the original CPO (4.8276), whereas CPO_PDAP (4.1034) and CPO_KCOL (4.8621) alone do not. MSCPO achieves the best mean rank (1.3793), obtains the best result on 22 of the 29 functions, and is never the worst on any function; its rank gap to every other variant in this tier exceeds the CD of 1.40, i.e., MSCPO differs significantly from all five variants.

Table 6 reports the complete factorial comparison. Three observations emerge. First, the complete MSCPO attains the best mean rank (3.3448), achieves the best result on 8 of the 29 functions, and is never the worst on any function. Second, the leave-one-out tier shows that removing any single strategy degrades the mean rank (3.9655, 4.0690, 7.5517, and 8.0690 for MSCPO_woPDAP, MSCPO_woKCOL, MSCPO_woAPODME, and MSCPO_woADDP, respectively); the degradation is statistically significant when APO-DME or ADDP is removed (p = 3.00 × 10−5 and p = 1.27 × 10−3, Wilcoxon signed-rank test), but not when KCOL or PDAP is removed (p = 1.41 × 10−1 and p = 6.817 × 10−1). Third, pairwise combinations of the exploration-phase strategies markedly outperform their constituent single strategies; CPO_APODME_ADDP attains the best pairwise rank (5.6552), and MSCPO significantly outperforms all single-strategy and pairwise variants (p < 0.01). It is worth noting that KCOL alone does not significantly improve over CPO on this suite (mean ranks 13.6207 versus 13.4828, within the same CD group), which is expected for an initialization strategy whose direct effect is diluted over 1000 iterations; its contribution emerges in combination, removing KCOL from the complete MSCPO degrades the mean rank from 3.3448 to 4.0690, and its greedy selection never degrades the initial population quality.

The factorial structure of Table 6 further indicates that the four strategies combine without destructive interactions: adding APO-DME, ADDP, or PDAP to any combination improves its mean rank (in all 24 nested comparisons involving these three strategies), whereas the effect of adding KCOL is neutral on average, consistent with its role as an initialization operator whose benefit materializes in the complete configuration, as evidenced by the leave-one-out analysis above. We therefore describe the four strategies as providing complementary, phase-targeted contributions, whose complete combination yields the best overall performance.

In summary, the full-factorial ablation establishes that the four strategies provide complementary, phase-targeted contributions, and that the complete four-strategy configuration is required to achieve the best overall performance.

4.3. Numerical Experiments on CEC 2017

In this section, MSCPO was compared against 11 optimization algorithms on the CEC 2017 test suite across four dimensions (D = 10, 30, 50, and 100). Detailed numerical results (mean and standard deviation for each function) are provided in Table A2, Table A3, Table A4 and Table A5 of Appendix A.

4.3.1. CEC 2017 Wilcoxon Signed-Rank Test

The Wilcoxon signed-rank test was used to compare MSCPO against each competitor on a per-function basis. Detailed results are provided in Table A6, Table A7, Table A8 and Table A9 of Appendix A. Table 7 summarizes the results, comparing MSCPO against CPO, GA, DE, WOA, HHO, DBO, GJA, SSA, BBO, L-SHADE, and LSHADE-SPACMA. The results are marked with ‘+’, ‘−’, and ‘=’, indicating whether MSCPO performed better than, worse than, or comparably to the corresponding competitors, respectively.

Table 7.

Wilcoxon signed-rank test results for different competitor algorithms (CEC 2017).

MSCPO vs. D = 10 D = 30 D = 50 D = 100 Total 1
+ − = + − = + − = + − = + − =
CPO 20 1 8 20 0 9 23 0 6 24 0 5 87 1 28
GA 29 0 0 29 0 0 29 0 0 29 0 0 116 0 0
DE 23 4 2 26 0 3 29 0 0 29 0 0 107 4 5
WOA 29 0 0 27 0 2 27 0 2 27 2 0 110 2 4
HHO 29 0 0 27 2 0 27 2 0 26 3 0 109 7 0
DBO 29 0 0 29 0 0 29 0 0 28 0 1 115 0 1
GJA 27 1 1 17 7 5 16 10 3 10 13 6 70 31 15
SSA 28 0 1 26 2 1 23 2 4 18 7 4 95 11 10
BBO 28 0 1 19 5 5 12 9 8 9 18 2 68 32 16
L-SHADE 19 3 7 23 4 2 19 4 6 12 9 8 73 20 23
LSHADE-SPACMA 14 5 10 12 9 8 9 8 12 9 13 7 44 35 37
Total 2 275 14 30 255 29 35 243 35 41 221 65 33 994 143 139

The detailed analysis is as follows:

(1) At D = 10, MSCPO outperformed (and was inferior to) CPO, GA, DE, WOA, HHO, DBO, GJA, SSA, BBO, L-SHADE, and LSHADE-SPACMA on 20 (1), 29 (0), 23 (4), 29 (0), 29 (0), 29 (0), 27 (1), 28 (0), 28 (0), 19 (3), and 14 (5) functions, respectively, with 8, 0, 2, 0, 0, 0, 1, 1, 1, 7, and 10 draws. Overall, MSCPO won 275 and lost 14 of these pairwise comparisons against all 11 competitors. It dominated GA, WOA, HHO, and DBO (29 wins, 0 losses each), as well as SSA and BBO (28 wins, 0 losses each). The strongest challenges came from LSHADE-SPACMA (14 wins, 5 losses, 10 draws) and L-SHADE (19 wins, 3 losses, 7 draws), whose success-history-based parameter adaptation provides advantages in smooth search landscapes. DE presented a moderate challenge (23 wins, 4 losses), while CPO was clearly surpassed (20 wins, 1 loss). This dominance at D = 10 confirms that the four phase-distributed strategies provide decisive advantages in low-dimensional spaces.

(2) At D = 30, MSCPO outperformed (and was inferior to) CPO, GA, DE, WOA, HHO, DBO, GJA, SSA, BBO, L-SHADE, and LSHADE-SPACMA on 20 (0), 29 (0), 26 (0), 27 (0), 27 (2), 29 (0), 17 (7), 26 (2), 19 (5), 23 (4), and 12 (9) functions, respectively, with 9, 0, 3, 2, 0, 0, 5, 1, 5, 2, and 8 draws. Overall, MSCPO won 255 and lost 29 of these comparisons. Its advantage over CPO strengthened (20 wins, 0 losses vs. 20 wins, 1 loss at D = 10), and it dominated DE (26 wins, 0 losses vs. 23 wins, 4 losses at D = 10). This suggests that APO-DME’s dual-modal exploration and ADDP’s adaptive differential perturbation become increasingly effective as the multimodal complexity increases. However, competitive pressure escalated: LSHADE-SPACMA surpassed MSCPO on 9 functions (up from 5 at D = 10), and GJA became more competitive, with 7 wins (up from 1). BBO also gained ground (5 wins, up from 0). Total losses increased from 14 to 29, reflecting the growing challenge of the expanded search space.

(3) At D = 50, MSCPO outperformed (and was inferior to) CPO, GA, DE, WOA, HHO, DBO, GJA, SSA, BBO, L-SHADE, and LSHADE-SPACMA on 23 (0), 29 (0), 29 (0), 27 (0), 27 (2), 29 (0), 16 (10), 23 (2), 12 (9), 19 (4), and 9 (8) functions, respectively, with 6, 0, 0, 2, 0, 0, 3, 4, 8, 6, and 12 draws. Overall, MSCPO won 243 and lost 35 of these comparisons. It dominated CPO (23 wins, 0 losses), and GA, DE, and DBO (29 wins, 0 losses each). GJA surpassed MSCPO on 10 functions (up from 7 at D = 30), BBO achieved 9 wins (up from 5 at D = 30), and LSHADE-SPACMA reached 8 wins (with more draws). Total losses increased to 35 from 29 at D = 30. The adaptive mechanisms in ADDP and PDAP remained effective at this dimensionality, as evidenced by MSCPO’s sustained dominance over CPO and the suppression of DE.

(4) At D = 100, MSCPO outperformed (and was inferior to) CPO, GA, DE, WOA, HHO, DBO, GJA, SSA, BBO, L-SHADE, and LSHADE-SPACMA on 24 (0), 29 (0), 29 (0), 27 (2), 26 (3), 28 (0), 10 (13), 18 (7), 9 (18), 12 (9), and 9 (13) functions, respectively, with 5, 0, 0, 0, 0, 1, 6, 4, 2, 8, and 7 draws. Overall, MSCPO won 221 and lost 65 of these comparisons. It still dominated CPO, GA, DE, WOA, HHO, and DBO (all with 24+ wins and 0–3 losses), but faced significant challenges from BBO (9 wins, 18 losses), GJA (10 wins, 13 losses), and LSHADE-SPACMA (9 wins, 13 losses). This is the first dimension at which LSHADE-SPACMA achieved more wins than losses against MSCPO. The total losses of 65 nearly double relative to D = 50 (35) and increased more than four-fold relative to D = 10 (14). This escalation reflects two factors: first, as the search space volume expands, the depth of exploration achievable by any algorithm is limited; second, the population-diversity-preserving strategies in BBO and GJA, and the success-history-based adaptation in LSHADE-SPACMA, provide advantages under extremely budget-constrained high-dimensional optimization that the MSCPO design does not fully match.

As shown by the “Total 1” columns of Table 7, MSCPO won more comparisons than it lost against all 11 competitors across the four dimensions. It dominated GA (116 wins, 0 losses), DBO (115 wins, 0 losses), WOA (110 wins, 2 losses), HHO (109 wins, 7 losses), and DE (107 wins, 4 losses). It also led CPO (87 wins, 1 loss) and SSA (95 wins, 11 losses). Against L-SHADE (73 wins, 20 losses), the advantage narrowed at higher dimensions. The most competitive rivals were GJA (70 wins, 31 losses) and BBO (68 wins, 32 losses), against which MSCPO’s advantage was marginal and reversed at D = 100. Against LSHADE-SPACMA (44 wins, 35 losses), the relationship was near-balanced, as LSHADE-SPACMA’s CMA-ES covariance matrix learning provides complementary strengths to MSCPO’s phase-distributed design. The “Total 2” row of Table 7 reveals a clear and consistent dimension-dependent performance trend: MSCPO’s win count decreases monotonically from 275 at D = 10 to 255 at D = 30, 243 at D = 50, and 221 at D = 100, while the losses increase from 14 to 29, 35, and 65. This trend is visually confirmed by Figure 3. Overall, MSCPO won 994, lost 143, and drew 139 of the 1276 pairwise comparisons, demonstrating robustness across the full dimensionality range on CEC 2017, although its advantage diminished and partially reversed against the strongest competitors at D = 100.

Figure 3.

Figure 3

Wilcoxon signed-rank test outcomes (α = 0.05) of MSCPO against each competitor on the 29 CEC 2017 functions (D = 10, 30, 50, 100; 30 runs per function). “+”/“−”: number of functions on which MSCPO is significantly better/worse; “=”: p≥0.05.

4.3.2. CEC 2017 Friedman Mean Rank Test

In this section, we used the Friedman mean rank test, a robust non-parametric method, to statistically analyze the performance of the competing algorithms on the CEC 2017 test suite. Table 8 presents the results of the compared algorithms over 30 runs. In particular, the last two columns of Table 8 show that MSCPO achieved the best overall mean rank averaged over the four dimensions, ranking first at D = 10, 30, and 50. LSHADE-SPACMA and L-SHADE followed closely behind. Additionally, Figure 4 visualizes these rankings, illustrating the overall superiority of MSCPO over its competitors. The detailed analysis is as follows:

Table 8.

Friedman mean rank test results for CEC 2017 (α=0.05).

Algorithm D = 10 D = 30 D = 50 D = 100 Mean Rank
MSCPO 1.72 2.41 2.76 3.66 2.64 1
CPO 3.03 4.14 5.14 5.66 4.49 5
GA 8.31 6.76 6.31 5.38 6.69 7
DE 9.72 8.69 8.24 7.86 8.63 9
WOA 10.69 10.97 11.59 11.79 11.26 12
HHO 4.97 7.14 7.86 8.45 7.10 8
DBO 9.38 10.55 10.72 10.59 10.31 10
GJA 6.38 4.69 3.86 3.10 4.51 6
SSA 5.76 4.66 4.03 3.48 4.48 4
BBO 11.00 10.72 10.17 9.72 10.41 11
L-SHADE 3.83 4.72 4.38 4.55 4.37 3
LSHADE-SPACMA 3.21 2.55 2.93 3.76 3.11 2
Friedman p-value 8.17 × 10−49 5.41 × 10−45 1.70 × 10−45 6.04 × 10−43 N/A N/A

Bold values indicate the best result. N/A: not applicable (the Friedman p-value is computed per dimension and does not apply to the averaged Mean and Rank columns).

Figure 4.

Figure 4

Friedman mean ranks (lower is better) on the 29 CEC 2017 functions (D = 10, 30, 50, 100; 30 runs per function). Ranks are computed per function and averaged over all functions; “Mean” denotes the average over the four dimensions; each dimension is an independent experiment.

At D = 10, MSCPO ranked first (mean rank 1.72), outperforming all 11 competitors. The gap to the second-ranked CPO (mean rank 3.03) was 1.31. At D = 30, MSCPO again ranked first (mean rank 2.41), with LSHADE-SPACMA following closely (mean rank 2.55, gap = 0.14), which made this the most competitive dimension for the top two. At D = 50, MSCPO ranked first (mean rank 2.76), followed by LSHADE-SPACMA (mean rank 2.93) and GJA (mean rank 3.86). At D = 100, MSCPO ranked third (mean rank 3.66), behind GJA (3.10) and SSA (3.48) but ahead of the other 9 competitors. This is the first dimension at which MSCPO did not rank first. The Friedman p-values for all four dimensions are less than 0.05, indicating statistically significant differences among the 12 algorithms at every dimension of CEC 2017.

As shown in Table 8 and Figure 4, MSCPO achieved the best overall mean rank of 2.64, followed by LSHADE-SPACMA (3.11) and L-SHADE (4.37). The original CPO achieved an overall mean rank of 4.49 (5th place), demonstrating that the proposed improvements yield substantial performance gains. Although MSCPO was surpassed by GJA and SSA at D = 100, its strong performance at D = 10, 30, and 50 gave it the best overall ranking on CEC 2017.

4.4. Numerical Experiments on CEC 2022

The detailed experimental results on CEC 2022 are reported in Table A10 and Table A11 of Appendix A.

4.4.1. CEC 2022 Wilcoxon Signed-Rank Test

In this section, we applied the non-parametric Wilcoxon signed-rank test to statistically analyze the CEC 2022 results. Detailed experimental results of the Wilcoxon signed-rank test for CEC 2022 are reported in Table A12 and Table A13 of Appendix A. Table 9 compares MSCPO against each competitor on the 12 CEC 2022 functions at D = 10 and D = 20.

Table 9.

Wilcoxon signed-rank test results for different competitor algorithms (CEC 2022).

MSCPO vs. D = 10 D = 20 Total 1
+ − = + − = + − =
CPO 6 2 4 7 0 5 13 2 9
GA 12 0 0 12 0 0 24 0 0
DE 7 3 2 9 2 1 16 5 3
WOA 12 0 0 12 0 0 24 0 0
HHO 11 0 1 12 0 0 23 0 1
DBO 11 0 1 12 0 0 23 0 1
GJA 11 0 1 9 1 2 20 1 3
SSA 11 0 1 11 0 1 22 0 2
BBO 10 1 1 8 1 3 18 2 4
L-SHADE 3 2 7 5 4 3 8 6 10
LSHADE-SPACMA 7 1 4 3 5 4 10 6 8
Total 2 101 9 22 100 13 19 201 22 41

(1) At D = 10, MSCPO outperformed (and was inferior to) CPO, GA, DE, WOA, HHO, DBO, GJA, SSA, BBO, L-SHADE, and LSHADE-SPACMA by 6 (2), 12 (0), 7 (3), 12 (0), 11 (0), 11 (0), 11 (0), 11 (0), 10 (1), 3 (2), and 7 (1) functions, respectively, with 4, 0, 2, 0, 1, 1, 1, 1, 1, 7, and 4 draws. Overall, MSCPO won 101 and lost 9 of these pairwise comparisons against all 11 competitors. MSCPO demonstrated complete dominance over GA and WOA (12 wins, 0 losses each), as well as HHO and DBO (11 wins, 0 losses each). The strongest challenges came from L-SHADE (3 wins, 2 losses, 7 draws) and DE (7 wins, 3 losses, 2 draws), whereas LSHADE-SPACMA posed a moderate challenge (7 wins, 1 loss, 4 draws).

(2) At D = 20, MSCPO outperformed (and was inferior to) CPO, GA, DE, WOA, HHO, DBO, GJA, SSA, BBO, L-SHADE, and LSHADE-SPACMA by 7 (0), 12 (0), 9 (2), 12 (0), 12 (0), 12 (0), 9 (1), 11 (0), 8 (1), 5 (4), and 3 (5) functions, respectively, with 5, 0, 1, 0, 0, 0, 2, 1, 3, 3, and 4 draws. Overall, MSCPO won 100 and lost 13 of these comparisons. It was outperformed by LSHADE-SPACMA (3 wins, 5 losses, 4 draws). The reversal against LSHADE-SPACMA at D = 20 reflects the increased complexity of the CEC 2022 functions at higher dimensions, where LSHADE-SPACMA’s covariance matrix adaptation is more effective. MSCPO still dominated GA, WOA, HHO, and DBO (12 wins, 0 losses each), and its advantage over CPO strengthened (7 wins, 0 losses vs. 6 wins, 2 losses at D = 10). L-SHADE narrowed the gap (5 wins, 4 losses, 3 draws vs. 3 wins, 2 losses, 7 draws at D = 10), and BBO became more competitive (8 wins, 1 loss, 3 draws vs. 10 wins, 1 loss, 1 draw at D = 10).

As shown by the “Total 1” columns of Table 9, MSCPO won more comparisons than it lost against all 11 competitors across both dimensions. It achieved overwhelming superiority over GA (24 wins, 0 losses), WOA (24 wins, 0 losses), HHO (23 wins, 0 losses), DBO (23 wins, 0 losses), and SSA (22 wins, 0 losses). It also led GJA (20 wins, 1 loss), BBO (18 wins, 2 losses), and DE (16 wins, 5 losses). Against CPO (13 wins, 2 losses), the advantage was smaller than on CEC 2017, reflecting the increased challenge of the CEC 2022 suite. The most competitive rivals were L-SHADE (8 wins, 6 losses) and LSHADE-SPACMA (10 wins, 6 losses); MSCPO’s advantage over them was marginal and even reversed at D = 20 against LSHADE-SPACMA.

The “Total 2” row of Table 9 reveals that MSCPO’s win count remained stable across all dimensions (101 at D = 10 vs. 100 at D = 20), whereas the losses increased from 9 to 13, indicating rising competitive pressure as dimensionality increases. This trend is visually confirmed by Figure 5. Overall, the proposed MSCPO won 201, lost 22, and drew 41 of the 264 pairwise comparisons. This demonstrates the robustness and effectiveness of MSCPO on CEC 2022, although LSHADE-SPACMA proved to be a strong competitor at D = 20.

Figure 5.

Figure 5

Wilcoxon signed-rank test outcomes (α = 0.05) of MSCPO against each competitor on the 12 CEC 2022 functions (D = 10, 20; 30 runs per function). “+”/“−”: number of functions on which MSCPO is significantly better/worse; “=”; p≥0.05.

4.4.2. CEC 2022 Friedman Mean Rank Test

In this section, we applied the Friedman mean rank test to evaluate the results on the CEC 2022 test suite. Table 10 presents the Friedman mean rank test results at D = 10 and D = 20. The Friedman p-values are 6.94 × 10−15 (D = 10) and 5.88 × 10−15 (D = 20), both well below α = 0.05, confirming statistically significant performance differences among the 12 algorithms. Figure 6 visualizes the ranking comparison between MSCPO and its competitors.

Table 10.

Friedman mean rank test results for CEC 2022 (α = 0.05).

Algorithm D = 10 D = 20 Mean Rank
MSCPO 2.08 2.67 2.38 1
CPO 3.00 4.42 3.71 4
GA 8.17 7.33 7.75 8
DE 8.75 9.00 8.88 9
WOA 11.25 11.08 11.17 12
HHO 5.00 5.17 5.08 5
DBO 9.00 10.17 9.58 10
GJA 5.58 5.42 5.50 6
SSA 6.58 6.17 6.38 7
BBO 10.50 10.25 10.38 11
L-SHADE 3.75 3.50 3.63 3
LSHADE-SPACMA 4.33 2.83 3.58 2
Friedman p-value 6.94 × 10−15 5.88 × 10−15 N/A N/A

Bold values indicate the best result. N/A: not applicable (the Friedman p-value is computed per dimension and does not apply to the averaged Mean and Rank columns).

Figure 6.

Figure 6

Friedman mean ranks (lower is better) on the 12 CEC 2022 functions (D = 10, 20; 30 runs per function). Ranks are computed per function and averaged over all functions; “Mean” denotes the average over the two dimensions; each dimension is an independent experiment.

At D = 10, MSCPO ranked first (mean rank 2.08), outperforming all 11 competitors. CPO ranked second (mean rank 3.00), followed by L-SHADE (mean rank 3.75) and LSHADE-SPACMA (mean rank 4.33), indicating that MSCPO’s strategies provide decisive advantages on the compact yet challenging CEC 2022 functions at low dimensionality. At D = 20, MSCPO again ranked first (mean rank 2.67), surpassing the other 11 competitors. LSHADE-SPACMA improved substantially to second place (mean rank 2.83, gap = 0.16), making this the most competitive dimension between the top two algorithms. L-SHADE held third place (mean rank 3.50), while CPO dropped to fourth (mean rank 4.42). The close competition between MSCPO and LSHADE-SPACMA at D = 20 reflects the increased complexity of the shifted and rotated functions in CEC 2022, on which LSHADE-SPACMA’s semi-parameter adaptation is more effective.

Combining the results of Table 10 and Figure 6, we find that MSCPO achieved the best overall mean rank of 2.375, followed by LSHADE-SPACMA (mean rank 3.583) and L-SHADE (mean rank 3.625). The original CPO achieved an overall mean rank of 3.708 (4th place). MSCPO maintained first place on CEC 2022, with its largest advantage at D = 10 and a narrower but preserved advantage at D = 20.

5. Application in Engineering Optimization Problems

In this section, MSCPO was evaluated on three engineering design problems: the step-cone pulley design problem [35,45], the hydrostatic thrust bearing design problem [35,46], and the robotic gripper design [35,47]. For these constrained problems, a larger population (N=100) with a smaller iteration budget (Tmax=500) was adopted, since each evaluation involves multiple nonlinear constraint terms and is therefore more expensive than a benchmark-function evaluation. MSCPO and all competitors were each run independently 30 times under the identical configuration, so the comparison remains internally fair.

5.1. Step-Cone Pulley Design

The step-cone pulley design problem is a classical benchmark in engineering optimization. It aims to minimize the mass of a four-stage pulley assembly. The problem involves five design variables: the diameters of the four steps and the common pulley width. It is subject to 11 nonlinear constraints, including the requirement of transmitting 0.75 horsepower. The mechanical structure of the step-cone pulley system is depicted in Figure 7.

Figure 7.

Figure 7

Mechanical structure of the step-cone pulley system.

The mathematical model is formulated as follows:

Minimize:

fx=ρωd121+N1N2+d221+N2N2+d321+N3N2+d421+N4N2 (29)

Subject to:

h1x=C1−C2=0, h2x=C1−C3=0, h3x=C1−C4=0, g1,2,3,4x=Ri≥2, g5,6,7,8x=Pi≥0.75 × 745.6998, where Ci indicates the length of the belt to obtain speed Ni and is given by

Ci=πdi21+NiN+NiN−124a+2a, i=1,2,3,4.

Ri is the tension ratio and is given by

Ri=expμπ−2sin−1NiN−1di2a, i=1,2,3,4.

Pi is the power transmitted at each step

Pi=stw1−exp−μπ−2sin−1NiN−1di2aπdiNi60, i=1,2,3,4.
ρ=7200 kg/m3, a=3 m, μ=0.35, s=1.75 MPa, t=8 mm.

The proposed MSCPO algorithm was applied to the step-cone pulley design problem and compared with CPO, WOA, HHO, GA, DE, DBO, BBO, GJA, SSA, L-SHADE, and LSHADE-SPACMA. The optimal parameters and statistical results obtained by the different algorithms are presented in Table 11 and Table 12. The average convergence curve and box plot of the step-cone pulley design are given in Figure 8 and Figure 9.

Table 11.

Best solutions for the step-cone pulley design problem.

Algorithm Optimal Values for Variables Optimal Cost
d1 d2 d3 d4 w
MSCPO 38.68 53.23 70.97 85.09 89.64 16.16
CPO 39.99 55.03 73.37 87.96 86.97 18.41
GA 40.11 55.20 73.59 88.24 87.50 44.32
DE 40.92 56.30 75.07 90.00 84.49 2.10 × 103
WOA 39.73 54.67 72.88 87.38 87.38 16.89
HHO 39.67 54.58 72.77 87.25 87.25 16.63
DBO 40.91 56.31 75.05 90.00 90.00 2.70 × 106
GJA 39.99 55.03 73.36 87.96 90.00 3.27 × 105
SSA 38.63 53.16 70.88 84.98 89.49 16.18
BBO 38.56 53.06 70.75 84.82 89.67 16.26
L-SHADE 38.74 53.30 71.06 85.20 89.32 16.26
LSHADE-SPACMA 38.41 52.86 70.47 84.50 90.00 16.09

Bold values indicate the best result.

Table 12.

Statistical results for the step-cone pulley design problem.

Algorithm Min Worst Std Mean Median
MSCPO 16.16 16.68 8.89 × 10−2 16.47 16.49
CPO 18.41 1.70 × 102 3.20 × 101 5.63 × 101 5.08 × 101
GA 44.32 9.46 × 108 1.88 × 108 6.26 × 107 1.48 × 105
DE 2.10 × 103 4.35 × 106 8.19 × 105 4.23 × 105 1.56 × 105
WOA 16.89 2.23 × 1011 4.09 × 1010 9.39 × 109 26.78
HHO 16.63 2.11 × 107 4.04 × 106 9.55 × 105 17.77
DBO 2.70 × 106 7.57 × 109 2.06 × 109 1.11 × 109 7.80 × 107
GJA 3.27 × 105 8.03 × 106 2.00 × 106 2.69 × 106 2.54 × 106
SSA 16.18 16.89 2.02 × 10−1 16.58 16.60
BBO 16.26 17.51 3.37 × 10−1 16.82 16.83
L-SHADE 16.26 16.92 1.69 × 10−1 16.62 16.64
LSHADE-SPACMA 16.09 16.09 2.40 × 10−7 16.09 16.09

Bold values indicate the best result.

Figure 8.

Figure 8

Average convergence curve for the step-cone pulley design problem.

Figure 9.

Figure 9

Box plot for the step-cone pulley design problem.

As presented in Table 11, LSHADE-SPACMA obtained the lowest optimal cost (16.09), followed closely by MSCPO (16.16); the gap between the two is only about 0.4%, and both are clearly better than all other competitors. MSCPO also markedly improves over the original CPO (18.41), confirming its capability in identifying near-global optima for this constrained problem. The convergence behavior illustrated in Figure 8 reveals that MSCPO converges rapidly and stabilizes at the optimal value with negligible fluctuations, indicating an effective balance between global exploration and local exploitation. In contrast, DBO, WOA, GA, GJA, HHO, and DE show slower convergence or premature stagnation at higher objective values.

The statistical metrics in Table 12 and the box plot in Figure 9 provide insights into algorithmic robustness. LSHADE-SPACMA is almost perfectly stable on this problem, reaching 16.09 in every run (Std = 2.40 × 10−7). MSCPO attains the second-best mean (16.47) and the second-smallest standard deviation (0.09), with a worst-case value of 16.68, ahead of SSA (mean 16.58) and L-SHADE (mean 16.62). This consistency across multiple independent runs highlights its reliability and low sensitivity to initial conditions. In contrast, WOA, DBO, and GA exhibit large variance and poor worst-case results, indicating instability and a higher risk of convergence failure. As shown in Table 11, the design variables (d1−d4,w) obtained by MSCPO fall within reasonable engineering limits. Crucially, this parameter set satisfies all 11 nonlinear constraints, thereby confirming its feasibility. These results highlight the practical utility of the method in generating viable engineering solutions.

In summary, on the step-cone pulley design problem, MSCPO ranks second overall, behind only LSHADE-SPACMA, and first among all nature-inspired competitors, clearly improving over the original CPO in both accuracy and robustness. WOA, GA, DE, DBO, and GJA yield inferior or highly unstable results, underscoring their inadequacy for handling such complex and constrained problems. These findings validate the efficacy of the improved strategies in MSCPO.

5.2. Hydrostatic Thrust Bearing Design

The hydrostatic thrust bearing design problem aims to minimize the total power loss during operation. It has four design variables: the bearing step radius R, the recess radius R0, the oil viscosity μ, and the lubricant flow rate Q. The system must satisfy seven nonlinear constraints related to inlet oil pressure, load capacity, oil film thickness, and other critical performance criteria. The configuration of the bearing is illustrated in Figure 10. The mathematical model is formulated as follows.

Figure 10.

Figure 10

Schematic of the hydrostatic thrust bearing design.

Minimize:

fx=QP00.7+Ef (30)

Subject to:

g1x=W−WS≥0, g2x=Pmax−P0≥0, g3x=ΔTmax−ΔT≥0, g4x=h−hmin≥0,g5x=R−R0≥0, g6x=0.001−γgP0Q2πRh≥0, g7x=5000−WπR2−R02≥0,

where

W=πP02R2−R02lnRR0, P0=6μQπh3lnRR0, Ef=9336QγCΔT, ΔT=210P−560,P=log10log108.122×106μ+0.8−c1n, h=2πN6022πμEfR4−R044

with

γ=0.0307, C=0.5, n=−3.55, c1=10.04, WS=10,100, Pmax=1000, ΔTmax=50, hmin=0.001,g=386.4, N=750. 1≤R, R0, Q≤16, 10−6≤μ≤16×10−6.

Table 13 and Table 14 report the optimal designs and the corresponding statistical results, and Figure 11 and Figure 12 show the convergence curves and box plots.

Table 13.

Best solutions for the hydrostatic thrust bearing design problem.

Algorithm Optimal Values for Variables Optimal Cost
R R0 μ Q
MSCPO 5.97 5.40 5.40 × 10−6 2.31 1632.34
CPO 6.17 5.60 6.63 × 10−6 3.76 1879.01
GA 7.75 7.01 5.73 × 10−6 4.97 2988.75
DE 6.87 6.10 5.88 × 10−6 4.11 2454.06
WOA 6.07 5.50 5.57 × 10−6 2.51 1687.66
HHO 7.43 6.98 7.50 × 10−6 6.91 2385.81
DBO 6.74 6.13 5.97 × 10−6 3.81 2265.77
GJA 6.20 5.65 7.43 × 10−6 5.04 1961.74
SSA 6.09 5.48 6.92 × 10−6 4.18 1926.34
BBO 6.05 5.49 5.69 × 10−6 2.59 1684.29
L-SHADE 5.97 5.39 5.44 × 10−6 2.34 1637.26
LSHADE-SPACMA 5.96 5.39 5.51 × 10−6 2.37 1633.25

Bold values indicate the best result.

Table 14.

Statistical results for the hydrostatic thrust bearing design problem.

Algorithm Min Worst Std Mean Median
MSCPO 1632.34 1839.35 61.02 1730.27 1728.63
CPO 1879.01 2308.01 103.81 2049.73 2039.92
GA 2988.75 4.12 × 1018 7.53 × 1017 1.38 × 1017 6175.14
DE 2454.06 3494.79 287.19 2943.60 2866.63
WOA 1687.66 1.06 × 109 2.69 × 108 7.08 × 107 2685.88
HHO 2385.81 1.20 × 109 3.56 × 108 1.17 × 108 3414.52
DBO 2265.77 4558.33 558.88 3158.51 3120.30
GJA 1961.74 2943.01 216.57 2341.68 2350.12
SSA 1926.34 6139.42 976.11 3124.16 2907.73
BBO 1684.29 2914.24 345.60 2134.71 1994.14
L-SHADE 1637.26 1897.13 61.72 1774.11 1782.86
LSHADE-SPACMA 1633.25 2042.79 105.84 1822.31 1810.40

Bold values indicate the best result.

Figure 11.

Figure 11

Average convergence curve for the hydrostatic thrust bearing design problem.

Figure 12.

Figure 12

Box plot for the hydrostatic thrust bearing design problem.

As recorded in Table 13, MSCPO achieves the lowest minimum power loss (1632.34) among all twelve algorithms, slightly ahead of LSHADE-SPACMA (1633.25) and L-SHADE (1637.26). The convergence curve in Figure 11 shows that MSCPO, CPO, DE, GJA, SSA, BBO, L-SHADE, and LSHADE-SPACMA all exhibit a sharp decline in the objective value during the initial search phase, stabilizing after approximately 25 iterations. MSCPO attains a consistently lower best value, indicating better refinement near the optimum. In contrast, GA, WOA, HHO, and DBO display slower convergence or apparent convergence to suboptimal plateaus.

The statistical metrics in Table 14 and the box plot in Figure 12 demonstrate that MSCPO achieves the lowest mean power loss (1730.27), the smallest standard deviation (61.02), and the best worst-case value (1839.35) among all compared algorithms, including the two CEC competition algorithms L-SHADE (mean 1774.11, Std 61.72) and LSHADE-SPACMA (mean 1822.31, Std 105.84), indicating consistent performance across multiple trials. In contrast, algorithms such as GA and HHO show higher variance and degraded worst-case performance, reflecting sensitivity to initialization or parameter settings. The optimal design vector obtained by MSCPO (R=5.97, R0=5.40, μ=5.40×10−6, and Q=2.31) corresponds to physically realistic dimensions and operating conditions. This configuration satisfies all seven nonlinear constraints, confirming that the solution is both optimal and feasible for the intended application.

5.3. Robotic Gripper Design

The robotic gripper design problem is a classical mechanical optimization problem. Its objective is to minimize the difference between the maximum and minimum gripping forces. The structure of the gripper mechanism is illustrated in Figure 13. The problem involves seven design variables related to the gripper mechanism and seven nonlinear design constraints. The mathematical model is formulated as follows.

Figure 13.

Figure 13

Schematic of the robotic gripper mechanism.

Minimize:

fx=maxzFkx,z−minzFkx,z (31)

Subject to:

g1x=Ymin−yx,zmax≥0, g2x=yx,zmax≥0, g3x=yx,0−Ymax≥0, g4x=YG−yx,0≥0,g5x=a+b2−l2−e2≥0, g6x=l−zmax2+a−e2−b2≥0, g7x=l−zmax≥0,

where

g=l−z2+e2, α=arccosa2+g2−b22ag+Φ, β=arccosb2+g2−a22bg−Φ, Φ=arctanel−z,Fk=Pbsinα+β2ccosα, yx,z=2e+f+csinβ+δ.
Ymin=50, Ymax=100, YG=150, zmax=100, P=100, 10≤f, a, b≤150, 100≤c≤200, 0≤e≤50,100≤l≤300, 1≤δ≤3.14.

The proposed MSCPO algorithm was applied to the robotic gripper design problem. The optimal parameters and statistical results are listed in Table 15 and Table 16. The average convergence curve and box plot of the robotic gripper design are given in Figure 14 and Figure 15.

Table 15.

Best solutions obtained for the robotic gripper design problem.

Algorithm Optimal Values for Variables Optimal Cost
a b c e f l δ
MSCPO 149.24 141.19 195.60 7.84 144.60 107.41 2.44 2.7312
CPO 148.03 139.59 186.22 7.89 107.75 121.30 2.24 3.2382
GA 143.73 124.97 167.63 16.57 94.03 142.80 2.39 4.2925
DE 150.00 149.73 197.72 0.00 10.00 114.75 1.64 3.0227
WOA 150.00 149.85 178.98 0.00 150.00 103.75 2.38 2.8980
HHO 150.00 149.88 176.97 0.00 150.00 100.85 2.45 2.8730
DBO 146.89 146.83 193.93 0.00 10.00 101.59 1.58 3.2309
GJA 150.00 131.13 189.05 18.69 128.12 103.96 2.37 2.9083
SSA 144.88 144.74 173.44 0.00 10.00 101.52 1.54 3.0588
BBO 149.93 137.44 199.21 12.30 100.28 105.46 2.15 2.7965
L-SHADE 149.40 145.27 199.97 3.98 147.43 103.38 2.35 2.6502
LSHADE-SPACMA 150.00 149.88 200.00 0.00 150.00 100.94 2.30 2.5438

Bold values indicate the best result.

Table 16.

Statistical results for the robotic gripper design problem.

Algorithm Min Worst Std Mean Median
MSCPO 2.7312 3.3110 0.1277 3.0344 3.0357
CPO 3.2382 4.3134 0.2389 3.9336 3.9156
GA 4.2925 36.4711 9.2051 10.7331 7.0667
DE 3.0227 4.7173 0.4187 3.9113 3.8639
WOA 2.8980 8.4718 1.3979 5.6896 5.5061
HHO 2.8730 66.2347 11.1674 7.4029 5.2083
DBO 3.2309 5.7523 0.6130 4.2780 4.2784
GJA 2.9083 4.4986 0.2920 3.2644 3.2086
SSA 3.0588 7.2062 1.2138 4.4945 4.1173
BBO 2.7965 4.4330 0.3860 3.1662 3.1063
L-SHADE 2.6502 3.1374 0.1245 2.7846 2.7439
LSHADE-SPACMA 2.5438 2.5466 5.81 × 10−4 2.5439 2.5438

Bold values indicate the best result.

Figure 14.

Figure 14

Average convergence curve for the robotic gripper design problem.

Figure 15.

Figure 15

Box plot for the robotic gripper design problem.

The optimal solutions obtained by all tested algorithms are recorded in Table 15. LSHADE-SPACMA obtains the lowest best value (2.5438), followed by L-SHADE (2.6502) and MSCPO (2.7312), with BBO (2.7965) close behind; the gap between MSCPO and the best value is within 8%. MSCPO clearly outperforms the original CPO (3.2382) as well as GA, DE, DBO, and SSA, confirming its strong optimization capability for this constrained mechanical design problem.

As shown in Figure 14, all tested algorithms exhibit a rapid initial reduction in the objective value and stabilize after approximately 100 iterations. The final converged values of the top performers differ only by a narrow margin: LSHADE-SPACMA and L-SHADE reach slightly lower final values, while MSCPO converges to a value close to the two CEC competition algorithms and clearly lower than the other nine competitors, including the original CPO.

The statistical results in Table 16 and the distribution of solutions visualized in Figure 15 demonstrate that LSHADE-SPACMA, L-SHADE, and MSCPO are the only three algorithms that combine low mean objective values with small standard deviations on this problem. LSHADE-SPACMA achieves the lowest mean (2.5439) and standard deviation (5.81 × 10−4), followed by L-SHADE (mean 2.7846, Std 0.1245) and MSCPO (mean 3.0344, Std 0.1277), which is ahead of BBO (3.1662) and clearly better than the original CPO (3.9336). In contrast, HHO and GA show large fluctuations and a higher worst-case objective value. The optimal design variables obtained by MSCPO all fall within the specified variable bounds. More importantly, this design strictly satisfies all seven nonlinear constraints, confirming that the optimal solution is both mechanically feasible and compliant with the problem’s performance requirements.

6. Discussion

6.1. Practical Efficiency

The asymptotic analysis in Section 3.8 shows that MSCPO preserves the time-complexity order of the original CPO, with only a constant-factor overhead. To verify this in practice, Table 17 compares the measured wall-clock runtimes of the two algorithms on all benchmark suites and engineering problems considered in this paper.

Table 17.

Average wall-clock runtime per run of CPO and MSCPO (in seconds). Each value is the mean over 30 independent runs, averaged over all 29 (CEC 2017) or 12 (CEC 2022) functions at the corresponding dimension. All timings were measured within a single MATLAB R2023b process with plotting disabled.

Benchmark Configuration CPO (s) MSCPO (s) Ratio (MSCPO/CPO)
CEC 2017 D = 10 0.0466 0.0671 1.44
CEC 2017 D = 30 0.0820 0.1027 1.25
CEC 2017 D = 50 0.1295 0.1553 1.20
CEC 2017 D = 100 0.2949 0.3327 1.13
CEC 2022 D = 10 0.0487 0.0698 1.43
CEC 2022 D = 20 0.0679 0.0875 1.29
Step-cone pulley D = 5 0.7471 0.8804 1.18
Hydrostatic thrust bearing D = 4 0.6144 0.7363 1.20
Robotic gripper D = 7 31.9769 32.9921 1.03

As shown in Table 17, the runtime ratio of MSCPO to CPO ranges from 1.13 to 1.44 across all benchmark configurations and, importantly, decreases as the problem dimension grows, confirming that the overhead is a small, dimension-independent constant factor. The ratios on the three engineering problems (1.18, 1.20, and 1.03 for the step-cone pulley, hydrostatic thrust bearing, and robotic gripper problems, respectively) fall within the same range. In addition, the extra N objective evaluations consumed by KCOL at initialization account for only about 0.1–0.2% of the total evaluation budget, as quantified in Section 3.8. The measured runtimes thus corroborate the complexity analysis: the performance gains of MSCPO reported in Section 4 and Section 5 are obtained at an acceptable, constant-factor runtime cost.

6.2. Comparison with Prior CPO Variants

Several enhanced variants of CPO have been proposed recently. ECPO [18] combines Sobol sequence initialization with a guided search strategy, an adaptive Levy flight, and centroid-based opposition-based learning; BTCPO [36] integrates a butterfly search strategy with a triangular walk; CAPCPO [38] introduces a composite Cauchy mutation strategy, an adaptive dynamic adjustment strategy, and a population mutation strategy; and SDHCPO [48] combines Sobol-OBL initialization, cosine annealing, a DE/rand/1 mutation, and horizontal–vertical crossover. The mechanism-level comparison is shown in Table 18. A distinguishing feature of MSCPO is its phase-targeted design: each of the four strategies is assigned to a specific phase of the original CPO (the initialization stage and the first, second, and fourth defense phases), so that the enhancements address four distinct weaknesses rather than modifying a single operator. This one-to-one correspondence also allows the contribution of each strategy to be analyzed independently, as demonstrated by the ablation study in Section 4.2.

Table 18.

Comparison of prior variants and MSCPO.

Algorithm Initialization Enhancement Strategies Validation Testbeds
ECPO [18] Sobol guided search, adaptive Levy flight, centroid-based OBL CEC 2014 (D = 30), CEC 2017 (D = 30), CEC 2020, CEC 2022
BTCPO [36] random butterfly search, triangular walk 23 classical functions, CEC 2021
CAPCPO [38] random composite Cauchy mutation, adaptive dynamic adjustment, population mutation CEC 2017 (D = 30; scalability at D = 100), CEC 2019, CEC 2022 (D = 10, 20)
SDHCPO [48] Sobol-OBL cosine annealing, DE/rand/1, horizontal-vertical crossover CEC 2017 (D = 30, 50), CEC 2022 (D = 20)
MSCPO KCOL APO-DME (Phase 1), ADDP (Phase 2), PDAP (Phase 4) CEC 2017 (D = 10, 30, 50, 100), CEC 2022 (D = 10, 20)

A direct or indirect numerical comparison between MSCPO and these variants is not feasible. As shown in Table 18, these variants were evaluated under substantially different configurations: ECPO was compared with 14 algorithms, including five CEC competition winners, on the CEC 2014, CEC 2017, CEC 2020, and CEC 2022 suites with a maximum of 500 iterations; BTCPO was compared with 8 algorithms on 23 classical benchmark functions and the CEC 2021 suite; CAPCPO was compared with 11 algorithms on the CEC 2017, CEC 2019, and CEC 2022 suites with a maximum of 500 iterations; and SDHCPO was compared with 7 algorithms on the CEC 2017 (D = 30 and 50) and CEC 2022 (D = 20) suites with a maximum of 500 iterations. Although partial overlaps with our testbed exist (CEC 2017 at D = 30 in ECPO and CAPCPO, and CEC 2022 at D = 10 and 20 in CAPCPO and at D = 20 in SDHCPO), the iteration budgets (500 versus 1000 iterations) and the comparison sets differ, and none of these studies reports results under the full configuration adopted in this paper (CEC 2017 at D = 10, 30, 50, and 100, and CEC 2022 at D = 10 and 20, with 1000 iterations). A direct comparison would therefore require re-implementing and carefully re-tuning each variant under a unified protocol, which falls outside the scope of this study. An indirect comparison through common baselines is likewise unreliable, because the absolute performance of any shared baseline itself depends on the evaluation budget. The comparison in this section is therefore restricted to the mechanism level. In this respect, the strategies of these variants are largely complementary to those of MSCPO, and combining them with the phase-targeted framework of MSCPO is a promising direction for future CPO enhancement.

6.3. Limitations and Generalizability

Several limitations of this study should be acknowledged. First, the advantage of MSCPO is dimension-dependent: on CEC 2017 it ranks first at D = 10, 30, and 50 but drops to third at D = 100, behind GJA and SSA; on CEC 2022 at D = 20, it records more losses than wins against LSHADE-SPACMA in the pairwise Wilcoxon comparison despite a better overall mean rank. A plausible explanation is that, with a fixed initial population size and a cyclic reduction schedule that does not adapt to the problem dimension, the four strategies may not fully exploit high-dimensional search spaces; this hypothesis remains to be tested. The attenuation is unlikely to stem from computational cost, because the runtime overhead of MSCPO relative to CPO decreases as the dimension grows, as shown in Table 17. Second, on the engineering problems, MSCPO is outperformed by LSHADE-SPACMA on the step-cone pulley and robotic gripper problems (and also by L-SHADE on the latter), suggesting that covariance matrix adaptation and success-history-based parameter adaptation are particularly effective on these highly constrained problems. Third, MSCPO has so far been evaluated only on unconstrained single-objective benchmark functions and three constrained engineering problems handled by a static penalty approach; its generalizability to other problem classes, such as dynamic, multi-modal constrained, or many-objective problems, remains to be verified. Finally, although KCOL is designed to improve the diversity and boundary coverage of the initial population, this coverage gain has not yet been quantified with discrepancy-based measures, and a systematic comparison with alternative schemes, such as random initialization, Latin hypercube sampling, Sobol sequences, the Kent map without opposition-based learning, and opposition-based learning without the Kent map, is left as an open question.

7. Conclusions and Future Work

This paper proposes MSCPO, a multi-strategy enhanced crested porcupine optimizer that addresses four limitations of the original CPO through four phase-targeted enhancement strategies: KCOL for population initialization, APO-DME for the first defense phase, ADDP for the second defense phase, and PDAP for the fourth defense phase. On the CEC 2017 suite, MSCPO attains the best overall mean rank (2.638), followed by LSHADE-SPACMA (3.112) and L-SHADE (4.371); it ranks first at D = 10, 30, and 50 (mean ranks 1.72, 2.41, and 2.76, respectively) but drops to third at D = 100. On the CEC 2022 suite, MSCPO ranks first at both tested dimensions (mean ranks 2.08 at D = 10 and 2.67 at D = 20; overall 2.375), followed overall by LSHADE-SPACMA (3.583) and L-SHADE (3.625), although at D = 20 the pairwise comparison against LSHADE-SPACMA records more losses than wins. The full ablation experiment over all 16 combinations of the four strategies shows that removing any single strategy degrades the overall ranking and that the complete MSCPO achieves the best mean rank (3.34), indicating that the four strategies contribute jointly to the final performance. On three constrained engineering design problems, MSCPO ranks first on the hydrostatic thrust bearing problem, second on the step-cone pulley problem, and third on the robotic gripper problem among eleven competing algorithms, confirming its applicability beyond benchmark functions.

Future work will proceed in three directions. First, the cyclic population reduction inherited from CPO follows a fixed schedule that does not account for the problem dimension; adapting the population schedule to the dimensionality or to the search progress, in the spirit of the linear population size reduction in L-SHADE [32] will be investigated to improve the performance of MSCPO on high-dimensional problems. Second, KCOL will be systematically compared with alternative initialization schemes, including Latin hypercube sampling and Sobol-based sequences, and the possibility of combining schemes, for instance by integrating Sobol-based sampling with opposition-based learning, or adaptively selecting them according to problem characteristics will be explored. Third, the phase-targeted framework will be extended to multi-objective optimization, as explored by multi-objective crested porcupines optimization (MOCPO) [49] and multi-objective crested porcupine optimization algorithm based on multiple defense strategies (MCPOMD) [50].

Abbreviations

The following abbreviations are used in this manuscript:

CPO Crested Porcupine Optimizer
MSCPO Multi-Strategy Enhanced Crested Porcupine Optimizer
KCOL Kent Chaos Opposition-Based Learning
APO-DME Arctic Puffin Optimization (APO)-Inspired Dual-Modal Evasion
ADDP Adaptive Dual-Differential Perturbation
PDAP Periodic Dynamic Adaptive Perturbation
GA genetic algorithm
GWO Gray Wolf Optimizer
WOA Whale optimization algorithm
DE differential evolution
GBO gradient-based optimizer
AVOA African vultures optimization algorithm
RUN Runge–Kutta method
EO equilibrium optimizer
GTO gorilla troops optimizer
UAV unmanned aerial vehicle
ECPO Enhanced CPO
BTCPO Butterfly Search and Triangular Walk CPO
CAPCPO Composite Adaptive CPO
HHO Harris Hawks Optimization
DBO dung beetle optimizer
GJA Gekko Japonicus Algorithm
SSA Sparrow search algorithm
BBO Beaver behavior optimizer
L-SHADE success-history based adaptive differential evolution with linear population size reduction
LSHADE-SPACMA LSHADE with semi-parameter adaptation hybrid with CMA-ES
CP crested porcupines
OBL opposition-based learning
APO Arctic Puffin Optimization
CD Critical Difference
MOCPO multi-objective crested porcupines optimization
MCPOMD multi-objective crested porcupine optimization algorithm based on multiple defense strategies

Appendix A

Table A1.

Parameter settings of MSCPO and all compared algorithms, as used in the experiments.

Algorithm Parameter Settings
GA Real-coded GA; roulette-wheel selection; arithmetic crossover with probability pc=0.6; non-uniform mutation with probability pm=0.3; infeasible offspring regenerated until within the bounds
DE DE/rand/1/bin; scale factor β~U(0.3, 0.9)  (resampled per dimension); crossover probability pCR=0.2
WOA Logarithmic spiral constant b=1; coefficient a decreases linearly from 2 to 0; a2 decreases linearly from−1 to−2
HHO Initial energy E0~U(−1, 1); escaping energy E1=2(1−t/Tmax); Levy exponent β=1.5
DBO Population proportions: ball-rolling beetles 20%, brood balls 25%, small dung beetles 30%, thief beetles 25%; k=0.1, b=0.2; dancing probability 0.2; Pα=−1=0.1; R=1−t/Tmax
GJA Step-size coefficient β decays from 1.2 to 0.3 via the cosh schedule; α=0.6β; guidance factor 0.3 applied every 3 generations; memory updated every 5 generations (capacity 5, replacing the worst 10%)
SSA Producer ratio PD=0.2; scrounger ratio SD=0.3; safety threshold ST=0.8
BBO Exploitation probability Et=sin(πt/2Tmax) (exploitation if rand<E(t), exploration otherwise); architect proportion 25%; per-dimension perturbation applied with probability 0.5: (1/10)cos(πt/2Tmax )(uj−lj)N(0,1)
L-SHADE Memory size H=N; initial memory MF=MCR=0.5; F~CauchyMF, 0.1 truncated to [0, 1]; CR~N(MCR,0.1) truncated to [0, 1]; p~U(2N,0.2); external archive of size at most N; linear population size reduction to Nmin=4; evaluation budget FES= N⋅Tmax
LSHADE-SPACMA pbest=0.11; memory size H=5; archive rate 1.4; Nmin=4; first half of the run F=0.45+0.1U(0,1), second half F~CauchyμF, 0.1; CMA-ES crossover applied with probability 0.5; σ=0.5
CPO Cyclic parameter T=2; convergence acceleration factor α=0.1; third/fourth defense trade-off probability Tf=0.8; population size reduction to Nmin as in Equation (2)
MSCPO CPO parameters unchanged (T=2, Tf=0.8, Nmin); the fixed α is not used because PDAP replaces the fourth defense. KCOL: Kent map control parameter r=0.4, chaotic iteration count Mc=10. APO-DME: mode 1 coefficient ε~U(0,1); mode 2 scaling factor FL=0.5 with Levy exponent β=1.5. ADDP: scaling factor F~U(0,1) (resampled per update). PDAP: ηt=sin2πU1+cos(2πU2) with U1, U2~U(0,1); I∈1,2 with equal probability

Shared settings: benchmark experiments (CEC 2017/CEC 2022) used N=30 and Tmax=1000; engineering problems used N=100 and Tmax=500. All algorithms were executed over 30 independent runs. Note that MSCPO inherits all parameters of the original CPO; the coefficients of its four strategies are either fixed constants or random variables drawn from fixed distributions at each update, so no problem-specific tuning is required.

Table A2.

Error statistics of different algorithms on CEC2017 (D = 10).

ID Metric MSCPO CPO GA DE WOA HHO DBO GJA SSA BBO LSHADE LSHADE-SPACMA
CEC2017-F1 Avg 1.0000 × 102 1.0000 × 102 2.1308 × 105 3.4555 × 103 9.2736 × 106 5.0983 × 105 1.5744 × 109 6.0335 × 104 4.0127 × 103 1.1562 × 103 1.0000 × 102 1.0000 × 102
Std 2.6305 × 10−9 9.0566 × 10−3 3.1720 × 105 2.8018 × 103 1.5927 × 107 2.3499 × 105 2.2465 × 109 1.4527 × 104 3.9010 × 103 1.7576 × 103 7.9670 × 10−13 3.7320 × 10−15
CEC2017-F3 Avg 3.0000 × 102 3.0000 × 102 5.2183 × 104 3.6152 × 103 3.6674 × 103 3.0800 × 102 2.7156 × 103 3.0017 × 102 3.0000 × 102 3.0000 × 102 3.0000 × 102 1.4328 × 103
Std 1.0556 × 10−14 9.0865 × 10−5 2.5456 × 104 1.2624 × 103 3.4369 × 103 8.8752 × 100 1.1304 × 103 4.9814 × 10−2 1.4615 × 10−6 5.9241 × 10−4 0.0000 × 100 4.3436 × 103
CEC2017-F4 Avg 4.0000 × 102 4.0157 × 102 4.3971 × 102 4.0617 × 102 4.2778 × 102 4.2255 × 102 4.9108 × 102 4.0477 × 102 4.0777 × 102 4.0485 × 102 4.0037 × 102 4.0000 × 102
Std 6.2837 × 10−4 9.6684 × 10−1 3.9871 × 101 4.0610 × 10−1 4.2599 × 101 2.9419 × 101 4.5908 × 101 8.0927 × 10−1 1.6778 × 101 1.2298 × 100 1.8859 × 10−1 2.1111 × 10−14
CEC2017-F5 Avg 5.0492 × 102 5.0758 × 102 5.8689 × 102 5.1296 × 102 5.5567 × 102 5.5119 × 102 5.4932 × 102 5.1142 × 102 5.3914 × 102 5.1254 × 102 5.1111 × 102 5.0455 × 102
Std 1.8710 × 100 2.9017 × 100 1.7178 × 101 2.4673 × 100 2.2751 × 101 2.1813 × 101 7.4406 × 100 5.5593 × 100 1.4716 × 101 3.9506 × 100 2.2347 × 100 1.2788 × 100
CEC2017-F6 Avg 6.0000 × 102 6.0000 × 102 6.6079 × 102 6.0000 × 102 6.3699 × 102 6.3676 × 102 6.2263 × 102 6.0029 × 102 6.1416 × 102 6.0017 × 102 6.0000 × 102 6.0000 × 102
Std 9.8260 × 10−11 2.1640 × 10−7 1.0839 × 101 1.0556 × 10−13 1.3114 × 101 1.3205 × 101 5.1227 × 100 2.1279 × 10−1 1.3309 × 101 4.8955 × 10−1 5.1711 × 10−14 1.9807 × 10−3
CEC2017-F7 Avg 7.1623 × 102 7.2098 × 102 8.0464 × 102 7.2485 × 102 7.8804 × 102 7.8425 × 102 7.7835 × 102 7.1974 × 102 7.9206 × 102 7.2442 × 102 7.2267 × 102 7.1401 × 102
Std 2.7612 × 100 3.1904 × 100 1.9932 × 101 3.0003 × 100 2.5857 × 101 2.3157 × 101 8.9945 × 100 3.8948 × 100 1.8073 × 101 7.7348 × 100 2.7500 × 100 1.8039 × 100
CEC2017-F8 Avg 8.0510 × 102 8.0788 × 102 8.7985 × 102 8.1252 × 102 8.4441 × 102 8.3044 × 102 8.3302 × 102 8.0857 × 102 8.3688 × 102 8.1380 × 102 8.1009 × 102 8.0454 × 102
Std 2.4024 × 100 3.1356 × 100 1.4035 × 101 2.6089 × 100 1.5919 × 101 7.5385 × 100 4.1537 × 100 3.0209 × 100 1.2646 × 101 5.5780 × 100 2.1546 × 100 1.4406 × 100
CEC2017-F9 Avg 9.0000 × 102 9.0000 × 102 9.4062 × 102 9.0000 × 102 1.5312 × 103 1.4822 × 103 1.0510 × 103 9.0003 × 102 1.4986 × 103 9.0000 × 102 9.0000 × 102 9.0019 × 102
Std 0.0000 × 100 0.0000 × 100 2.1103 × 101 2.1111 × 10−14 3.5566 × 102 2.2157 × 102 8.5046 × 101 1.3192 × 10−2 3.2293 × 102 1.6334 × 10−2 0.0000 × 100 4.2131 × 10−1
CEC2017-F10 Avg 1.3850 × 103 1.4546 × 103 2.3310 × 103 1.5585 × 103 2.1530 × 103 1.9964 × 103 2.1067 × 103 1.4579 × 103 1.9900 × 103 1.6029 × 103 1.7002 × 103 1.2336 × 103
Std 2.5144 × 102 2.0363 × 102 2.6950 × 102 1.2370 × 102 2.5964 × 102 2.8264 × 102 2.6932 × 102 2.7681 × 102 3.1423 × 102 1.9246 × 102 1.5030 × 102 9.6545 × 101
CEC2017-F11 Avg 1.1012 × 103 1.1034 × 103 1.1661 × 104 1.1326 × 103 1.4972 × 103 1.1680 × 103 1.3126 × 103 1.1130 × 103 1.1511 × 103 1.1242 × 103 1.1022 × 103 1.1110 × 103
Std 1.0726 × 100 1.8493 × 100 1.0270 × 104 1.4602 × 101 4.0645 × 102 3.3476 × 101 9.6112 × 101 5.2848 × 100 4.5365 × 101 1.1194 × 101 1.2028 × 100 1.1612 × 101
CEC2017-F12 Avg 1.3398 × 103 2.2789 × 103 6.4924 × 106 4.0698 × 105 5.6736 × 106 3.8132 × 106 4.3865 × 106 1.2424 × 105 1.5677 × 104 8.4582 × 104 1.9810 × 103 1.6611 × 103
Std 9.5234 × 101 1.1545 × 103 6.6704 × 106 3.0597 × 105 6.6411 × 106 3.7614 × 106 4.2195 × 106 1.4522 × 105 1.5374 × 104 1.1472 × 105 3.2408 × 102 2.4245 × 102
CEC2017-F13 Avg 1.3046 × 103 1.3074 × 103 1.8823 × 104 3.5550 × 103 2.1970 × 104 1.7603 × 104 2.0142 × 104 8.1911 × 103 1.0800 × 104 9.0424 × 103 1.3073 × 103 1.3308 × 103
Std 3.2287 × 100 3.3434 × 100 1.0361 × 104 2.8160 × 103 1.6656 × 104 1.2693 × 104 1.2149 × 104 3.8461 × 103 9.4478 × 103 6.3674 × 103 3.3708 × 100 2.6729 × 101
CEC2017-F14 Avg 1.4008 × 103 1.4016 × 103 8.0191 × 103 1.4472 × 103 2.5428 × 103 1.7346 × 103 1.8851 × 103 1.4758 × 103 1.7154 × 103 1.5682 × 103 1.4094 × 103 1.4131 × 103
Std 6.8945 × 10−1 1.4153 × 100 7.3787 × 103 3.7511 × 101 1.4981 × 103 3.8604 × 102 3.9535 × 102 4.1839 × 101 4.0959 × 102 2.9962 × 102 9.5679 × 100 1.0221 × 101
CEC2017-F15 Avg 1.5004 × 103 1.5007 × 103 7.5832 × 103 1.6738 × 103 7.7883 × 103 5.5997 × 103 3.9640 × 103 1.7886 × 103 2.1196 × 103 1.9157 × 103 1.5006 × 103 1.5072 × 103
Std 4.8040 × 10−1 4.8307 × 10−1 6.4733 × 103 3.4147 × 102 6.0100 × 103 2.1356 × 103 2.1938 × 103 3.8686 × 102 7.2705 × 102 7.9715 × 102 5.1399 × 10−1 7.2002 × 100
CEC2017-F16 Avg 1.6012 × 103 1.6129 × 103 1.8443 × 103 1.6069 × 103 1.9264 × 103 1.9629 × 103 1.8023 × 103 1.8014 × 103 1.7974 × 103 1.6940 × 103 1.6049 × 103 1.6057 × 103
Std 2.0480 × 100 3.6229 × 101 1.0531 × 102 8.2450 × 100 1.8573 × 102 1.4890 × 102 1.1681 × 102 1.3563 × 102 1.6427 × 102 1.2854 × 102 9.8076 × 100 2.1686 × 101
CEC2017-F17 Avg 1.7056 × 103 1.7049 × 103 1.7709 × 103 1.7038 × 103 1.8131 × 103 1.7736 × 103 1.7766 × 103 1.7481 × 103 1.7834 × 103 1.7577 × 103 1.7125 × 103 1.7021 × 103
Std 3.4154 × 100 3.6594 × 100 2.3723 × 101 4.6646 × 100 5.5035 × 101 5.4902 × 101 1.4530 × 101 3.2998 × 101 5.7536 × 101 2.8110 × 101 9.0409 × 100 1.9638 × 100
CEC2017-F18 Avg 1.8005 × 103 1.8017 × 103 1.8240 × 104 4.3509 × 103 1.5720 × 104 1.7930 × 104 6.4543 × 104 1.1102 × 104 8.8492 × 103 1.3046 × 104 1.8140 × 103 1.8345 × 103
Std 2.9524 × 10−1 9.5977 × 10−1 1.3783 × 104 2.3513 × 103 1.3620 × 104 1.2196 × 104 6.5817 × 104 9.0020 × 103 6.2154 × 103 8.7685 × 103 9.7070 × 100 2.0980 × 101
CEC2017-F19 Avg 1.9002 × 103 1.9003 × 103 9.1459 × 103 2.1530 × 103 1.3178 × 105 1.1846 × 104 6.6910 × 103 2.1745 × 103 3.8883 × 103 2.5605 × 103 1.9006 × 103 1.9040 × 103
Std 1.4234 × 10−1 2.4416 × 10−1 8.7179 × 103 5.5099 × 102 2.3840 × 105 1.0381 × 104 1.3339 × 104 3.8935 × 102 2.3600 × 103 1.0860 × 103 6.7959 × 10−1 4.8929 × 100
CEC2017-F20 Avg 2.0000 × 103 2.0001 × 103 2.1961 × 103 2.0001 × 103 2.1836 × 103 2.1800 × 103 2.1063 × 103 2.0442 × 103 2.0835 × 103 2.0487 × 103 2.0034 × 103 2.0033 × 103
Std 1.0789 × 10−1 1.4964 × 10−1 5.9824 × 101 2.0840 × 10−1 8.3843 × 101 6.2062 × 101 4.4730 × 101 4.4847 × 101 6.1836 × 101 5.3680 × 101 7.5588 × 100 6.7861 × 100
CEC2017-F21 Avg 2.2000 × 103 2.2064 × 103 2.2873 × 103 2.2232 × 103 2.3946 × 103 2.4609 × 103 2.2651 × 103 2.2436 × 103 2.3784 × 103 2.2871 × 103 2.2218 × 103 2.2069 × 103
Std 8.4444 × 10−14 3.2200 × 101 1.2853 × 102 6.1531 × 100 2.0993 × 102 2.8833 × 102 2.4040 × 101 8.1225 × 101 2.4786 × 102 1.1959 × 102 6.7193 × 101 2.8349 × 101
CEC2017-F22 Avg 2.3289 × 103 2.5283 × 103 5.0623 × 103 3.5143 × 103 5.2782 × 103 5.6607 × 103 3.6703 × 103 3.7213 × 103 5.1424 × 103 3.8084 × 103 3.5301 × 103 2.7288 × 103
Std 2.5906 × 102 6.3242 × 102 1.1066 × 103 6.7974 × 102 1.2727 × 103 1.1409 × 103 1.1375 × 103 8.4619 × 102 1.0351 × 103 6.7608 × 102 6.5362 × 102 3.7967 × 102
CEC2017-F23 Avg 2.6567 × 103 2.6807 × 103 3.1283 × 103 2.7440 × 103 3.1158 × 103 3.2837 × 103 3.1238 × 103 2.7359 × 103 3.0372 × 103 2.7463 × 103 2.7038 × 103 2.6612 × 103
Std 2.6033 × 101 3.1948 × 101 9.6542 × 101 3.7153 × 101 1.9744 × 102 2.6116 × 102 1.3478 × 102 4.6001 × 101 2.0740 × 102 5.7889 × 101 3.1076 × 101 2.3437 × 101
CEC2017-F24 Avg 2.5367 × 103 2.5367 × 103 2.8750 × 103 2.5989 × 103 3.0154 × 103 2.6805 × 103 2.7276 × 103 2.5716 × 103 2.6628 × 103 2.6079 × 103 2.5616 × 103 2.5435 × 103
Std 4.9013 × 101 4.9013 × 101 2.6963 × 102 3.9072 × 101 4.0586 × 102 3.0497 × 102 6.3118 × 101 7.1280 × 101 3.5368 × 102 1.5273 × 102 9.6020 × 101 5.0629 × 101
CEC2017-F25 Avg 2.9098 × 103 2.9158 × 103 2.9923 × 103 2.9005 × 103 2.9431 × 103 2.9178 × 103 3.0125 × 103 2.9180 × 103 2.9215 × 103 2.9220 × 103 2.9072 × 103 2.9059 × 103
Std 2.1120 × 101 1.7746 × 101 2.3541 × 101 1.6858 × 101 3.1678 × 101 1.8121 × 101 5.2459 × 101 1.7066 × 101 2.5755 × 101 1.5067 × 101 2.2919 × 101 2.2140 × 101
CEC2017-F26 Avg 2.9000 × 103 2.9016 × 103 3.7964 × 103 2.9395 × 103 3.6363 × 103 3.4871 × 103 3.1896 × 103 2.8878 × 103 3.5596 × 103 2.8687 × 103 2.9242 × 103 2.9160 × 103
Std 0.0000 × 100 8.6083 × 100 6.1082 × 102 4.5710 × 101 5.6928 × 102 5.6043 × 102 9.9250 × 101 6.4418 × 101 6.0934 × 102 8.1788 × 101 4.5397 × 101 3.3259 × 101
CEC2017-F27 Avg 3.0935 × 103 3.0932 × 103 3.2124 × 103 3.0904 × 103 3.1527 × 103 3.1633 × 103 3.1104 × 103 3.0997 × 103 3.1167 × 103 3.0971 × 103 3.0907 × 103 3.0942 × 103
Std 1.9224 × 100 1.9874 × 100 3.9349 × 101 6.8123 × 10−1 4.1575 × 101 5.1850 × 101 1.1068 × 101 1.4918 × 101 3.0260 × 101 5.2218 × 100 2.9150 × 100 4.1747 × 100
CEC2017-F28 Avg 3.1104 × 103 3.1208 × 103 3.2851 × 103 3.2864 × 103 3.4390 × 103 3.4062 × 103 3.2868 × 103 3.2787 × 103 3.3154 × 103 3.3021 × 103 3.2945 × 103 3.2454 × 103
Std 5.6931 × 101 7.9112 × 101 5.4405 × 101 9.7980 × 101 1.7997 × 102 1.4552 × 102 1.1361 × 102 1.4451 × 102 1.5536 × 102 1.3771 × 102 1.4424 × 102 1.4393 × 102
CEC2017-F29 Avg 3.1545 × 103 3.1647 × 103 3.3282 × 103 3.1768 × 103 3.3750 × 103 3.3327 × 103 3.2404 × 103 3.2036 × 103 3.2840 × 103 3.1797 × 103 3.1663 × 103 3.1565 × 103
Std 1.1271 × 101 1.5127 × 101 7.1740 × 101 1.3249 × 101 1.0415 × 102 8.8335 × 101 4.5729 × 101 4.2897 × 101 9.0241 × 101 2.5421 × 101 1.4115 × 101 1.4120 × 101
CEC2017-F30 Avg 3.1054 × 104 5.8042 × 103 2.1623 × 106 3.9803 × 104 1.1321 × 106 8.6551 × 105 1.0675 × 106 1.9145 × 105 3.2936 × 105 9.4758 × 104 1.9634 × 105 1.5409 × 105
Std 1.4913 × 105 3.5494 × 103 1.6362 × 106 3.9745 × 104 1.7386 × 106 1.4057 × 106 8.7821 × 105 3.5491 × 105 5.1685 × 105 2.9737 × 105 4.0134 × 105 3.4980 × 105

Bold values indicate the best result.

Table A3.

Error statistics of different algorithms on CEC2017 (D = 30).

ID Metric MSCPO CPO GA DE WOA HHO DBO GJA SSA BBO LSHADE LSHADE-SPACMA
CEC2017-F1 Avg 2.2142 × 103 2.1257 × 103 4.0850 × 109 5.3168 × 104 1.8575 × 109 2.8690 × 107 3.0544 × 1010 1.3582 × 106 4.6115 × 103 1.5627 × 104 1.0007 × 102 4.5862 × 103
Std 2.3215 × 103 2.4369 × 103 3.1941 × 109 2.9695 × 104 8.7476 × 108 6.2226 × 106 4.8707 × 109 2.6271 × 105 6.0240 × 103 1.1423 × 104 1.0343 × 10−1 6.0219 × 103
CEC2017-F3 Avg 7.7012 × 103 3.8271 × 104 2.5055 × 105 1.5424 × 105 2.6005 × 105 4.1066 × 104 7.3766 × 104 9.4120 × 103 4.2652 × 104 2.1573 × 103 5.3000 × 104 4.5116 × 104
Std 3.4341 × 103 7.9245 × 103 6.2742 × 104 2.2090 × 104 7.3935 × 104 7.5710 × 103 7.3517 × 103 4.1870 × 103 5.5319 × 103 1.2481 × 103 1.3329 × 104 6.0124 × 104
CEC2017-F4 Avg 4.6527 × 102 4.9132 × 102 9.4930 × 102 4.9970 × 102 8.7928 × 102 5.5520 × 102 6.4786 × 103 5.0249 × 102 4.9296 × 102 4.9389 × 102 4.9316 × 102 4.8843 × 102
Std 3.3608 × 101 2.4269 × 101 1.9870 × 102 6.7247 × 100 1.8382 × 102 3.2569 × 101 2.3042 × 103 1.9012 × 101 3.2727 × 101 2.9371 × 101 1.8200 × 101 2.6225 × 101
CEC2017-F5 Avg 6.0418 × 102 6.5357 × 102 9.6277 × 102 6.7971 × 102 8.5422 × 102 7.5235 × 102 8.2807 × 102 5.7085 × 102 7.7394 × 102 5.8775 × 102 6.4872 × 102 5.5207 × 102
Std 3.5262 × 101 1.9062 × 101 6.1231 × 101 9.3155 × 100 7.0634 × 101 3.3563 × 101 2.2118 × 101 1.9636 × 101 3.4217 × 101 1.9553 × 101 1.3528 × 101 8.6919 × 100
CEC2017-F6 Avg 6.0001 × 102 6.0005 × 102 7.2011 × 102 6.0001 × 102 6.7918 × 102 6.6706 × 102 6.6972 × 102 6.0653 × 102 6.5133 × 102 6.0982 × 102 6.0001 × 102 6.0123 × 102
Std 3.1733 × 10−2 3.2837 × 10−2 1.5078 × 101 2.2390 × 10−3 1.3127 × 101 5.5994 × 100 6.1817 × 100 1.4014 × 100 1.1414 × 101 6.8266 × 100 4.3004 × 10−2 1.1594 × 100
CEC2017-F7 Avg 8.6622 × 102 9.0162 × 102 1.7072 × 103 9.1437 × 102 1.2818 × 103 1.2723 × 103 1.2156 × 103 8.1138 × 102 1.2694 × 103 8.5849 × 102 8.8752 × 102 8.0032 × 102
Std 2.6474 × 101 1.8556 × 101 2.1844 × 102 1.3390 × 101 7.6928 × 101 7.5810 × 101 4.1315 × 101 1.9834 × 101 6.6526 × 101 5.0019 × 101 1.5293 × 101 1.9042 × 101
CEC2017-F8 Avg 9.0521 × 102 9.3991 × 102 1.1988 × 103 9.7929 × 102 1.0402 × 103 9.8033 × 102 1.0610 × 103 8.6888 × 102 9.8920 × 102 8.8229 × 102 9.4589 × 102 8.4752 × 102
Std 3.9919 × 101 2.8745 × 101 4.2696 × 101 1.1874 × 101 4.5553 × 101 2.4536 × 101 2.0065 × 101 1.8574 × 101 2.3317 × 101 2.0520 × 101 1.5281 × 101 8.6241 × 100
CEC2017-F9 Avg 9.1964 × 102 9.8095 × 102 6.3668 × 103 1.6067 × 103 1.0939 × 104 8.2022 × 103 7.8346 × 103 1.0798 × 103 5.4344 × 103 1.8668 × 103 9.0222 × 102 1.1033 × 103
Std 2.8102 × 101 1.1698 × 102 3.3252 × 103 3.6154 × 102 4.8439 × 103 9.6581 × 102 1.2164 × 103 2.2394 × 102 2.1292 × 102 6.8894 × 102 3.1811 × 100 1.9555 × 102
CEC2017-F10 Avg 6.8933 × 103 6.8642 × 103 7.7862 × 103 7.2594 × 103 7.1360 × 103 5.6712 × 103 8.1932 × 103 4.1337 × 103 5.4195 × 103 4.4284 × 103 7.7917 × 103 3.8669 × 103
Std 4.4186 × 102 3.6717 × 102 7.5512 × 102 2.4172 × 102 7.2985 × 102 7.0388 × 102 6.8978 × 102 6.4505 × 102 5.6458 × 102 5.9356 × 102 2.8883 × 102 4.2288 × 102
CEC2017-F11 Avg 1.2099 × 103 1.3313 × 103 3.3327 × 104 5.2010 × 103 5.8647 × 103 1.4171 × 103 6.7692 × 103 1.2190 × 103 1.3340 × 103 1.2681 × 103 1.2705 × 103 2.4280 × 103
Std 4.5642 × 101 8.6188 × 101 1.3605 × 104 1.4517 × 103 2.6176 × 103 1.0750 × 102 1.4504 × 103 4.0785 × 101 7.4719 × 101 5.0760 × 101 4.2962 × 101 2.1531 × 103
CEC2017-F12 Avg 4.9618 × 104 3.7514 × 105 7.3129 × 107 2.9712 × 107 2.4105 × 108 2.5227 × 107 6.1664 × 109 3.8797 × 106 1.1741 × 106 1.7908 × 106 1.1630 × 105 7.2011 × 104
Std 4.5679 × 104 3.2505 × 105 7.8152 × 107 1.3188 × 107 1.3856 × 108 1.8083 × 107 1.7551 × 109 2.3954 × 106 8.1051 × 105 1.2694 × 106 1.6273 × 105 6.0665 × 104
CEC2017-F13 Avg 7.8124 × 103 8.8705 × 103 9.5615 × 106 1.4749 × 106 2.1449 × 106 7.2247 × 105 3.1524 × 109 1.4008 × 105 1.9948 × 104 4.2308 × 104 2.6074 × 104 8.1440 × 103
Std 7.3380 × 103 6.9861 × 103 1.5818 × 107 8.3549 × 105 2.5220 × 106 4.6397 × 105 1.8456 × 109 4.5314 × 104 1.8501 × 104 2.2188 × 104 1.7307 × 104 7.3695 × 103
CEC2017-F14 Avg 1.4776 × 103 1.5277 × 103 6.6783 × 106 2.4279 × 105 2.1863 × 106 6.7345 × 105 5.7756 × 105 2.0225 × 104 5.5748 × 104 1.5838 × 104 1.7138 × 103 1.5955 × 103
Std 1.6657 × 101 2.6145 × 101 7.5315 × 106 1.4878 × 105 2.9637 × 106 4.6495 × 105 5.4235 × 105 2.2793 × 104 5.3373 × 104 1.4035 × 104 7.5162 × 102 8.1458 × 101
CEC2017-F15 Avg 1.6394 × 103 2.3295 × 103 1.3873 × 106 3.1898 × 105 4.6559 × 106 9.8062 × 104 3.3246 × 106 3.9248 × 104 8.6024 × 103 1.4234 × 104 2.1868 × 103 2.0244 × 103
Std 3.8622 × 101 1.5834 × 103 3.0227 × 106 1.8155 × 105 1.3489 × 107 6.5846 × 104 3.5503 × 106 1.8285 × 104 8.6841 × 103 8.5613 × 103 3.0389 × 102 3.6603 × 102
CEC2017-F16 Avg 2.5324 × 103 2.5770 × 103 3.6671 × 103 2.7026 × 103 4.2999 × 103 3.5137 × 103 3.8512 × 103 2.5597 × 103 2.9080 × 103 2.4366 × 103 2.7400 × 103 2.3013 × 103
Std 2.4928 × 102 3.0266 × 102 3.5048 × 102 1.7161 × 102 7.3201 × 102 5.0532 × 102 4.5970 × 102 1.9971 × 102 3.1702 × 102 2.1439 × 102 2.1560 × 102 2.9727 × 102
CEC2017-F17 Avg 1.8142 × 103 1.8700 × 103 2.6524 × 103 2.1080 × 103 2.6895 × 103 2.6636 × 103 2.7983 × 103 2.0367 × 103 2.4662 × 103 2.0622 × 103 1.9656 × 103 1.9032 × 103
Std 5.6596 × 101 9.0466 × 101 2.2422 × 102 1.0604 × 102 2.7958 × 102 3.3140 × 102 3.1112 × 102 1.7306 × 102 2.4016 × 102 1.3812 × 102 9.6739 × 101 8.6515 × 101
CEC2017-F18 Avg 1.2760 × 104 3.9395 × 104 7.2858 × 106 1.9027 × 106 6.7120 × 106 2.9165 × 106 4.3680 × 106 2.7438 × 105 8.1597 × 105 5.6917 × 105 1.9737 × 105 2.7115 × 104
Std 1.0050 × 104 1.8757 × 104 7.7912 × 106 8.0059 × 105 6.9446 × 106 3.2756 × 106 4.5085 × 106 1.9941 × 105 1.1132 × 106 4.7407 × 105 1.3347 × 105 1.8326 × 104
CEC2017-F19 Avg 1.9466 × 103 2.3721 × 103 2.6830 × 106 2.3886 × 105 1.2707 × 107 1.0366 × 106 1.6596 × 108 4.8061 × 104 8.6869 × 103 9.9597 × 103 2.1377 × 103 2.6129 × 103
Std 1.3898 × 101 7.4067 × 102 3.7156 × 106 1.3298 × 105 1.1105 × 107 8.1363 × 105 1.4470 × 108 2.9310 × 104 1.0375 × 104 6.1828 × 103 1.9262 × 102 2.8635 × 103
CEC2017-F20 Avg 2.2085 × 103 2.2322 × 103 3.0037 × 103 2.4001 × 103 2.8905 × 103 2.7744 × 103 2.6563 × 103 2.2929 × 103 2.8270 × 103 2.3776 × 103 2.3311 × 103 2.2484 × 103
Std 7.7214 × 101 1.3377 × 102 2.3492 × 102 1.1343 × 102 2.2572 × 102 2.4798 × 102 1.3570 × 102 1.1186 × 102 2.2322 × 102 1.3096 × 102 8.7262 × 101 1.2348 × 102
CEC2017-F21 Avg 2.5273 × 103 2.6786 × 103 5.5512 × 103 3.4584 × 103 4.7685 × 103 4.0598 × 103 3.2260 × 103 2.6920 × 103 4.1099 × 103 2.9021 × 103 3.3925 × 103 2.4876 × 103
Std 5.1189 × 102 7.5773 × 102 1.2986 × 103 6.2522 × 102 8.5491 × 102 7.7136 × 102 3.5226 × 102 4.2291 × 102 7.8002 × 102 4.1329 × 102 6.1654 × 102 2.8928 × 102
CEC2017-F22 Avg 1.7808 × 104 1.7407 × 104 2.0096 × 104 1.8158 × 104 1.8407 × 104 1.6280 × 104 2.0827 × 104 1.0665 × 104 1.4316 × 104 1.1220 × 104 1.8768 × 104 1.0081 × 104
Std 1.0354 × 103 1.1122 × 103 1.8324 × 103 8.8924 × 102 1.5905 × 103 1.8959 × 103 1.7090 × 103 2.3913 × 103 1.7101 × 103 1.6547 × 103 7.8438 × 102 9.9988 × 102
CEC2017-F23 Avg 3.7264 × 103 4.1701 × 103 6.6308 × 103 4.5466 × 103 6.9141 × 103 7.0410 × 103 6.2370 × 103 3.4853 × 103 5.4691 × 103 3.5568 × 103 4.2469 × 103 3.2576 × 103
Std 4.8786 × 102 3.9466 × 102 7.7147 × 102 1.2184 × 102 1.0539 × 103 1.0711 × 103 5.4007 × 102 2.1390 × 102 8.8208 × 102 1.9723 × 102 1.4285 × 102 1.0712 × 102
CEC2017-F24 Avg 3.3418 × 103 3.5330 × 103 6.7142 × 103 4.9167 × 103 5.9926 × 103 5.8762 × 103 6.0606 × 103 2.9504 × 103 5.8657 × 103 3.5102 × 103 4.3721 × 103 3.0747 × 103
Std 5.2906 × 102 1.0189 × 103 5.9606 × 102 4.1276 × 102 7.4284 × 102 1.4035 × 102 3.3742 × 102 6.3763 × 102 1.1786 × 102 7.2166 × 102 1.3097 × 102 3.8879 × 102
CEC2017-F25 Avg 2.8808 × 103 2.8849 × 103 3.9835 × 103 2.8825 × 103 3.1070 × 103 2.9454 × 103 4.0589 × 103 2.9036 × 103 2.8884 × 103 2.8893 × 103 2.8802 × 103 2.8802 × 103
Std 2.7352 × 100 8.0235 × 100 4.1418 × 102 2.9901 × 100 5.0672 × 101 2.9942 × 101 2.5461 × 102 1.8766 × 101 8.9794 × 100 1.7844 × 101 1.6477 × 100 1.0601 × 100
CEC2017-F26 Avg 4.1989 × 103 4.4453 × 103 7.9215 × 103 5.4095 × 103 8.5697 × 103 8.0556 × 103 7.7492 × 103 4.1827 × 103 6.6881 × 103 4.3906 × 103 4.9212 × 103 4.0582 × 103
Std 6.2863 × 102 1.1380 × 103 7.9363 × 102 1.0708 × 102 9.1617 × 102 8.9768 × 102 6.6961 × 102 1.1259 × 103 1.4642 × 103 1.1725 × 103 4.4168 × 102 4.9794 × 102
CEC2017-F27 Avg 3.2206 × 103 3.2403 × 103 3.9029 × 103 3.2219 × 103 3.5000 × 103 3.4582 × 103 3.6048 × 103 3.2446 × 103 3.2910 × 103 3.2327 × 103 3.2160 × 103 3.2365 × 103
Std 9.9421 × 100 9.2144 × 100 2.3142 × 102 3.7736 × 100 2.0065 × 102 1.6357 × 102 1.1589 × 102 1.8745 × 101 4.4206 × 101 1.5064 × 101 9.9254 × 100 2.1824 × 101
CEC2017-F28 Avg 3.2030 × 103 3.2227 × 103 4.5063 × 103 3.2851 × 103 3.5982 × 103 3.3254 × 103 5.1527 × 103 3.2459 × 103 3.2235 × 103 3.2171 × 103 3.2104 × 103 3.2087 × 103
Std 1.8521 × 101 1.8753 × 101 6.5055 × 102 3.1008 × 101 1.1856 × 102 2.9274 × 101 5.5568 × 102 2.8071 × 101 2.3153 × 101 1.8290 × 101 1.5129 × 101 3.8265 × 101
CEC2017-F29 Avg 3.5674 × 103 3.7134 × 103 4.8732 × 103 4.0314 × 103 5.2362 × 103 4.6624 × 103 4.8517 × 103 3.6700 × 103 4.2881 × 103 3.7477 × 103 3.7903 × 103 3.5519 × 103
Std 1.0443 × 102 1.4914 × 102 3.5849 × 102 1.1935 × 102 7.3298 × 102 4.2726 × 102 2.4194 × 102 1.6721 × 102 3.6608 × 102 1.7940 × 102 1.3234 × 102 1.0829 × 102
CEC2017-F30 Avg 9.4993 × 103 1.9732 × 104 9.3020 × 106 1.4777 × 105 3.6812 × 107 4.7265 × 106 1.1903 × 108 2.2622 × 105 1.5015 × 104 1.1773 × 105 2.0614 × 104 1.1779 × 104
Std 2.7938 × 103 7.0458 × 103 8.3694 × 106 6.9578 × 104 2.3239 × 107 2.2901 × 106 1.7345 × 108 9.2579 × 104 5.8924 × 103 9.9786 × 104 2.0906 × 104 3.7276 × 103

Bold values indicate the best result.

Table A4.

Error statistics of different algorithms on CEC2017 (D = 50).

ID Metric MSCPO CPO GA DE WOA HHO DBO GJA SSA BBO LSHADE LSHADE-SPACMA
CEC2017-F1 Avg 4.7650 × 103 6.6915 × 105 9.9690 × 1010 3.7568 × 107 8.9401 × 109 2.7126 × 108 7.0252 × 1010 5.1180 × 106 1.3399 × 105 3.0658 × 105 5.2063 × 103 3.1110 × 104
Std 5.3095 × 103 4.9110 × 105 4.0732 × 1010 4.3049 × 107 2.5771 × 109 6.7104 × 107 6.8282 × 109 7.1472 × 105 7.1654 × 104 1.7142 × 105 6.2875 × 103 2.3708 × 104
CEC2017-F3 Avg 7.0228 × 104 1.4141 × 105 4.2008 × 105 3.4343 × 105 2.7557 × 105 1.3210 × 105 1.9580 × 105 8.0838 × 104 2.3539 × 105 5.1340 × 104 1.8625 × 105 1.3207 × 105
Std 1.6494 × 104 2.0391 × 104 7.5788 × 104 3.3037 × 104 1.0360 × 105 2.0661 × 104 3.6195 × 104 1.6182 × 104 6.2420 × 104 1.3532 × 104 3.2794 × 104 1.0690 × 105
CEC2017-F4 Avg 5.5844 × 102 5.9059 × 102 9.7367 × 103 6.9440 × 102 2.2869 × 103 8.3793 × 102 1.6640 × 104 5.9201 × 102 5.6517 × 102 5.6903 × 102 5.5001 × 102 5.7397 × 102
Std 5.0278 × 101 6.1330 × 101 6.9842 × 103 2.4679 × 101 6.2374 × 102 1.1122 × 102 2.6370 × 103 4.1814 × 101 5.1294 × 101 5.6668 × 101 5.7077 × 101 4.9268 × 101
CEC2017-F5 Avg 7.5890 × 102 8.7208 × 102 1.4395 × 103 9.1942 × 102 1.0478 × 103 9.0226 × 102 1.0822 × 103 6.6867 × 102 8.7964 × 102 6.8774 × 102 8.3849 × 102 6.4241 × 102
Std 8.0294 × 101 2.6601 × 101 9.8646 × 101 1.7807 × 101 7.2999 × 101 3.1058 × 101 3.1576 × 101 3.4133 × 101 1.7359 × 101 3.0719 × 101 1.9634 × 101 2.3427 × 101
CEC2017-F6 Avg 6.0048 × 102 6.0182 × 102 7.3871 × 102 6.0087 × 102 6.9049 × 102 6.7587 × 102 6.8382 × 102 6.1553 × 102 6.6435 × 102 6.2659 × 102 6.0023 × 102 6.0313 × 102
Std 3.3320 × 10−1 1.3882 × 100 1.0819 × 101 1.3723 × 10−1 1.2153 × 101 5.6819 × 100 6.6192 × 100 4.1720 × 100 6.2637 × 100 6.6994 × 100 2.5649 × 10−1 1.9265 × 100
CEC2017-F7 Avg 1.1247 × 103 1.1917 × 103 3.8269 × 103 1.1938 × 103 1.8496 × 103 1.8467 × 103 1.7580 × 103 9.5099 × 102 1.7730 × 103 1.0345 × 103 1.1270 × 103 1.0015 × 103
Std 4.3645 × 101 4.6347 × 101 5.1565 × 102 1.6252 × 101 1.0575 × 102 9.2931 × 101 6.5451 × 101 4.4255 × 101 2.7520 × 101 6.9556 × 101 2.8580 × 101 4.7205 × 101
CEC2017-F8 Avg 1.0804 × 103 1.1668 × 103 1.6432 × 103 1.2137 × 103 1.3374 × 103 1.2091 × 103 1.3713 × 103 9.6398 × 102 1.2001 × 103 9.9882 × 102 1.1420 × 103 9.4227 × 102
Std 8.2894 × 101 2.9906 × 101 8.9038 × 101 2.5214 × 101 6.5949 × 101 3.8930 × 101 3.6024 × 101 3.9702 × 101 2.9676 × 101 4.1593 × 101 1.9795 × 101 1.7274 × 101
CEC2017-F9 Avg 2.4264 × 103 4.2822 × 103 3.2780 × 104 7.9145 × 103 3.3895 × 104 2.9734 × 104 3.0606 × 104 2.8700 × 103 1.3166 × 104 6.0462 × 103 1.4675 × 103 3.3985 × 103
Std 1.4911 × 103 1.8566 × 103 1.0276 × 104 2.0529 × 103 1.1636 × 104 3.2786 × 103 3.6840 × 103 1.3373 × 103 7.2072 × 102 1.7324 × 103 7.2986 × 102 1.0964 × 103
CEC2017-F10 Avg 1.2572 × 104 1.2798 × 104 1.4383 × 104 1.3722 × 104 1.2736 × 104 9.4842 × 103 1.4080 × 104 6.5686 × 103 8.8687 × 103 6.7518 × 103 1.3865 × 104 7.1115 × 103
Std 6.9887 × 102 5.0166 × 102 7.2682 × 102 3.0614 × 102 1.2779 × 103 8.2200 × 102 1.1079 × 103 1.1125 × 103 7.9849 × 102 9.4494 × 102 4.4638 × 102 5.3078 × 102
CEC2017-F11 Avg 1.7654 × 103 5.5029 × 103 8.6075 × 104 2.8588 × 104 6.3940 × 104 5.6766 × 103 2.4855 × 104 1.6344 × 103 3.4854 × 103 1.5057 × 103 2.6886 × 103 1.0055 × 104
Std 1.3211 × 102 1.5451 × 103 2.3860 × 104 5.6763 × 103 2.0577 × 104 1.6461 × 103 4.2745 × 103 1.2329 × 102 9.8400 × 102 9.4230 × 101 4.4080 × 102 1.3566 × 104
CEC2017-F12 Avg 1.4097 × 106 3.7372 × 106 4.8681 × 109 4.2424 × 108 1.8337 × 109 1.9122 × 108 4.1840 × 1010 2.3801 × 107 9.9537 × 106 1.4600 × 107 1.8961 × 106 5.9152 × 106
Std 7.6393 × 105 1.5611 × 106 3.0418 × 109 1.5612 × 108 7.6003 × 108 1.0856 × 108 6.2961 × 109 1.0929 × 107 6.1497 × 106 6.9778 × 106 1.2317 × 106 4.7938 × 106
CEC2017-F13 Avg 2.9921 × 103 3.8559 × 103 3.7661 × 108 6.5580 × 106 1.4299 × 108 6.1898 × 106 1.3785 × 1010 4.5204 × 105 2.0503 × 104 7.2381 × 104 1.3755 × 104 1.3695 × 104
Std 1.4282 × 103 2.5842 × 103 3.9875 × 108 5.5313 × 106 1.0315 × 108 8.3887 × 106 5.5627 × 109 1.5435 × 105 1.6805 × 104 3.5585 × 104 1.4691 × 104 8.4036 × 103
CEC2017-F14 Avg 5.1856 × 103 3.3313 × 104 1.5905 × 107 2.2247 × 106 4.9488 × 106 2.3598 × 106 6.7970 × 106 1.3674 × 105 3.9576 × 105 1.9671 × 105 6.5311 × 104 8.9150 × 103
Std 4.5063 × 103 5.0900 × 104 1.1629 × 107 9.3222 × 105 4.1467 × 106 1.4391 × 106 4.7682 × 106 8.1704 × 104 2.8205 × 105 9.7570 × 104 3.4071 × 104 1.2468 × 104
CEC2017-F15 Avg 4.2458 × 103 6.9329 × 103 3.2254 × 107 9.7236 × 105 1.6320 × 107 7.5738 × 105 1.6490 × 109 1.3833 × 105 1.7769 × 104 2.8465 × 104 1.6102 × 104 8.1949 × 103
Std 2.6019 × 103 3.7176 × 103 3.6351 × 107 9.0927 × 105 1.7179 × 107 3.1654 × 105 6.7887 × 108 3.4378 × 104 5.6826 × 103 1.8834 × 104 6.9753 × 103 4.9935 × 103
CEC2017-F16 Avg 3.0908 × 103 3.5837 × 103 5.5848 × 103 4.5772 × 103 6.0478 × 103 4.4500 × 103 5.5665 × 103 3.1111 × 103 3.9909 × 103 3.0430 × 103 4.0673 × 103 2.9952 × 103
Std 6.0126 × 102 4.7992 × 102 6.7887 × 102 2.2161 × 102 8.0064 × 102 6.1713 × 102 4.8179 × 102 3.3287 × 102 4.6026 × 102 4.0817 × 102 4.3705 × 102 3.2827 × 102
CEC2017-F17 Avg 2.7500 × 103 2.8468 × 103 4.3192 × 103 3.5132 × 103 4.4400 × 103 3.8590 × 103 4.7832 × 103 2.9821 × 103 3.6113 × 103 3.0211 × 103 3.4169 × 103 2.8907 × 103
Std 2.6686 × 102 2.8180 × 102 5.9230 × 102 1.4238 × 102 5.4870 × 102 4.4333 × 102 4.6612 × 102 3.0536 × 102 3.0943 × 102 3.0688 × 102 2.0272 × 102 2.5951 × 102
CEC2017-F18 Avg 1.5916 × 105 7.8502 × 105 6.0229 × 107 1.3833 × 107 4.1915 × 107 5.4105 × 106 1.4495 × 107 1.7391 × 106 2.5137 × 106 2.2098 × 106 1.7417 × 106 3.2543 × 105
Std 1.1082 × 105 7.2060 × 105 5.0107 × 107 6.3456 × 106 3.3123 × 107 4.4868 × 106 1.1631 × 107 9.2519 × 105 1.4504 × 106 1.2425 × 106 1.1453 × 106 1.1783 × 106
CEC2017-F19 Avg 1.1174 × 104 2.1489 × 104 2.3930 × 107 2.6490 × 105 8.4171 × 106 1.9501 × 106 1.1591 × 109 1.0609 × 105 1.7386 × 104 3.1929 × 104 1.8920 × 104 1.4490 × 104
Std 7.1319 × 103 8.2980 × 103 1.6381 × 107 1.9257 × 105 8.2281 × 106 1.7254 × 106 7.4986 × 108 3.7662 × 104 1.2810 × 104 1.6103 × 104 1.5687 × 104 1.0310 × 104
CEC2017-F20 Avg 3.0767 × 103 3.1667 × 103 4.0784 × 103 3.4911 × 103 3.7239 × 103 3.4998 × 103 3.7955 × 103 2.7965 × 103 3.7485 × 103 3.0221 × 103 3.5375 × 103 2.9951 × 103
Std 3.4757 × 102 3.7954 × 102 4.7087 × 102 1.6492 × 102 3.5064 × 102 3.4082 × 102 3.0165 × 102 2.9759 × 102 3.1536 × 102 3.1131 × 102 1.5189 × 102 2.2697 × 102
CEC2017-F21 Avg 4.6023 × 103 4.8088 × 103 1.0817 × 104 6.4835 × 103 7.9930 × 103 6.2291 × 103 7.0711 × 103 3.9536 × 103 6.1127 × 103 4.2081 × 103 5.5775 × 103 3.4749 × 103
Std 1.1719 × 103 1.7092 × 103 1.5798 × 103 3.5284 × 102 1.0509 × 103 2.8776 × 102 8.1544 × 102 1.0541 × 103 3.1032 × 102 4.7044 × 102 6.3316 × 102 5.9767 × 102
CEC2017-F22 Avg 3.3650 × 104 3.3591 × 104 3.8148 × 104 3.4952 × 104 3.2967 × 104 2.9067 × 104 3.6608 × 104 1.7999 × 104 2.3457 × 104 1.8155 × 104 3.5646 × 104 1.9106 × 104
Std 1.4046 × 103 1.2684 × 103 2.2838 × 103 9.8909 × 102 2.7331 × 103 2.9961 × 103 2.3915 × 103 2.2894 × 103 2.3031 × 103 1.6650 × 103 1.1230 × 103 1.2225 × 103
CEC2017-F23 Avg 5.6036 × 103 6.7108 × 103 1.2219 × 104 7.1910 × 103 1.1770 × 104 1.1414 × 104 1.0731 × 104 4.6248 × 103 9.1393 × 103 5.1431 × 103 6.4778 × 103 4.5975 × 103
Std 8.8008 × 102 3.0961 × 102 1.3323 × 103 1.5114 × 102 1.4462 × 103 1.1037 × 103 5.3892 × 102 3.6999 × 102 1.1208 × 103 4.4733 × 102 2.3581 × 102 2.6488 × 102
CEC2017-F24 Avg 5.3993 × 103 6.6485 × 103 1.1623 × 104 7.5307 × 103 9.2170 × 103 8.3018 × 103 9.4716 × 103 5.6416 × 103 8.2545 × 103 5.2589 × 103 6.2963 × 103 4.3898 × 103
Std 8.8212 × 102 1.2352 × 103 9.6280 × 102 2.1654 × 102 8.8243 × 102 2.3113 × 102 1.6660 × 102 1.5178 × 103 2.0701 × 102 7.1997 × 102 2.4117 × 102 4.4445 × 102
CEC2017-F25 Avg 3.0778 × 103 3.1353 × 103 1.1577 × 104 3.1052 × 103 4.1457 × 103 3.2518 × 103 1.1010 × 104 3.1365 × 103 3.1047 × 103 3.0646 × 103 3.0626 × 103 3.0668 × 103
Std 3.1673 × 101 2.1742 × 101 3.3695 × 103 2.3661 × 101 2.7197 × 102 5.1214 × 101 1.1642 × 103 3.3040 × 101 1.9946 × 101 2.8924 × 101 2.8202 × 101 2.7543 × 101
CEC2017-F26 Avg 5.9650 × 103 7.3521 × 103 1.4674 × 104 7.7822 × 103 1.4645 × 104 1.1357 × 104 1.3815 × 104 4.7604 × 103 8.5778 × 103 6.4353 × 103 7.1025 × 103 5.9975 × 103
Std 1.0411 × 103 1.6800 × 103 1.7343 × 103 2.1290 × 102 1.4684 × 103 1.6223 × 103 8.8641 × 102 2.3844 × 103 3.8077 × 103 1.4889 × 103 3.8225 × 102 7.4246 × 102
CEC2017-F27 Avg 3.4044 × 103 3.4958 × 103 5.4041 × 103 3.4736 × 103 4.6483 × 103 4.5819 × 103 4.9553 × 103 3.4707 × 103 3.8547 × 103 3.3934 × 103 3.3801 × 103 3.5277 × 103
Std 6.7468 × 101 6.7283 × 101 5.6351 × 102 4.7113 × 101 5.2570 × 102 4.3275 × 102 3.5834 × 102 1.3003 × 102 3.0059 × 102 5.1638 × 101 8.2511 × 101 9.8351 × 101
CEC2017-F28 Avg 3.3575 × 103 3.4502 × 103 1.0454 × 104 3.4471 × 103 5.2203 × 103 3.8273 × 103 8.1364 × 103 3.4114 × 103 3.3647 × 103 3.3133 × 103 3.3222 × 103 3.3567 × 103
Std 2.9537 × 101 4.6058 × 101 1.5769 × 103 6.3226 × 101 3.9721 × 102 1.5127 × 102 7.6229 × 102 4.8431 × 101 3.9677 × 101 3.9005 × 101 1.5995 × 101 4.1470 × 101
CEC2017-F29 Avg 3.9994 × 103 4.4925 × 103 7.1790 × 103 5.2465 × 103 8.9688 × 103 6.1490 × 103 1.0624 × 104 4.3802 × 103 5.1137 × 103 4.5546 × 103 4.5836 × 103 3.9903 × 103
Std 2.7685 × 102 3.0103 × 102 8.0311 × 102 2.6462 × 102 1.5255 × 103 7.0345 × 102 1.9484 × 103 2.9359 × 102 3.9852 × 102 2.5908 × 102 3.1932 × 102 2.7081 × 102
CEC2017-F30 Avg 1.1377 × 106 1.9051 × 106 3.9192 × 108 1.3754 × 107 2.7526 × 108 6.7289 × 107 1.7362 × 109 3.2906 × 106 1.3493 × 106 9.4474 × 106 1.0803 × 106 1.5865 × 106
Std 2.3226 × 105 6.2518 × 105 1.9481 × 108 5.4033 × 106 1.2522 × 108 2.3776 × 107 1.1883 × 109 5.8716 × 105 5.3601 × 105 1.5224 × 106 5.4471 × 105 4.5749 × 105

Bold values indicate the best result.

Table A5.

Error statistics of different algorithms on CEC2017 (D = 100).

ID Metric MSCPO CPO GA DE WOA HHO DBO GJA SSA BBO LSHADE LSHADE-SPACMA
CEC2017-F1 Avg 1.2701 × 108 1.1138 × 109 4.5232 × 1011 2.8907 × 109 6.3413 × 1010 7.1047 × 109 2.2225 × 1011 6.0541 × 107 8.8652 × 107 1.0566 × 107 4.8709 × 106 1.9749 × 108
Std 6.8553 × 107 9.9604 × 108 6.6935 × 1010 1.0483 × 109 1.0534 × 1010 1.5085 × 109 9.4099 × 109 1.3287 × 107 3.9860 × 107 2.7847 × 106 6.8899 × 106 1.0162 × 108
CEC2017-F3 Avg 2.8813 × 105 4.0520 × 105 8.8727 × 105 8.2911 × 105 8.9874 × 105 3.1624 × 105 4.6507 × 105 3.3101 × 105 4.9189 × 105 3.9369 × 105 5.5462 × 105 4.2622 × 105
Std 3.1412 × 104 3.3551 × 104 1.3937 × 105 9.5300 × 104 1.4957 × 105 1.4244 × 104 1.1221 × 105 4.0688 × 104 5.9345 × 104 6.8267 × 104 6.5778 × 104 1.7550 × 105
CEC2017-F4 Avg 9.5403 × 102 1.2114 × 103 1.0181 × 105 1.7183 × 103 1.2323 × 104 2.5580 × 103 5.9257 × 104 9.9606 × 102 9.8377 × 102 7.9212 × 102 8.1872 × 102 9.6634 × 102
Std 1.0366 × 102 1.1634 × 102 2.9901 × 104 1.7309 × 102 2.8080 × 103 3.6173 × 102 7.8191 × 103 7.4607 × 101 7.9217 × 101 4.9189 × 101 5.8770 × 101 8.0355 × 101
CEC2017-F5 Avg 1.4013 × 103 1.5769 × 103 2.9032 × 103 1.6310 × 103 1.8496 × 103 1.5945 × 103 1.9329 × 103 9.9218 × 102 1.3685 × 103 1.0849 × 103 1.4473 × 103 1.0751 × 103
Std 1.2713 × 102 7.2099 × 101 1.7532 × 102 3.3078 × 101 1.1353 × 102 5.1306 × 101 4.9000 × 101 9.8830 × 101 4.6953 × 101 8.7574 × 101 3.8671 × 101 9.2773 × 101
CEC2017-F6 Avg 6.1505 × 102 6.2119 × 102 7.5659 × 102 6.1893 × 102 7.0134 × 102 6.8671 × 102 6.9726 × 102 6.3016 × 102 6.6530 × 102 6.4494 × 102 6.0745 × 102 6.1553 × 102
Std 3.4835 × 100 5.1188 × 100 8.4711 × 100 1.4928 × 100 8.7251 × 100 4.3657 × 100 3.4944 × 100 3.5775 × 100 2.2487 × 100 5.9429 × 100 3.0241 × 100 4.1403 × 100
CEC2017-F7 Avg 1.9972 × 103 2.1761 × 103 1.0939 × 104 2.1251 × 103 3.7181 × 103 3.7347 × 103 3.6280 × 103 1.5146 × 103 3.2753 × 103 1.8404 × 103 2.0012 × 103 2.0421 × 103
Std 1.1698 × 102 9.7010 × 101 1.1371 × 103 4.6347 × 101 1.7377 × 102 1.3154 × 102 9.0079 × 101 8.3278 × 101 7.9512 × 101 2.5999 × 102 1.0258 × 102 1.9254 × 102
CEC2017-F8 Avg 1.6780 × 103 1.8504 × 103 3.2148 × 103 1.9324 × 103 2.3152 × 103 2.0340 × 103 2.3322 × 103 1.2844 × 103 1.8498 × 103 1.3861 × 103 1.7421 × 103 1.3783 × 103
Std 1.5143 × 102 6.6795 × 101 2.0091 × 102 3.9529 × 101 1.3760 × 102 5.8349 × 101 7.0194 × 101 7.6786 × 101 4.4657 × 101 8.2525 × 101 4.5899 × 101 9.7207 × 101
CEC2017-F9 Avg 2.7627 × 104 4.0582 × 104 1.3782 × 105 5.2905 × 104 7.2508 × 104 6.3180 × 104 7.6051 × 104 2.1871 × 104 2.4921 × 104 2.3334 × 104 1.3467 × 104 2.2034 × 104
Std 6.1878 × 103 5.0439 × 103 2.4246 × 104 6.9337 × 103 2.0754 × 104 4.5858 × 103 6.4651 × 103 5.6326 × 103 5.4601 × 102 4.0579 × 103 5.5337 × 103 5.8177 × 103
CEC2017-F10 Avg 2.9692 × 104 2.9463 × 104 3.2424 × 104 3.1754 × 104 2.7659 × 104 2.2785 × 104 3.1093 × 104 1.4123 × 104 1.7588 × 104 1.4630 × 104 3.1488 × 104 1.9417 × 104
Std 8.8045 × 102 6.5356 × 102 1.0151 × 103 5.7956 × 102 1.8443 × 103 1.1431 × 103 1.2173 × 103 1.2816 × 103 1.4807 × 103 1.0939 × 103 4.1840 × 102 1.6947 × 103
CEC2017-F11 Avg 5.4010 × 104 1.4751 × 105 5.9343 × 105 3.8504 × 105 3.0424 × 105 9.6788 × 104 1.8587 × 105 3.9284 × 104 1.5582 × 105 1.9289 × 104 1.5393 × 105 1.4830 × 105
Std 9.5361 × 103 1.8515 × 104 1.4287 × 105 5.0119 × 104 1.1249 × 105 1.7123 × 104 2.1232 × 104 9.7679 × 103 2.2712 × 104 5.7574 × 103 2.5620 × 104 1.2877 × 105
CEC2017-F12 Avg 3.2418 × 107 1.1401 × 108 1.6375 × 1011 3.9752 × 109 1.3002 × 1010 1.3683 × 109 1.2723 × 1011 1.8701 × 108 1.2000 × 108 1.5223 × 108 1.9574 × 107 2.0890 × 108
Std 1.3074 × 107 3.3589 × 107 5.0683 × 1010 6.1004 × 108 3.6277 × 109 4.6261 × 108 1.3398 × 1010 6.1129 × 107 7.0411 × 107 5.9585 × 107 1.9424 × 107 1.1495 × 108
CEC2017-F13 Avg 7.4980 × 103 8.4994 × 103 3.1108 × 1010 3.2949 × 106 7.5206 × 108 1.8581 × 107 3.0491 × 1010 9.5382 × 105 2.8394 × 104 6.8695 × 104 8.3729 × 103 8.7352 × 104
Std 4.1625 × 103 2.7723 × 103 1.3405 × 1010 5.9783 × 106 3.5623 × 108 4.6441 × 106 3.6630 × 109 1.6060 × 105 1.1832 × 104 2.7468 × 104 3.6506 × 103 1.1329 × 105
CEC2017-F14 Avg 4.6911 × 105 1.6863 × 106 9.3110 × 107 3.6340 × 107 1.3004 × 107 5.5380 × 106 2.5357 × 107 1.8660 × 106 1.9371 × 106 1.9558 × 106 2.2157 × 106 4.6305 × 105
Std 2.2471 × 105 6.0757 × 105 6.2776 × 107 1.0967 × 107 6.8054 × 106 2.1601 × 106 1.2583 × 107 5.5252 × 105 1.0049 × 106 5.7638 × 105 1.2375 × 106 3.5608 × 105
CEC2017-F15 Avg 3.3766 × 103 3.6367 × 103 4.0026 × 109 4.1738 × 106 1.2211 × 108 4.2001 × 106 1.1094 × 1010 3.6963 × 105 1.0177 × 104 4.5049 × 104 5.2915 × 103 1.0091 × 104
Std 1.5706 × 103 1.7913 × 103 2.8796 × 109 4.6077 × 106 9.1026 × 107 1.2887 × 106 2.3587 × 109 7.5760 × 104 5.3278 × 103 2.0120 × 104 4.2847 × 103 4.5352 × 103
CEC2017-F16 Avg 7.8186 × 103 9.1635 × 103 1.7483 × 104 1.1184 × 104 1.5729 × 104 8.8168 × 103 1.6249 × 104 5.7003 × 103 6.3152 × 103 5.6163 × 103 8.9219 × 103 5.4772 × 103
Std 1.5412 × 103 5.4547 × 102 3.5943 × 103 3.6526 × 102 2.1188 × 103 7.8236 × 102 1.4350 × 103 6.5925 × 102 7.7871 × 102 8.7931 × 102 4.4221 × 102 7.5669 × 102
CEC2017-F17 Avg 5.6173 × 103 6.2777 × 103 1.4027 × 104 7.7639 × 103 1.3596 × 104 6.8174 × 103 8.2229 × 104 5.2902 × 103 6.1276 × 103 4.7563 × 103 6.5941 × 103 5.0768 × 103
Std 7.9345 × 102 2.8262 × 102 1.5010 × 104 2.9988 × 102 8.8913 × 103 7.8199 × 102 7.6044 × 104 4.9333 × 102 6.5858 × 102 5.0227 × 102 2.9901 × 102 4.8688 × 102
CEC2017-F18 Avg 1.0813 × 106 2.4812 × 106 8.1950 × 107 7.0192 × 107 1.2183 × 107 5.8297 × 106 3.5956 × 107 2.2841 × 106 2.6029 × 106 3.9889 × 106 5.7476 × 106 5.4289 × 105
Std 7.0130 × 105 1.0646 × 106 5.1153 × 107 1.9672 × 107 5.8963 × 106 2.4408 × 106 1.8397 × 107 6.1524 × 105 1.3334 × 106 1.6816 × 106 2.6941 × 106 2.6153 × 105
CEC2017-F19 Avg 3.4315 × 103 3.4672 × 103 4.8042 × 109 5.2201 × 106 1.5203 × 108 1.6813 × 107 9.0696 × 109 7.4783 × 105 6.4428 × 103 4.8084 × 105 5.4243 × 103 8.5867 × 103
Std 2.0912 × 103 1.1943 × 103 3.6573 × 109 4.7932 × 106 1.1624 × 108 7.5953 × 106 2.7698 × 109 2.4031 × 105 6.8515 × 103 2.9005 × 105 3.6469 × 103 7.1556 × 103
CEC2017-F20 Avg 6.4975 × 103 6.7526 × 103 7.9528 × 103 7.3851 × 103 6.9086 × 103 6.0497 × 103 7.3168 × 103 4.7908 × 103 6.1338 × 103 4.8636 × 103 7.1456 × 103 5.9049 × 103
Std 6.3102 × 102 3.1485 × 102 6.8663 × 102 2.8324 × 102 5.4989 × 102 5.1158 × 102 4.1474 × 102 5.3416 × 102 6.8093 × 102 5.8773 × 102 2.8056 × 102 4.3728 × 102
CEC2017-F21 Avg 1.0227 × 104 1.2190 × 104 2.6740 × 104 1.3919 × 104 1.7615 × 104 1.5065 × 104 1.8318 × 104 6.9153 × 103 1.2534 × 104 7.9146 × 103 1.1745 × 104 8.0304 × 103
Std 1.8147 × 103 4.2747 × 102 1.8922 × 103 3.3733 × 102 1.0966 × 103 1.0553 × 103 7.2445 × 102 7.0400 × 102 1.1863 × 103 8.5967 × 102 3.8680 × 102 1.0582 × 103
CEC2017-F22 Avg 7.8809 × 104 7.8178 × 104 8.6996 × 104 8.0495 × 104 7.4772 × 104 6.6609 × 104 7.9341 × 104 4.2093 × 104 4.8863 × 104 3.8981 × 104 7.9588 × 104 5.1281 × 104
Std 2.1838 × 103 2.2231 × 103 2.9741 × 103 1.7274 × 103 4.4165 × 103 3.7331 × 103 7.7910 × 103 3.5686 × 103 4.0845 × 103 4.3535 × 103 2.0504 × 103 4.1180 × 103
CEC2017-F23 Avg 1.0894 × 104 1.2565 × 104 2.7840 × 104 1.3043 × 104 2.2972 × 104 2.1125 × 104 2.1446 × 104 7.6435 × 103 1.6528 × 104 8.7006 × 103 1.2131 × 104 7.8418 × 103
Std 1.4916 × 103 5.0827 × 102 1.8126 × 103 2.8550 × 102 2.0758 × 103 1.8550 × 103 1.1861 × 103 7.3097 × 102 1.8455 × 103 9.1541 × 102 5.1115 × 102 3.9286 × 102
CEC2017-F24 Avg 1.2521 × 104 1.5320 × 104 3.2885 × 104 1.4721 × 104 2.2665 × 104 2.0240 × 104 2.2824 × 104 1.1431 × 104 1.9379 × 104 1.0347 × 104 1.2908 × 104 1.1038 × 104
Std 1.6553 × 103 3.4463 × 103 2.2561 × 103 2.9783 × 102 1.3055 × 103 6.1119 × 102 5.5971 × 102 4.2468 × 103 7.1965 × 102 1.2912 × 103 4.6916 × 102 1.3300 × 103
CEC2017-F25 Avg 3.6172 × 103 3.8895 × 103 5.3289 × 104 5.4798 × 103 7.8490 × 103 4.5165 × 103 1.9248 × 104 3.6803 × 103 3.5893 × 103 3.4218 × 103 3.4703 × 103 3.6233 × 103
Std 5.8472 × 101 8.3122 × 101 1.3954 × 104 2.9856 × 102 5.5670 × 102 1.5445 × 102 1.2836 × 103 8.1869 × 101 6.2250 × 101 6.9247 × 101 8.5059 × 101 7.0563 × 101
CEC2017-F26 Avg 1.4887 × 104 1.8924 × 104 4.6981 × 104 1.6883 × 104 3.6841 × 104 2.8435 × 104 3.8626 × 104 1.5505 × 104 2.4446 × 104 1.4086 × 104 1.4805 × 104 1.5572 × 104
Std 2.2893 × 103 1.5169 × 103 4.8239 × 103 3.0219 × 102 3.3451 × 103 1.7968 × 103 4.1294 × 103 5.2015 × 103 3.9929 × 103 2.4920 × 103 2.1921 × 103 2.6741 × 103
CEC2017-F27 Avg 3.7033 × 103 3.8049 × 103 1.0022 × 104 4.1460 × 103 6.0261 × 103 5.2990 × 103 8.2725 × 103 3.7397 × 103 4.1165 × 103 3.6109 × 103 3.6145 × 103 3.9611 × 103
Std 7.7381 × 101 9.7903 × 101 2.2413 × 103 1.3579 × 102 9.7265 × 102 8.4598 × 102 9.1168 × 102 1.0382 × 102 4.8835 × 102 8.1372 × 101 8.2967 × 101 1.8744 × 102
CEC2017-F28 Avg 3.8982 × 103 4.3369 × 103 4.1110 × 104 1.0076 × 104 1.1486 × 104 5.6663 × 103 2.1716 × 104 3.8306 × 103 3.7256 × 103 3.5084 × 103 3.6124 × 103 3.7799 × 103
Std 1.2127 × 102 1.5143 × 102 6.0587 × 103 1.8533 × 103 9.3633 × 102 4.6061 × 102 1.9758 × 103 7.1264 × 101 5.6227 × 101 4.3896 × 101 6.4731 × 101 8.9309 × 101
CEC2017-F29 Avg 7.7284 × 103 9.2312 × 103 2.2438 × 104 9.9807 × 103 1.9045 × 104 1.0998 × 104 6.5193 × 104 7.3049 × 103 8.0970 × 103 7.5819 × 103 8.7124 × 103 7.5203 × 103
Std 1.0219 × 103 4.2578 × 102 1.1921 × 104 3.7509 × 102 3.7301 × 103 8.5332 × 102 3.5300 × 104 5.5987 × 102 7.1321 × 102 5.8173 × 102 6.0006 × 102 7.9185 × 102
CEC2017-F30 Avg 1.2135 × 105 5.5110 × 105 2.0139 × 1010 4.6468 × 106 1.5944 × 109 1.4641 × 108 2.6094 × 1010 5.2084 × 106 5.8463 × 105 1.0163 × 107 1.7563 × 104 1.6432 × 106
Std 6.7594 × 104 3.5660 × 105 1.1548 × 1010 1.6847 × 106 5.1328 × 108 6.1047 × 107 2.9071 × 109 1.2395 × 106 3.4602 × 105 4.1414 × 106 5.9044 × 103 1.5843 × 106

Bold values indicate the best result.

Table A6.

Detailed results of the Wilcoxon signed-rank test on CEC2017 (D = 10).

MSCPO vs. CPO GA DE WOA HHO DBO GJA SSA BBO LSHADE LSHADE-SPACMA
CEC2017-F1 + + + + + + + + + − −
CEC2017-F3 + + + + + + + + + = =
CEC2017-F4 + + + + + + + + + + −
CEC2017-F5 + + + + + + + + + + =
CEC2017-F6 + + − + + + + + + − +
CEC2017-F7 + + + + + + + + + + −
CEC2017-F8 + + + + + + + + + + =
CEC2017-F9 = + = + + + + + + = +
CEC2017-F10 = + + + + + = + + + −
CEC2017-F11 + + + + + + + + + + +
CEC2017-F12 + + + + + + + + + + +
CEC2017-F13 + + + + + + + + + + +
CEC2017-F14 = + + + + + + + + + +
CEC2017-F15 + + + + + + + + + = +
CEC2017-F16 + + + + + + + + + + +
CEC2017-F17 = + − + + + + + + + −
CEC2017-F18 + + + + + + + + + + +
CEC2017-F19 + + + + + + + + + + +
CEC2017-F20 + + = + + + + + + = +
CEC2017-F21 + + + + + + + + + = =
CEC2017-F22 = + + + + + + + + + +
CEC2017-F23 + + + + + + + + + + =
CEC2017-F24 = + + + + + + = + = =
CEC2017-F25 = + − + + + + + + = =
CEC2017-F26 + + + + + + − + = + +
CEC2017-F27 = + − + + + + + + − =
CEC2017-F28 + + + + + + + + + + +
CEC2017-F29 + + + + + + + + + + =
CEC2017-F30 − + + + + + + + + + =

Table A7.

Detailed results of the Wilcoxon signed-rank test on CEC2017 (D = 30).

MSCPO vs. CPO GA DE WOA HHO DBO GJA SSA BBO LSHADE LSHADE-SPACMA
CEC2017-F1 = + + + + + + = + − +
CEC2017-F3 + + + + + + = + − + =
CEC2017-F4 + + + + + + + + + + +
CEC2017-F5 + + + + + + − + − + −
CEC2017-F6 + + = + + + + + + − +
CEC2017-F7 + + + + + + − + = + −
CEC2017-F8 + + + + + + − + − + −
CEC2017-F9 + + + + + + + + + − +
CEC2017-F10 = + + = − + − − − + −
CEC2017-F11 + + + + + + = + + + +
CEC2017-F12 + + + + + + + + + + =
CEC2017-F13 = + + + + + + + + + =
CEC2017-F14 + + + + + + + + + + +
CEC2017-F15 + + + + + + + + + + +
CEC2017-F16 = + + + + + = + = + −
CEC2017-F17 + + + + + + + + + + +
CEC2017-F18 + + + + + + + + + + +
CEC2017-F19 + + + + + + + + + + +
CEC2017-F20 = + + + + + + + + + =
CEC2017-F21 = + + + + + = + + + =
CEC2017-F22 = + = = − + − − − + −
CEC2017-F23 + + + + + + − + = + −
CEC2017-F24 = + + + + + − + = + −
CEC2017-F25 + + + + + + + + + − −
CEC2017-F26 = + + + + + = + = + =
CEC2017-F27 + + = + + + + + + = +
CEC2017-F28 + + + + + + + + + = =
CEC2017-F29 + + + + + + + + + + =
CEC2017-F30 + + + + + + + + + + +

Table A8.

Detailed results of the Wilcoxon signed-rank test on CEC2017 (D = 50).

MSCPO vs. CPO GA DE WOA HHO DBO GJA SSA BBO LSHADE LSHADE-SPACMA
CEC2017-F1 + + + + + + + + + = +
CEC2017-F3 + + + + + + + + − + =
CEC2017-F4 + + + + + + + = = = =
CEC2017-F5 + + + + + + − + − + −
CEC2017-F6 + + + + + + + + + − +
CEC2017-F7 + + + + + + − + − = −
CEC2017-F8 + + + + + + − + − + −
CEC2017-F9 + + + + + + = + + − +
CEC2017-F10 = + + = − + − − − + −
CEC2017-F11 + + + + + + − + − + =
CEC2017-F12 + + + + + + + + + = +
CEC2017-F13 = + + + + + + + + + +
CEC2017-F14 + + + + + + + + + + =
CEC2017-F15 + + + + + + + + + + +
CEC2017-F16 + + + + + + = + = + =
CEC2017-F17 = + + + + + + + + + +
CEC2017-F18 + + + + + + + + + + =
CEC2017-F19 + + + + + + + = + + =
CEC2017-F20 = + + + + + − + = + =
CEC2017-F21 = + + + + + − + = + −
CEC2017-F22 = + + = − + − − − + −
CEC2017-F23 + + + + + + − + − + −
CEC2017-F24 + + + + + + = + = + −
CEC2017-F25 + + + + + + + + = = =
CEC2017-F26 + + + + + + − + = + =
CEC2017-F27 + + + + + + + + = = +
CEC2017-F28 + + + + + + + = − − =
CEC2017-F29 + + + + + + + + + + =
CEC2017-F30 + + + + + + + = + − +

Table A9.

Detailed results of the Wilcoxon signed-rank test on CEC2017 (D = 100).

MSCPO vs. CPO GA DE WOA HHO DBO GJA SSA BBO LSHADE LSHADE-SPACMA
CEC2017-F1 + + + + + + − − − − +
CEC2017-F3 + + + + + + + + + + +
CEC2017-F4 + + + + + + = = − − =
CEC2017-F5 + + + + + + − = − = −
CEC2017-F6 + + + + + + + + + − =
CEC2017-F7 + + + + + + − + − = =
CEC2017-F8 + + + + + + − + − = −
CEC2017-F9 + + + + + + − − − − −
CEC2017-F10 = + + − − + − − − + −
CEC2017-F11 + + + + + + − + − + +
CEC2017-F12 + + + + + + + + + − +
CEC2017-F13 + + + + + + + + + = +
CEC2017-F14 + + + + + + + + + + =
CEC2017-F15 = + + + + + + + + = +
CEC2017-F16 + + + + + + − − − + −
CEC2017-F17 + + + + + + = + − + −
CEC2017-F18 + + + + + + + + + + −
CEC2017-F19 = + + + + + + + + + +
CEC2017-F20 = + + + − + − − − + −
CEC2017-F21 + + + + + + − + − + −
CEC2017-F22 = + + − − = − − − = −
CEC2017-F23 + + + + + + − + − + −
CEC2017-F24 + + + + + + = + − = −
CEC2017-F25 + + + + + + + = − − =
CEC2017-F26 + + + + + + = + = = =
CEC2017-F27 + + + + + + = + − − +
CEC2017-F28 + + + + + + − − − − −
CEC2017-F29 + + + + + + = = = + =
CEC2017-F30 + + + + + + + + + − +

Table A10.

Error statistics of different algorithms on CEC2022 (D = 10).

ID Metric MSCPO CPO GA DE WOA HHO DBO GJA SSA BBO LSHADE LSHADE-SPACMA
CEC2022-F1 Avg 3.0000 × 102 3.0000 × 102 3.0001 × 102 3.1396 × 102 4.1790 × 104 2.9111 × 103 3.5281 × 103 3.0000 × 102 3.0012 × 102 1.9439 × 104 3.0000 × 102 1.8296 × 103
Std 1.0556 × 10−14 9.4383 × 10−3 2.4894 × 10−2 2.6545 × 101 1.3780 × 104 1.3046 × 103 1.2199 × 103 4.1977 × 10−4 3.0059 × 10−2 1.0688 × 104 0.0000 × 100 3.4982 × 103
CEC2022-F2 Avg 4.0126 × 102 4.0098 × 102 4.1909 × 102 4.2709 × 102 4.5788 × 102 4.0793 × 102 5.6525 × 102 4.0540 × 102 4.0888 × 102 4.4924 × 102 4.0580 × 102 4.0546 × 102
Std 2.5658 × 100 2.1326 × 100 2.6716 × 101 3.3995 × 101 2.2813 × 101 7.6889 × 10−1 1.0179 × 102 1.7888 × 101 2.1179 × 101 6.5876 × 101 3.2456 × 100 3.3753 × 100
CEC2022-F3 Avg 6.0000 × 102 6.0000 × 102 6.1368 × 102 6.3280 × 102 6.6330 × 102 6.0000 × 102 6.2379 × 102 6.0016 × 102 6.0032 × 102 6.4358 × 102 6.0000 × 102 6.0000 × 102
Std 5.2850 × 10−9 3.0241 × 10−7 1.1658 × 101 1.2668 × 101 1.0243 × 101 1.0970 × 10−13 5.6861 × 100 3.9650 × 10−1 2.1184 × 10−1 1.5115 × 101 4.7206 × 10−14 1.2762 × 10−2
CEC2022-F4 Avg 8.0792 × 102 8.1002 × 102 8.3363 × 102 8.2629 × 102 8.6980 × 102 8.2078 × 102 8.3430 × 102 8.1342 × 102 8.0869 × 102 8.3726 × 102 8.1298 × 102 8.0519 × 102
Std 3.0658 × 100 3.8922 × 100 9.9919 × 100 8.1727 × 100 1.2701 × 101 4.2988 × 100 5.1417 × 100 6.3463 × 100 3.5076 × 100 1.3366 × 101 3.7020 × 100 2.1808 × 100
CEC2022-F5 Avg 9.0000 × 102 9.0000 × 102 1.4431 × 103 1.3815 × 103 9.2504 × 102 9.0001 × 102 1.0836 × 103 9.0032 × 102 9.0017 × 102 1.6221 × 103 9.0000 × 102 9.0013 × 102
Std 0.0000 × 100 1.0622 × 10−10 1.0555 × 102 1.6307 × 102 7.7149 × 100 1.0565 × 10−2 7.5417 × 101 5.7824 × 10−1 3.7403 × 10−1 4.2522 × 102 0.0000 × 100 2.5466 × 10−1
CEC2022-F6 Avg 1.8007 × 103 1.8038 × 103 3.5586 × 103 5.1615 × 103 3.7776 × 103 5.2438 × 103 3.7702 × 105 2.7387 × 103 3.6305 × 103 3.9181 × 103 1.8082 × 103 1.8176 × 103
Std 7.7366 × 10−1 2.0591 × 100 1.9423 × 103 3.1883 × 103 1.6342 × 103 2.7402 × 103 9.2769 × 105 1.1415 × 103 1.6861 × 103 1.7658 × 103 8.0712 × 100 1.6553 × 101
CEC2022-F7 Avg 2.0006 × 103 2.0006 × 103 2.0451 × 103 2.0672 × 103 2.0880 × 103 2.0067 × 103 2.0577 × 103 2.0218 × 103 2.0154 × 103 2.0783 × 103 2.0033 × 103 2.0051 × 103
Std 6.2531 × 10−1 8.1963 × 10−1 4.2407 × 101 2.9243 × 101 2.6968 × 101 6.3848 × 100 1.3924 × 101 8.2830 × 100 9.3245 × 100 3.0865 × 101 6.8814 × 100 7.5346 × 100
CEC2022-F8 Avg 2.2099 × 103 2.2058 × 103 2.2422 × 103 2.2368 × 103 2.2622 × 103 2.2187 × 103 2.2298 × 103 2.2208 × 103 2.2237 × 103 2.2363 × 103 2.2117 × 103 2.2168 × 103
Std 8.9399 × 100 6.1993 × 100 4.4113 × 101 1.4962 × 101 4.0554 × 101 4.1268 × 100 3.3831 × 100 3.3324 × 100 2.3062 × 101 1.1594 × 101 8.8353 × 100 7.2909 × 100
CEC2022-F9 Avg 2.5293 × 103 2.5293 × 103 2.5293 × 103 2.5774 × 103 2.6565 × 103 2.5293 × 103 2.6351 × 103 2.5293 × 103 2.5293 × 103 2.5829 × 103 2.5293 × 103 2.5293 × 103
Std 5.6014 × 10−13 7.3384 × 10−8 1.0151 × 10−1 4.4085 × 101 4.3490 × 101 0.0000 × 100 5.3496 × 101 6.8443 × 10−7 3.9917 × 10−3 4.6158 × 101 0.0000 × 100 0.0000 × 100
CEC2022-F10 Avg 2.5040 × 103 2.5074 × 103 2.6100 × 103 2.5970 × 103 2.6882 × 103 2.5000 × 103 2.5096 × 103 2.5648 × 103 2.5590 × 103 2.6830 × 103 2.5296 × 103 2.5003 × 103
Std 1.9908 × 101 2.6782 × 101 1.4289 × 102 1.0226 × 102 4.1556 × 102 2.8857 × 101 2.4456 × 101 5.7508 × 101 5.5898 × 101 2.8700 × 102 4.9468 × 101 8.7521 × 10−2
CEC2022-F11 Avg 2.8700 × 103 2.6433 × 103 2.8765 × 103 2.8178 × 103 3.2285 × 103 2.8888 × 103 2.8508 × 103 2.8506 × 103 2.9145 × 103 2.9693 × 103 2.8933 × 103 2.8824 × 103
Std 9.1539 × 101 1.1351 × 102 8.0193 × 101 1.1755 × 102 4.4235 × 102 3.7193 × 101 9.1627 × 101 1.1387 × 102 8.3446 × 101 2.6875 × 102 5.8329 × 101 1.1723 × 102
CEC2022-F12 Avg 2.8645 × 103 2.8647 × 103 2.8751 × 103 2.9138 × 103 2.9736 × 103 2.8614 × 103 2.8839 × 103 2.8656 × 103 2.8654 × 103 2.9007 × 103 2.8634 × 103 2.8645 × 103
Std 8.5176 × 10−1 8.3475 × 10−1 2.3293 × 101 5.6427 × 101 4.6002 × 101 1.2919 × 100 1.5831 × 101 1.5071 × 100 1.2106 × 100 3.6772 × 101 1.3339 × 100 1.2529 × 100

Bold values indicate the best result.

Table A11.

Error statistics of different algorithms on CEC2022 (D = 20).

ID Metric MSCPO CPO GA DE WOA HHO DBO GJA SSA BBO LSHADE LSHADE-SPACMA
CEC2022-F1 Avg 3.2227 × 102 4.1083 × 103 8.5854 × 104 3.4597 × 104 2.4776 × 104 9.0873 × 103 2.7225 × 104 3.0980 × 102 7.2206 × 103 3.0029 × 102 2.4391 × 103 1.0718 × 104
Std 2.8530 × 101 1.8467 × 103 2.4318 × 104 6.4895 × 103 7.3915 × 103 4.0540 × 103 6.5260 × 103 1.8252 × 101 5.9058 × 103 2.5899 × 10−1 1.3445 × 103 1.5389 × 104
CEC2022-F2 Avg 4.5267 × 102 4.5520 × 102 5.8842 × 102 4.4962 × 102 5.8895 × 102 5.0299 × 102 9.6322 × 102 4.5679 × 102 4.5223 × 102 4.5258 × 102 4.5088 × 102 4.3625 × 102
Std 1.3686 × 101 1.4748 × 101 5.1452 × 101 3.8123 × 100 5.5302 × 101 4.1197 × 101 1.5776 × 102 1.2871 × 101 1.7437 × 101 1.6091 × 101 1.2294 × 101 2.0080 × 101
CEC2022-F3 Avg 6.0000 × 102 6.0000 × 102 7.0530 × 102 6.0000 × 102 6.6627 × 102 6.6026 × 102 6.5689 × 102 6.0304 × 102 6.3982 × 102 6.0287 × 102 6.0000 × 102 6.0031 × 102
Std 4.9401 × 10−5 9.0930 × 10−4 1.4970 × 101 2.1979 × 10−5 9.3450 × 100 8.2508 × 100 7.5777 × 100 2.1173 × 100 1.4054 × 101 4.6658 × 100 1.1599 × 10−4 2.7839 × 10−1
CEC2022-F4 Avg 8.4041 × 102 8.6515 × 102 1.0294 × 103 9.1264 × 102 9.2964 × 102 8.8689 × 102 9.3031 × 102 8.4062 × 102 8.9022 × 102 8.4251 × 102 8.7498 × 102 8.2178 × 102
Std 1.7267 × 101 1.4722 × 101 3.4391 × 101 6.3304 × 100 3.9372 × 101 1.3494 × 101 1.4562 × 101 1.2239 × 101 1.9973 × 101 1.5628 × 101 1.0952 × 101 6.8461 × 100
CEC2022-F5 Avg 9.0068 × 102 9.0396 × 102 1.3985 × 103 9.7819 × 102 4.1318 × 103 2.9116 × 103 2.6806 × 103 9.1221 × 102 2.4275 × 103 1.0213 × 103 9.0014 × 102 9.2143 × 102
Std 9.2327 × 10−1 1.7783 × 101 6.4628 × 102 5.1807 × 101 1.6955 × 103 2.6748 × 102 2.8505 × 102 1.0033 × 101 6.7230 × 101 1.4267 × 102 2.3435 × 10−1 2.4905 × 101
CEC2022-F6 Avg 2.2095 × 103 4.3648 × 103 2.3763 × 104 2.4521 × 106 9.3182 × 105 1.6664 × 105 4.8946 × 107 2.6516 × 104 7.1037 × 103 4.3543 × 103 1.8881 × 104 2.0066 × 103
Std 5.5204 × 102 2.1664 × 103 1.9890 × 104 1.6279 × 106 2.7387 × 106 7.1147 × 104 5.5336 × 107 8.1657 × 103 6.1376 × 103 2.8197 × 103 1.4442 × 104 1.6498 × 102
CEC2022-F7 Avg 2.0383 × 103 2.0407 × 103 2.2631 × 103 2.0476 × 103 2.2243 × 103 2.1868 × 103 2.1601 × 103 2.0530 × 103 2.1459 × 103 2.0632 × 103 2.0463 × 103 2.0317 × 103
Std 5.9851 × 100 6.6625 × 100 7.4054 × 101 7.6928 × 100 6.4803 × 101 6.1328 × 101 2.9431 × 101 2.3244 × 101 8.4465 × 101 2.6170 × 101 6.6562 × 100 5.4122 × 100
CEC2022-F8 Avg 2.2274 × 103 2.2277 × 103 2.3411 × 103 2.2287 × 103 2.2900 × 103 2.2786 × 103 2.3398 × 103 2.2685 × 103 2.3000 × 103 2.2543 × 103 2.2332 × 103 2.2224 × 103
Std 1.4089 × 100 1.3656 × 100 8.7556 × 101 1.1251 × 100 5.8427 × 101 8.0489 × 101 1.0216 × 102 6.0135 × 101 8.7268 × 101 5.3719 × 101 3.6922 × 100 3.3623 × 100
CEC2022-F9 Avg 2.4808 × 103 2.4808 × 103 2.6650 × 103 2.4808 × 103 2.5597 × 103 2.4997 × 103 2.6240 × 103 2.4811 × 103 2.4808 × 103 2.4809 × 103 2.4808 × 103 2.4808 × 103
Std 1.3284 × 10−5 7.0012 × 10−3 4.8565 × 101 1.4915 × 10−4 5.2106 × 101 1.5454 × 101 6.1279 × 101 2.4580 × 10−1 2.0955 × 10−2 1.2294 × 10−1 8.4444 × 10−14 1.0782 × 10−7
CEC2022-F10 Avg 2.5159 × 103 2.5049 × 103 5.5443 × 103 2.5183 × 103 4.8477 × 103 3.8960 × 103 2.5570 × 103 2.6615 × 103 3.9993 × 103 2.8724 × 103 2.7069 × 103 2.5042 × 103
Std 4.0088 × 101 2.9491 × 101 1.4316 × 103 2.9033 × 101 1.0301 × 103 8.6680 × 102 1.6216 × 101 1.6642 × 102 9.1500 × 102 5.3073 × 102 4.5948 × 102 4.3441 × 101
CEC2022-F11 Avg 2.9000 × 103 2.9100 × 103 6.5796 × 103 2.9000 × 103 3.4629 × 103 3.1610 × 103 6.4783 × 103 3.0047 × 103 2.9233 × 103 2.9061 × 103 2.9000 × 103 2.9008 × 103
Std 5.5255 × 10−7 3.0515 × 101 1.2464 × 103 5.0947 × 10−6 2.7719 × 102 7.4123 × 102 4.0670 × 102 1.0317 × 101 7.7385 × 101 5.4364 × 100 1.8882 × 10−13 3.8306 × 100
CEC2022-F12 Avg 2.9465 × 103 2.9604 × 103 3.5174 × 103 2.9428 × 103 3.0638 × 103 3.1571 × 103 3.1621 × 103 2.9684 × 103 3.0173 × 103 2.9613 × 103 2.9473 × 103 2.9527 × 103
Std 6.0775 × 100 7.4974 × 100 1.6128 × 102 2.8884 × 100 8.1727 × 101 1.7807 × 102 5.7753 × 101 1.7443 × 101 5.5027 × 101 2.0146 × 101 9.4921 × 100 1.6655 × 101

Bold values indicate the best result.

Table A12.

Detailed results of the Wilcoxon signed-rank test on CEC2022 (D = 10).

MSCPO vs. CPO GA DE WOA HHO DBO GJA SSA BBO LSHADE LSHADE-SPACMA
CEC2022-F1 + + + + + + + + + = +
CEC2022-F2 − + + + + + + + = + +
CEC2022-F3 + + − + + + + + + − +
CEC2022-F4 + + + + + + = + + + −
CEC2022-F5 + + + + + + + + + = +
CEC2022-F6 + + + + + + + + + + +
CEC2022-F7 = + + + + + + + + = +
CEC2022-F8 = + + + + + + + + = +
CEC2022-F9 + + = + + + + = + = =
CEC2022-F10 = + − + + + + + + = =
CEC2022-F11 − + = + = = + + − = =
CEC2022-F12 = + − + + + + + + − =

Table A13.

Detailed results of the Wilcoxon signed-rank test on CEC2022 (D = 20).

MSCPO vs. CPO GA DE WOA HHO DBO GJA SSA BBO LSHADE LSHADE-SPACMA
CEC2022-F1 + + + + + + − + − + =
CEC2022-F2 = + = + + + + = = = −
CEC2022-F3 + + − + + + + + + − +
CEC2022-F4 + + + + + + = + = + −
CEC2022-F5 = + + + + + + + + − +
CEC2022-F6 + + + + + + + + + + =
CEC2022-F7 = + + + + + + + + + −
CEC2022-F8 = + + + + + = + = + −
CEC2022-F9 + + + + + + + + + − −
CEC2022-F10 = + + + + + + + + = =
CEC2022-F11 + + + + + + + + + − +
CEC2022-F12 + + − + + + + + + = =

Author Contributions

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

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The data presented in this study, including the MSCPO source code, the parameter settings of all compared algorithms, the raw outputs of all independent runs, and the random seeds used, are available from the corresponding author upon reasonable request.

Conflicts of Interest

The authors declare no conflicts of interest.

Funding Statement

This research was funded by the Science and Technology Research Project of Jiangxi Provincial Department of Education, grant number GJJ2402807, and the Jiangxi Provincial Natural Science Foundation of China, grant number 20252BAC240201.

Footnotes

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.

References

  • 1.Manguri A., Hassan H., Saeed N., Jankowski R. Topology, Size, and Shape Optimization in Civil Engineering Structures: A Review. CMES-Comput. Model. Eng. Sci. 2025;142:933–971. doi: 10.32604/cmes.2025.059249. [DOI] [Google Scholar]
  • 2.Li S.Y., Wei Y.L., Liu H. Resource Allocation for Multi-Type Enterprise Applications in Cloud Migration and Deployment Based on Improved Particle Swarm Optimization Algorithms. Eng. Lett. 2026;34:721–734. [Google Scholar]
  • 3.Fan Z.Y., Xiao Z.H., Li X., Huang Z.H., Zhang C. MSBWO: A Multi-Strategies Improved Beluga Whale Optimization Algorithm for Feature Selection. Biomimetics. 2024;9:572. doi: 10.3390/biomimetics9090572. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 4.Lusiyanti D., Anam S., Mahmudy W.F., Saadah U. A Novel Hyperparameter Tuning Strategy Using Spider Monkey Optimization for Deep Neural Networks in Water Quality Prediction; Proceedings of the 2025 International Electronics Symposium-IES; Surabaya, Indonesia. 5–7 August 2025; pp. 619–626. [Google Scholar]
  • 5.Xie J.Y., Min A., Kong W.B. Improvement of Signal Decomposition Variational Mode Decomposition Method Based on African Vulture Optimization Algorithm. Trait. DU Signal. 2025;42:19–27. doi: 10.18280/ts.420103. [DOI] [Google Scholar]
  • 6.Naser M.Z., Al-Bashiti M.K., Tapeh A.T.G., Naser A., Kodur V., Hawileh R., Abdalla J., Khodadadi N., Gandomi A.H., Eslamlou A.D. A Review of Benchmark and Test Functions for Global Optimization Algorithms and Metaheuristics. Wiley Interdiscip. Rev.-Comput. Stat. 2025;17:e70028. doi: 10.1002/wics.70028. [DOI] [Google Scholar]
  • 7.Mirjalili S. SCA: A Sine Cosine Algorithm for solving optimization problems. Knowl.-Based Syst. 2016;96:120–133. doi: 10.1016/j.knosys.2015.12.022. [DOI] [Google Scholar]
  • 8.Abdel-Basset M., Mohamed R., Abouhawwash M. Crested Porcupine Optimizer: A new nature-inspired metaheuristic. Knowl.-Based Syst. 2024;284:111257. doi: 10.1016/j.knosys.2023.111257. [DOI] [Google Scholar]
  • 9.Mirjalili S., Mirjalili S.M., Lewis A. Grey Wolf Optimizer. Adv. Eng. Softw. 2014;69:46–61. doi: 10.1016/j.advengsoft.2013.12.007. [DOI] [Google Scholar]
  • 10.Mirjalili S., Lewis A. The Whale Optimization Algorithm. Adv. Eng. Softw. 2016;95:51–67. doi: 10.1016/j.advengsoft.2016.01.008. [DOI] [Google Scholar]
  • 11.Storn R., Price K. Differential evolution—A simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 1997;11:341–359. doi: 10.1023/a:1008202821328. [DOI] [Google Scholar]
  • 12.Mirjalili S., Gandomi A.H., Mirjalili S.Z., Saremi S., Faris H., Mirjalili S.M. Salp Swarm Algorithm: A bio-inspired optimizer for engineering design problems. Adv. Eng. Softw. 2017;114:163–191. doi: 10.1016/j.advengsoft.2017.07.002. [DOI] [Google Scholar]
  • 13.Daoud M.S., Shehab M., Al-Mimi H.M., Abualigah L., Zitar R.A., Shambour M.K.Y. Gradient-Based Optimizer (GBO): A Review, Theory, Variants, and Applications. Arch. Comput. Methods Eng. 2023;30:2431–2449. doi: 10.1007/s11831-022-09872-y. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 14.Abdollahzadeh B., Gharehchopogh F.S., Mirjalili S. African vultures optimization algorithm: A new nature-inspired metaheuristic algorithm for global optimization problems. Comput. Ind. Eng. 2021;158:107408. doi: 10.1016/j.cie.2021.107408. [DOI] [Google Scholar]
  • 15.Ahmadianfar I., Heidari A.A., Gandomi A.H., Chu X.F., Chen H.L. RUN beyond the metaphor: An efficient optimization algorithm based on Runge Kutta method. Expert Syst. Appl. 2021;181:115079. doi: 10.1016/j.eswa.2021.115079. [DOI] [Google Scholar]
  • 16.Faramarzi A., Heidarinejad M., Stephens B., Mirjalili S. Equilibrium optimizer: A novel optimization algorithm. Knowl.-Based Syst. 2020;191:105190. doi: 10.1016/j.knosys.2019.105190. [DOI] [Google Scholar]
  • 17.Abdollahzadeh B., Gharehchopogh F.S., Mirjalili S. Artificial gorilla troops optimizer: A new nature-inspired metaheuristic algorithm for global optimization problems. Int. J. Intell. Syst. 2021;36:5887–5958. doi: 10.1002/int.22535. [DOI] [Google Scholar]
  • 18.Zhao F., Li Z.H., Guo P., Zhao A.P., Fu Y.F. Enhanced crested porcupine optimizer for numerical optimization and wireless sensor network deployment. Sci. Rep. 2025;15:40141. doi: 10.1038/s41598-025-23881-4. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 19.Pan P., Liu H., Lei B., Tang X.H. Bearing Fault Diagnosis via FMD with Parameters Optimized by an Improved Crested Porcupine Optimizer. Sensors. 2025;25:7339. doi: 10.3390/s25237339. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 20.Zhang H.L., Guo C.L., Zhai D.H., Wang Y.F., Liu H., Chen F.G., Xu D. Application of Improved Crown Porcupine Optimizer in UAV Path Planning Based on Dynamic Weighted JAYA-CPO Attack Strategy. Prot. Control Mod. Power Syst. 2025;10:101–127. doi: 10.23919/pcmp.2024.000413. [DOI] [Google Scholar]
  • 21.Cai T.T., Wang W., Yang Y.J. CO2 Concentration Control in Cleanrooms Using an Improved Crested Porcupine Algorithm. Electronics. 2025;14:435. doi: 10.3390/electronics14030435. [DOI] [Google Scholar]
  • 22.Luo D.M., Du K.L., Niu D.T. Prediction of chloride concentration in concrete under multi-salt environment: Optimization of integrated algorithm based on MSCPO and interpretability analysis. Mater. Des. 2025;251:113682. doi: 10.1016/j.matdes.2025.113682. [DOI] [Google Scholar]
  • 23.Yang D.X., Li G., Cheng G.D. On the efficiency of chaos optimization algorithms for global optimization. Chaos Solitons Fractals. 2007;34:1366–1375. doi: 10.1016/j.chaos.2006.04.057. [DOI] [Google Scholar]
  • 24.Yang D.X., Liu Z.J., Zhou J.L. Chaos optimization algorithms based on chaotic maps with different probability distribution and search speed for global optimization. Commun. Nonlinear Sci. Numer. Simul. 2014;19:1229–1246. doi: 10.1016/j.cnsns.2013.08.017. [DOI] [Google Scholar]
  • 25.Wang W.C., Tian W.C., Xu D.M., Zang H.F. Arctic puffin optimization: A bio-inspired metaheuristic algorithm for solving engineering design optimization. Adv. Eng. Softw. 2024;195:103694. doi: 10.1016/j.advengsoft.2024.103694. [DOI] [Google Scholar]
  • 26.Michalewicz Z., Janikow C.Z., Krawczyk J.B. A Modified Genetic Algorithm for Optimal Control Problems. Comput. Math. Appl. 1992;23:83–94. doi: 10.1016/0898-1221(92)90094-x. [DOI] [Google Scholar]
  • 27.Heidari A.A., Mirjalili S., Faris H., Aljarah I., Mafarja M., Chen H.L. Harris hawks optimization: Algorithm and applications. Future Gener. Comput. Syst. 2019;97:849–872. doi: 10.1016/j.future.2019.02.028. [DOI] [Google Scholar]
  • 28.Xue J.K., Shen B. Dung beetle optimizer: A new meta-heuristic algorithm for global optimization. J. Supercomput. 2023;79:7305–7336. doi: 10.1007/s11227-022-04959-6. [DOI] [Google Scholar]
  • 29.Zhang K., Zhao H., Li X., Fu C., Jin J. Gekko Japonicus Algorithm: A Novel Nature-inspired Algorithm for Engineering Problems and Path Planning. J. Bionic Eng. 2026;23:431–471. doi: 10.1007/s42235-025-00805-6. [DOI] [Google Scholar]
  • 30.Xue J., Shen B. A novel swarm intelligence optimization approach: Sparrow search algorithm. Syst. Sci. Control Eng. 2020;8:22–34. doi: 10.1080/21642583.2019.1708830. [DOI] [Google Scholar]
  • 31.Ouyang K., Wei D., Sha X., Yu J., Zhao Y., Qiu M., Fu S., Heidari A.A., Chen H. Beaver behavior optimizer: A novel metaheuristic algorithm for solar PV parameter identification and engineering problems. J. Adv. Res. 2025;84:525–555. doi: 10.1016/j.jare.2025.09.001. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 32.Tanabe R., Fukunaga A.S. Improving the Search Performance of SHADE Using Linear Population Size Reduction; Proceedings of the IEEE Congress on Evolutionary Computation (CEC); Beijing, China. 6–11 July 2014; pp. 1658–1665. [Google Scholar]
  • 33.Mohamed A.W., Hadi A.A., Fattouh A.M., Jambi K.M. LSHADE with Semi-Parameter Adaptation Hybrid with CMA-ES for Solving CEC 2017 Benchmark Problems; Proceedings of the IEEE Congress on Evolutionary Computation (CEC); Donostia, Spain. 5–8 June 2017; pp. 145–152. [Google Scholar]
  • 34.Demsar J. Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 2006;7:1–30. [Google Scholar]
  • 35.Rao R.V., Savsani V.J., Vakharia D.P. Teaching-learning-based optimization: A novel method for constrained mechanical design optimization problems. Comput.-Aided Des. 2011;43:303–315. doi: 10.1016/j.cad.2010.12.015. [DOI] [Google Scholar]
  • 36.Chen B.H., Chen Y.D., Cao L., Chen C.Z., Yue Y.G. An Improved Crested Porcupine Optimization Algorithm Incorporating Butterfly Search and Triangular Walk Strategies. Biomimetics. 2025;10:766. doi: 10.3390/biomimetics10110766. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 37.Xing C.H., Tang B., Xu G.H., Wu H.Y. An Improved Crested Porcupine Optimizer for Path Planning of Mobile Robot. Appl. Sci.-Basel. 2025;15:12595. doi: 10.3390/app152312595. [DOI] [Google Scholar]
  • 38.Liu H.J., Zhou R., Zhong X.Y., Yao Y., Shan W.F., Yuan J., Xiao J., Ma Y., Zhang K.P., Wang Z.B. Multi-Strategy Enhanced Crested Porcupine Optimizer: CAPCPO. Mathematics. 2024;12:3080. doi: 10.3390/math12193080. [DOI] [Google Scholar]
  • 39.Tizhoosh H.R. Opposition-based learning: A new scheme for machine intelligence; Proceedings of the International Conference on Computational Intelligence for Modelling, Control and Automation/International Conference on Intelligent Agents Web Technologies and International Commerce; Vienna, Austria. 28–30 November 2005; pp. 695–701. [Google Scholar]
  • 40.Rahnamayan S., Tizhoosh H.R., Salama M.M.A. Opposition-based differential evolution. IEEE Trans. Evol. Comput. 2008;12:64–79. doi: 10.1109/tevc.2007.894200. [DOI] [Google Scholar]
  • 41.Solis F.J., Wets R.J.B. Minimization by Random Search Techniques. Math. Oper. Res. 1981;6:19–30. doi: 10.1287/moor.6.1.19. [DOI] [Google Scholar]
  • 42.Rudolph G. Convergence Analysis of Canonical Genetic Algorithms. IEEE Trans. Neural Netw. 1994;5:96–101. doi: 10.1109/72.265964. [DOI] [PubMed] [Google Scholar]
  • 43.Awad N.H., Ali M.Z., Suganthan P.N., Liang J.J., Qu B.-Y. Problem Definitions and Evaluation Criteria for the CEC 2017 Special Session and Competition on Single Objective Real-Parameter Numerical Optimization. School of EEE, Nanyang Technological University; Singapore: School of Computer Information Systems, Jordan University of Science and Technology; Ar-Ramtha, Jordan: School of Electrical Engineering, Zhengzhou University; Zhengzhou, China: 2016. [Google Scholar]
  • 44.Kumar A., Price K.V., Mohamed A.W., Hadi A.A., Suganthan P.N. Problem Definitions and Evaluation Criteria for the CEC 2022 Special Session and Competition on Single Objective Bound Constrained Numerical Optimization. Nanyang Technological University; Singapore: 2021. [Google Scholar]
  • 45.Rao S.S. Engineering Optimization: Theory and Practice. New Age International; New Delhi, India: 2002. [Google Scholar]
  • 46.Coello C.A.C. Treating Constraints as Objectives for Single-objective Evolutionary Optimization. Eng. Optim. 2000;32:275–308. doi: 10.1080/03052150008941301. [DOI] [Google Scholar]
  • 47.Osyczka A., Krenich S., Karas K. Optimum Design of Robot Grippers using Genetic Algorithms; Proceedings of the Third World Congress of Structural and Multidisciplinary Optimization (WCSMO-3); Buffalo, NY, USA. 17–21 May 1999; pp. 241–243. [Google Scholar]
  • 48.Xie H.R., Mao J., Wan X.J., Bai Y.F. Adaptive multi mechanism integration in the crested porcupine optimizer for global optimization and engineering design problems. Sci. Rep. 2026;16:9275. doi: 10.1038/s41598-026-39222-y. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 49.Adalja D., Patel P., Mashru N., Jangir P., Arpita, Jangid R., Gulothungan G., Khishe M. A new multi objective crested porcupines optimization algorithm for solving optimization problems. Sci. Rep. 2025;15:14380. doi: 10.1038/s41598-025-99207-1. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 50.Zhao S.X., Zhou Y., Li C.L. A Multi-objective Crested Porcupine Optimization Algorithm Based on Multi-defense Strategies; Proceedings of the 44th Chinese Control Conference-CCC-Annual; Chongqing, China. 28–30 July 2025; pp. 2861–2866. [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Data Availability Statement

The data presented in this study, including the MSCPO source code, the parameter settings of all compared algorithms, the raw outputs of all independent runs, and the random seeds used, are available from the corresponding author upon reasonable request.


Articles from Biomimetics are provided here courtesy of Multidisciplinary Digital Publishing Institute (MDPI)

RESOURCES