Journal of Bionic Engineering ›› 2024, Vol. 21 ›› Issue (3): 1592-1616.doi: 10.1007/s42235-024-00510-w

• • 上一篇    

APFA: Ameliorated Pathfinder Algorithm for Engineering Applications

Keyu Zhong1,2; Fen Xiao3; Xieping Gao1,4   

  1. 1 Key Laboratory of Computing and Stochastic Mathematics of Ministry of Education, Hunan Normal University, Changsha 410081, China
    2 School of Mathematics and Statistics, Hunan Normal University, Changsha 410081, China
    3 School of Computer Science, Xiangtan University, Xiangtan 411105, China
    4 Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing, Hunan Normal University, Changsha 410081, China
  • 出版日期:2024-05-20 发布日期:2024-06-08
  • 通讯作者: Fen Xiao; Xieping Gao E-mail:xiaof@xtu.edu.cn; xpgao@hunnu.edu.cn
  • 作者简介:Keyu Zhong1,2; Fen Xiao3; Xieping Gao1,4

APFA: Ameliorated Pathfinder Algorithm for Engineering Applications

Keyu Zhong1,2; Fen Xiao3; Xieping Gao1,4   

  1. 1 Key Laboratory of Computing and Stochastic Mathematics of Ministry of Education, Hunan Normal University, Changsha 410081, China
    2 School of Mathematics and Statistics, Hunan Normal University, Changsha 410081, China
    3 School of Computer Science, Xiangtan University, Xiangtan 411105, China
    4 Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing, Hunan Normal University, Changsha 410081, China
  • Online:2024-05-20 Published:2024-06-08
  • Contact: Fen Xiao; Xieping Gao E-mail:xiaof@xtu.edu.cn; xpgao@hunnu.edu.cn
  • About author:Keyu Zhong1,2; Fen Xiao3; Xieping Gao1,4

摘要: Pathfinder algorithm (PFA) is a swarm intelligent optimization algorithm inspired by the collective activity behavior of
swarm animals, imitating the leader in the population to guide followers in finding the best food source. This algorithm has
the characteristics of a simple structure and high performance. However, PFA faces challenges such as insufficient population
diversity and susceptibility to local optima due to its inability to effectively balance the exploration and exploitation
capabilities. This paper proposes an Ameliorated Pathfinder Algorithm called APFA to solve complex engineering optimization
problems. Firstly, a guidance mechanism based on multiple elite individuals is presented to enhance the global search
capability of the algorithm. Secondly, to improve the exploration efficiency of the algorithm, the Logistic chaos mapping
is introduced to help the algorithm find more high-quality potential solutions while avoiding the worst solutions. Thirdly,
a comprehensive following strategy is designed to avoid the algorithm falling into local optima and further improve the
convergence speed. These three strategies achieve an effective balance between exploration and exploitation overall, thus
improving the optimization performance of the algorithm. In performance evaluation, APFA is validated by the CEC2022
benchmark test set and five engineering optimization problems, and compared with the state-of-the-art metaheuristic algorithms.
The numerical experimental results demonstrated the superiority of APFA.

关键词: Pathfinder algorithm · Swarm intelligent · Metaheuristic · Engineering problems

Abstract: Pathfinder algorithm (PFA) is a swarm intelligent optimization algorithm inspired by the collective activity behavior of
swarm animals, imitating the leader in the population to guide followers in finding the best food source. This algorithm has
the characteristics of a simple structure and high performance. However, PFA faces challenges such as insufficient population
diversity and susceptibility to local optima due to its inability to effectively balance the exploration and exploitation
capabilities. This paper proposes an Ameliorated Pathfinder Algorithm called APFA to solve complex engineering optimization
problems. Firstly, a guidance mechanism based on multiple elite individuals is presented to enhance the global search
capability of the algorithm. Secondly, to improve the exploration efficiency of the algorithm, the Logistic chaos mapping
is introduced to help the algorithm find more high-quality potential solutions while avoiding the worst solutions. Thirdly,
a comprehensive following strategy is designed to avoid the algorithm falling into local optima and further improve the
convergence speed. These three strategies achieve an effective balance between exploration and exploitation overall, thus
improving the optimization performance of the algorithm. In performance evaluation, APFA is validated by the CEC2022
benchmark test set and five engineering optimization problems, and compared with the state-of-the-art metaheuristic algorithms.
The numerical experimental results demonstrated the superiority of APFA.

Key words: Pathfinder algorithm · Swarm intelligent · Metaheuristic · Engineering problems