Next Article in Journal
Analyzing the Properties of Graph Neural Networks with Evolutionary Algorithms
Previous Article in Journal
Matching Optimization for Automated Negotiation: From a Privacy-Enhanced Data Modeling Perspective
Previous Article in Special Issue
Pricing Optimization for High-Speed Railway Considering Hybrid Choice Behavior of Heterogeneous Passengers Under Stochastic Demand
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

EAPO: A Multi-Strategy-Enhanced Artificial Protozoa Optimizer and Its Application to 3D UAV Path Planning

1
School of Intelligent Manufacturing, Sichuan University Jinjiang College, Meishan 620860, China
2
Key Laboratory of Advanced Manufacturing Technology of the Ministry of Education, Guizhou University, Guiyang 550025, China
3
Engineering Training Center, Guizhou Institute of Technology, Guiyang 550025, China
*
Author to whom correspondence should be addressed.
Mathematics 2026, 14(1), 153; https://doi.org/10.3390/math14010153
Submission received: 5 December 2025 / Revised: 20 December 2025 / Accepted: 24 December 2025 / Published: 31 December 2025

Abstract

Three-dimensional unmanned aerial vehicle (UAV) path planning presents a challenging optimization problem characterized by high dimensionality, strong nonlinearity, and multiple constraints. To address these complexities, this study proposes an Enhanced Protozoan Optimizer (EAPO) by refining the initialization, behavioral decision-making, environmental perception, and population diversity preservation mechanisms of the original Protozoan Optimizer. Specifically: Latin hypercube sampling enriches initial population diversity; a behavior adaptation mechanism based on historical success dynamically adjusts the exploration-exploitation balance; environmental structure modeling using perception fields enhances local exploitation capabilities; an adaptive hibernation-reconstruction strategy boosts global escape ability. Ablation experiment validates the effectiveness of each enhancement module, while exploration-exploitation analysis demonstrates EAPO maintains an optimal balance throughout the optimization process. Comprehensive evaluations using CEC2022 and CEC2020 benchmark datasets, ten real-world engineering design problems, and four drone path planning scenarios of varying scales and complexities further validate its excellent performance. Experimental results demonstrate that EAPO outperforms the baseline APO and twelve advanced optimizers in convergence accuracy, stability, and robustness. In UAV path planning applications, paths generated by EAPO satisfy all constraints and outperform APO-generated paths across multiple path quality evaluation metrics concerning safety, smoothness, and energy consumption. Compared to APO, EAPO achieved average fitness improvements of 14.0%, 4.5%, 8.7%, and 31.42% across the four maps, respectively, fully demonstrating its practical value and formidable capability in tackling complex engineering optimization problems.

1. Introduction

In recent years, unmanned aerial vehicles (UAVs) have emerged as a new type of aircraft, finding extensive applications in numerous fields such as power line inspections, complex terrain exploration, disaster relief, and military reconnaissance. In these diverse and complex mission scenarios, UAV path planning is a core component for ensuring autonomous navigation. Its objective is to devise the safest and most efficient optimal flight trajectory at the lowest possible cost, while satisfying flight constraints and avoiding obstacles and threat zones [1]. However, path planning faces multiple challenges due to terrain variations in three-dimensional space, the distribution of threat sources, and the UAV’s own physical characteristics. The objective is to plan a safe, efficient, and optimal flight trajectory at the lowest possible cost while satisfying flight constraints and avoiding obstacles and threat zones [2]. However, due to terrain variations in three-dimensional space, the distribution of threat sources, and the UAV’s own physical constraints, path planning is inherently a complex optimization problem characterized by high dimensionality, nonlinearity, and multiple constraints. This places extremely high demands on the global search capability and convergence accuracy of algorithms [3].
In path planning research, traditional algorithms such as Dijkstra’s algorithm (1959) [4], A-star (1968) [5], Artificial Potential Field (APF, 1985) [6], and Rapidly Exploring Random Tree (RRT, 1996) [7] possess theoretical foundations. However, they often face issues such as low computational efficiency and susceptibility to local optima in high-dimensional complex environments. In recent years, meta-heuristic algorithms such as Particle Swarm Optimization (PSO, 1995) [8], Differential Evolution Algorithm (DE, 1995) [9], The Whale Optimization Algorithm (WOA, 2016) [10], Harris Hawks Optimization (HHO, 2019) [11], Arithmetic Optimization Algorithm (AOA, 2021) [12], Dung Beetle Optimizer (DBO, 2023) [13], and their variants have become effective tools for solving such NP-hard problems due to their robust global optimization capabilities and adaptability. Zhao et al. [14] proposed an unmanned vehicle path planning method based on the Adaptive Particle Swarm Optimization (APSO) algorithm. Through simulation experiments conducted on grid maps preprocessed by a map simplification strategy, they demonstrated that this method outperforms the original algorithm and comparison algorithms. Freitas et al. [15] introduced a novel path planner, DE3D-NURBS, based on the differential evolution (DE) algorithm for three-dimensional path planning with maximum and minimum ascent/descent angles and maximum curvature for robots. Simulation results demonstrated the proposed planner’s capability to generate feasible paths. Li et al. [16] introduced a learning-based approach through constructing a reverse population, incorporating a random convergence factor and endpoint random neighborhood perturbation. This yielded an improved whale optimization algorithm (IWOA) considering a global perspective, applied to trajectory planning for small unmanned aerial vehicle (UAV) swarms. You et al. [17] proposed a hybrid strategy Harris-Hawthorne optimization algorithm (MSHHO) by integrating four innovative strategies to enhance HHO’s effectiveness in local development and global exploration. Experiments demonstrated MSHHO’s efficacy in overcoming complex optimization challenges. To conserve UAV resources, reduce computational time, and enhance solution accuracy, Wang et al. [18] introduced compact and parallel techniques into the AOA algorithm, resulting in a parallel and compact AOA algorithm (PCAOA). Chen et al. [19] applied multiple strategies, including an adaptive Cauchy mutation policy, to the DBO algorithm, proposing an improved dung beetle optimizer (IDBO) for UAV path planning. Simulations validated that the proposed improved algorithm effectively solves UAV path planning problems.
The Artificial Protozoa Optimizer (APO) is a novel meta-heuristic algorithm proposed by Wang et al. [20] in 2024. It guides the search process by simulating the foraging, hibernation, and reproduction behaviors of protozoa, demonstrating outstanding performance in solving diverse and complex optimization problems. Nevertheless, the APO algorithm still exhibits deficiencies in convergence accuracy and stability when handling complex problems, necessitating further refinement and enhancement. In this regard, numerous valuable explorations have been conducted by scholars worldwide. Elamy et al. [21] proposed a machine learning approach utilizing the Artificial Protozoa Optimizer to predict the tribological properties of Cu-ZrO_2 nanocomposites. Liao et al. [22] integrated the Sine-Cosine Algorithm (SCA) and Leader Selection Strategy within the APO framework, thereby proposing the Sine-Cosine Multi-Objective APO (LSCMOAPO) algorithm. Its performance was validated on benchmark functions and five practical engineering problems. Wang et al. [23] introduced a novel membrane algorithm based on the Artificial Protozoa Optimizer (MAAPO), incorporating a parallel distributed paradigm within the Membrane Computation (MC) framework and an autotrophic model enhanced within APO. They applied MAAPO to solve multi-level threshold image segmentation problems using Otsu and Kapur entropy as objective functions. Bo et al. [24] enhanced APO’s efficiency and solution accuracy by implementing cyclone foraging strategies during the foraging phase and hybrid mutation strategies during the reproduction phase. These works lay a crucial foundation for APO algorithm improvements and applications, while also indicating that introducing more advanced search strategies and adaptive mechanisms holds promise for further performance enhancement.
This paper aims to systematically enhance the APO algorithm by proposing an Enhanced Artificial Protozoa Optimizer (EAPO). The core improvements include integrating a Latin hypercube sampling initialization strategy to ensure population diversity at the outset, introducing a behaviorally adaptive selection mechanism based on past success experience to dynamically balance exploration and exploitation, and combining a perceptual field-based environmental modeling strategy with an adaptive hibernation strategy to enhance the algorithm’s optimization efficiency and robustness in complex environments. To comprehensively validate EAPO’s effectiveness, this study conducts systematic testing across three benchmarks: First, evaluating its numerical optimization performance on the CEC2022 and CEC2020 benchmark suite; second, applying it to ten real-world engineering design problems; and finally, performing simulation validation in the more challenging scenario of UAV 3D path planning.
The primary contribution of this paper lies in proposing a systematic set of APO enhancement strategies and constructing the EAPO algorithm. Through comprehensive multi-dimensional and multi-scenario experimental validation, the superiority and practicality of EAPO in handling complex optimization problems have been fully demonstrated. The structure of this paper is as follows: Section 1 provides an introduction; Section 2 details the problem modeling for UAV path planning; Section 3 explains the fundamental principles of the original APO algorithm; Section 4 focuses on the various improvement strategies of the EAPO algorithm; Section 5 and Section 6 present experimental results and analyses of the algorithm on the CEC2022 benchmark suite, CEC2020 benchmark suite, engineering optimization problems, and UAV path planning, respectively; the Section 8 summarizes the research work and offers future directions.

2. Modeling of UAV Path Planning

This section addresses the modeling issues in UAV path planning from the perspectives of decision variables, objective functions, and cost function components [25,26,27,28].

2.1. Decision Variables

The UAV path is represented by  n waypoints. For planning convenience, each waypoint is described using spherical coordinates, with its decision variable vector  x defined as follows:
    x = r 1 , r 2 , , r n , θ 1 , θ 2 , , θ n , φ 1 , φ 2 , , φ n , v
where  r i represents the radial distance of the  i th waypoint;  θ i represents the elevation angle of the  i th waypoint, primarily used for vertical obstacle avoidance,  θ i π 4 , π 4 φ i represents the azimuth angle of the  i th waypoint, primarily used for horizontal detouring;  v represents the flight speed of the UAV.
The schematic diagram of the decision variable space is shown in Figure 1. Through the conversion function from spherical coordinates to Cartesian coordinates, the actual position sequence of the drone in three-dimensional space can be obtained as follows:
                x i = x 0 + j = 1 i r j · c o s θ j · c o s φ i y i = y 0 + j = 1 i r j · c o s θ j · c o s φ i z i = z 0 + j = 1 i r j · c o s θ j · c o s φ i
where  x 0 y 0 , and  z 0 represent the initial positions in the  x y , and  z directions, respectively.

2.2. Objective Function

The goal of path planning is to find an optimal solution that minimizes the total objective function value. The total objective function  F T consists of a weighted cost function  F W and an additional penalty term  F P , as shown in Equation (3).
    F T = F W + F P

2.2.1. Weighted Cost Function

The weighted cost function is a linearly weighted sum of the sub-cost functions, expressed as:
      F W = ω 1 · f 1 + ω 2 · f 2 + ω 3 · f 3 + ω 4 · f 4 + ω 5 · f 5 + ω 6 · f 6
where  f 1 to  f 6 and  ω 1 to  ω 6 respectively represent flight cost, altitude cost, threat cost, angle constraint, trajectory segment constraint, and no-fly zone constraint along with their respective weights, with the sum of all weights equaling 1. Threat cost and altitude cost are assigned higher weights to emphasize obstacle avoidance and safe flight.

2.2.2. Penalty Term

To strictly enforce avoidance of threat zones and no-fly zones, an additional penalty term is imposed beyond the weighted cost, as shown in Equation (5):
        F P = 100 · N r c + N a c + 10 · f 6
where  N r c and  N a c represent the number of times the path traverses the radar and artillery threat zones, respectively. The penalty coefficients (100 and 10) are fixed values determined through empirical analysis. The coefficient 100 for threat violations ensures that any infeasible solution (crossing threat zones) has a fitness value significantly worse than any feasible solution, effectively creating a barrier in the search space. The coefficient 10 for no-fly zones reflects their lower criticality compared to threat zones. These values remain constant throughout the optimization process to maintain consistent constraint prioritization.

2.3. Cost Function Components

2.3.1. Flight Path Cost

The flight path cost function  f 1 aims to generate the shortest or near-shortest flight path to minimize mission duration and energy consumption.  f 1 is defined as follows:
    f 1 = L L m a x
    L = i = 1 n 1 P i + 1 P i
    L m a x = 5 · P n P 1
where  P i is the Cartesian coordinate of the  i th waypoint;  L is the total actual path length;  L m a x is the maximum allowable path length.

2.3.2. Altitude Cost

Altitude Cost  f 2 ensures the UAV operates within safe altitude limits, avoiding collisions with terrain and complying with airspace management regulations.  f 2 is defined as follows:
  f 2 = k = 1 n ( f c o ( k ) + f b o ( k ) )
f c o k = 100 , i f   z k H t e r r i a n x k , y k + 10 0 , o t h e r w i s e
f b o k   =   10 , i f   z k < H m i n   o r   z k > H m a x 0 , o t h e r w i s e
where  f c o ( k ) represents the terrain collision penalty cost;  f b o ( k ) denotes the altitude over-limit penalty cost;  z k signifies the absolute elevation of the  k th waypoint;  H t e r r i a n x k , y k indicates the ground elevation at the horizontal coordinate;  H m a x and  H m i n respectively denote the upper and lower limits of absolute flight altitude.

2.3.3. Threat Cost

Threat cost  f 3 compels the UAV to avoid radar and artillery threat zones, modeled as spheres in three-dimensional space. The cost comprises a fixed penalty and a distance-based inverse penalty.  f 3 is defined as follows:
    f 3 = j = 1 N r 1 d i j 2 + 50 + j = 1 N a R j 2 d i j 2 + 1 + 50
where  d i j denotes the shortest three-dimensional Euclidean distance from the  i th track segment to the  j th threat center;  1 d i j 2 represents the radar range penalty term, where the penalty value increases sharply with decreasing distance;  R j signifies the effective radius of the  j th artillery threat zone.

2.3.4. Angular Constraint Cost

The angular constraint cost  f 4 limits the turning angle of the UAV between consecutive waypoints, ensuring the planned path aligns with the UAV’s physical maneuverability.  f 4 is defined as follows:
  f 4 = 10 , i f   θ k > θ m a x 0 ,     o t h e r w i s e        
where  θ k is the turning angle at the kth path point;  θ m a x is the maximum allowable turning angle.

2.3.5. Trajectory Segment Constraint Cost

To prevent planning overly dense and impractical paths, each trajectory segment must have sufficient length to meet the minimum step size requirement for flight control. trajectory segment constraint cost  f 5 is defined as follows:
f 5 = 5 , i f   P i + 1 P i < L m i n 0 , o t h e r w i s e                                          
where  L m i n is the minimum allowable track segment length.

2.3.6. No-Fly Zone Constraint Cost

The no-fly zone constraint cost  f 6 compels the UAV to avoid specific prohibited areas, modeled as vertical cylinders extending from the ground to a specified height.  f 6 is defined as follows:
  f 6 = i = 1 n 1 j = 1 N n f f n f i , j
where  N n f is the number of no-fly zones;  f n f ( i , j ) is the penalty cost resulting from the interaction between the  i th flight segment and the  j th no-fly zone. When the 2D projection of the  i th flight segment intersects the horizontal projection of the  j th no-fly zone and the altitude range of the  i th flight segment overlaps with the vertical range of the  j th no-fly zone,  f n f ( i , j ) is set to 50; otherwise, it is 0.

3. Artificial Protozoa Optimizer (APO)

The Artificial Protozoa Optimizer is a swarm intelligence optimization algorithm inspired by the survival behaviors of natural protozoa, such as Euglena. It simulates three fundamental behaviors—foraging, dormancy, and reproduction—executed by protozoa in their environment to seek optimal solutions to problems.

3.1. Foraging

Foraging behavior is categorized into autotrophic and heterotrophic modes, governed by the probability parameter  p a h , defined as:
      p a h = 1 2 · 1 + cos F E S M A X F E S · π
where  F E S and  M A X F E S represent the current function evaluation count and the maximum function evaluation count, respectively.
If  p a h is greater than the random number, execute the autotrophic mode; otherwise, execute the heterotrophic mode. The value of  p a h changes from 1 to 0 during iteration, so the algorithm favors autotrophy (exploration) in the early stages and heterotrophy (eploitation) in the later stages.

3.1.1. Autotrophic Mode

The autotrophic mode simulates euglena performing photosynthesis under light. If light is too intense, it moves away; if light is moderate, it moves toward it. In the algorithm, this corresponds to exploration, helping escape local optima. The position update formula in autotrophic mode is as follows:
  X i n e w = X i + f · X j X i + 1 n p k = 1 n p w a · X k X k + M f
    X i = x i 1 , x i 2 , , x i d i m ,                     X i = s o r t X i
    f = r a n d · 1 + c o s F E S M A X F E S · π
    n p m a x = p s 1 2
  w a = e f x k f x k + + e p s
M f d i   =   1 , i f   d i   i s   i n   r a n d p e r m d i m , d i m · i p s   0 , o t h e r w i s e
where  X i represents the current individual’s position;  X j denotes another randomly selected individual providing a random direction;  f is the foraging factor controlling the movement step size;  n p is the logarithm of neighbors in external factors, influencing the number of individuals referenced during search;  n p m a x denotes the maximum value of  n p X k and  X k + represent neighbors ranked below and above the current individual, respectively. Their difference introduces population diversity to enhance exploration;  r a n d indicates a random number selected from the interval [0, 1] uniformly distributed;  p s denotes the population size;  w a is the weight factor, whose value correlates with the fitness of neighbors, biasing the search toward more favorable regions;  M f is the foraging mapping vector. For the individual ranked  i , the number of dimensions updated is  d i m · i p s , meaning poorer individuals update more dimensions (exploration) while better individuals update fewer dimensions (exploitation);  d i denotes the dimension index, and  d i { 1,2 , , d i m } represents the Hadamard product.

3.1.2. Heterotrophic Mode

The heterotrophic mode simulates paramecia absorbing surrounding organic matter in darkness, moving toward areas rich in food. In the algorithm, this corresponds to exploitation, aiding in fine-grained search near good solutions. The position update formula in heterotrophic mode is as follows:
X i n e w = X i + f · X n e a r X i + 1 n p k = 1 n p w h · X i k X i + k M f
X n e a r = 1 ± R a n d · 1 F E S M A X F E S X i
w h = e f X i k f X i + k
R a n d = r a n d 1 , r a n d 2 , , r a n d d i m
where   X n e a r represents a position generated near the current individual, whose value gradually converges toward  X i with iterations, facilitating the transition from exploration to exploitation.  X i k and  X i + k denote fixed neighbors based on ranking, specifically the  ( i k ) th and  ( i + k ) th protozoa selected from  k paired neighbors. Notably, if  X i equals  X p s X i ± k is also set to  X p s w h denotes the weight factor.

3.2. Dormancy

When environmental conditions deteriorate, paramecia enter dormancy by forming protective cysts. In the algorithm, if a solution shows no improvement for an extended period, it is reinitialized. This increases population diversity and prevents getting stuck in local optima. The position update formula during dormancy is as follows:
  X i n e w = X m i n + R a n d X m a x X m i n
    X m i n = l b 1 , l b 2 , l b d i m , X m i n = l b 1 , l b 2 , l b d i m
where  X m a x and  X m i n denote the upper bound vector and lower bound vector, respectively, and  l b d i and  u b d i represent the lower bound and upper bound of the  d i th variable, respectively.

3.3. Reproduction

Euglena reproduce through binary fission, where one organism divides into two similar individuals. In the algorithm, this corresponds to copying the current solution and introducing a small perturbation to generate a new solution, aiding further exploration near good solutions. The position update formula during reproduction is as follows:
X i n e w = X i ± r a n d X m i n + R a n d X m a x X m i n M r
M r d i   =   1 , i f   d i   i s   i n   r a n d p e r m d i m , d i m · rand   0 , o t h e r w i s e
where  M r denotes the mapping vector during reproduction, which randomly determines which dimensions undergo variation.
The proportion fraction  p f determines what percentage of individuals in the current population will enter hibernation or reproduce, while the remaining individuals will forage. Its value is defined as:
p f = p f m a x · r a n d
where  p f m a x represents the maximum value of  p f .
Probability parameter  p d r controls the probability of executing hibernation and reproduction, defined as:
p d r = 1 2 · 1 + c o s 1 i p s · π
If  p d r is greater than the random number, hibernate; otherwise, perform reproduction. Lower-ranked individuals are more inclined to hibernate (explore) to escape local optima; higher-ranked individuals are more inclined to reproduce (exploit) to conduct detailed searches in high-quality regions.

4. Enhanced Artificial Protozoan Optimization Algorithm (EAPO)

