This paper presents an enhanced artificial lemming algorithm (EALA) for solving complex unmanned aircraft system (UAV) path planning problems in three-dimensional environments. Key improvements include chaotic initialization, adaptive perturbation, and hybrid mutation, enabling a better exploration–exploitation balance and local refinement. Validation on the IEEE CEC2017 and CEC2022 benchmark functions demonstrates the EALA’s superior performance, achieving faster convergence and better algorithm performance compared to the standard ALA and 10 other algorithms. When applied to UAV path planning in large- and medium-scale environments with realistic obstacle constraints, the EALA generates Pareto-optimal paths that minimize length, curvature, and computation time while guaranteeing collision avoidance. Benchmark tests and realistic simulations show that the EALA outperforms 10 algorithms. This method is particularly suited for mission-critical applications with strict safety and time constraints.

This study addresses the premature convergence issue of the Black-Winged Kite Algorithm (BKA) in high-dimensional optimization problems by proposing an enhanced hybrid algorithm (BKAPI). First of all, BKA provides dynamic global exploration through its hovering and dive attack strategies, while Particle Swarm Optimization (PSO) enhances local exploitation via its velocity-based search mechanism. Then, PSO enables efficient local refinement, and Differential Evolution (DE) introduces a differential mutation strategy to maintain population diversity and prevent premature convergence. Finally, the integration ensures a balanced exploration–exploitation trade-off, overcoming BKA’s sensitivity to parameter settings and insufficient local search capabilities. By combining these mechanisms, BKAPI achieves a robust balance, significantly improving convergence speed and computational accuracy. To validate its effectiveness, the performance of the enhanced hybrid algorithm is rigorously evaluated against seven other intelligent optimization algorithms using the CEC 2017 and CEC 2022 benchmark test functions. Experimental results demonstrate that the proposed integrated strategy surpasses other advanced algorithms, highlighting its superiority and strong application potential. Additionally, the algorithm’s practical utility is further confirmed through its successful application to three real-world engineering problems: welding beam design, the Himmelblau function, and visible light positioning, underscoring the effectiveness and versatility of the proposed approach.

The Walrus Optimization (WO) algorithm, a metaheuristic inspired by walrus behavior, is known for its competitive convergence speed and effectiveness in solving high-dimensional and practical engineering optimization problems. However, it suffers from a tendency to converge to local optima and exhibits instability during the iterative process. To overcome these limitations, this study proposes an improved WO (IMWO) algorithm based on the integration of Differential Evolution/best/1 (DE/best/1) mutation, Logistics–Sine–Cosine (LSC) Mapping, and the Beta Opposition-Based Learning (Beta-OBL) strategy. These strategies work synergistically to enhance the algorithm’s global exploration capability, improve its search stability, and accelerate convergence with higher precision. The performance of the IMWO algorithm was comprehensively evaluated using the CEC2017 and CEC2022 benchmark test suites, where it was compared against the original WO algorithm and six other state-of-the-art metaheuristics. Experimental data revealed that the IMWO algorithm achieved average fitness rankings of 1.66 and 1.33 in the two test suites, ranking first among all compared algorithms. The WSN coverage optimization problem aims to maximize the monitored area while reducing perception blind spots under limited node resources and energy constraints, which is a typical complex optimization problem with multiple constraints. In a practical application addressing the coverage optimization problem in Wireless Sensor Networks (WSNs), the IMWO algorithm attained average coverage rates of 95.86% and 96.48% in two sets of coverage experiments, outperforming both the original WO and other compared algorithms. These results confirm the practical utility and robustness of the IMWO algorithm in solving complex real-world engineering problems.

This study proposes Enhanced Beaver Behavior Optimizer (EBBO) to overcome the original BBO algorithm’s limitations in handling complex optimization problems. EBBO integrates a three-phase cooperative framework, incorporating adaptive mutation, dynamic opposition-based learning, and an risk-aware decision strategy inspired by simulated annealing. Comprehensive evaluations on the CEC 2017 and CEC 2020 benchmark suites demonstrate that EBBO significantly outperforms nine widely used algorithms (e.g., BBO, FATA, DE) in convergence accuracy, stability, and robustness, especially for high-dimensional and multimodal functions. EBBO achieves average objective value reductions of 15–50% and standard deviation reductions of 30–70% compared to the original BBO, with Wilcoxon rank-sum tests confirming statistical significance across most functions. When applied to three classical engineering design problems—step-cone pulley, pressure vessel, three-bar truss optimization, and 3D UAV path planning—EBBO consistently achieved the best or near-optimal solutions while satisfying all nonlinear constraints. The results confirm that EBBO effectively balances exploration and exploitation, offering a reliable and efficient approach for solving complex constrained optimization challenges in both benchmark and real-world engineering contexts.

The Kangaroo Escape Optimizer (KEO) is a recently proposed biomimetic metaheuristic inspired by the adaptive escape strategies of kangaroos in predator–prey interactions. Although effective, KEO-like algorithms based on many populations may suffer from premature convergence and loss of population diversity when addressing complex, multimodal, and constrained optimization problems. This paper proposes an Enhanced Kangaroo Escape Optimizer (EKEO) that integrates Differential Evolution Mutation (DEM) and Quasi-Oppositional Learning (QOL) to address fundamental limitations in exploration–exploitation balance. From a biomimetic perspective, DEM mimics the refined high-frequency muscular adjustments of a kangaroo during close-range evasion, enabling local refinement around promising solutions, while QOL emulates the animal’s sudden directional changes and scanning behavior to preserve population diversity and escape local optima. Their principled integration yields a robust optimization framework that consistently outperforms state-of-the-art and classical metaheuristics across benchmark functions and real-world engineering problems. The findings suggest a generalizable design principle for biomimetic hybrid metaheuristics, demonstrating that coupling directed exploitation with diversity-preserving exploration leads to reliable high-performance optimization. The performance of EKEO is rigorously evaluated in two phases. First, its optimization accuracy and convergence speed are benchmarked against 11 state-of-the-art and classical metaheuristics on 23 classical benchmark functions and the CEC 2019 test suite. Second, its practical applicability and constraint-handling effectiveness are validated on four real-world engineering design problems: step-cone pulley, gear system, tubular column, and pressure vessel design. The experimental results are supported by comprehensive statistical analyses (including Wilcoxon rank-sum tests) and convergence curves, showing that EKEO consistently outperforms its competitors in solution quality, convergence speed, and robustness. These findings establish EKEO as a competitive, reliable, and versatile biomimetic optimization tool suitable for solving complex continuous and constrained engineering optimization problems.

Unmanned aerial vehicle path planning faces multiple challenges in terms of effectiveness and safety. Traditional optimization methods are difficult to use to effectively find the best route. An enhanced artificial lemming optimization algorithm (ALAEN) is proposed here, which introduces stochastic differential mutation and Beta opposition-based learning into the artificial lemming algorithm (ALA). The comparison with other algorithms on the CEC2017 test set shows that it can effectively improve the optimization ability and convergence speed of the artificial lemming algorithm. Among all algorithms, ALA has an overall ranking of 5.45 and ALAEN has a ranking of 1.34. The ability of ALAEN to solve the actual problem of UAV trajectory planning is tested on two different maps, and it is found that it can effectively improve the path planning ability and ensure safety compared with the ALA. In the small map scene, the average cost function of ALA is 92.999, and the average cost function of ALAEN is 91.598, which is a significant improvement. Compared with other algorithms, ALAEN has the shortest trajectory route and trajectory cost function.