Polar fox optimization algorithm: a novel meta-heuristic algorithm

Ahmad Ghiaskar, Amir Amiri, Seyedali Mirjalili

Research output: Contribution to journalArticlepeer-review

19 Citations (Scopus)

Abstract

The proposed paper introduces a new optimization algorithm inspired by nature called the polar fox optimization algorithm (PFA). This algorithm addresses the herd life of polar foxes and especially their hunting method. The polar fox jumping strategy for hunting, which is performed through high hearing power, is mathematically formulated and implemented to perform optimization processes in a wide range of search spaces. The performance of the polar fox algorithm is tested with 14 classic benchmark functions. To provide a comprehensive comparison, all 14 test functions are expanded, shifted, rotated and combined for this test. For further testing, the recent CEC 2021 test’s complex functions are studied in the unimodal, basic, hybrid and composition modes. Finally, the rate of convergence and computational time of PFA are also evaluated by several changes with other algorithms. Comparisons show that PFA has numerous benefits over other well-known meta-heuristic algorithms and determines the solutions with fewer control parameters. So it offers competitive and promising results. In addition, this research tests PFA performance with 6 different challenging engineering problems. Compared to the well-known meta-artist methods, the superiority of the PFA is observed from the experimental results of the proposed algorithm in real-world problem-solving. The source codes of the PFA are publicly available at https://github.com/ATR616/PFA.

Original languageEnglish
JournalNeural Computing and Applications
DOIs
Publication statusAccepted/In press - 2024

Keywords

  • Artificial intelligence
  • Engineering applications
  • Meta-heuristic
  • Nonlinear optimization
  • Polar fox algorithm

Fingerprint

Dive into the research topics of 'Polar fox optimization algorithm: a novel meta-heuristic algorithm'. Together they form a unique fingerprint.

Cite this