Although APO demonstrates competitive performance, our preliminary analysis reveals four inherent limitations when addressing complex problems: (1) random initialization leads to uneven population distribution; (2) fixed behavior-selection probabilities fail to adapt to different optimization stages; (3) search directions rely heavily on stochastic perturbations without exploiting local landscape information; and (4) population diversity rapidly degrades in later iterations, increasing the risk of premature convergence.
To address these issues, this study proposes an Enhanced Artificial Protozoa Optimizer (EAPO) by introducing four complementary strategies, each explicitly designed to overcome a specific limitation of the original APO. Specifically, Latin hypercube sampling is used to improve the uniformity of the initial population. This strengthens global exploration in the early stage: a behaviorally adaptive selection strategy based on historical success is designed. It adjusts the selection probabilities of different behaviors according to their past performance. This helps balance exploration and exploitation during the search; A sensory field–based environmental modeling strategy is introduced. It provides local landscape information for guiding the search. The search direction becomes more informative instead of purely random; an adaptive hibernation–reconstruction mechanism is applied. It restores population diversity when stagnation occurs. This helps the algorithm escape local optima. These four strategies are mutually supportive and collectively form a coherent enhancement framework.

4.1. Latin Hypercube Sampling

In meta-heuristic algorithms, the quality of the initial population critically impacts both the convergence speed and the quality of the final solution. Traditional random initialization methods uniformly and independently sample within the solution space. In high-dimensional spaces, this approach is prone to issues such as uneven population distribution, incomplete coverage, and exploration blind spots. Consequently, the algorithm may converge slowly in the early stages or prematurely settle into local optima.
To address this issue, Latin hypercube sampling (LHS) [29,30] is adopted for population initialization. LHS is a stratified sampling method that promotes uniform coverage in each dimension. For a D-dimensional optimization problem, the search range of each dimension is first divided into  p s equal intervals, where  p s denotes the population size. A  p s × D matrix is then constructed, in which each column is a random permutation of integers from 1 to  p s . This matrix ensures that each interval index appears exactly once in every column.
Next, one sample point is randomly generated within each interval of every dimension. According to the matrix arrangement, these sample points are combined across dimensions to generate  p s initial D-dimensional individuals.
Through this approach, the initial population created by Latin hypercube sampling uniformly covers the entire search space across every dimension. This strategy directly addresses the uneven spatial coverage caused by random initialization in APO, thereby improving early-stage exploration efficiency.

4.2. Behavioral Adaptive Selection Strategy Based on Historical Success

This strategy differs from APO’s reliance on fixed formulas by dynamically adjusting the selection probability of each behavior (autotrophy, heterotrophy, dormancy, reproduction) in subsequent iterations based on its historical success rate during algorithm execution. Behaviors with higher success rates receive greater selection probabilities, thereby achieving adaptive exploration-exploitation adjustments within the algorithm. A schematic illustration of its specific mechanism is shown in Figure 2. In this figure, the success rate  S R ( a ) of each behavior is first mapped to a confidence value using the confidence-weighted mechanism defined in Equations (35) and (36), which prevents frequently selected behaviors from dominating the selection process. The exploration–exploitation balance mechanism further adjusts these confidence values according to the current iteration stage, as described in Equations (37)–(44). Finally, the normalized probabilities  p ^ a are obtained and used to stochastically select the corresponding behavior for each individual.

4.2.1. Historical Feedback Mechanism

First, define four basic behaviors:
    A = a 1 a 2 a 3 a 4
where  a 1 a 2 a 3 , and  a 4 represent autotrophy, heterotrophy, dormancy, and reproduction, respectively.
Second, for each behavior  a , set up two counters  S ( a ) and  C ( a ), representing the total number of successful attempts for action a and the total number of times action a was attempted, respectively.
Finally, define the base success rate  S R a for action a as:
S R a = S a + e C a + m · e
where  m = 4 represents the total number of behaviors;  e = 10 6 serves to prevent the denominator from becoming zero.

4.2.2. Sample Confidence Mechanism

To prevent over-reliance on behaviors with few attempts and better balance historical experience with exploring new behaviors, a sample confidence mechanism [31] is implemented.
First, the confidence of each behavior  a is calculated using a logarithmic function. This design prevents behaviors with many attempts from gaining excessive advantage and preserves opportunities for behaviors with fewer attempts. The confidence calculation formula for each behavior is given as follows:
    c o n f a = ln C a + 1 ln C m a x + 1
where  C m a x is the value attempted most frequently across all behaviors.
For new behaviors with few attempts, the  c o n f ( a ) value is low. This means that even with limited historical data, the behavior still receives a baseline  p a value, encouraging the algorithm to explore. For mature behaviors with many attempts, the  c o n f ( a ) value is high. This indicates the algorithm fully trusts the historical performance of this behavior, encouraging the use of known effective actions.
Next, the confidence is converted into a final confidence factor that influences decision-making, calculated using the formula:
  C F a = 1 ω + ω · c o n f a
where  C F ( a ) is the confidence factor, used to account for the reliability of the sample size;  ω is the confidence weight parameter, used to control the influence of the confidence level,  ω 0 , 1 .

4.2.3. Adaptive Mechanism for Exploration/Exploitation Phases

Since algorithms exhibit varying demands for exploration/exploitation during iteration, different weights are assigned to the four behaviors of APO across different iteration phases. The specific definitions are as follows:
  P F a = ω r · β r a + ω o i · β o i a
  ω r = 0.2 + 0.8 · cos F E S M A X F E S · π 2
  ω o i = 0.2 + 0.8 · sin F E S M A X F E S · π 2
  β r = 1.0 0.2 1.0 0.4
  β o i = 0.2 1.0 0.3 0.8
where  P F ( a ) represents the stage factor;  ω r and  ω o i denote the weights for exploration and exploitation, respectively;  β r a and  β o i ( a ) denote the weights for the exploratory and exploitative aspects of the four behaviors. In the early phase, exploratory behaviors  ( a 1 ,   a 3 ) receive higher weights, while in the later phase, exploitative behaviors  ( a 2 ,   a 4 ) receive higher weights.

4.2.4. Calculation of Combined Action Probability

For behaviors when  C a > 0 , the combined probability of each behavior being selected in the next iteration is:
    p a = S R a · C F a · P F a
For behaviors when  C a = 0 p a is defined by Formula (43) to assign different initial probabilities to untried behaviors based on the current stage, thereby encouraging attempts at corresponding behavior types at appropriate stages.
  p a = 0.3 + 0.4 · ω r ,   a a 1 , a 3 0.3 + 0.4 · ω o i , a a 2 , a 4
Ultimately, the probability  p ^ a that behavior  a is selected in the next iteration is normalized with respect to  p a :
  p ^ a = p a i = 1 m p a i

4.2.5. Behavior Selection Mechanism

A roulette wheel is used to select four behaviors:
  A c t i o n 1 = a 1 , i f     r a n d < p ^ a 1 p ^ a 1 + a 2 a 2 , o t h e r w i s e                                            
  A c t i o n 2 = a 3 , i f     r a n d < p ^ a 3 p ^ a 3 + a 4 a 4 , o t h e r w i s e                                            
To avoid over-reliance on early history, apply decay at the end of each iteration, that is:
  S t + 1 a = λ · S t a
  C t + 1 a = λ · C t a
where  S t + 1 a and  C t + 1 ( a ) represent the total number of successful occurrences of behavior  a and the total number of attempts at behavior  a during the  t + 1 iteration, respectively;  λ ( 0 ,   1 ) is the decay factor.

4.3. Environmental Structure Modeling Strategy Based on Sensory Field

The original APO algorithm relies on random mapping for its search direction, lacking utilization of local terrain structures. This results in significant jumps and insufficient local exploration capabilities. To address this, this paper introduces a local sensory field. By constructing an approximate gradient direction based on the quality differences in neighboring individuals, the search is guided toward potential optimal regions. This mechanism equips APO with basic environmental perception and shifts the search direction from blind perturbation to information-guided movement. Consequently, search stability and convergence accuracy are improved. The schematic diagram of sensory field modeling is shown in Figure 3. In this figure, the current solution is denoted by a star, with neighboring individuals distributed throughout the local search space and represented by dots with green outlines. The horizontal and vertical axes represent two dimensions of the decision space. The perceptual direction indicated by the arrow corresponds to the aggregated guidance vector defined in Equation (49), which is computed based on the fitness differences between the current individual and its neighbors.
We define the environmental perception model as:
      f X i = 1 N i X j N i f j f i X j X i
where  N i denotes the neighborhood set of the  i th individual (which may consist of the  k best individuals or the  k nearest neighbors);  f j represents the fitness of neighborhood individual  X j X j X i is the relative position vector, indicating the directional trend of the local landscape.
Autotrophic and heterotrophic behaviors are now updated via guided search, so Equations (17) and (23) become as follows:
  X i n e w = X i + f · X j X i + 1 n p k = 1 n p w a · X k X k + M f α t · N o r m a l i z e f X i
  X i n e w = X i + f · X n e a r X i + 1 n p k = 1 n p w h · X i k X i + k M f α t · N o r m a l i z e f X i
α t = α m a x F E S M A X F E S α m a x α m i n
where  α t is the stride factor,  α m a x and  α m i n are the initial stride and final stride, respectively;  N o r m a l i z e ( · ) is the vector normalization function, which prevents the stride from becoming excessively large.
The neighborhood-based gradient estimation relies on a fixed-size local neighborhood. Therefore, the computational complexity scales linearly with the neighborhood size and does not increase exponentially with the problem dimension. Consequently, the sensory field strategy does not significantly affect the overall runtime of the algorithm.

4.4. Adaptive Hibernation Reconstruction Strategy

To prevent premature convergence caused by population diversity degradation and enhance the ability to escape local optima, individuals with low energy or stuck in stagnation will transition from direct random reset to guided reconstruction. This introduces directionality, reduces blind jumping, and improves both population diversity and search efficiency. Consequently, Equation (27) is modified as follows:
  X i n e w = X w o r s t + R a n d X b e s t X w o r s t

4.5. EAPO Algorithm Pseudocode and Flowchart

The flowchart of the EAPO algorithm (Algorithm 1), which integrates Latin hypercube sampling initialization, behavior adaptation selection strategy based on historical success, environmental structure modeling strategy based on perceptual fields, and adaptive hibernation reconstruction mechanism, is shown in Figure 4. The time complexity analysis of EAPO is provided in Appendix A.1, and its pseudocode is as follows:
Algorithm 1 Pseudocode for EAPO
Input:   Population   size   N ,   maximum   evaluations   M a x F E S ,   bounds   l b   &   u b ,   dimension   d i m   objective function   objfun ,   objective   function   o b j f u n
Output:   Best   solution   X b e s t ,   best   fitness   B e s t _ S c o r e
Set Parameters:  λ   =   0.5 ,     α m a x = 0.9 α m i n = 0.1 ,   ω = 0.2 p f m a x = 0.1 n p = 1 ,   k = 5
1: Initialize population  X using Latin hypercube sampling and elite strategy.
2: Initialize behavior counter  S C .
3 : while   F E S     M a x F E S  do
4 :   Calculate   ω r ,   ω o i using Equations (38) and (39).
5 :   for   each   action   a = 1 to 4 do
6 :      if   c [ a ]   >   0 then
7 :      Calculate   S R a , C F a ,   P F a ,   p a using Equations (34), (36), (37) and (42).
8:   else
9 :      Calculate   p a using Equation (43).
10:   end if
11:    end for
12 :   Calculate   p ^ a   using   Equation   ( 44 ) .   Sort   the   population   by   fitness .   r i   Randomly   select   p s · p m a x · r a n d ( ) individuals.
13 :   for   i   =   1   to   p s do
14 :      if   i r i   then
15 :       Select   behavior   ( a 3 ,   a 4 ) using Equation (46).
16 :       if   a 3    then
17 :        update   X i n e w using Equation (52).
18:     else
19 :        update   X i n e w using Equation (29).
20:     end if
21:   else
22 :       Calculate   f ,   f X i ,   α t , f using Equations (19), (49) and (52).
23 :       Select   behavior   ( a 1 ,   a 2 ) using Equation (45).
24 :       if   a 1    then
25        update   X i n e w using Equation (50).
26:     else
27 :        update   X i n e w using Equation (51).
28:     end if
29 :       Update   S ,   C .   Update   X b e s t ,   B e s t _ S c o r e if better solution found.
30:  end for
31 : Update   S ,   C   using Equations (47) and (48).
32:   end while
33 :   Return   X b e s t , B e s t _ S c o r e .

5. Parameter Sensitivity Analysis of EAPO

This section presents a parameter sensitivity analysis of the proposed Enhanced Artificial Protozoa Optimizer (EAPO). The main purpose of this analysis is to determine suitable values for key parameters used in the algorithm.
Two parameters are investigated. The first is the neighborhood size  K in the sensory field strategy. This parameter determines how many neighboring individuals are used to estimate the search direction. The second parameter is the decay factor  λ in the historical success mechanism. This parameter controls how strongly past information influences behavior selection.
In the experiments, different values of  K and  λ are tested within predefined ranges, while all other parameters are kept unchanged. The results are compared to identify parameter values that lead to stable convergence and good solution quality. Based on these results, appropriate values for  K and  λ are selected for the proposed algorithm.
The experiments are conducted on the CEC2022 benchmark suite with problem dimensions of 10 and 20. For each parameter setting, the best value, mean value, and standard deviation are recorded. In addition, the Friedman test is used to evaluate the overall performance, and the average rankings are calculated. To enhance readability, detailed results are presented in Table A4, Table A5, Table A6 and Table A7 within Appendix B. The Friedman average rankings over the 12 CEC2022 functions for the two dimensions are shown in Figure 5 and Figure 6, respectively.
From the results, it can be observed that the parameter combination λ = 0.4 and k = 8 achieves the lowest average Friedman ranking in both dimensions. Therefore, these values are selected as the default parameter settings for EAPO in all subsequent experiments.

6. Algorithm Performance Testing and Analysis

This section evaluates the performance of EAPO through a series of benchmark tests and practical engineering applications. The evaluation consists of two main parts: standard benchmark function testing and real-world engineering problem validation.
First, ablation experiments are conducted to assess the effectiveness of each proposed strategy. Quantitative analysis is used to examine the algorithm’s ability to maintain a dynamic balance between exploration and exploitation. Subsequently, EAPO is systematically evaluated using the CEC2022 and CEC2020 benchmark suites, which contain 12 and 10 test functions, respectively. These benchmarks are designed to assess convergence accuracy, convergence speed, robustness, and adaptability across different function types. Finally, EAPO is applied to ten real-world engineering optimization problems to demonstrate its practical applicability and effectiveness in solving complex constrained optimization tasks. The detailed definitions of the CEC2022 and CEC2020 functions are provided in Table A1 and Table A2 of Appendix A.2.
We selected 13 representative optimization algorithms across four categories for comparison: (1) classic high-citation algorithms: PSO, DE, WOA, HHO, CMA-ES (Matrix Adaptation—Evolution strategies, 2016) [32]; (2) highly cited algorithms proposed within the last three years: DBO, AOA, HO (Hippopotamus Optimization Algorithm, 2024) [33], HOA (Hiking Optimization Algorithm, 2024) [34], TGCOA (The tetragonula carbonaria Optimization Algorithm, 2025) [35]; (3) mature algorithm variants: NCHHO (Nonlinear Chaotic Harris Hawks Optimization, 2021) [36], CL-PSO (Comprehensive Learning Particle Swarm Optimization, 2009) [37]; (4) the fundamental artificial protozoa optimization algorithm: APO.

6.1. Experimental Configuration

The population size for all algorithms was uniformly set to 100. Other parameters were configured according to their original references or widely adopted standard values, as detailed in Table 1. The maximum number of function evaluations in the CEC2022 and CEC2020 tests were set to 1000 × dim, while the maximum evaluations for real-world engineering problems were set to 20,000. All experiments were programmed and implemented in the MATLAB R2021b environment. To mitigate randomness, each algorithm was independently run 30 times on each test problem. The minimum, average, and standard deviation values from each run were recorded as performance metrics. For rigorous statistical analysis of experimental results, both the Wilcoxon rank-sum test and Friedman test were employed.

6.2. Ablation Experiment

To verify the effectiveness of the proposed improvement strategies, an ablation study was conducted on the CEC2022 benchmark suite with a problem dimension of 10. Four enhanced variants of the original APO algorithm were constructed by individually integrating each strategy: APO_L (APO with Latin Hypercube Sampling initialization), APO_H (APO with the success-history-based adaptive parameter adjustment), APO_S (APO with sensory-field-based environmental structure modeling strategy), and APO_D (APO with the adaptive dormancy–reconstruction mechanism).
The experimental results are summarized in Table 2, including the optimal values, mean values, standard deviations, and Friedman rankings obtained from testing. The best results in the table are highlighted in bold and underlined.. The results demonstrate that the fully enhanced EAPO algorithm, which integrates all four strategies, achieves the best overall performance and attains the highest number of optimal performance indicators across the test functions, ranking first overall. In addition, the single-strategy variants also exhibit competitive performance, as each of them achieves the best results on certain individual metrics or specific test functions, and all ranking higher than the original APO. These findings indicate that the proposed strategies are not only individually effective in improving the search performance of APO, but also complementary in nature, and their combination leads to a more robust and efficient optimization capability.

6.3. Exploration and Exploitation Capability Analysis

To quantitatively evaluate the global optimization performance of the algorithm, this section assesses the exploration and exploitation capabilities of EAPO using the population dimensional diversity metric [38,39]. This metric measures diversity changes during the search process by calculating the average deviation of population individuals from the median across each dimension. Its formula is as follows:
D i v = 1 D j = 1 D 1 N i = 1 N m e d i a n X j X i , j
On this basis, the exploration and exploitation ratios in each iteration of the algorithm can be defined as follows:
    E x p l o r a t i o n % = D i v D i v m a x
  E x p l o i t a t i o n % = D i v D i v m a x D i v m a x
where  D i v represents the diversity metric of the current population;  D i v m a x denotes the maximum diversity value recorded throughout the entire iteration process;  X i , j indicates the position of the  i th individual in the  j th dimension; and  m e d i a n ( X j ) signifies the median value of all individuals in the  j th dimensional variable.
Six functions from CEC2022 were selected for analysis, and the results are shown in Figure 7. The exploration and exploitation ratios of EAPO exhibit clear changes during the iteration process. In the early stage, the algorithm maintains a high exploration ratio. This allows extensive searching of the solution space to locate promising regions. As the iteration proceeds, the exploration ratio gradually decreases. At the same time, the exploitation ratio steadily increases.
This behavior indicates a gradual transition from global exploration to local refinement. It shows that EAPO can effectively maintain a dynamic balance between exploration and exploitation.

6.4. Testing on the CEC2022 Benchmark Suite

Test results obtained on the 10-dimensional and 20-dimensional CEC2022 benchmarks are shown in Table 3 and Table 4, including optimal values, averages, variances, p-values from the Wilcoxon rank-sum test, and Friedman rankings. The best results in the table are highlighted in bold and underlined. The symbols “+”, “=”, and “−” in the tables represent that EAPO’s performance is superior, equal, or inferior to other comparison algorithms, respectively, based on the Wilcoxon rank-sum test results. Iteration curves and boxplots for the 10-dimensional and 20-dimensional problems are shown in Figure 8, Figure 9, Figure 10 and Figure 11.
Based on experimental results, the EAPO algorithm demonstrates superior performance in both 10-dimensional and 20-dimensional problems. Specifically, in the 10-dimensional test, EAPO achieved the best results in 14 out of 36 metrics (covering 12 functions’ optimal values, means, and standard deviations), with an average ranking of 1.83; In the 20-dimensional test, EAPO performed even more outstandingly, achieving the best results in 20 metrics, with its average ranking further improving to 1.41. Based on the comprehensive evaluation of the above metrics, EAPO ranked first among all comparison algorithms, fully demonstrating its effectiveness and stability in solving optimization problems of different dimensions, with superior accuracy compared to the original APO algorithm.

6.5. Testing on the CEC2020 Benchmark Suite

The results obtained in the 10-dimensional and 20-dimensional tests of the CEC2020 benchmark suite are shown in Table 5 and Table 6. The meanings of the metrics in these tables are the same as those described in Section 6.4. The best results in the table are highlighted in bold and underlined. The average fitness iteration curves and box plots across different dimensions are shown in Figure 12, Figure 13, Figure 14 and Figure 15.
Based on experimental results, the EAPO algorithm also demonstrated strong performance on the 10-dimensional and 20-dimensional problems in CEC2020, particularly excelling in mean and standard deviation metrics, proving its robust capabilities. Specifically, in the 10-dimensional test, EAPO achieved the best performance in 13 out of 30 metrics (covering the optimal values, mean, and standard deviation of 10 functions), with an average ranking of 1.83. In the 20-dimensional test, EAPO achieved the best results in 14 metrics, with an average ranking of 1.41. Consequently, EAPO ranked first among all comparison algorithms.

6.6. Testing and Analysis of Engineering Optimization Problems

