Return
A distance determination wolf pack algorithm for solving high-dimensional complex functions and its application
DOI:10.1007/s11227-025-07306-7.png)
Abstract
En 中文
The wolf pack algorithm (WPA), a swarm intelligence method inspired by wolf hunting behaviors, faces limitations in convergence accuracy, computational efficiency, and local optima avoidance. This paper proposes a Distance Determination Wolf Pack Algorithm (DDWPA) to address these challenges. Key innovations include: (1) An initial wandering position recording mechanism to prevent premature local convergence; (2) a distance judgment factor integrated into the summoning phase for accelerated population evolution; and (3) a head wolf relative positioning strategy and distance-updated regeneration operator to enhance global search capability. The algorithm's convergence is theoretically verified through Markov process analysis. Extensive evaluations on CEC2022 and CEC2020 benchmark functions demonstrate DDWPA's superiority over existing swarm intelligence algorithms in terms of solution precision and convergence speed. Four engineering case studies further validate its effectiveness in handling high-dimensional real-world optimization problems. Results consistently show that DDWPA achieves superior global convergence and computational efficiency while maintaining robustness against local optima traps.
Keywords:
Wolf pack algorithm
Wander threshold
Population-based optimization
Distance determination factor
High-dimensional function optimization
Journal
IF:
2.7
Papers:
1.2K
Citations:
1.0W
Organization
Cited Papers
Optimal design of spatial structures by a novel meta-heuristic algorithm: Sound energy optimizer
STRUCTURES
IF4.3
A New Hybrid Improved Arithmetic Optimization Algorithm for Solving Global and Engineering Optimization Problems
Mathematics
IF0

