.png){kind=icon}
Return
A new meta-heuristic optimizer: Pathfinder algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2019.03.012.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a new meta-heuristic algorithm called Pathfinder Algorithm (PFA) to solve optimization problems with different structure. This method is inspired by collective movement of animal group and mimics the leadership hierarchy of swarms to find best food area or prey. The proposed method is tested on some optimization problems to show and confirm the performance on test beds. It can be observed on benchmark test functions that PFA is able to converge global optimum and avoid the local optima effectively. Also, PFA is designed for multi-objective problems (MOPFA). The results obtained show that it can approximate to true Pareto optimal solutions. The proposed PFA and MPFA are implemented to some design problems and a multi-objective engineering problem which is time consuming and computationally expensive. The results of final case study verify the superiority of the algorithms proposed in solving challenging real-world problems with unknown search spaces. Furthermore, the method provides very competitive solutions compared to well-known meta-heuristics in literature, such as particle swarm optimization, artificial bee colony, firefly and grey wolf optimizer. (C) 2019 Elsevier B.V. All rights reserved.
Keywords:
Optimization
Optimization techniques
Metaheuristics
Multi-objective optimization
Pathfinder algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W
Organization
Cited Papers
ShareSaveShareSaveShareSave
Improved multi-objective particle swarm optimization with preference strategy for optimal DG integration into the distribution system.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
ShareSave
View more