To validate the performance of the proposed algorithm in complex engineering optimization scenarios, this section selects 10 typical real-world engineering problems from the CEC2020 Real-World Constrained Optimization Problem Set (CEC2020-RW) as test benchmarks. CEC2020-RW encompasses optimization problems across multiple typical engineering application domains. Unlike conventional numerical optimization problems, these datasets exhibit highly nonlinear and nonconvex characteristics, incorporating diverse equality and inequality constraints that closely mirror real-world engineering optimization requirements [40,41]. From the industrial chemical processes, process synthesis and design, mechanical engineering, and livestock feed ration optimization domains within this test suite, several representative problems were selected from each field to form a total of 10 problems. These were solved using EAPO alongside 13 other algorithms. Definitions for these 10 typical engineering problems are provided in Table A3 of Appendix A.2, where  D g h , and  f denote problem dimension, inequality constraints, equality constraints, and known feasible optimal objective function values, respectively.
The test results are shown in Table 7, including optimal values, mean values, variance, Wilcoxon rank-sum test p-values, and Friedman rankings. The best results in the table are highlighted in bold and underlined. The experimental results demonstrate that EAPO achieved the best average values across all problems, the best standard deviation for all problems except RW02, RW03, and RW06, and ranked first in the Friedman ranking. This fully validates the algorithm’s advantages in solution accuracy and stability compared to other algorithms. Across multiple engineering problems with complex constraints, EAPO consistently converged stably to high-quality solutions, demonstrating its exceptional constraint handling capability and global optimization performance.

7. UAV Path Planning Simulation Experiment

7.1. Experimental Configuration for UAV Path Planning

Four map scenarios with different sizes and levels of complexity were constructed, as shown in Figure 16. In the figures, red spheres represent artilleries, and blue spheres represent radars. Blue cylinders denote no-fly zones. The square and the five-pointed star indicate the starting point and the target point, respectively.
Seven algorithms that showed strong performance on the CEC2022 and CEC2020 benchmark tests, together with the proposed EAPO, were selected for comparative UAV path planning experiments. For all algorithms, the population size was set to 100. The maximum number of function evaluations was set to 10,000. The remaining parameters were configured according to Table 1.
The constraint parameters of the unmanned aerial vehicle dynamics are listed in Table 8 to simulate realistic flight conditions. In the simulation environment, the number of waypoints was set to 10. The coordinates of the starting point and the target point, the number of intermediate waypoints, and the parameters of the threat zones and terrain model are also provided in Table 9.
To reduce randomness, each algorithm was independently executed 30 times. Performance was evaluated using the best, mean, and variance of fitness values, alongside Friedman’s test for ranking. In addition, path quality evaluation metrics were employed to conduct comparative assessments of the paths generated by EAPO and APO planning. The comparison metrics included path length, path smoothness, flight altitude variation, actual maximum climb angle, actual maximum descent angle, energy consumption, threat distance, and computation time, all averaged over 30 runs. These comparisons further validate the performance advantages of EAPO over APO in UAV path planning tasks.

7.2. Path Quality Evaluation Metrics

To comprehensively evaluate the quality of the planned UAV trajectories, multiple path evaluation metrics are adopted from geometric, kinematic, safety, and energy perspectives. These metrics provide a detailed assessment of path feasibility, smoothness, safety levels, and energy expenditure.

7.2.1. Path Length

The total path length  L is defined as the cumulative Euclidean distance between consecutive waypoints:
        L = i = 1 n 1 x i + 1 x i 2 + y i + 1 y 2 + z i + 1 z i 2
where  n is the total number of waypoints;  ( x i , y i , z i ) denotes the 3D coordinates of the  i th waypoint.

7.2.2. Path Smoothness

Path smoothness reflects the continuity of direction changes along the trajectory. First, the turning angle between consecutive segments is calculated as:
θ i = arccos v i · v i + 1 v i v i + 1
where  θ i is the turning angle between two adjacent segments;  v i and  v i + 1 are consecutive path segment vectors.
Based on the accumulated turning angles, the smoothness index  S is defined as:
  S = 1 1 + θ i

7.2.3. Altitude Variation

Altitude variation is used to evaluate vertical motion stability and is quantified by Equation (60).
      H t o t a l = z i + 1 z i
The altitude range is defined as:
  H r a n g e = z m a x z m i n
where  H t o t a l and  H t o t a l measure altitude fluctuation.

7.2.4. Climb and Descent Angles

The climb or descent angle  ψ i at each path segment is computed as:
  ψ i = arctan z i + 1 z i x i + 1 x i 2 + y i + 1 y i 2

7.2.5. Threat Distance

The threat distance is defined as the minimum clearance between the planned path and a threat region. Each threat region is modeled as a sphere, and the distance is computed as the shortest distance from a path segment to the surface of the sphere. If the path intersects the threat region, the threat distance is set to zero. The threat distance  d t h r e a t is calculated as:
    d t h r e a t = max 0 , P c l o s e s t O R
where  P c l o s e s t denotes the closest point on the path segment to the threat center;  O is the center of the spherical threat region;  R is the radius of the threat sphere including the safety margin.

7.2.6. Energy Consumption

The total energy consumption  E is estimated as:
E = k 1 L + k 2 H c l i m b + k 3 θ i
where  k 1 k 2 and  k 3 represent the coefficients for horizontal flight, climbing, and turning energy costs, respectively;  H c l i m b is the accumulated climbing altitude.

7.3. Analysis of Experimental Results

The optimal UAV path planning results and the corresponding average convergence curves in four simulated environments are shown in Figure 17, Figure 18, Figure 19 and Figure 20. The results indicate that EAPO successfully avoids all threat zones and no-fly zones and generates feasible paths from the starting point to the target point. The planned paths satisfy the imposed constraints and maintain good smoothness. Table 10 summarizes the fitness values obtained by EAPO and seven comparison algorithms across the four maps. Table 11, Table 12, Table 13 and Table 14 report the comparative results of path quality evaluation metrics for EAPO and APO. The optimum value for each indicator in the table is highlighted in bold and and underlined.
As shown in Table 10, EAPO achieves the best average fitness values on all four maps. Compared with the original APO algorithm, the improvements are 14.0%, 4.5%, 8.7%, and 31.42%, respectively. The composite average ranking of EAPO is 1.25, which consistently ranks first among all algorithms. On Maps 1 and 4, EAPO obtains the best results in terms of both the best value and the mean value. On Map 2, EAPO achieves the lowest mean fitness value among all algorithms. On Map 3, it provides the best mean value and the lowest standard deviation, indicating stable convergence behavior. Although HOA and DBO slightly outperform EAPO in terms of the best value on Maps 2 and 3, EAPO still shows clear overall advantages over the original APO algorithm.
The results in Table 11, Table 12, Table 13 and Table 14 further show that EAPO outperforms APO on most path quality metrics. On Maps 2 and 3, EAPO produces paths that are shorter, smoother, more energy-efficient, and safer. On Maps 1 and 4, although the path length is not shorter than that of APO, EAPO achieves better performance in terms of smoothness, elevation variation, and safety.
These results indicate that the proposed enhancement strategies improve both global exploration and local exploitation abilities. Although EAPO requires more computational time than APO, the performance improvement compensates for this increase in runtime.

8. Conclusions

To address the complex constraints and multimodal optimization challenges in three-dimensional path planning for UAVs, this paper proposes an Enhanced Artificial Protozoa Optimization (EAPO) algorithm. Building upon the original APO, this algorithm implements systematic enhancements across four dimensions: initialization strategy, behavioral decision mechanism, environmental perception capability, and population diversity maintenance. First, a hybrid initialization method combining Latin hypercube sampling enhances the uniformity and quality of the initial population within the search space, establishing a solid foundation for global exploration. Second, an adaptive behavior selection mechanism based on historical success is introduced, enabling the algorithm to dynamically choose search behaviors and effectively balance exploration and exploitation needs across different optimization phases. Additionally, the algorithm constructs an environmental structure model based on a perceptual field and designs an adaptive hibernation and reconstruction mechanism accordingly. This mechanism allows the algorithm to promptly escape from local optima when population activity declines, enhancing its global escape capability.
To address the complex constraints and multimodal optimization challenges in three-dimensional UAV path planning, this paper proposes an Enhanced Artificial Protozoa Optimizer (EAPO). The proposed algorithm is developed based on the original APO framework and introduces several targeted improvements. These improvements focus on population initialization, behavior selection, environmental perception, and population diversity maintenance.
First, a hybrid initialization strategy based on Latin hypercube sampling is adopted. This strategy improves the uniformity and quality of the initial population. It provides a more reliable starting point for global exploration. Second, a behaviorally adaptive selection mechanism based on historical success is introduced. This mechanism dynamically adjusts behavior selection probabilities during the optimization process. It helps maintain a balance between exploration and exploitation at different search stages. In addition, a sensory field–based environmental structure modeling strategy is incorporated. This strategy provides perceptual environmental information to guide the search direction. An adaptive hibernation–reconstruction mechanism is also designed. It restores population diversity when stagnation occurs and helps the algorithm escape from local optima.
The effectiveness of the proposed strategies is verified through ablation experiments. The exploration–exploitation balance is further analyzed using dedicated experiments. Extensive tests on the CEC2022 benchmark suite, the CEC2020 benchmark suite, and ten real-world engineering optimization problems demonstrate that EAPO outperforms the original APO and other advanced optimization algorithms in terms of convergence accuracy, stability, and robustness.
In four simulated UAV path planning scenarios with different sizes and complexities, EAPO consistently generates feasible paths that satisfy all constraints. The results in Table 11, Table 12, Table 13 and Table 14 further show that EAPO outperforms APO on most path quality evaluation metrics. On Maps 2 and 3, EAPO produces paths that are shorter, smoother, more energy-efficient, and safer. On Maps 1 and 4, although the path length is not shorter than that of APO, EAPO achieves better performance in terms of smoothness, altitude variation, and safety. Moreover, compared to the other seven algorithms, EAPO achieved the most favorable average fitness value, with Friedman ranking first overall. This indicates EAPO’s path planning capability surpasses that of the other algorithms.
Although EAPO demonstrated superior performance in experiments, future research can be expanded in several directions: first, extending EAPO to a multi-objective optimization framework to simultaneously optimize conflicting goals such as path length, energy consumption, and safety. Second, integrating deep learning or reinforcement learning methods to enhance the algorithm’s adaptive and real-time planning capabilities in dynamic threat environments. Third, further exploring the algorithm’s application potential in broader engineering scenarios such as power system dispatch, hyperparameter optimization, and image processing.

Author Contributions

Conceptualization, X.T. and C.J.; methodology, X.T.; software, X.T. and P.Q.; validation, X.T. and C.J.; data curation, C.J.; writing—original draft preparation, X.T.; writing—review and editing, X.T. and C.J.; All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Natural Science Foundation of China (No.52065010, No. 52165063 and No.52565031), the Science and Technology Program Projects of Meishan Municipal Science and Technology Bureau (No. 2024KJZD162), Guizhou Provincial Department of Science and Technology Projects (No. [2023]G094, No. [2023]G125 and No. [2024]K154), Guizhou Provincial Key Laboratory Construction Project (Qiankehe Platform ZSYS[2025]012) and Guizhou University Postgraduate Science and Technology Competition Cul-tivation Project (YKJP202306).

Data Availability Statement

The data used to support the findings of this study are included in the article.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A

Appendix A.1

