4.7 Article

An enhanced pathfinder algorithm for engineering optimization problems

期刊

ENGINEERING WITH COMPUTERS
卷 38, 期 SUPPL 2, 页码 1481-1503

出版社

SPRINGER
DOI: 10.1007/s00366-021-01286-x

关键词

Pathfinder algorithm (PFA); Exploration and exploitation; Engineering optimization problems; Meta-heuristic optimization

资金

  1. National Science Foundation of China [62066005, 61563008]
  2. Project of Guangxi Natural Science Foundation [2018GXNSFAA138146]

向作者/读者索取更多资源

The Pathfinder Algorithm (PFA) is a new population-based optimizer that divides search agents into leaders and followers. To avoid falling into local optima, acceptance, exchange, and mutation mechanisms are introduced. By treating the leader as a guide and introducing a guidance mechanism, the algorithm's mining and exploration capabilities are balanced.
The pathfinder algorithm (PFA) is a new population-based optimizer, it divides the search agents of the algorithm into leaders and followers, imitating the leadership level of the group movement to find the best food area or prey. In PFA, followers follow the new position according to the position of the leader and their own consciousness makes the algorithm easy to fall into local optimum. To overcome this shortcoming, the following stage is complicated in this paper, and the acceptance operator, the exchange operator and the mutation mechanism are introduced into the algorithm. To further balance the mining ability and exploration ability of the algorithm, the article regards the leader as a guide and introduces a guide mechanism. To verify the performance of the improved algorithm, it is applied to nine real-life engineering case problems. The simulation results of the real-life engineering design problems exhibit the superiority of the improved PFA (IMPFA) algorithm in solving challenging problems with constrained and unknown search spaces when compared to the basic PFA algorithm or other available solutions.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据