EODE-PFA: Un algoritmo de Pathfinder mejorado con múltiples estrategias para la optimización de ingeniería y la...

The Pathfinder Algorithm (PFA) is a bionic swarm intelligence optimization algorithm inspired by simulating the cooperative movement of animal groups in nature to search for prey. Based on fitness, the algorithm classifies search individuals into leaders and followers. However, PFA fails to effectively balance the optimization capabilities of leaders and followers, leading to problems such as insufficient population diversity and slow convergence speed in the original algorithm. To address these issues, this paper proposes an enhanced pathfinder algorithm based on multi-strategy (EODE-PFA). Through the synergistic effects of multiple improved strategies, it effectively solves the balance problem between global exploration and local optimization of the algorithm. To verify the performance of EODE-PFA, this paper applies it to CEC2022 benchmark functions, three types of complex engineering optimization problems, and six sets of feature selection problems, respectively, and compares it with eight mature optimization algorithms. Experimental results show that in three different scenarios, EODE-PFA has significant advantages and competitiveness in both convergence speed and solution accuracy, fully verifying its engineering practicality and scenario universality. To highlight the synergistic effects and overall gains of multiple improved strategies, ablation experiments are conducted on key strategies. To further verify the statistical significance of the experimental results, the Wilcoxon signed-rank test is performed in this study. In addition, for feature selection problems, this study selects UCI real datasets with different real-world scenarios and dimensions, and the results show that the algorithm can still effectively balance exploration and exploitation capabilities in discrete scenarios.