Time Complexity of EAPO:
When  n p = 1 , the time complexity of APO is  O ( i t e r m a x · p s · ( log p s + d i m + f ( · ) ) , where  i t e r m a x is the maximum iteration count.
The additional overhead introduced by EAPO includes:
  • Latin hypercube sampling initialization: The additional complexity introduced by  O ( p s · d i m ) occurs only during the initialization phase and is therefore negligible.
  • Behavioral probability update based on historical success:  O ( p s ) . Negligible relative to the main loop.
  • Environmental structure modeling based on perceptual fields:  O ( p s · k · d i m ) . Due to  k p s , the actual impact is relatively limited.
  • Adaptive hibernation strategy:  O ( p s · p f · d i m ) . With  p f = 0.1 , the additional overhead is minimal.
Therefore, when  n p = 1 and  p f = 0.1 , the overall time complexity of EAPO is  O ( p s · ( d i m + f ( · ) ) ) + O ( i t e r m a x · p s · ( l o g ( p s ) + ( k + 1 ) · d i m + f ( · ) ) ) = O ( i t e r m a x · p s · ( l o g ( p s ) + ( k + 1 ) · d i m + f ( · ) ) )

Appendix A.2

Table A1. CEC2022 benchmark functions.
Table A1. CEC2022 benchmark functions.
TypeNo.Functions F i = F i ( X )
Unimodal Functions1Shifted and full Rotated Zakharov Function300
Basic Functions2Shifted and full Rotated Rosenbrock’s Function400
3Shifted and full Rotated Expanded Schaffer’s f6 Function600
4Shifted and full Rotated Non-Continuous Rastrigin’s Function800
5Shifted and full Rotated Levy Function900
Hybrid Functions6Hybrid Function 1 (N = 3)1800
7Hybrid Function 2 (N = 3)2000
8Hybrid Function 3 (N = 3)2200
Composition Functions9Composition Function 1 (N = 3)2300
10Composition Function 2 (N = 4)2400
11Composition Function 3 (N = 5)2600
12Composition Function 4 (N = 6)2700
Search   Range :   [ 100 ,   100 ] D
Table A2. CEC2020 benchmark functions.
Table A2. CEC2020 benchmark functions.
TypeNo.Functions F i = F i ( X )
Unimodal Functions1Shifted and Rotated Bent Cigar Function100
Basic Functions2Shifted and Rotated Schwefel’s Function1100
3Shifted and Rotated Rastrigin’s Function700
4Shifted and Rotated Lunacek bi-Rastrigin Function1900
Hybrid Functions5Hybrid Function 1 (N = 3)1700
6Hybrid Function 2 (N = 3)1600
7Hybrid Function 3 (N = 3)2100
Composition Functions8Composition Function 1 (N = 3)2200
9Composition Function 2 (N = 4)2400
10Composition Function 3 (N = 5)2500
Search   Range :   [ 100 ,   100 ] D
Table A3. Definitions of 10 Typical Real-World Engineering Problems.
Table A3. Definitions of 10 Typical Real-World Engineering Problems.
No.Name D g h f
Industrial Chemical Processes
RW01Heat Exchanger Network Design 211097.049 × 103
RW02Blending-Pooling-Separation problem380321.864 × 100
RW03Propane, Isobutane, n-Butane Non-sharp Separation480382.116 × 100
Process Synthesis and Design Problems
RW04Process synthesis problem 27902.925 × 100
RW05Multi-product batch plant101005.364 × 104
Mechanical Engineering Problems
RW06Optimal Design of Industrial refrigeration System141503.221 × 10−2
RW07Pressure vessel design4405.885 × 103
RW08Step-cone pulley problem5831.607 × 101
Livestock Feed Ration Optimization
RW09Beef Cattle (case 1)591414.551 × 103
RW10Beef Cattle (case 2)591413.349 × 103

Appendix B

Table A4. Sensitivity analysis results for parameter  λ on CEC2022 (dim = 10).
Table A4. Sensitivity analysis results for parameter  λ on CEC2022 (dim = 10).
FunctionItem Name λ
0.10.20.30.40.50.60.70.80.9
F1Best3.640 × 1032.979 × 1032.246 × 1032.452 × 1031.899 × 1032.187 × 1032.588 × 1031.003 × 1032.973 × 103
Mean5.365 × 1035.419 × 1034.344 × 1034.599 × 1035.576 × 1034.738 × 1035.743 × 1035.379 × 1035.271 × 103
Std1.611 × 1031.624 × 1031.367 × 1031.736 × 1032.252 × 1031.927 × 1031.744 × 1032.384 × 1031.828 × 103
Rank231875964
F2Best4.070 × 1024.069 × 1024.071 × 1024.068 × 1024.071 × 1024.072 × 1024.071 × 1024.070 × 1024.070 × 102
Mean4.085 × 1024.083 × 1024.083 × 1024.084 × 1024.094 × 1024.113 × 1024.090 × 1024.087 × 1024.109 × 102
Std1.453 × 1001.248 × 1009.623 × 10−11.151 × 1002.393 × 1001.018 × 1011.272 × 1001.125 × 1007.269 × 100
Rank824361759
F3Best6.000 × 1026.000 × 1026.000 × 1026.000 × 1026.000 × 1026.000 × 1026.000 × 1026.000 × 1026.000 × 102
Mean6.002 × 1026.002 × 1026.002 × 1026.001 × 1026.002 × 1026.002 × 1026.003 × 1026.004 × 1026.005 × 102
Std1.751 × 10−11.833 × 10−12.374 × 10−11.000 × 10−11.840 × 10−12.197 × 10−13.171 × 10−13.620 × 10−14.053 × 10−1
Rank217534698
F4Best8.088 × 1028.116 × 1028.110 × 1028.083 × 1028.112 × 1028.108 × 1028.116 × 1028.137 × 1028.076 × 102
Mean8.160 × 1028.174 × 1028.181 × 1028.154 × 1028.160 × 1028.166 × 1028.175 × 1028.179 × 1028.171 × 102
Std4.376 × 1003.710 × 1003.838 × 1004.165 × 1002.917 × 1003.642 × 1003.905 × 1002.496 × 1003.622 × 100
Rank419723586
F5Best9.010 × 1029.009 × 1029.011 × 1029.003 × 1029.005 × 1029.008 × 1029.018 × 1029.009 × 1029.020 × 102
Mean9.056 × 1029.042 × 1029.042 × 1029.036 × 1029.041 × 1029.046 × 1029.054 × 1029.057 × 1029.069 × 102
Std3.460 × 1002.349 × 1003.087 × 1002.705 × 1002.268 × 1002.661 × 1003.416 × 1003.560 × 1003.977 × 100
Rank321457689
F6Best2.177 × 1031.998 × 1031.942 × 1031.963 × 1032.032 × 1032.192 × 1032.066 × 1032.353 × 1032.018 × 103
Mean3.054 × 1032.717 × 1032.796 × 1033.019 × 1033.412 × 1033.139 × 1033.173 × 1033.383 × 1033.343 × 103
Std8.711 × 1026.923 × 1026.287 × 1028.537 × 1021.334 × 1039.945 × 1027.738 × 1027.866 × 1029.896 × 102
Rank632174598
F7Best2.025 × 1032.023 × 1032.025 × 1032.015 × 1032.017 × 1032.025 × 1032.025 × 1032.023 × 1032.026 × 103
Mean2.030 × 1032.031 × 1032.031 × 1032.029 × 1032.032 × 1032.032 × 1032.031 × 1032.032 × 1032.031 × 103
Std3.768 × 1004.223 × 1003.444 × 1004.787 × 1004.728 × 1004.068 × 1002.963 × 1003.152 × 1003.339 × 100
Rank623481597
F8Best2.224 × 1032.213 × 1032.215 × 1032.217 × 1032.215 × 1032.217 × 1032.215 × 1032.217 × 1032.221 × 103
Mean2.226 × 1032.224 × 1032.225 × 1032.223 × 1032.224 × 1032.224 × 1032.224 × 1032.224 × 1032.225 × 103
Std1.022 × 1003.216 × 1002.679 × 1002.950 × 1002.519 × 1002.673 × 1002.730 × 1002.670 × 1001.655 × 100
Rank216759438
F9Best2.529 × 1032.529 × 1032.529 × 1032.529 × 1032.529 × 1032.529 × 1032.529 × 1032.529 × 1032.529 × 103
Mean2.530 × 1032.530 × 1032.530 × 1032.530 × 1032.530 × 1032.530 × 1032.530 × 1032.531 × 1032.530 × 103
Std3.514 × 10−11.227 × 1001.063 × 1006.917 × 10−14.754 × 10−11.342 × 1001.370 × 1002.200 × 1004.480 × 10−1
Rank243615789
F10Best2.500 × 1032.500 × 1032.500 × 1032.500 × 1032.500 × 1032.500 × 1032.500 × 1032.500 × 1032.500 × 103
Mean2.502 × 1032.501 × 1032.501 × 1032.501 × 1032.500 × 1032.506 × 1032.500 × 1032.500 × 1032.501 × 103
Std4.413 × 1006.506 × 10−11.578 × 1004.345 × 1007.847 × 10−22.566 × 1015.978 × 10−21.105 × 10−11.522 × 100
Rank839457261
F11Best2.716 × 1032.696 × 1032.660 × 1032.683 × 1032.647 × 1032.722 × 1032.666 × 1032.655 × 1032.675 × 103
Mean2.738 × 1032.739 × 1032.739 × 1032.730 × 1032.727 × 1032.739 × 1032.734 × 1032.735 × 1032.736 × 103
Std1.215 × 1011.457 × 1012.229 × 1012.270 × 1013.000 × 1019.953 × 1001.942 × 1012.292 × 1012.045 × 101
Rank439517268
F12Best2.860 × 1032.862 × 1032.860 × 1032.862 × 1032.860 × 1032.862 × 1032.859 × 1032.862 × 1032.862 × 103
Mean2.864 × 1032.864 × 1032.864 × 1032.863 × 1032.864 × 1032.864 × 1032.863 × 1032.864 × 1032.863 × 103
Std1.027 × 1009.228 × 10−11.201 × 1007.583 × 10−11.329 × 1006.742 × 10−11.362 × 1006.663 × 10−15.828 × 10−1
Rank416879253
Mean Rank4.252.1755.174.755.1756.836.67
Table A5. Sensitivity analysis results for parameter  λ on CEC2022 (dim = 10).
Table A5. Sensitivity analysis results for parameter  λ on CEC2022 (dim = 10).
FunctionItem Name λ
0.10.20.30.40.50.60.70.80.9
F1Best1.454 × 1041.155 × 1041.258 × 1041.440 × 1041.574 × 1041.179 × 1041.535 × 1041.626 × 1041.531 × 104
Mean2.262 × 1042.233 × 1041.819 × 1042.092 × 1041.904 × 1041.568 × 1042.250 × 1042.572 × 1042.545 × 104
Std8.043 × 1039.517 × 1032.546 × 1035.583 × 1033.031 × 1032.439 × 1035.362 × 1035.489 × 1034.472 × 103
Rank652431798
F2Best4.449 × 1024.491 × 1024.491 × 1024.453 × 1024.491 × 1024.423 × 1024.491 × 1024.491 × 1024.491 × 102
Mean4.517 × 1024.555 × 1024.508 × 1024.537 × 1024.516 × 1024.497 × 1024.540 × 1024.527 × 1024.518 × 102
Std6.395 × 1001.024 × 1012.767 × 1008.569 × 1007.301 × 1004.496 × 1007.587 × 1007.812 × 1007.323 × 100
Rank185732964
F3Best6.001 × 1026.001 × 1026.001 × 1026.001 × 1026.001 × 1026.001 × 1026.001 × 1026.001 × 1026.001 × 102
Mean6.002 × 1026.002 × 1026.002 × 1026.002 × 1026.002 × 1026.002 × 1026.003 × 1026.002 × 1026.003 × 102
Std1.077 × 10−17.721 × 10−28.023 × 10−28.878 × 10−21.337 × 10−17.131 × 10−22.319 × 10−17.130 × 10−21.528 × 10−1
Rank734261859
F4Best8.392 × 1028.460 × 1028.542 × 1028.469 × 1028.451 × 1028.463 × 1028.457 × 1028.468 × 1028.462 × 102
Mean8.528 × 1028.556 × 1028.573 × 1028.545 × 1028.573 × 1028.546 × 1028.569 × 1028.532 × 1028.550 × 102
Std8.538 × 1006.799 × 1002.475 × 1008.171 × 1006.573 × 1006.112 × 1005.521 × 1005.115 × 1007.660 × 100
Rank569274813
F5Best9.000 × 1029.001 × 1029.005 × 1029.000 × 1029.003 × 1029.000 × 1029.006 × 1029.000 × 1029.000 × 102
Mean9.017 × 1029.009 × 1029.028 × 1029.053 × 1029.019 × 1029.019 × 1029.032 × 1029.016 × 1029.012 × 102
Std2.414 × 1007.856 × 10−12.713 × 1006.173 × 1001.541 × 1002.965 × 1004.780 × 1001.454 × 1001.051 × 100
Rank419763852
F6Best5.252 × 1033.185 × 1033.493 × 1032.360 × 1035.564 × 1033.745 × 1036.716 × 1033.330 × 1034.982 × 103
Mean9.018 × 1037.781 × 1031.126 × 1048.838 × 1031.319 × 1049.031 × 1032.244 × 1042.035 × 1041.823 × 104
Std3.432 × 1034.294 × 1037.965 × 1035.657 × 1035.972 × 1033.573 × 1032.047 × 1041.327 × 1041.009 × 104
Rank314265978
F7Best2.048 × 1032.052 × 1032.047 × 1032.055 × 1032.042 × 1032.046 × 1032.054 × 1032.044 × 1032.051 × 103
Mean2.065 × 1032.072 × 1032.067 × 1032.070 × 1032.067 × 1032.062 × 1032.067 × 1032.068 × 1032.063 × 103
Std8.660 × 1001.134 × 1011.009 × 1011.018 × 1011.183 × 1011.031 × 1019.601 × 1009.835 × 1007.442 × 100
Rank396851472
F8Best2.228 × 1032.227 × 1032.227 × 1032.229 × 1032.227 × 1032.228 × 1032.227 × 1032.227 × 1032.228 × 103
Mean2.230 × 1032.230 × 1032.230 × 1032.230 × 1032.230 × 1032.230 × 1032.229 × 1032.230 × 1032.230 × 103
Std1.030 × 1001.176 × 1001.721 × 1008.783 × 10−12.234 × 1001.214 × 1001.600 × 1001.729 × 1001.498 × 100
Rank916354278
F9Best2.481 × 1032.481 × 1032.481 × 1032.481 × 1032.481 × 1032.481 × 1032.481 × 1032.481 × 1032.481 × 103
Mean2.482 × 1032.481 × 1032.481 × 1032.481 × 1032.481 × 1032.481 × 1032.481 × 1032.482 × 1032.481 × 103
Std7.970 × 10−13.344 × 10−11.347 × 10−13.013 × 10−16.915 × 10−13.124 × 10−16.724 × 10−11.116 × 1006.122 × 10−1
Rank951382467
F10Best2.500 × 1032.500 × 1032.500 × 1032.500 × 1032.500 × 1032.500 × 1032.501 × 1032.500 × 1032.500 × 103
Mean2.521 × 1032.501 × 1032.501 × 1032.750 × 1032.504 × 1032.518 × 1032.534 × 1032.501 × 1032.511 × 103
Std5.197 × 1017.140 × 10−25.893 × 10−25.266 × 1021.064 × 1015.544 × 1016.802 × 1017.363 × 10−23.372 × 101
Rank615472938
F11Best2.901 × 1032.901 × 1032.902 × 1032.901 × 1032.738 × 1032.901 × 1032.901 × 1032.902 × 1032.901 × 103
Mean2.902 × 1032.902 × 1032.942 × 1032.902 × 1032.886 × 1032.938 × 1032.902 × 1032.942 × 1032.973 × 103
Std3.703 × 10−12.481 × 10−11.246 × 1027.237 × 10−15.203 × 1011.134 × 1024.294 × 10−11.248 × 1021.516 × 102
Rank127546389
F12Best2.941 × 1032.939 × 1032.936 × 1032.939 × 1032.939 × 1032.940 × 1032.938 × 1032.940 × 1032.941 × 103
Mean2.945 × 1032.944 × 1032.946 × 1032.945 × 1032.945 × 1032.943 × 1032.944 × 1032.945 × 1032.945 × 103
Std3.393 × 1002.125 × 1007.639 × 1003.704 × 1003.551 × 1002.440 × 1003.718 × 1004.017 × 1002.629 × 100
Rank347891256
Mean Rank4.753.835.424.585.752.676.085.756.17
Table A6. Sensitivity analysis results for parameter  k on CEC2022 (dim = 10).
Table A6. Sensitivity analysis results for parameter  k on CEC2022 (dim = 10).
FunctionItem Name k
12345678910
F1Best3.128 × 1032.559 × 1033.674 × 1032.096 × 1034.632 × 1033.356 × 1033.700 × 1033.433 × 1033.954 × 1032.599 × 103
Mean5.458 × 1033.985 × 1035.114 × 1034.894 × 1036.058 × 1036.273 × 1035.865 × 1035.272 × 1036.151 × 1034.610 × 103
Std1.946 × 1031.025 × 1031.541 × 1031.696 × 1031.177 × 1032.071 × 1031.248 × 1031.002 × 1031.779 × 1031.707 × 103
Rank61437108592
F2Best4.073 × 1024.072 × 1024.075 × 1024.074 × 1024.056 × 1024.073 × 1024.072 × 1024.072 × 1024.072 × 1024.075 × 102
Mean4.084 × 1024.080 × 1024.096 × 1024.100 × 1024.094 × 1024.089 × 1024.087 × 1024.088 × 1024.083 × 1024.091 × 102
Std9.251 × 10−11.006 × 1002.952 × 1003.695 × 1003.798 × 1009.312 × 10−19.228 × 10−19.202 × 10−19.169 × 10−17.495 × 10−1
Rank41710583629
F3Best6.002 × 1026.001 × 1026.001 × 1026.001 × 1026.000 × 1026.000 × 1026.001 × 1026.000 × 1026.000 × 1026.000 × 102
Mean6.005 × 1026.004 × 1026.004 × 1026.003 × 1026.003 × 1026.003 × 1026.003 × 1026.004 × 1026.003 × 1026.001 × 102
Std2.410 × 10−13.504 × 10−12.801 × 10−11.990 × 10−11.952 × 10−12.656 × 10−13.714 × 10−13.445 × 10−12.673 × 10−11.850 × 10−1
Rank10984625731
F4Best8.114 × 1028.089 × 1028.097 × 1028.154 × 1028.121 × 1028.137 × 1028.103 × 1028.101 × 1028.099 × 1028.128 × 102
Mean8.166 × 1028.151 × 1028.155 × 1028.167 × 1028.155 × 1028.182 × 1028.171 × 1028.159 × 1028.158 × 1028.176 × 102
Std4.633 × 1004.299 × 1003.858 × 1001.611 × 1002.125 × 1003.027 × 1004.182 × 1004.285 × 1003.761 × 1003.324 × 100
Rank41573108269
F5Best9.008 × 1029.009 × 1029.025 × 1029.009 × 1029.011 × 1029.009 × 1029.018 × 1029.011 × 1029.010 × 1029.014 × 102
Mean9.065 × 1029.057 × 1029.056 × 1029.052 × 1029.036 × 1029.036 × 1029.033 × 1029.047 × 1029.024 × 1029.059 × 102
Std4.760 × 1004.671 × 1002.922 × 1002.764 × 1002.367 × 1002.145 × 1001.223 × 1003.220 × 1009.747 × 10−14.160 × 100
Rank95108423617
F6Best2.659 × 1032.115 × 1032.139 × 1031.959 × 1032.094 × 1032.166 × 1031.922 × 1032.346 × 1032.066 × 1032.541 × 103
Mean3.968 × 1033.039 × 1033.421 × 1033.060 × 1032.905 × 1033.168 × 1032.713 × 1033.557 × 1032.970 × 1033.799 × 103
Std1.630 × 1031.174 × 1031.006 × 1037.081 × 1028.531 × 1029.538 × 1025.070 × 1029.450 × 1027.538 × 1029.708 × 102
Rank92763518410
F7Best2.025 × 1032.027 × 1032.025 × 1032.026 × 1032.026 × 1032.027 × 1032.024 × 1032.027 × 1032.029 × 1032.022 × 103
Mean2.031 × 1032.031 × 1032.029 × 1032.032 × 1032.030 × 1032.033 × 1032.031 × 1032.030 × 1032.032 × 1032.031 × 103
Std3.198 × 1002.697 × 1003.383 × 1003.674 × 1003.378 × 1003.968 × 1004.169 × 1002.515 × 1002.828 × 1004.330 × 100
Rank46183105297
F8Best2.221 × 1032.220 × 1032.221 × 1032.209 × 1032.216 × 1032.211 × 1032.220 × 1032.219 × 1032.220 × 1032.219 × 103
Mean2.224 × 1032.224 × 1032.225 × 1032.222 × 1032.221 × 1032.224 × 1032.225 × 1032.225 × 1032.225 × 1032.224 × 103
Std1.609 × 1002.604 × 1001.605 × 1005.887 × 1003.501 × 1004.970 × 1001.773 × 1002.305 × 1001.928 × 1002.718 × 100
Rank25631974108
F9Best2.529 × 1032.529 × 1032.529 × 1032.529 × 1032.529 × 1032.529 × 1032.529 × 1032.529 × 1032.529 × 1032.529 × 103
Mean2.530 × 1032.531 × 1032.530 × 1032.530 × 1032.530 × 1032.530 × 1032.530 × 1032.530 × 1032.530 × 1032.531 × 103
Std8.413 × 10−12.076 × 1004.889 × 10−12.068 × 1007.222 × 10−11.814 × 1001.379 × 1008.030 × 10−13.129 × 10−13.065 × 100
Rank51067392184
F10Best2.500 × 1032.500 × 1032.500 × 1032.500 × 1032.500 × 1032.500 × 1032.500 × 1032.500 × 1032.500 × 1032.500 × 103
Mean2.500 × 1032.500 × 1032.501 × 1032.500 × 1032.501 × 1032.501 × 1032.501 × 1032.500 × 1032.501 × 1032.500 × 103
Std1.133 × 10−12.319 × 10−21.465 × 10−16.388 × 10−27.403 × 10−17.931 × 10−21.817 × 10−16.871 × 10−22.892 × 10−15.213 × 10−2
Rank23518967104
F11Best2.679 × 1032.701 × 1032.713 × 1032.656 × 1032.716 × 1032.688 × 1032.706 × 1032.697 × 1032.645 × 1032.646 × 103
Mean2.737 × 1032.735 × 1032.738 × 1032.729 × 1032.738 × 1032.732 × 1032.743 × 1032.736 × 1032.736 × 1032.734 × 103
Std2.195 × 1011.743 × 1011.347 × 1012.651 × 1011.098 × 1011.905 × 1011.447 × 1011.762 × 1013.272 × 1013.212 × 101
Rank84612310597
F12Best2.862 × 1032.863 × 10032.863 × 1032.862 × 1032.860 × 1032.861 × 1032.860 × 1032.861 × 1032.862 × 1032.863 × 103
Mean2.863 × 1032.864 × 10032.864 × 1032.864 × 1032.863 × 1032.863 × 1032.863 × 1032.863 × 1032.864 × 1032.863 × 103
Std6.712 × 10−15.493 × 10−16.343 × 10−11.183 × 1001.210 × 1001.279 × 1001.166 × 1009.406 × 10−16.436 × 10−13.016 × 10−1
Rank28107645193
Mean Rank5.424.586.255.424.256.755.254.56.675.92
Table A7. Sensitivity analysis results for parameter  k on CEC2022 (dim = 20).
Table A7. Sensitivity analysis results for parameter  k on CEC2022 (dim = 20).
FunctionItem Name k
12345678910
F1Best1.313 × 1048.988 × 1031.140 × 1041.152 × 1041.288 × 1041.321 × 1041.429 × 1041.224 × 1041.258 × 1041.333 × 104
Mean2.256 × 1041.836 × 1042.359 × 1042.027 × 1041.882 × 1042.015 × 1042.009 × 1041.764 × 1042.433 × 1042.060 × 104
Std6.043 × 1035.429 × 1037.038 × 1038.987 × 1034.098 × 1036.461 × 1033.846 × 1033.764 × 1031.072 × 1045.498 × 103
Rank92103456187
F2Best4.491 × 1024.492 × 1024.491 × 1024.491 × 1024.491 × 1024.491 × 1024.491 × 1024.491 × 1024.491 × 1024.491 × 102
Mean4.541 × 1024.541 × 1024.564 × 1024.557 × 1024.530 × 1024.541 × 1024.521 × 1024.567 × 1024.552 × 1024.527 × 102
Std8.072 × 1008.240 × 1001.212 × 1011.020 × 1017.360 × 1001.052 × 1017.448 × 1001.082 × 1019.286 × 1008.937 × 100
Rank91068731452
F3Best6.002 × 1026.001 × 1026.001 × 1026.001 × 1026.001 × 1026.001 × 1026.001 × 1026.001 × 1026.001 × 1026.001 × 102
Mean6.003 × 1026.003 × 1026.002 × 1026.003 × 1026.003 × 1026.002 × 1026.002 × 1026.002 × 1026.002 × 1026.002 × 102
Std1.149 × 10−11.008 × 10−18.454 × 10−29.944 × 10−22.539 × 10−11.741 × 10−19.909 × 10−21.044 × 10−19.300 × 10−21.290 × 10−1
Rank10859413672
F4Best8.465 × 1028.453 × 1028.453 × 1028.512 × 1028.365 × 1028.273 × 1028.423 × 1028.460 × 1028.501 × 10028.431 × 102
Mean8.562 × 1028.530 × 1028.570 × 1028.571 × 1028.535 × 1028.530 × 1028.540 × 1028.549 × 1028.581 × 1028.556 × 102
Std6.388 × 1006.182 × 1005.873 × 1003.494 × 1006.710 × 1001.033 × 1017.164 × 1005.527 × 1005.408 × 1007.629 × 100
Rank72683514109
F5Best9.000 × 1029.001 × 1029.000 × 1029.001 × 1029.001 × 1029.002 × 1029.001 × 1029.011 × 1029.001 × 1029.004 × 102
Mean9.049 × 1029.031 × 1029.029 × 1029.019 × 1029.027 × 1029.017 × 1029.016 × 1029.043 × 1029.013 × 1029.017 × 102
Std7.111 × 1005.835 × 1003.551 × 1002.130 × 1002.247 × 1001.689 × 1001.169 × 1004.876 × 1001.452 × 1001.007 × 100
Rank82469531017
F6Best5.371 × 1032.468 × 1036.923 × 1034.078 × 1032.898 × 1033.524 × 1033.488 × 1032.682 × 1033.643 × 1034.973 × 103
Mean1.662 × 1041.591 × 1041.400 × 1041.283 × 1041.183 × 1041.089 × 1041.285 × 1049.385 × 1031.237 × 1041.030 × 104
Std7.920 × 1031.244 × 1045.953 × 1037.449 × 1038.854 × 1031.011 × 1046.398 × 1034.497 × 1038.187 × 1034.175 × 103
Rank10895327164
F7Best2.053 × 1032.053 × 1032.044 × 1032.059 × 1032.052 × 1032.054 × 1032.060 × 1032.052 × 1032.035 × 1032.043 × 103
Mean2.069 × 1032.062 × 1032.063 × 1032.070 × 1032.068 × 1032.063 × 1032.069 × 1032.066 × 1032.065 × 1032.061 × 103
Std7.043 × 1007.263 × 1001.284 × 1016.545 × 1001.464 × 1016.634 × 1005.752 × 1001.156 × 1011.550 × 1019.566 × 100
Rank10349718652
F8Best2.227 × 1032.228 × 1032.229 × 1032.226 × 1032.229 × 1032.226 × 1032.229 × 1032.228 × 1032.227 × 1032.226 × 103
Mean2.230 × 1032.230 × 1032.230 × 1032.229 × 1032.230 × 1032.229 × 1032.230 × 1032.230 × 1032.229 × 1032.229 × 103
Std1.474 × 1001.182 × 1008.012 × 10−11.305 × 1001.093 × 1001.409 × 1007.423 × 10−11.018 × 1001.504 × 1002.361 × 100
Rank97518361042
F9Best2.481 × 1032.481 × 1032.481 × 1032.481 × 1032.481 × 1032.481 × 1032.481 × 1032.481 × 1032.481 × 1032.481 × 103
Mean2.482 × 1032.481 × 1032.481 × 1032.482 × 1032.482 × 1032.481 × 1032.482 × 1032.481 × 1032.481 × 1032.482 × 103
Std5.243 × 10−13.630 × 10−14.709 × 10−15.124 × 10−16.593 × 10−15.065 × 10−11.153 × 1006.032 × 10−13.866 × 10−19.217 × 10−1
Rank94510871326
F10Best2.501 × 1032.500 × 1032.500 × 1032.500 × 1032.500 × 1032.500 × 1032.500 × 1032.500 × 1032.500 × 1032.500 × 103
Mean2.516 × 1032.512 × 1032.543 × 1032.518 × 1032.508 × 1032.537 × 1032.623 × 1032.513 × 1032.501 × 1032.510 × 103
Std3.072 × 1013.539 × 1011.040 × 1023.559 × 1011.564 × 1019.630 × 1013.824 × 1022.740 × 1017.912 × 10−22.270 × 101
Rank10528694137
F11Best2.905 × 1032.902 × 1032.902 × 1032.902 × 1032.902 × 1032.902 × 1032.901 × 1032.901 × 1032.901 × 1032.901 × 103
Mean2.988 × 1033.021 × 1032.902 × 1032.926 × 1032.902 × 1032.941 × 1032.943 × 1032.941 × 1032.955 × 1032.952 × 103
Std1.700 × 1021.912 × 1024.893 × 10−17.579 × 1015.263 × 10−11.239 × 1021.311 × 1021.227 × 1021.232 × 1021.167 × 102
Rank10963742815
F12Best2.937 × 1032.941 × 1032.938 × 1032.940 × 1032.940 × 1032.941 × 1032.939 × 1032.940 × 1032.935 × 1032.939 × 103
Mean2.944 × 1032.946 × 1032.944 × 1032.945 × 1032.945 × 1032.946 × 1032.946 × 1032.943 × 1032.944 × 1032.943 × 103
Std3.589 × 1002.610 × 1003.001 × 1003.427 × 1004.687 × 1003.069 × 1004.654 × 1002.995 × 1005.198 × 1002.867 × 100
Rank69357108142
Mean Rank8.925.755.426.256.084.584.174.584.674.58

References

  1. Jones, M.; Djahel, S.; Welsh, K. Path-planning for unmanned aerial vehicles with environment complexity considerations: A survey. ACM Comput. Surv. 2023, 55, 234. [Google Scholar] [CrossRef]
  2. Jiang, Y.; Xu, X.X.; Zheng, M.Y.; Zhan, Z.H. Evolutionary computation for unmanned aerial vehicle path planning: A survey. Artif. Intell. Rev. 2024, 57, 267. [Google Scholar] [CrossRef]
  3. Kumar, P.; Pal, K.; Govil, M.C. Comprehensive review of path planning techniques for unmanned aerial vehicles (uavs). ACM Comput. Surv. 2025, 58, 73. [Google Scholar] [CrossRef]
  4. Wayahdi, M.R.; Ginting, S.H.N.; Syahputra, D. Greedy, A-Star, and Dijkstra’s algorithms in finding shortest path. Int. J. Adv. Data Inf. Syst. 2021, 2, 45–52. [Google Scholar] [CrossRef]
  5. Hart, P.E.; Nilsson, N.J.; Raphael, B. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 1968, 4, 100–107. [Google Scholar] [CrossRef]
  6. LaValle, S. Rapidly-Exploring Random Trees: A New Tool for Path Planning; Iowa State University: Ames, IA, USA, 1998. [Google Scholar]
  7. Khatib, O. Real-time obstacle avoidance for manipulators and mobile robots. Int. J. Robot. Res. 1986, 5, 90–98. [Google Scholar] [CrossRef]
  8. Kennedy, J.; Eberhart, R. Particle swarm optimization. In Proceedings of the ICNN’95-International Conference on Neural Networks, Perth, WA, Australia, 27 November–1 December 1995; IEEE: New York, NY, USA; Volume 4, pp. 1942–1948. [Google Scholar] [CrossRef]
  9. Storn, R. Differrential Evolution: A Simple and Efficient Adaptive Scheme for Global Optimization Over Continuous Spaces; International Computer Science Institute: Berkeley, CA, USA, 1995. [Google Scholar]
  10. Mirjalili, S.; Lewis, A. The whale optimization algorithm. Adv. Eng. Softw. 2016, 95, 51–67. [Google Scholar] [CrossRef]
  11. Heidari, A.A.; Mirjalili, S.; Faris, H.; Aljarah, I.; Mafarja, M.; Chen, H. Harris hawks optimization: Algorithm and applications. Future Gener. Comput. Syst. 2019, 97, 849–872. [Google Scholar] [CrossRef]
  12. Abualigah, L.; Diabat, A.; Mirjalili, S.; Abd Elaziz, M.; Gandomi, A.H. The arithmetic optimization algorithm. Comput. Methods Appl. Mech. Eng. 2021, 376, 113609. [Google Scholar] [CrossRef]
  13. Xue, J.; Shen, B. Dung beetle optimizer: A new meta-heuristic algorithm for global optimization. J. Supercomput. 2023, 79, 7305–7336. [Google Scholar] [CrossRef]
  14. Zhao, J.; Deng, C.; Yu, H.; Fei, H.; Li, D. Path planning of unmanned vehicles based on adaptive particle swarm optimization algorithm. Comput. Commun. 2024, 216, 112–129. [Google Scholar] [CrossRef]
  15. Freitas, E.J.; Cohen, M.W.; Neto, A.A.; Guimarães, F.G.; Pimenta, L.C. DE3D-NURBS: A differential evolution-based 3D path-planner integrating kinematic constraints and obstacle avoidance. Knowl. Based Syst. 2024, 300, 112084. [Google Scholar] [CrossRef]
  16. Li, Y.; Gao, A.; Li, H.; Li, L. An improved whale optimization algorithm for UAV swarm trajectory planning. Adv. Contin. Discret. Models 2024, 2024, 40. [Google Scholar] [CrossRef]
  17. You, G.; Hu, Y.; Lian, C.; Yang, Z. Mixed-strategy Harris Hawk optimization algorithm for UAV path planning and engineering applications. Appl. Sci. 2024, 14, 10581. [Google Scholar] [CrossRef]
  18. Wang, R.B.; Wang, W.F.; Geng, F.D.; Pan, J.S.; Chu, S.C.; Xu, L. UAV path planning in mountain areas based on a hybrid parallel compact arithmetic optimization algorithm. Neural Comput. Appl. 2025, 37, 22353–22368. [Google Scholar] [CrossRef]
  19. Chen, Q.; Wang, Y.; Sun, Y. An improved dung beetle optimizer for UAV 3D path planning. J. Supercomput. 2024, 80, 26537–26567. [Google Scholar] [CrossRef]
  20. Wang, X.; Snášel, V.; Mirjalili, S.; Pan, J.S.; Kong, L.; Shehadeh, H.A. Artificial Protozoa Optimizer (APO): A novel bio-inspired metaheuristic algorithm for engineering optimization. Knowl.-Based Syst. 2024, 295, 111737. [Google Scholar] [CrossRef]
  21. Elamy, M.I.; Abd Elaziz, M.; Al-Betar, M.A.; Fathy, A.; Elmahdy, M. Enhanced random vector functional link based on artificial protozoa optimizer to predict wear characteristics of Cu-ZrO2 nanocomposites. Results Eng. 2024, 24, 103007. [Google Scholar] [CrossRef]
  22. Liao, J.; Melethil Sethumadhavan, S.; Ke, R.; Gao, Z.M.; Zhao, J. A leaded sine–cosine artificial protozoa optimizer algorithm for solving multi-objective optimization problems. Clust. Comput. 2025, 28, 304. [Google Scholar] [CrossRef]
  23. Wang, X.; Snášel, V.; Mirjalili, S.; Pan, J.S. MAAPO: An innovative membrane algorithm based on artificial protozoa optimizer for multilevel threshold image segmentation. Artif. Intell. Rev. 2025, 58, 324. [Google Scholar] [CrossRef]
  24. Bo, H.; Wu, J.; Hu, G. MSAPO: A Multi-Strategy Fusion Artificial Protozoa Optimizer for Solving Real-World Problems. Mathematics 2025, 13, 2888. [Google Scholar] [CrossRef]
  25. Tang, X.; Jia, C.; He, Z. UAV Path Planning: A Dual-Population Cooperative Honey Badger Algorithm for Staged Fusion of Multiple Differential Evolutionary Strategies. Biomimetics 2025, 10, 168. [Google Scholar] [CrossRef]
  26. Chai, X.; Zheng, Z.; Xiao, J.; Yan, L.; Qu, B.; Wen, P.; Wang, H.; Zhou, Y.; Sun, H. Multi-strategy fusion differential evolution algorithm for UAV path planning in complex environment. Aerosp. Sci. Technol. 2022, 121, 107287. [Google Scholar] [CrossRef]
  27. Yu, X.; Jiang, N.; Wang, X.; Li, M. A hybrid algorithm based on grey wolf optimizer and differential evolution for UAV path planning. Expert Syst. Appl. 2023, 215, 119327. [Google Scholar] [CrossRef]
  28. Tang, X.; Lian, J.J.; Ma, L.; Wu, X.; Zhong, R.; Zhang, Y.; Chen, H. IECO: An improved educational competition optimizer for state-of-the-art engineering optimization. J. Big Data 2025, 12, 200. [Google Scholar] [CrossRef]
  29. McKay, M.D. Latin hypercube sampling as a tool in uncertainty analysis of computer models. In Proceedings of the 24th Conference on Winter Simulation, Arlington, VA, USA, 13–16 December 1992; pp. 557–564. [Google Scholar] [CrossRef]
  30. Stein, M. Large sample properties of simulations using Latin hypercube sampling. Technometrics 1987, 29, 143–151. [Google Scholar] [CrossRef]
  31. Nesterov, Y.; Vial, J.P. Confidence level solutions for stochastic programming. Automatica 2008, 44, 1559–1568. [Google Scholar] [CrossRef]
  32. Hansen, N.; Müller, S.D.; Koumoutsakos, P. Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). Evol. Comput. 2003, 11, 1–18. [Google Scholar] [CrossRef] [PubMed]
  33. Amiri, M.H.; Mehrabi Hashjin, N.; Montazeri, M.; Mirjalili, S.; Khodadadi, N. Hippopotamus optimization algorithm: A novel nature-inspired optimization algorithm. Sci. Rep. 2024, 14, 5032. [Google Scholar] [CrossRef]
  34. Oladejo, S.O.; Ekwe, S.O.; Mirjalili, S. The Hiking Optimization Algorithm: A novel human-based metaheuristic approach. Knowl. Based Syst. 2024, 296, 111880. [Google Scholar] [CrossRef]
  35. Gámez, M.G.M.; Vázquez, H.P. A Novel Swarm Optimization Algorithm Based on Hive Construction by Tetragonula carbonaria Builder Bees. Mathematics 2025, 13, 2721. [Google Scholar] [CrossRef]
  36. Dehkordi, A.A.; Sadiq, A.S.; Mirjalili, S.; Ghafoor, K.Z. Nonlinear-based chaotic harris hawks optimizer: Algorithm and internet of vehicles application. Appl. Soft Comput. 2021, 109, 107574. [Google Scholar] [CrossRef]
  37. Shahzad, W.; Khan, F.A.; Siddiqui, A.B. Clustering in mobile ad hoc networks using comprehensive learning particle swarm optimization (CLPSO). In Proceedings of the International Conference on Future Generation Communication and Networking, Jeju Island, Republic of Korea, 10–12 December 2009; Springer: Berlin/Heidelberg, Germany; pp. 342–349. [Google Scholar] [CrossRef]
  38. Ch Cheng, S.; Shi, Y.; Qin, Q.; Zhang, Q.; Bai, R. Population diversity maintenance in brain storm optimization algorithm. J. Artif. Intell. Soft Comput. Res. 2014, 4, 83–97. [Google Scholar] [CrossRef]
  39. Morales-Castañeda, B.; Zaldivar, D.; Cuevas, E.; Fausto, F.; Rodríguez, A. A better balance in metaheuristic algorithms: Does it exist? Swarm Evol. Comput. 2020, 54, 100671. [Google Scholar] [CrossRef]
  40. Garg, V.; Deep, K.; Bansal, S. Improved teaching learning algorithm with Laplacian operator for solving nonlinear engineering optimization problems. Eng. Appl. Artif. Intell. 2023, 124, 106549. [Google Scholar] [CrossRef]
  41. Shen, B.; Khishe, M.; Mirjalili, S. Evolving Marine Predators Algorithm by dynamic foraging strategy for real-world engineering optimization problems. Eng. Appl. Artif. Intell. 2023, 123, 106207. [Google Scholar] [CrossRef]
