Polar fox optimization algorithm: a novel meta-heuristic algorithm

Ahmad Ghiaskar, Amir Amiri, Seyedali Mirjalili
{"title":"Polar fox optimization algorithm: a novel meta-heuristic algorithm","authors":"Ahmad Ghiaskar, Amir Amiri, Seyedali Mirjalili","doi":"10.1007/s00521-024-10346-4","DOIUrl":null,"url":null,"abstract":"<p>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.</p>","PeriodicalId":18925,"journal":{"name":"Neural Computing and Applications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neural Computing and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s00521-024-10346-4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

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.

Abstract Image

极狐优化算法:一种新型元启发式算法
本文介绍了一种受大自然启发的新优化算法,称为 "北极狐优化算法"(PFA)。该算法针对北极狐的群居生活,特别是其狩猎方法。通过高听力执行的北极狐跳跃狩猎策略被数学化,并在广泛的搜索空间中执行优化过程。极狐算法的性能通过 14 个经典基准函数进行了测试。为了提供全面的比较,所有 14 个测试函数都在本次测试中进行了扩展、移动、旋转和组合。为了进一步测试,最近的 CEC 2021 测试在单模态、基本模态、混合模态和组合模态下对复杂函数进行了研究。最后,通过与其他算法的比较,对 PFA 的收敛速度和计算时间进行了评估。比较结果表明,与其他著名的元启发式算法相比,PFA 有很多优点,而且只需较少的控制参数就能确定解。因此,它能提供有竞争力和有前景的结果。此外,本研究还用 6 个不同的挑战性工程问题测试了 PFA 的性能。与知名的元算法相比,PFA 在实际问题求解中的实验结果显示了其优越性。PFA 的源代码可在 https://github.com/ATR616/PFA 公开获取。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信