Figure 1. Schematic diagram of decision variable space.
Figure 1. Schematic diagram of decision variable space.
Mathematics 14 00153 g001
Figure 2. Schematic diagram of the principle of behaviorally adaptive selection based on historical success. The success rate of each behavior is transformed into a selection probability through a confidence-weighted mechanism and an exploration–exploitation balance mechanism, enabling adaptive behavior selection at different search stages.
Figure 2. Schematic diagram of the principle of behaviorally adaptive selection based on historical success. The success rate of each behavior is transformed into a selection probability through a confidence-weighted mechanism and an exploration–exploitation balance mechanism, enabling adaptive behavior selection at different search stages.
Mathematics 14 00153 g002
Figure 3. Schematic diagram of perceptual field modeling.
Figure 3. Schematic diagram of perceptual field modeling.
Mathematics 14 00153 g003
Figure 4. EAPO algorithm flowchart.
Figure 4. EAPO algorithm flowchart.
Mathematics 14 00153 g004
Figure 5. Average Friedman test ranking of different  λ parameters on CEC2022.
Figure 5. Average Friedman test ranking of different  λ parameters on CEC2022.
Mathematics 14 00153 g005
Figure 6. Average Friedman test ranking of different  k parameters on CEC2022.
Figure 6. Average Friedman test ranking of different  k parameters on CEC2022.
Mathematics 14 00153 g006
Figure 7. EAPO’s Exploration and Exploitation Curve on CEC2022.
Figure 7. EAPO’s Exploration and Exploitation Curve on CEC2022.
Mathematics 14 00153 g007
Figure 8. Iteration curves EAPO and other algorithms on CEC2022 (Dim = 10).
Figure 8. Iteration curves EAPO and other algorithms on CEC2022 (Dim = 10).
Mathematics 14 00153 g008
Figure 9. Box plots of EAPO and other algorithms on CEC2022 (Dim = 10).
Figure 9. Box plots of EAPO and other algorithms on CEC2022 (Dim = 10).
Mathematics 14 00153 g009
Figure 10. Iteration curves of EAPO and other algorithms on CEC2022 (Dim = 20).
Figure 10. Iteration curves of EAPO and other algorithms on CEC2022 (Dim = 20).
Mathematics 14 00153 g010
Figure 11. Boxplots of EAPO and other algorithms on CEC2022 (Dim = 20).
Figure 11. Boxplots of EAPO and other algorithms on CEC2022 (Dim = 20).
Mathematics 14 00153 g011
Figure 12. Iteration curves EAPO and other algorithms on CEC2020 (Dim = 10).
Figure 12. Iteration curves EAPO and other algorithms on CEC2020 (Dim = 10).
Mathematics 14 00153 g012
Figure 13. Boxplots of EAPO and other algorithms on CEC2022 (Dim = 10).
Figure 13. Boxplots of EAPO and other algorithms on CEC2022 (Dim = 10).
Mathematics 14 00153 g013
Figure 14. Iteration curves EAPO and other algorithms on CEC2020 (Dim = 20).
Figure 14. Iteration curves EAPO and other algorithms on CEC2020 (Dim = 20).
Mathematics 14 00153 g014
Figure 15. Boxplots of EAPO and other algorithms on CEC2020 (Dim = 20).
Figure 15. Boxplots of EAPO and other algorithms on CEC2020 (Dim = 20).
Mathematics 14 00153 g015
Figure 16. Four simulation maps.
Figure 16. Four simulation maps.
Mathematics 14 00153 g016
Figure 17. Optimal paths and average iteration curves planned by EAPO and other algorithms (Map 1).
Figure 17. Optimal paths and average iteration curves planned by EAPO and other algorithms (Map 1).
Mathematics 14 00153 g017
Figure 18. Optimal paths and average iteration curves planned by EAPO and other algorithms (Map 2).
Figure 18. Optimal paths and average iteration curves planned by EAPO and other algorithms (Map 2).
Mathematics 14 00153 g018
Figure 19. Optimal paths and average iteration curves planned by EAPO and other algorithms (Map 3).
Figure 19. Optimal paths and average iteration curves planned by EAPO and other algorithms (Map 3).
Mathematics 14 00153 g019
Figure 20. Optimal paths and average iteration curves planned by EAPO and other algorithms (Map 4).
Figure 20. Optimal paths and average iteration curves planned by EAPO and other algorithms (Map 4).
Mathematics 14 00153 g020
Table 1. Parameters setting.
Table 1. Parameters setting.
AlgorithmsParameters Setting
PSO C 1 = 1 , C 2 = 1 , v m i n = 10 ,   v m a x = 10 ,   ω = [ 0.9 ,   0.4 ]
DE F = 0.5 ,   C R = 0.5
CMA-ES σ = 0.75
WOA a = [ 2 ,   0 ]
HHO a = 5 ,   β = 1.5
CL-PSO C = 1.2 ,   F m a x = 7 ,     ω m a x = 0.9 ,   ω m i n = 0.4
NCHHO a = 4
DBO k = 0.1 ,   b = 0.3 ,   S = 0.5
HOParameter free
HOA θ = [ 0 ,   50 ] ,   S F = [ 1 ,   2 ]
AOA μ = 0.499 ,   α = 5
TGCOA l T = 10 ,   u T = 40 ,   k = 0.03 ,   α = 50 ,   a = 0 ,   b = 10
APO p f m a x = 0.1 ,   n p = 1
EAPO λ = 0.4 ,   α m a x = 0.9 ,   α m i n = 0.1 ,   ω = 0.5 ,   p f m a x = 0.1 ,   n p = 1 ,   k = 8
Table 2. Ablation experiment results.
Table 2. Ablation experiment results.
FunctionItem NameAPOAPO_LAPO_HAPO_SAPO_DEAPO
F1Best3.441 × 1033.829 × 1031.729 × 1032.098 × 1032.094 × 1032.464 × 103
Mean7.274 × 1037.249 × 1036.752 × 1037.078 × 1036.201 × 1035.198 × 103
Std1.671 × 1032.228 × 1032.236 × 1032.347 × 1032.271 × 1031.903 × 103
Rank653421
F2Best4.080 × 1024.078 × 1024.076 × 1024.076 × 1024.073 × 1024.071 × 102
Mean4.107 × 1024.102 × 1024.126 × 1024.098 × 1024.088 × 1024.086 × 102
Std2.409 × 1002.082 × 1006.368 × 1001.962 × 1001.059 × 1008.597 × 10−1
Rank645321
F3Best6.009 × 1026.008 × 1026.004 × 1026.009 × 1026.008 × 1026.000 × 102
Mean6.016 × 1026.016 × 1026.010 × 1026.019 × 1026.012 × 1026.002 × 102
Std3.579 × 10−13.740 × 10−12.703 × 10−14.945 × 10−12.811 × 10−12.659 × 10−1
Rank452631
F4Best8.080 × 1028.102 × 1028.111 × 1028.119 × 1028.064 × 1028.072 × 102
Mean8.172 × 1028.154 × 1028.170 × 1028.169 × 1028.140 × 1028.165 × 102
Std3.619 × 1002.937 × 1003.260 × 1003.122 × 1003.801 × 1003.506 × 100
Rank625413
F5Best9.053 × 1029.136 × 1029.080 × 1029.086 × 1029.029 × 1029.004 × 102
Mean9.217 × 1029.215 × 1029.165 × 1029.163 × 1029.104 × 1029.048 × 102
Std7.598 × 1007.471 × 1005.562 × 1005.999 × 1004.161 × 1002.820 × 100
Rank654321
F6Best2.449 × 1032.437 × 1031.909 × 1031.993 × 1032.058 × 1031.904 × 103
Mean4.302 × 1034.389 × 1033.669 × 1034.199 × 1034.352 × 1033.513 × 103
Std1.703 × 1031.600 × 1031.661 × 1031.383 × 1031.458 × 1031.162 × 103
Rank362451
F7Best2.021 × 1032.012 × 1032.018 × 1032.016 × 1032.017 × 1032.021 × 103
Mean2.029 × 1032.027 × 1032.028 × 1032.030 × 1032.027 × 1032.031 × 103
Std3.696 × 1004.167 × 1003.824 × 1004.671 × 1003.720 × 1004.225 × 100
Rank423516
F8Best2.213 × 1032.214 × 1032.217 × 1032.221 × 1032.216 × 1032.218 × 103
Mean2.222 × 1032.223 × 1032.223 × 1032.225 × 1032.223 × 1032.225 × 103
Std3.209 × 1002.653 × 1001.995 × 1001.213 × 1002.361 × 1002.015 × 100
Rank134625
F9Best2.530 × 1032.529 × 1032.530 × 1032.529 × 1032.529 × 1032.529 × 103
Mean2.534 × 1032.532 × 1032.532 × 1032.531 × 1032.531 × 1032.530 × 103
Std6.907 × 1001.757 × 1002.232 × 1001.541 × 1001.534 × 1001.471 × 100
Rank654321
F10Best2.500 × 1032.500 × 1032.500 × 1032.500 × 1032.500 × 1032.500 × 103
Mean2.501 × 1032.501 × 1032.501 × 1032.505 × 1032.501 × 1032.501 × 103
Std1.421 × 1008.305 × 10−12.753 × 1002.113 × 1012.036 × 1004.090 × 10−1
Rank543621
F11Best2.716 × 1032.741 × 1032.738 × 1032.733 × 1032.720 × 1032.665 × 103
Mean2.747 × 1032.747 × 1032.749 × 1032.746 × 1032.744 × 1032.735 × 103
Std7.346 × 1002.849 × 1002.994 × 1004.653 × 1007.199 × 1001.858 × 101
Rank546321
F12Best2.862 × 1032.861 × 1032.863 × 1032.861 × 1032.861 × 1032.861 × 103
Mean2.864 × 1032.864 × 1032.864 × 1032.864 × 1032.864 × 1032.863 × 103
Std7.076 × 10−17.757 × 10−17.868 × 10−18.428 × 10−17.667 × 10−19.569 × 10−1
Rank245631
Mean Rank4.54.084.084.172.251.92
Final Ranking633521
Table 3. Test results of EAPO and other algorithms on CEC2022 (dim = 10).
Table 3. Test results of EAPO and other algorithms on CEC2022 (dim = 10).
FunctionItem NamePSODECMA-ESWOAHHOCL-PSONC-HHODBOHOHOAAOATG-COAAPOEAPO
F1Best4.192 × 1037.024 × 1032.971 × 1037.056 × 1034.694 × 1035.551 × 1035.076 × 1035.348 × 1021.659 × 1039.697 × 1021.727 × 1041.563 × 1032.769 × 1032.739 × 103
Mean7.337 × 1032.080 × 1041.848 × 1042.583 × 1048.749 × 1031.744 × 1049.386 × 1033.226 × 1036.559 × 1033.516 × 1031.207 × 1055.136 × 1037.999 × 1035.136 × 103
Std2.401 × 1035.527 × 1031.054 × 1041.341 × 1041.474 × 1034.335 × 1031.471 × 1031.997 × 1032.535 × 1031.272 × 1033.379 × 1052.226 × 1032.156 × 1031.987 × 103
p1.709 × 10−31.734 × 10−61.734 × 10−61.734 × 10−61.127 × 10−51.734 × 10−63.515 × 10−62.831 × 10−42.067 × 10−21.197 × 10−01.734 × 10−67.655 × 10−16.320 × 10−5~
Rank6121013811915214374
F2Best4.138 × 1024.295 × 1024.950 × 1024.016 × 1024.028 × 1025.135 × 1024.418 × 1024.006 × 1024.197 × 1024.122 × 1027.812 × 1024.019 × 1024.081 × 1024.069 × 102
Mean4.563 × 1024.623 × 1026.021 × 1024.451 × 1025.171 × 1026.894 × 1025.789 × 1024.278 × 1024.997 × 1025.099 × 1022.298 × 1034.770 × 1024.107 × 1024.090 × 102
Std7.060 × 1011.703 × 1016.205 × 1017.397 × 1011.065 × 1021.498 × 1029.076 × 1013.058 × 1016.966 × 1017.573 × 1011.029 × 1034.194 × 1012.991 × 1002.243 × 100
p1.734 × 10−61.734 × 10−61.734 × 10−64.390 × 10−34.286 × 10−61.734 × 10−61.734 × 10−61.245 × 10−21.734 × 10−61.921 × 10−61.734 × 10−62.127 × 10−65.287 × 10−4~
Rank5612481311391014721
F3Best6.114 × 1026.084 × 1026.000 × 1026.175 × 1026.237 × 1026.229 × 1026.217 × 1026.000 × 1026.144 × 1026.112 × 1026.502 × 1026.173 × 1026.005 × 1026.000 × 102
Mean6.215 × 1026.229 × 1026.156 × 1026.365 × 1026.405 × 1026.427 × 1026.475 × 1026.018 × 1026.318 × 1026.214 × 1026.865 × 1026.463 × 1026.015 × 1026.002 × 102
Std5.720 × 1004.489 × 1001.923 × 1011.509 × 1011.167 × 1019.533 × 1001.266 × 1013.465 × 1001.244 × 1016.113 × 1001.405 × 1011.439 × 1014.004 × 10−12.276 × 10−1
p1.734 × 10−61.734 × 10−64.492 × 10−21.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−62.415 × 10−31.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−6~
Rank5749101113286141231
F4Best8.371 × 1028.496 × 1028.111 × 1028.150 × 1028.187 × 1028.490 × 1028.227 × 1028.070 × 1028.127 × 1028.113 × 1028.858 × 1028.145 × 1028.102 × 1028.091 × 102
Mean8.576 × 1028.678 × 1028.255 × 1028.382 × 1028.361 × 1028.660 × 1028.408 × 1028.316 × 1028.303 × 1028.253 × 1029.148 × 1028.387 × 1028.159 × 1028.168 × 102
Std7.439 × 1007.699 × 1007.242 × 1001.449 × 1011.060 × 1017.449 × 1001.031 × 1011.623 × 1018.938 × 1008.850 × 1001.365 × 1011.474 × 1013.133 × 1003.471 × 100
p1.734 × 10−61.734 × 10−65.792 × 10−52.353 × 10−61.921 × 10−61.734 × 10−61.734 × 10−61.742 × 10−46.984 × 10−61.036 × 10−31.734 × 10−61.734 × 10−65.577 × 10−1~
Rank1113478121056314912
F5Best1.012 × 1031.394 × 1039.000 × 1029.242 × 1021.047 × 1031.266 × 1031.258 × 1039.005 × 1029.882 × 1029.241 × 1022.429 × 1031.191 × 1039.116 × 1029.017 × 102
Mean1.155 × 1031.971 × 1039.000 × 1021.473 × 1031.385 × 1031.901 × 1031.469 × 1039.384 × 1021.193 × 1031.031 × 1034.235 × 1031.665 × 1039.222 × 1029.046 × 102
Std8.676 × 1013.356 × 1022.404 × 10−53.646 × 1021.716 × 1023.669 × 1021.507 × 1027.870 × 1011.752 × 1028.543 × 1018.750 × 1023.818 × 1027.559 × 1002.573 × 100
p1.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−62.105 × 10−31.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−6~
Rank6131981210375141142
F6Best6.735 × 1041.566 × 1053.017 × 1052.142 × 1031.845 × 1032.490 × 1041.908 × 1031.882 × 1032.299 × 1032.227 × 1038.483 × 1071.869 × 1031.936 × 1031.905 × 103
Mean2.179 × 1062.489 × 1065.242 × 1067.117 × 1034.163 × 1033.550 × 1064.117 × 1036.077 × 1035.559 × 1044.015 × 1068.333 × 1083.458 × 1033.590 × 1033.172 × 103
Std1.478 × 1062.093 × 1066.734 × 1067.599 × 1036.861 × 1035.157 × 1063.370 × 1032.322 × 1031.168 × 1057.733 × 1064.633 × 1081.868 × 1031.268 × 1031.018 × 103
p1.734 × 10−61.734 × 10−61.734 × 10−64.196 × 10−42.989 × 10−11.734 × 10−62.536 × 10−12.843 × 10−58.944 × 10−49.316 × 10−61.734 × 10−69.426 × 10−12.989 × 10−1~
Rank1211136110587914243
F7Best2.040 × 1032.034 × 1032.026 × 1032.029 × 1032.044 × 1032.049 × 1032.036 × 1032.000 × 1032.028 × 1032.028 × 1032.090 × 1032.046 × 1032.018 × 1032.025 × 103
Mean2.062 × 1032.046 × 1032.092 × 1032.083 × 1032.088 × 1032.086 × 1032.108 × 1032.024 × 1032.062 × 1032.053 × 1032.221 × 1032.100 × 1032.027 × 1032.031 × 103
Std1.298 × 1016.873 × 1004.101 × 1013.178 × 1013.695 × 1011.948 × 1013.482 × 1017.764 × 1002.357 × 1011.326 × 1015.565 × 1013.455 × 1012.997 × 1003.136 × 100
p1.734 × 10−61.734 × 10−66.339 × 10−61.921 × 10−61.734 × 10−61.734 × 10−61.734 × 10−65.792 × 10−52.603 × 10−61.921 × 10−61.734 × 10−61.734 × 10−65.307 × 10−5~
Rank7498101113165141223
F8Best2.230 × 1032.226 × 1032.229 × 1032.224 × 1032.225 × 1032.226 × 1032.214 × 1032.221 × 1032.224 × 1032.217 × 1032.255 × 1032.225 × 1032.216 × 1032.217 × 103
Mean2.242 × 1032.230 × 1032.241 × 1032.239 × 1032.240 × 1032.234 × 1032.247 × 1032.226 × 1032.252 × 1032.227 × 1032.503 × 1032.263 × 1032.223 × 1032.224 × 103
Std2.247 × 1012.250 × 1008.718 × 1001.329 × 1011.490 × 1014.525 × 1002.094 × 1013.771 × 1004.589 × 1013.649 × 1001.720 × 1025.795 × 1012.460 × 1003.264 × 100
p1.734 × 10−61.734 × 10−61.734 × 10−62.879 × 10−61.734 × 10−61.921 × 10−62.603 × 10−68.730 × 10−32.603 × 10−65.287 × 10−41.734 × 10−61.921 × 10−61.306 × 10−1~
Rank1051298613374141112
F9Best2.531 × 1032.534 × 1032.531 × 1032.530 × 1032.532 × 1032.576 × 1032.540 × 1032.529 × 1032.550 × 1032.618 × 1032.727 × 1032.548 × 1032.529 × 1032.529 × 103
Mean2.555 × 1032.547 × 1032.557 × 1032.586 × 1032.655 × 1032.653 × 1032.639 × 1032.533 × 1032.650 × 1032.660 × 1032.953 × 1032.617 × 1032.531 × 1032.530 × 103
Std3.365 × 1011.006 × 1013.500 × 1015.412 × 1015.141 × 1013.709 × 1015.798 × 1017.776 × 1005.002 × 1011.667 × 1011.421 × 1023.440 × 1011.629 × 1002.956 × 10−1
p1.921 × 10−61.734 × 10−62.127 × 10−62.879 × 10−61.734 × 10−61.734 × 10−61.734 × 10−69.918 × 10−11.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−6~
Rank4567111292101314831
F10Best2.502 × 1032.510 × 1032.513 × 1032.500 × 1032.501 × 1032.516 × 1032.501 × 1032.500 × 1032.501 × 1032.501 × 1032.540 × 1032.501 × 1032.500 × 1032.500 × 103
Mean2.576 × 1032.520 × 1032.771 × 1032.563 × 1032.609 × 1032.550 × 1032.627 × 1032.544 × 1032.580 × 1032.570 × 1033.192 × 1032.564 × 1032.501 × 1032.500 × 103
Std8.326 × 1016.368 × 103.486 × 1021.625 × 1023.051 × 1024.279 × 1011.398 × 1026.332 × 1017.441 × 1016.330 × 1016.623 × 1021.163 × 1022.448 × 109.281 × 10−2
p1.734 × 10−61.734 × 10−61.734 × 10−62.127 × 10−61.734 × 10−61.734 × 10−61.734 × 10−62.353 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−68.221 × 10−2~
Rank1071346111239814521
F11Best2.783 × 1032.791 × 1032.806 × 1032.635 × 1032.717 × 1032.809 × 1032.738 × 1032.600 × 1032.736 × 1032.702 × 1032.966 × 1032.732 × 1032.716 × 1032.633 × 103
Mean2.991 × 1032.832 × 1032.915 × 1032.804 × 1032.947 × 1033.108 × 1033.132 × 1032.752 × 1032.941 × 1032.857 × 1034.402 × 1032.865 × 1032.746 × 1032.736 × 103
Std8.339 × 1022.604 × 1021.327 × 1034.846 × 1021.422 × 1039.098 × 1021.250 × 1038.121 × 1027.938 × 1027.909 × 1022.010 × 1039.381 × 1022.256 × 1017.474 × 101
p1.734 × 10−61.734 × 10−61.734 × 10−63.160 × 10−24.729 × 10−61.734 × 10−62.127 × 10−64.284 × 10−13.515 × 10−62.597 × 10−51.734 × 10−64.729 × 10−63.501 × 10−2~
Rank1091248131137514621
F12Best2.860 × 1032.866 × 1032.870 × 1032.864 × 1032.867 × 1032.866 × 1032.871 × 1032.861 × 1032.866 × 1032.910 × 1032.975 × 1032.868 × 1032.861 × 1032.862 × 103
Mean2.870 × 1032.867 × 1032.875 × 1032.893 × 1032.923 × 1032.895 × 1032.937 × 1032.864 × 1032.892 × 1032.954 × 1033.109 × 1032.919 × 1032.864 × 1032.863 × 103
Std5.579 × 1001.143 × 1002.742 × 1003.055 × 1015.743 × 1011.724 × 1014.529 × 1011.504 × 1003.364 × 1012.685 × 1017.643 × 1012.899 × 1017.257 × 10−18.084 × 10−1
p4.286 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−64.277 × 10−21.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−68.590 × 10−2~
Rank5468109123713141121
Mean Rank7.5888.57.33810.9210.673.087.336.92148.082.751.83
Final Ranking7811681312354141021
+/=/−12/0/012/0/011/0/112/0/011/1/012/0/011/1/08/1/312/0/011/1/012/0/010/0/07/3/2~
Table 4. Test results of EAPO and other algorithms on CEC2022 (dim = 20).
Table 4. Test results of EAPO and other algorithms on CEC2022 (dim = 20).
FunctionItem NamePSODECMA-ESWOAHHOCL-PSONC-HHODBOHOHOAAOATG-COAAPOEAPO
F1Best2.941 × 1042.869 × 1043.745 × 1041.272 × 1041.819 × 1043.662 × 1041.803 × 1041.603 × 1041.880 × 1049.905 × 1038.485 × 1041.360 × 1041.821 × 1041.346 × 104
Mean5.077 × 1046.218 × 1046.962 × 1042.168 × 1043.946 × 1045.997 × 1043.257 × 1043.347 × 1042.974 × 1041.979 × 1042.827 × 1072.870 × 1042.783 × 1041.995 × 104
Std1.569 × 1049.490 × 1031.957 × 1047.843 × 1031.489 × 1041.053 × 1049.899 × 1031.166 × 1046.187 × 1034.989 × 1031.466 × 1088.135 × 1034.366 × 1034.297 × 103
p1.734 × 10−61.734 × 10−61.734 × 10−64.284 × 10−15.216 × 10−61.734 × 10−66.984 × 10−62.843 × 10−54.286 × 10−69.918 × 10−11.734 × 10−66.892 × 10−52.163 × 10−5~
Rank1012133911876214541
F2Best5.611 × 1026.176 × 1026.497 × 1024.564 × 1025.133 × 1021.072 × 1035.733 × 1024.067 × 1025.727 × 1026.573 × 1022.978 × 1035.545 × 1024.461 × 1024.449 × 102
Mean7.674 × 1028.061 × 1021.293 × 1035.366 × 1029.269 × 1022.268 × 1039.636 × 1024.897 × 1027.982 × 1028.664 × 1027.456 × 1038.880 × 1024.523 × 1024.536 × 102
Std1.813 × 1028.522 × 1013.483 × 1025.630 × 1013.234 × 1026.481 × 1022.338 × 1025.268 × 1011.436 × 1021.393 × 1022.185 × 1032.478 × 1026.009 × 1009.448 × 100
p1.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−62.225 × 10−41.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.254 × 10−1~
Rank5712410131136914821
F3Best6.302 × 1026.275 × 1026.406 × 1026.333 × 1026.404 × 1026.504 × 1026.527 × 1026.048 × 1026.388 × 1026.285 × 1026.876 × 1026.346 × 1026.004 × 1026.001 × 102
Mean6.443 × 1026.326 × 1026.637 × 1026.620 × 1026.675 × 1026.609 × 1026.752 × 1026.170 × 1026.615 × 1026.425 × 1027.182 × 1026.687 × 1026.006 × 1026.002 × 102
Std6.435 × 1002.914 × 1001.042 × 1011.208 × 1011.307 × 1015.290 × 1001.074 × 1017.650 × 1001.083 × 1018.660 × 1001.299 × 1011.224 × 1011.698 × 10−18.296 × 10−2
p1.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.921 × 10−6~
Rank6410811713395141221
F4Best9.437 × 1029.590 × 1028.830 × 1028.739 × 1028.810 × 1029.504 × 1029.041 × 1028.560 × 1028.549 × 1028.563 × 1021.055 × 1039.066 × 1028.317 × 1028.308 × 102
Mean9.677 × 1029.936 × 1029.794 × 1029.246 × 1029.183 × 1029.920 × 1029.465 × 1029.025 × 1029.084 × 1029.011 × 1021.104 × 1039.365 × 1028.446 × 1028.535 × 102
Std1.357 × 1011.428 × 1013.826 × 1012.562 × 1012.699 × 1011.841 × 1012.163 × 1013.196 × 1011.910 × 1011.864 × 1012.109 × 1012.360 × 1017.077 × 1008.997 × 100
p1.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.965 × 10−3~
Rank1013117612945314812
F5Best1.646 × 1034.266 × 1039.000 × 1021.852 × 1031.944 × 1033.204 × 1032.213 × 1031.058 × 1031.770 × 1031.523 × 1038.116 × 1032.189 × 1039.018 × 1029.000 × 102
Mean4.010 × 1036.840 × 1031.151 × 1033.655 × 1033.019 × 1035.616 × 1033.036 × 1031.891 × 1032.825 × 1032.162 × 1031.246 × 1043.195 × 1039.061 × 1029.027 × 102
Std1.057 × 1031.145 × 1039.812 × 1021.388 × 1035.897 × 1021.128 × 1034.659 × 1028.300 × 1024.354 × 1024.901 × 1021.814 × 1037.338 × 1024.191 × 1003.071 × 100
p1.734 × 10−61.734 × 10−64.534 × 10−41.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.036 × 10−3~
Rank1113110812746514932
F6Best2.999 × 1074.160 × 1073.832 × 1074.905 × 1041.155 × 1042.440 × 1071.134 × 1072.032 × 1034.433 × 1053.783 × 1061.939 × 1091.280 × 1041.360 × 1042.375 × 103
Mean1.454 × 1087.068 × 1075.967 × 1085.363 × 1057.310 × 1074.382 × 1088.449 × 1071.148 × 1062.585 × 1071.047 × 1085.571 × 1092.017 × 1079.664 × 1041.271 × 104
Std8.499 × 1071.878 × 1073.849 × 1085.391 × 1051.052 × 1083.395 × 1088.887 × 1075.279 × 1062.989 × 1079.671 × 1072.202 × 1096.931 × 1075.277 × 1041.017 × 104
p1.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−66.424 × 10−31.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−62.353 × 10−6~
Rank1110134712826914531
F7Best2.099 × 1032.093 × 1032.137 × 1032.100 × 1032.100 × 1032.115 × 1032.161 × 1032.036 × 1032.068 × 1032.092 × 1032.226 × 1032.081 × 1032.045 × 1032.047 × 103
Mean2.159 × 1032.132 × 1032.212 × 1032.222 × 1032.217 × 1032.172 × 1032.237 × 1032.099 × 1032.166 × 1032.143 × 1032.504 × 1032.195 × 1032.060 × 1032.069 × 103
Std3.439 × 1012.323 × 1012.914 × 1017.585 × 1016.176 × 1013.753 × 1015.173 × 1013.749 × 1014.657 × 1013.770 × 1011.179 × 1026.184 × 1017.695 × 1001.086 × 101
p1.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−62.412 × 10−41.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−63.609 × 10−3~
Rank7412101181336514912
F8Best2.250 × 1032.234 × 1032.247 × 1032.236 × 1032.242 × 1032.243 × 1032.240 × 1032.222 × 1032.230 × 1032.230 × 1032.672 × 1032.239 × 1032.225 × 1032.227 × 103
Mean2.302 × 1032.259 × 1032.384 × 1032.282 × 1032.282 × 1032.273 × 1032.310 × 1032.277 × 1032.298 × 1032.281 × 1035.128 × 1032.451 × 1032.227 × 1032.230 × 103
Std4.045 × 1011.349 × 1019.697 × 1016.334 × 1015.555 × 1012.397 × 1017.782 × 1015.858 × 1016.218 × 1015.801 × 1014.190 × 1031.193 × 1028.364 × 10−11.050 × 100
p1.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−69.711 × 10−51.921 × 10−64.286 × 10−61.734 × 10−61.734 × 10−62.353 × 10−6~
Rank1151267810394141312
F9Best2.511 × 1032.496 × 1032.633 × 1032.491 × 1032.522 × 1032.598 × 1032.554 × 1032.481 × 1032.549 × 1032.685 × 1033.048 × 1032.524 × 1032.481 × 1032.481 × 103
Mean2.648 × 1032.510 × 1032.830 × 1032.538 × 1032.633 × 1032.803 × 1032.703 × 1032.498 × 1032.664 × 1032.802 × 1033.937 × 1032.685 × 1032.482 × 1032.481 × 103
Std7.640 × 1018.349 × 1001.224 × 1024.245 × 1016.514 × 1019.317 × 1017.475 × 1012.427 × 1015.318 × 1017.774 × 1014.471 × 1026.228 × 1019.008 × 10−16.883 × 10−1
p1.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−62.613 × 10−41.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.742 × 10−4~
Rank7413561110381214921
F10Best2.517 × 1032.532 × 1032.609 × 1032.501 × 1032.528 × 1032.575 × 1032.557 × 1032.501 × 1032.502 × 1032.521 × 1032.695 × 1032.503 × 1032.500 × 1032.500 × 103
Mean5.059 × 1032.669 × 1036.094 × 1034.539 × 1034.993 × 1033.880 × 1035.623 × 1033.310 × 1034.521 × 1033.739 × 1037.466 × 1034.393 × 1032.534 × 1032.506 × 103
Std1.665 × 1032.392 × 1021.402 × 1031.323 × 1031.546 × 1031.285 × 1031.121 × 1039.327 × 1021.845 × 1031.304 × 1031.684 × 1031.689 × 1037.810 × 1012.087 × 101
p1.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−65.792 × 10−51.734 × 10−61.734 × 10−61.734 × 10−64.286 × 10−67.655 × 10−1~
Rank1041361171239514821
F11Best3.456 × 1033.833 × 1033.879 × 1033.025 × 1034.285 × 1035.079 × 1034.299 × 1032.850 × 1033.749 × 1034.701 × 1039.720 × 1034.213 × 1032.953 × 1032.901 × 103
Mean4.862 × 1034.227 × 1037.302 × 1033.359 × 1036.230 × 1037.301 × 1036.055 × 1033.109 × 1034.770 × 1035.855 × 1031.299 × 1045.697 × 1032.987 × 1032.921 × 103
Std7.499 × 1022.275 × 1021.107 × 1036.378 × 1021.359 × 1031.090 × 1031.069 × 1031.829 × 1027.110 × 1027.680 × 1021.746 × 1039.836 × 1021.975 × 1018.469 × 101
p1.734 × 10−61.734 × 10−61.734 × 10−65.216 × 10−61.734 × 10−61.734 × 10−61.734 × 10−63.112 × 10−51.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−63.405 × 10−5~
Rank7512411131036914821
F12Best2.955 × 1032.951 × 1033.002 × 1032.963 × 1033.012 × 1033.056 × 1033.003 × 1032.941 × 1032.960 × 1033.166 × 1033.494 × 1033.102 × 1032.941 × 1032.938 × 103
Mean3.010 × 1032.962 × 1033.052 × 1033.066 × 1033.310 × 1033.143 × 1033.277 × 1032.967 × 1033.106 × 1033.486 × 1034.130 × 1033.391 × 1032.945 × 1032.945 × 103
Std3.870 × 1015.283 × 1002.164 × 1017.354 × 1012.323 × 1025.165 × 1011.949 × 1022.332 × 1018.774 × 1011.302 × 1022.882 × 1021.622 × 1023.114 × 1003.806 × 100
p1.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−63.182 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−67.036 × 10−1~
Rank5367119104813141212
Mean Rank8.33710.676.17910.2510.083.576.75148.8321.41
Final Ranking8613410121136514921
+/=/−12/0/012/0/012/0/011/1/012/0/012/0/012/0/012/0/012/0/011/1/012/0/012/0/09/2/1~
Table 5. Test results of EAPO and other algorithms on CEC2020 (dim = 10).
Table 5. Test results of EAPO and other algorithms on CEC2020 (dim = 10).
FunctionItem NamePSODECMA-ESWOAHHOCL-PSONC-HHODBOHOHOAAOATG-COAAPOEAPO
F1Best1.419 × 1083.522 × 1081.292 × 1099.222 × 1051.848 × 1071.349 × 1091.990 × 1081.326 × 1021.493 × 1081.932 × 1087.592 × 1098.608 × 1063.190 × 1061.259 × 103
Mean7.644 × 1088.076 × 1083.401 × 1091.768 × 1078.225 × 1085.160 × 1092.096 × 1094.980 × 1067.235 × 1081.805 × 1091.433 × 10102.112 × 1085.919 × 1063.338 × 103
Std6.282 × 1082.580 × 1081.165 × 1091.519 × 1071.448 × 1092.136 × 1091.799 × 1091.777 × 1074.869 × 1089.251 × 1084.255 × 1093.870 × 1081.650 × 1062.237 × 103
p1.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−62.765 × 10−31.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−6~
Rank7912461310281114531
F2Best1.978 × 1031.846 × 1032.237 × 1031.597 × 1031.507 × 1032.088 × 1031.534 × 1031.262 × 1031.731 × 1031.412 × 1032.839 × 1031.428 × 1031.599 × 1031.283 × 103
Mean2.538 × 1032.302 × 1032.697 × 1032.323 × 1032.414 × 1032.429 × 1032.340 × 1031.831 × 1032.409 × 1031.911 × 1033.475 × 1032.177 × 1031.783 × 1031.776 × 103
Std2.520 × 1021.554 × 1021.893 × 1023.462 × 1023.427 × 1021.374 × 1024.034 × 1022.621 × 1023.012 × 1022.659 × 1022.713 × 1023.825 × 1021.217 × 1021.651 × 102
p1.734 × 10−61.734 × 10−61.734 × 10−68.466 × 10−62.879 × 10−61.734 × 10−69.316 × 10−62.895 × 10−13.882 × 10−61.319 × 10−21.734 × 10−66.320 × 10−58.612 × 10−1~
Rank1261379108311414521
F3Best7.579 × 1027.724 × 1027.273 × 1027.410 × 1027.618 × 1027.974 × 1027.428 × 1027.107 × 1027.422 × 1027.296 × 1028.835 × 1027.439 × 1027.219 × 1027.173 × 102
Mean8.168 × 1028.050 × 1027.398 × 1027.876 × 1028.010 × 1028.579 × 1028.015 × 1027.336 × 1027.769 × 1027.515 × 1021.109 × 1037.878 × 1027.266 × 1027.310 × 102
Std1.877 × 1011.293 × 1014.855 × 1002.381 × 1012.470 × 1013.465 × 1012.349 × 1011.259 × 1011.868 × 1011.313 × 1016.833 × 1012.543 × 1013.182 × 1004.386 × 100
p1.734 × 10−61.734 × 10−64.286 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−64.528 × 10−11.734 × 10−64.286 × 10−61.734 × 10−61.734 × 10−66.156 × 10−4~
Rank1211479131036514812
F4Best1.907 × 1031.914 × 1031.951 × 1031.902 × 1031.903 × 1032.327 × 1031.906 × 1031.901 × 1031.903 × 1031.907 × 1031.836 × 1041.904 × 1031.901 × 1031.901 × 103
Mean1.928 × 1031.931 × 1032.783 × 1031.908 × 1032.108 × 1031.189 × 1042.822 × 1031.904 × 1032.405 × 1032.826 × 1039.525 × 1051.957 × 1031.902 × 1031.902 × 103
Std4.423 × 1011.653 × 1017.388 × 1025.425 × 1004.800 × 1021.806 × 1042.390 × 1033.778 × 1001.542 × 1031.338 × 1038.239 × 1056.971 × 1013.186 × 10−14.323 × 10−1
p1.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.204 × 10−11.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−63.872 × 10−2~
Rank5812491310371114612
F5Best1.163 × 1049.216 × 1041.218 × 1047.560 × 1039.704 × 1033.651 × 1034.026 × 1032.520 × 1033.445 × 1032.786 × 1034.384 × 1052.626 × 1032.560 × 1033.282 × 103
Mean9.556 × 1047.830 × 1051.708 × 1054.179 × 1053.588 × 1059.797 × 1041.144 × 1054.429 × 1047.965 × 1042.032 × 1051.006 × 1072.060 × 1041.145 × 1049.740 × 103
Std7.971 × 1046.335 × 1051.949 × 1056.434 × 1052.483 × 1058.431 × 1041.515 × 1057.554 × 1041.520 × 1051.529 × 1051.159 × 1073.270 × 1046.384 × 1035.862 × 103
p1.734 × 10−61.734 × 10−62.127 × 10−63.515 × 10−61.734 × 10−63.882 × 10−61.127 × 10−55.667 × 10−32.849 × 10−23.515 × 10−61.734 × 10−68.290 × 10−12.452 × 10−1~
Rank8131011127645914132
F6Best1.622 × 1031.667 × 1031.875 × 1031.629 × 1031.604 × 1031.666 × 1031.646 × 1031.601 × 1031.642 × 1031.639 × 1032.113 × 1031.724 × 1031.604 × 1031.610 × 103
Mean1.787 × 1031.830 × 1031.991 × 1031.836 × 1031.881 × 1031.879 × 1031.969 × 1031.764 × 1031.884 × 1031.851 × 1032.724 × 1031.978 × 1031.629 × 1031.640 × 103
Std1.014 × 1027.346 × 1016.859 × 1019.580 × 1011.671 × 1021.116 × 1022.008 × 1021.373 × 1021.450 × 1021.289 × 1022.477 × 1021.262 × 1021.663 × 1012.224 × 101
p1.921 × 10−61.734 × 10−61.734 × 10−61.921 × 10−61.921 × 10−61.734 × 10−61.921 × 10−62.831 × 10−41.921 × 10−61.921 × 10−61.734 × 10−61.734 × 10−62.703 × 10−2~
Rank4613581011397141212
F7Best4.155 × 1032.024 × 1045.643 × 1033.626 × 1034.122 × 1033.653 × 1036.712 × 1032.381 × 1032.330 × 1032.830 × 1035.623 × 1042.676 × 1032.292 × 1032.288 × 103
Mean1.735 × 1042.769 × 1053.260 × 1054.441 × 1055.679 × 1051.217 × 1046.326 × 1058.418 × 1031.190 × 1046.809 × 1044.980 × 1068.061 × 1032.836 × 1032.740 × 103
Std9.366 × 1031.783 × 1055.082 × 1059.759 × 1051.057 × 1068.113 × 1031.271 × 1068.456 × 1031.083 × 1041.341 × 1057.005 × 1065.316 × 1033.142 × 1023.144 × 102
p1.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.025 × 10−52.127 × 10−61.734 × 10−61.734 × 10−61.921 × 10−62.289 × 10−1~
Rank7139121161035814421
F8Best2.314 × 1032.317 × 1032.300 × 1032.268 × 1032.302 × 1032.323 × 1032.280 × 1032.213 × 1032.252 × 1032.261 × 1033.146 × 1032.277 × 1032.291 × 1032.285 × 103
Mean2.394 × 1032.569 × 1032.619 × 1032.317 × 1032.459 × 1032.763 × 1032.583 × 1032.301 × 1032.361 × 1032.385 × 1033.876 × 1032.356 × 1032.306 × 1032.300 × 103
Std4.532 × 1011.115 × 10025.178 × 1021.598 × 1011.312 × 1022.167 × 1022.400 × 1022.644 × 1015.474 × 1015.418 × 1014.149 × 1024.495 × 1013.329 × 1002.865 × 100
p1.734 × 10−61.734 × 10−66.435 × 10−12.052 × 10−41.734 × 10−61.734 × 10−61.921 × 10−62.765 × 10−32.597 × 10−52.603 × 10−61.734 × 10−64.286 × 10−62.370 × 10−5~
Rank9125410131127814631
F9Best2.591 × 1032.675 × 1032.791 × 1032.538 × 1032.544 × 1032.671 × 1032.573 × 1032.512 × 1032.544 × 1032.508 × 1032.849 × 1032.522 × 1032.581 × 1032.598 × 103
Mean2.763 × 1032.763 × 1032.809 × 1032.768 × 1032.791 × 1032.788 × 1032.803 × 1032.740 × 1032.760 × 1032.775 × 1032.958 × 1032.781 × 1032.733 × 1032.733 × 103
Std5.035 × 1013.334 × 1018.519 × 1006.581 × 1018.131 × 1015.123 × 1019.564 × 1017.332 × 1017.312 × 1017.508 × 1016.457 × 1019.228 × 1014.037 × 1013.922 × 101
p1.593 × 10−38.217 × 10−31.734 × 10−63.589 × 10−44.390 × 10−34.534 × 10−44.390 × 10−31.319 × 10−22.765 × 10−31.833 × 10−31.734 × 10−61.833 × 10−35.038 × 10−1~
Rank5413710912368141121
F10Best2.946 × 1032.976 × 1032.936 × 1032.872 × 1032.927 × 1032.967 × 1032.966 × 1032.898 × 1032.949 × 1032.926 × 1033.195 × 1032.746 × 1032.906 × 1032.901 × 103
Mean2.994 × 1033.011 × 1033.091 × 1032.953 × 1033.054 × 1033.177 × 1033.066 × 1032.938 × 1032.994 × 1032.992 × 1034.211 × 1032.994 × 1032.941 × 1032.935 × 103
Std2.928 × 1011.993 × 1017.328 × 1013.128 × 1011.210 × 1021.160 × 1028.135 × 1012.818 × 1014.673 × 1014.779 × 1015.076 × 1029.466 × 1019.829 × 1001.621 × 101
p1.921 × 10−61.734 × 10−61.921 × 10−61.108 × 10−22.127 × 10−61.734 × 10−61.734 × 10−68.936 × 10−11.734 × 10−62.127 × 10−61.734 × 10−64.534 × 10−41.254 × 10−1~
Rank8101249131137614521
Mean Rank7.59.310.26.59.410.610.12.96.78.414621.4
Final Ranking7912510131136814421
+/=/−10/0/010/0/010/1/010/0/010/0/010/0/010/0/05/4/110/0/010/0/010/0/09/1/04/6/1~
Table 6. Test results of EAPO and other algorithms on CEC2020 (dim = 20).
Table 6. Test results of EAPO and other algorithms on CEC2020 (dim = 20).
FunctionItem NamePSODECMA-ESWOAHHOCL-PSONC-HHODBOHOHOAAOATG-COAAPOEAPO
F1Best2.632 × 1092.397 × 1098.724 × 1092.643 × 1077.027 × 1081.255 × 10105.643 × 1091.020 × 1032.552 × 1095.216 × 1092.975 × 10101.317 × 1092.450 × 1056.582 × 103
Mean6.571 × 1093.968 × 1091.744 × 10107.331 × 1078.219 × 1092.171 × 10101.091 × 10103.373 × 1067.716 × 1091.028 × 10105.106 × 10107.270 × 1095.500 × 1051.460 × 104
Std1.771 × 1098.734 × 1085.121 × 1093.515 × 1074.500 × 1095.131 × 1093.607 × 1095.604 × 1063.094 × 1093.266 × 1099.958 × 1093.034 × 1092.535 × 1056.298 × 103
p1.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−64.897 × 10−41.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−6~
Rank6512491311281014731
F2Best4.315 × 1033.195 × 1034.917 × 1033.080 × 1033.110 × 1033.944 × 1033.779 × 1032.043 × 1033.641 × 1033.059 × 1036.326 × 1033.694 × 1031.995 × 1032.454 × 103
Mean5.108 × 1033.660 × 1035.629 × 1033.915 × 1034.521 × 1034.529 × 1034.785 × 1032.937 × 1034.732 × 1033.961 × 1036.848 × 1034.634 × 1032.617 × 1032.880 × 103
Std4.130 × 1022.002 × 1022.743 × 1025.294 × 1025.172 × 1022.645 × 1025.263 × 1025.088 × 1025.072 × 1024.745 × 1022.627 × 1024.499 × 1022.547 × 1022.373 × 102
p1.734 × 10−61.734 × 10−61.734 × 10−61.921 × 10−61.734 × 10−61.734 × 10−61.734 × 10−66.435 × 10−11.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.965 × 10−3~
Rank1241357811310614912
F3Best1.030 × 1039.732 × 1028.036 × 1028.245 × 1029.237 × 1029.984 × 1029.553 × 1027.403 × 1028.901 × 1028.331 × 1021.817 × 1038.114 × 1027.426 × 1027.592 × 102
Mean1.154 × 1031.067 × 1038.185 × 1029.458 × 1021.001 × 1031.172 × 1039.995 × 1027.853 × 1029.408 × 1028.743 × 1022.112 × 1039.554 × 1027.548 × 1027.768 × 102
Std7.951 × 1014.047 × 1015.706 × 1005.474 × 1013.539 × 1019.090 × 1012.549 × 1013.405 × 1012.765 × 1012.982 × 1011.571 × 1025.832 × 1016.289 × 1007.849 × 100
p1.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−63.933 × 10−11.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−6~
Rank1211471013936514812
F4Best2.000 × 1032.115 × 1034.075 × 1031.916 × 1032.272 × 1034.361 × 1042.049 × 1031.904 × 1032.225 × 1032.614 × 1031.259 × 1062.071 × 1031.903 × 1031.904 × 103
Mean6.563 × 1034.053 × 1031.306 × 1051.982 × 1033.421 × 1043.881 × 1053.771 × 1041.916 × 1038.683 × 1032.810 × 1046.543 × 1061.934 × 1041.904 × 1031.906 × 103
Std6.587 × 1039.507 × 1029.504 × 1049.119 × 1013.859 × 1043.382 × 1055.154 × 1041.224 × 1017.711 × 1032.500 × 1043.256 × 1063.479 × 1046.551 × 10−17.098 × 10−1
p1.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−64.449 × 10−51.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−62.603 × 10−6~
Rank6512410139371114812
F5Best7.484 × 1051.185 × 1061.286 × 1069.891 × 1041.651 × 1056.724 × 1052.584 × 1053.771 × 1042.774 × 1057.996 × 1041.604 × 1077.094 × 1043.756 × 1042.718 × 104
Mean2.824 × 1064.837 × 1069.443 × 1061.748 × 1062.123 × 1063.397 × 1062.022 × 1066.159 × 1051.978 × 1061.272 × 1068.384 × 1077.290 × 1051.060 × 1058.271 × 104
Std1.533 × 1062.432 × 1066.965 × 1061.427 × 1061.595 × 1062.106 × 1061.388 × 1066.742 × 1051.170 × 1067.694 × 1055.529 × 1075.763 × 1053.577 × 1043.598 × 104
p1.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−62.353 × 10−61.734 × 10−61.734 × 10−61.734 × 10−62.353 × 10−63.160 × 10−2~
Rank1012136811739514421
F6Best2.061 × 1031.689 × 1032.339 × 1031.789 × 1032.052 × 1032.249 × 1032.292 × 1031.623 × 1032.032 × 1031.840 × 1033.405 × 1032.392 × 1031.645 × 1031.666 × 103
Mean2.394 × 1031.800 × 1032.761 × 1032.482 × 1032.721 × 1032.588 × 1032.866 × 1031.983 × 1032.540 × 1032.367 × 1034.277 × 1032.853 × 1031.696 × 1031.719 × 103
Std1.949 × 1026.006 × 1011.895 × 1023.223 × 1023.749 × 1021.656 × 1023.243 × 1021.785 × 1022.824 × 1022.680 × 1023.995 × 1023.218 × 1023.377 × 1012.865 × 101
p1.734 × 10−65.216 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−64.286 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.114 × 10−3~
Rank6311710912485141312
F7Best1.815 × 1054.964 × 1053.600 × 1058.786 × 1046.482 × 1049.171 × 1041.301 × 1059.613 × 1031.271 × 1057.606 × 1046.979 × 1061.716 × 1044.283 × 1034.901 × 103
Mean8.156 × 1051.835 × 1064.209 × 1061.141 × 1065.698 × 1057.369 × 1051.203 × 1062.384 × 1057.795 × 1055.922 × 1054.887 × 1072.358 × 1052.246 × 1041.569 × 104
Std4.977 × 1059.568 × 1053.407 × 1061.001 × 1064.257 × 1055.173 × 1051.243 × 1062.979 × 1056.737 × 1054.792 × 1053.804 × 1072.343 × 1052.143 × 1041.281 × 104
p1.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−62.353 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.921 × 10−63.286 × 10−1~
Rank9121310581137614421
F8Best2.736 × 1033.869 × 1033.745 × 1032.319 × 1032.802 × 1033.513 × 1033.427 × 1032.300 × 1032.470 × 1032.795 × 1036.215 × 1032.594 × 1032.309 × 1032.300 × 103
Mean5.002 × 1034.603 × 1036.617 × 1033.876 × 1035.264 × 1035.508 × 1035.157 × 1032.656 × 1032.953 × 1034.036 × 1038.159 × 1034.620 × 1032.312 × 1032.302 × 103
Std1.834 × 1034.044 × 1027.734 × 1021.857 × 1031.135 × 1036.683 × 1021.056 × 1037.745 × 1024.155 × 1021.239 × 1035.592 × 1021.555 × 1031.547 × 1001.209 × 100
p1.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−63.182 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−6~
Rank9813511121034614721
F9Best2.914 × 1032.922 × 1032.983 × 1032.915 × 1032.935 × 1032.990 × 1033.029 × 1032.851 × 1032.947 × 1033.063 × 1033.245 × 1033.006 × 1032.822 × 1032.835 × 103
Mean2.952 × 1032.951 × 1033.026 × 1032.984 × 1033.118 × 1033.087 × 1033.286 × 1032.899 × 1033.062 × 1033.194 × 1033.604 × 1033.189 × 1032.841 × 1032.848 × 103
Std2.943 × 1011.064 × 1012.039 × 1015.029 × 1011.038 × 1024.947 × 1011.238 × 1022.145 × 1017.490 × 1017.417 × 1011.602 × 1021.091 × 1027.777 × 1006.755 × 100
p1.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−62.415 × 10−3~
Rank4576109133812141112
F10Best3.073 × 1033.153 × 1033.629 × 1032.928 × 1033.163 × 1034.006 × 1033.141 × 1032.914 × 1033.065 × 1033.114 × 1035.833 × 1033.046 × 1032.914 × 1032.914 × 103
Mean3.293 × 1033.438 × 1034.287 × 1033.025 × 1033.696 × 1034.902 × 1033.624 × 1032.961 × 1033.326 × 1033.514 × 1031.067 × 1043.429 × 1032.947 × 1032.945 × 103
Std1.705 × 1021.438 × 1024.686 × 1024.541 × 1013.981 × 1025.709 × 1023.066 × 1025.800 × 1011.956 × 1021.919 × 1022.319 × 1032.425 × 1023.088 × 1013.088 × 101
p1.734 × 10−61.734 × 10−61.734 × 10−64.286 × 10−61.734 × 10−61.734 × 10−61.734 × 10−64.405 × 10−11.734 × 10−61.734 × 10−61.734 × 10−61.734 × 10−69.426 × 10−1~
Rank5812411131026914731
Mean Rank7.97.3115.89.110.910.32.97.37.5147.81.71.5
Final Ranking9513410121135714821
+/=/−10/0/010/0/010/0/010/0/010/0/010/0/010/0/07/3/010/0/010/0/010/0/09/1/04/2/4~
Table 7. Test results of EAPO and other algorithms on 10 real-world engineering problems.
Table 7. Test results of EAPO and other algorithms on 10 real-world engineering problems.
FunctionItem NamePSODECMA-ESWOAHHOCL-PSONC-HHODBOHOHOAAOATG-COAAPOEAPO
RW01Best5.199 × 10157.031 × 10139.257 × 10212.354 × 10134.887 × 10109.257 × 10217.779 × 10137.049 × 1032.896 × 10142.176 × 10161.137 × 10171.131 × 10154.699 × 1095.036 × 107
Mean3.636 × 10162.487 × 10149.257 × 10214.408 × 10141.083 × 10159.270 × 10211.201 × 10153.834 × 10141.167 × 10165.948 × 10164.777 × 10172.309 × 10166.585 × 10103.224 × 109
Std2.852 × 10161.209 × 10147.466 × 10062.938 × 10143.288 × 10151.880 × 10191.419 × 10156.695 × 10141.280 × 10162.446 × 10161.726 × 10172.192 × 10164.587 × 10105.103 × 109
p3.020 × 10−113.020 × 10−111.212 × 10−123.020 × 10−113.020 × 10−112.982 × 10−113.020 × 10−116.607 × 10−013.020 × 10−113.020 × 10−113.020 × 10−113.020 × 10−118.993 × 10−113.020 × 10−11
Rank1051364147381112921
RW02Best2.514 × 1002.644 × 1007.883 × 1002.828 × 1003.243 × 1005.102 × 1023.243 × 1001.102 × 1003.035 × 1009.474 × 1001.243 × 1029.245 × 1001.920 × 1001.405 × 100
Mean8.391 × 1003.177 × 1001.027 × 1015.049 × 1007.466 × 1012.541 × 1041.662 × 1012.373 × 1005.819 × 1002.168 × 1012.192 × 1022.653 × 1012.579 × 1001.926 × 100
Std5.649 × 1002.961 × 10−14.875 × 1004.556 × 1006.273 × 1012.576 × 1041.006 × 1019.085 × 10−14.238 × 1007.489 × 1004.877 × 1011.101 × 1012.510 × 10−12.706 × 10−1
p3.020 × 10−113.020 × 10−116.387 × 10−123.020 × 10−112.521 × 10−113.020 × 10−113.020 × 10−111.911 × 10−023.012 × 10−113.020 × 10−113.020 × 10−113.020 × 10−111.070 × 10−93.020 × 10−11
Rank7485121492610131131
RW03Best2.324 × 1002.669 × 1006.356 × 1012.067 × 1002.672 × 1002.627 × 1023.143 × 1001.282 × 1002.663 × 1009.996 × 1003.348 × 1015.703 × 1002.052 × 1001.345 × 100
Mean6.313 × 1003.333 × 1007.183 × 1012.929 × 1009.258 × 1001.623 × 1039.347 × 1002.419 × 1006.088 × 1001.529 × 1014.998 × 1011.170 × 1012.476 × 1001.615 × 100
Std3.428 × 1003.401 × 10−15.558 × 1004.773 × 10−16.093 × 1001.123 × 1034.455 × 1004.628 × 10−11.852 × 1002.989 × 1008.998 × 1003.332 × 1002.033 × 10−12.041 × 10−1
p3.020 × 10−113.020 × 10−112.932 × 10−113.685 × 10−113.020 × 10−113.020 × 10−113.020 × 10−116.518 × 10−93.020 × 10−113.020 × 10−113.020 × 10−113.020 × 10−114.077 × 10−113.020 × 10−11
Rank6513481492711121031
RW04Best3.907 × 1003.010 × 1001.117 × 1012.951 × 1004.762 × 1008.280 × 1002.926 × 1002.925 × 1002.925 × 1002.928 × 1001.412 × 1094.618 × 1002.925 × 1002.926 × 100
Mean6.534 × 1006.412 × 1001.615 × 1015.419 × 1007.964 × 1001.178 × 1013.782 × 1004.040 × 1003.327 × 1003.903 × 1002.492 × 10124.799 × 1002.947 × 1002.937 × 100
Std1.709 × 1003.113 × 1001.313 × 1002.015 × 1002.035 × 1002.717 × 1008.537 × 10−19.609 × 10−15.337 × 10−16.146 × 10−16.830 × 10122.023 × 10−13.861 × 10−21.323 × 10−2
p3.020 × 10−113.012 × 10−112.088 × 10−116.066 × 10−113.020 × 10−113.009 × 10−119.260 × 10−91.269 × 10−83.010 × 10−73.197 × 10−93.020 × 10−113.020 × 10−119.234 × 10−013.020 × 10−11
Rank1091381112453614721
RW05Best5.507 × 1045.551 × 1047.663 × 10116.260 × 1046.504 × 1047.663 × 10115.747 × 1045.380 × 1046.414 × 1046.567 × 1041.261 × 1056.739 × 1045.407 × 1045.368 × 104
Mean6.789 × 1045.892 × 1047.663 × 10118.824 × 1049.873 × 1047.663 × 10118.248 × 1046.388 × 1047.502 × 1048.515 × 1042.044 × 1069.069 × 1045.528 × 1045.472 × 104
Std9.398 × 1031.731 × 1033.725 × 10−41.484 × 1042.619 × 1041.885 × 1061.823 × 1041.284 × 1047.852 × 1031.034 × 1042.850 × 1061.062 × 1041.401 × 1031.243 × 103
p2.154 × 10−104.200 × 10−101.212 × 10−123.020 × 10−113.020 × 10−112.232 × 10−113.690 × 10−111.385 × 10−63.020 × 10−113.020 × 10−113.020 × 10−113.020 × 10−112.709 × 10−22.154 × 10−10
Rank5313810147469121121
RW06Best5.833 × 10−24.474 × 10−15.925 × 1037.620 × 10−21.371 × 1001.619 × 1031.753 × 1004.424 × 10−25.685 × 1002.090 × 1006.628 × 1066.435 × 1035.173 × 10−23.663 × 10−2
Mean1.220 × 1054.346 × 1006.748 × 1041.513 × 1051.617 × 1066.079 × 1055.300 × 1048.748 × 1041.195 × 1061.180 × 1035.973 × 1071.159 × 1063.062 × 1041.872 × 104
Std4.733 × 1054.329 × 1001.950 × 1052.419 × 1053.726 × 1065.654 × 1051.470 × 1059.512 × 1041.740 × 1062.240 × 1034.988 × 1071.328 × 1066.899 × 1045.713 × 104
p5.462 × 10−61.868 × 10−58.131 × 10−88.352 × 10−86.010 × 10−84.200 × 10−101.359 × 10−71.111 × 10−31.174 × 10−91.596 × 10−73.020 × 10−115.573 × 10−101.004 × 10−35.462 × 10−6
Rank4210891275116141331
RW07Best5.762 × 1035.745 × 1036.183 × 1035.921 × 1036.322 × 1036.181 × 1036.100 × 1035.743 × 1035.918 × 1036.161 × 1039.732 × 1035.746 × 1035.743 × 1035.746 × 103
Mean6.314 × 1036.012 × 1036.420 × 1037.285 × 1031.005 × 1046.352 × 1038.443 × 1035.926 × 1036.846 × 1036.719 × 1032.152 × 1046.783 × 1035.923 × 1035.888 × 103
Std5.552 × 1021.262 × 1022.962 × 1021.289 × 1033.381 × 1032.007 × 1023.291 × 1032.855 × 1029.953 × 1023.610 × 1027.230 × 1031.094 × 1031.623 × 1021.023 × 102
p2.126 × 10−42.891 × 10−31.174 × 10−92.439 × 10−93.690 × 10−118.101 × 10−105.494 × 10−111.180 × 10−15.462 × 10−99.919 × 10−113.020 × 10−111.385 × 10−67.845 × 10−12.126 × 10−4
Rank5481113612291014731
RW08Best1.821 × 1011.611 × 1011.010 × 10101.619 × 1011.655 × 1011.010 × 10101.652 × 1011.604 × 1011.633 × 1011.640 × 1019.152 × 1021.606 × 1011.606 × 1011.605 × 101
Mean2.145 × 1011.675 × 1011.010 × 10101.684 × 1011.068 × 1021.010 × 10103.900 × 1011.711 × 1011.791 × 1011.998 × 1012.447 × 1093.502 × 1011.636 × 1011.616 × 101
Std4.588 × 1003.519 × 10−11.185 × 1022.642 × 10−13.133 × 1022.899 × 1012.668 × 1011.994 × 1001.967 × 1009.937 × 1002.196 × 1092.943 × 1012.289 × 10−11.642 × 10−1
p3.020 × 10−114.573 × 10−93.020 × 10−111.613 × 10−103.690 × 10−113.020 × 10−115.494 × 10−113.912 × 10−21.464 × 10−108.993 × 10−113.020 × 10−117.773 × 10−91.430 × 10−53.020 × 10−11
Rank1041451113936712821
RW09Best5.313 × 1067.108 × 1044.422 × 1063.539 × 1041.926 × 1051.016 × 10104.538 × 1044.525 × 1034.291 × 1041.653 × 1062.757 × 10108.635 × 1042.493 × 1051.934 × 104
Mean1.345 × 1092.362 × 1055.089 × 1078.291 × 1056.760 × 1061.406 × 10106.792 × 1051.555 × 1054.936 × 1053.040 × 1063.375 × 10101.347 × 1069.880 × 1054.434 × 104
Std7.180 × 1081.380 × 1051.924 × 1074.172 × 1054.956 × 1062.018 × 1093.451 × 1052.646 × 1054.274 × 1058.519 × 1052.691 × 1091.337 × 1064.279 × 1052.822 × 104
p3.020 × 10−119.919 × 10−113.020 × 10−112.154 × 10−103.020 × 10−113.020 × 10−111.206 × 10−101.171 × 10−21.547 × 10−93.020 × 10−113.020 × 10−114.077 × 10−113.020 × 10−113.020 × 10−11
Rank1231169135241014781
RW10Best4.840 × 1084.882 × 1031.972 × 1077.763 × 1033.392 × 1062.433 × 1095.272 × 1034.082 × 1035.220 × 1033.250 × 1052.894 × 10102.787 × 1044.618 × 1034.136 × 103
Mean3.708 × 1097.854 × 1036.825 × 1071.942 × 1058.833 × 1066.574 × 1093.572 × 1046.643 × 1031.804 × 1041.557 × 1063.532 × 10104.819 × 1066.430 × 1034.878 × 103
Std2.608 × 1093.580 × 1031.791 × 1074.086 × 1054.771 × 1061.722 × 1092.817 × 1043.235 × 1036.969 × 1038.407 × 1053.637 × 1098.760 × 1062.331 × 1033.970 × 102
p3.020 × 10−113.020 × 10−113.020 × 10−113.020 × 10−113.020 × 10−113.020 × 10−113.020 × 10−116.414 × 10−013.020 × 10−113.020 × 10−113.020 × 10−113.020 × 10−113.020 × 10−113.020 × 10−11
Rank1241171013625814931
Mean Rank8.14.311.46.89.712.57.536.58.8139.23.11
Final Ranking8412611137259141031
+/=/−10/0/010/0/010/0/010/0/010/0/010/0/010/0/07/3/010/0/010/0/010/0/010/0/08/2/0~
Table 8. Setting of constraint parameters for UAV dynamics.
Table 8. Setting of constraint parameters for UAV dynamics.
Constraint ParameterSymbolNumerical Value
Minimum flight speed v m i n 20   m / s
Maximum flight speed v m a x 60   m / s
Maximum turn angle θ m a x 30 °
Maximum climb angle ψ c l i m b 45 °
Maximum descent angle ψ d e s c e n t 45 °
Minimum turn radius R m i n 30   m
Maximum climb rate R O C m a x 8   m / s
Maximum descent rate R O D m a x 6   m / s
Minimum flight segment length L m i n 10   m
Minimum flight altitude h m i n 150   m
Maximum flight altitude h m a x 350   m
Safety margin coefficient M s a f t y 1.2
Minimum terrain clearance d t e r r a i n 10   m
Maximum acceleration a m a x 3   m / s 2
Maximum deceleration a d e c 4   m / s 2
Table 9. Parameter Configuration for the UAV Path Planning Simulation Environment.
Table 9. Parameter Configuration for the UAV Path Planning Simulation Environment.
MapStarting PointTarget PointThreatNo-Fly Zone
RadarArtillery
CenterRCenterRCenterR
1(80, 80, 200)(900, 800, 250)(400, 500, 190)
(600, 200, 220)
100
100
(300, 250, 200)100(700, 500)100
2(80, 80, 200)(900, 800, 250)(380, 420, 200)
(550, 200, 215)
(720, 650, 185)
(250, 650, 195)
85
75
70
80
(150, 280, 215)
(650, 450, 205)
(820, 320, 180)
95
85
90
(540, 620)
(850, 500)
(350, 100)
75
70
65
3(80, 80, 150)(380, 380, 200)(150, 380, 90)50(150, 125, 100)50(350, 250)60
4(80, 80, 150)(380, 380, 200)(200, 200, 105)
(150, 75, 110)
(410, 150, 85)
45
40
40
(85, 160, 110)
(310, 250, 120)
50
45
(325, 135)
(400, 300)
(200, 330)
40
45
45
Table 10. Path planning fitness value results for EAPO and other algorithms.
Table 10. Path planning fitness value results for EAPO and other algorithms.
MapItem NamePSODEWOADBOHOHOAAPOEAPO
1Best5.997 × 10−16.431 × 10−15.984 × 10−15.635 × 10−15.809 × 10−11.180 × 10−19.865 × 10−28.854 × 10−2
Mean6.409 × 10−16.699 × 10−16.883 × 10−15.897 × 10−16.050 × 10−15.468 × 10−14.524 × 10−13.451 × 10−1
Std2.433 × 10−21.360 × 10−28.804 × 10−21.660 × 10−21.466 × 10−21.131 × 10−12.245 × 10−12.449 × 10−1
Rank68745231
2Best6.323 × 10−16.716 × 10−15.949 × 10−15.850 × 10−16.213 × 10−16.206 × 10−16.249 × 10−16.325 × 10−1
Mean1.662 × 1001.140 × 1002.118 × 1008.932 × 10−17.848 × 10−16.498 × 10−16.483 × 10−16.453 × 10−1
Std1.538 × 1007.829 × 10−12.905 × 1006.840 × 10−17.260 × 10−11.754 × 10−21.003 × 10−29.010 × 10−3
Rank78614532
3Best6.266 × 10−16.398 × 10−16.007 × 10−16.041 × 10−16.400 × 10−16.494 × 10−16.200 × 10−16.130 × 10−1
Mean6.423 × 10−16.496 × 10−16.636 × 10−16.199 × 10−16.545 × 10−16.684 × 10−16.237 × 10−16.194 × 10−1
Std8.482 × 10−34.902 × 10−34.046 × 10−29.723 × 10−31.145 × 10−21.244 × 10−22.320 × 10−33.072 × 10−3
Rank45627831
4Best6.237 × 10−16.466 × 10−16.282 × 10−16.250 × 10−16.481 × 10−16.567 × 10−16.238 × 10−16.174 × 10−1
Mean6.428 × 10−16.594 × 10−17.119 × 10−16.343 × 10−16.774 × 10−16.823 × 10−16.318 × 10−16.291 × 10−1
Std1.119 × 10−26.859 × 10−35.142 × 10−24.532 × 10−32.043 × 10−21.394 × 10−24.231 × 10−35.481 × 10−3
Rank45836721
Mean Rank5.256.56.752.55.55.52.751.25
Final Ranking47825531
Table 11. Comparison of Average Results for UAV Path Planning Between EAPO and APO (MAP 1).
Table 11. Comparison of Average Results for UAV Path Planning Between EAPO and APO (MAP 1).
Item NameAPOEAPOPercentage
Improvement
Path length1.419 × 1031.422 × 103−0.21%
Path smoothness index1.926 × 10−12.201 × 10−114.28%
Flight altitude variation1.902 × 1021.549 × 10218.56%
Actual maximum climb angle29.6628.284.65%
Actual maximum descent angle−21.29−13.7735.18%
Energy consumption1.722 × 1031.680 × 1032.44%
Threat distance6.330 × 1016.599 × 1014.25%
Computation time1.4361.618−12.67%
Table 12. Comparison of Average Results for UAV Path Planning Between EAPO and APO (MAP 2).
Table 12. Comparison of Average Results for UAV Path Planning Between EAPO and APO (MAP 2).
Item NameAPOEAPOPercentage
Improvement
Path length1.521 × 1031.515 × 1030.39%
Path smoothness index1.250 × 10−11.312 × 10−14.96%
Flight altitude variation3.774 × 1023.579 × 1025.17%
Actual maximum climb angle42.9140.326.04%
Actual maximum descent angle−34.20−34.93−2.13%
Energy consumption2.059 × 1032.028 × 10315.06%
Threat distance4.604 × 1005.040 × 1009.47%
Computation time2.1082.365−12.19%
Table 13. Comparison of Average Results for UAV Path Planning Between EAPO and APO (MAP 3).
Table 13. Comparison of Average Results for UAV Path Planning Between EAPO and APO (MAP 3).
Item NameAPOEAPOPercentage
Improvement
Path length6.227 × 1026.189 × 1020.61%
Path smoothness index1.560 × 10−11.638 × 10−15.00%
Flight altitude variation1.965 × 1021.838 × 1026.46%
Actual maximum climb angle44.4344.55−0.27%
Actual maximum descent angle−37.83−37.321.35%
Energy consumption9.336 × 1029.137 × 1022.13%
Threat distance3.542 × 1013.517 × 1010.71%
Computation time1.4431.605−11.22%
Table 14. Comparison of Average Results for UAV Path Planning Between EAPO and APO (MAP 4).
Table 14. Comparison of Average Results for UAV Path Planning Between EAPO and APO (MAP 4).
Item NameAPOEAPOPercentage
Improvement
Path length6.385 × 1026.412 × 102−0.42%
Path smoothness index1.814 × 10−21.797 × 10−20.94%
Flight altitude variation2.139 × 1022.074 × 1023.04%
Actual maximum climb angle43.8044.08−0.64%
Actual maximum descent angle−39.11−38.102.58%
Energy consumption9.716 × 1029.660 × 1020.58%
Threat distance2.808 × 1012.812 × 1010.14%
Computation time1.8452.044−10.78%
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Tang, X.; Jia, C.; Qu, P. EAPO: A Multi-Strategy-Enhanced Artificial Protozoa Optimizer and Its Application to 3D UAV Path Planning. Mathematics 2026, 14, 153. https://doi.org/10.3390/math14010153

AMA Style

Tang X, Jia C, Qu P. EAPO: A Multi-Strategy-Enhanced Artificial Protozoa Optimizer and Its Application to 3D UAV Path Planning. Mathematics. 2026; 14(1):153. https://doi.org/10.3390/math14010153

Chicago/Turabian Style

Tang, Xiaojie, Chengfen Jia, and Pengju Qu. 2026. "EAPO: A Multi-Strategy-Enhanced Artificial Protozoa Optimizer and Its Application to 3D UAV Path Planning" Mathematics 14, no. 1: 153. https://doi.org/10.3390/math14010153

APA Style

Tang, X., Jia, C., & Qu, P. (2026). EAPO: A Multi-Strategy-Enhanced Artificial Protozoa Optimizer and Its Application to 3D UAV Path Planning. Mathematics, 14(1), 153. https://doi.org/10.3390/math14010153

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

Article Metrics

Article metric data becomes available approximately 24 hours after publication online.
Back to TopTop