Fractional-order PID-based search algorithms: A math-inspired meta-heuristic technique with historical information consideration

IF 9.9 1区 工程技术 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Advanced Engineering Informatics Pub Date : 2025-05-01 Epub Date: 2025-02-03 DOI:10.1016/j.aei.2024.103088
Guangyao Chen , Yangze Liang , Ziyang Jiang , Sihao Li , Heng Li , Zhao Xu
{"title":"Fractional-order PID-based search algorithms: A math-inspired meta-heuristic technique with historical information consideration","authors":"Guangyao Chen ,&nbsp;Yangze Liang ,&nbsp;Ziyang Jiang ,&nbsp;Sihao Li ,&nbsp;Heng Li ,&nbsp;Zhao Xu","doi":"10.1016/j.aei.2024.103088","DOIUrl":null,"url":null,"abstract":"<div><div>The PID-based Search Algorithm (PSA) is a novel math-inspired metaheuristic algorithm. However, the traditional PSA, based on PID principles, only considers the current population information. To investigate the influence of Population Historical Information (PHI) on the convergence performance of PSA and design a more effective population evolution mechanism, we drew inspiration from the fractional-order PID and introduced the fractional-order Nabla operator, which is well-suited for modeling discrete systems characterized by memory and heredity, to improve PSA. We proposed three fractional-order variants of PSA, named FoPSA-I, FoPSA-II, and FoPSA-III, based on three types of historical information in the population update process: error, input, and position. Through fractional-order sensitivity analysis on CEC benchmark test functions and numerical experiments in relevant engineering applications, we found that among the three FoPSA variants, FoPSA-III, which considers historical position information, showed significant differences in convergence performance compared to PSA, whereas FoPSA-I and FoPSA-II showed minimal differences from PSA. Additionally, the <em>p</em>-values obtained from the Wilcoxon test further validated the differences among the three FoPSAs and PSA, with <em>p</em>-values for FoPSA-I, FoPSA-II, and FoPSA-III being 0.1446, 0.0475, and 0.0019, respectively. Finally, through mathematical analysis, we qualitatively explored the reasons for the differing convergence performance of the three FoPSA variants. The results indicate that considering historical position information in the PSA population update process can enhance population diversity and the algorithm’s convergence performance. This provides new insights into the design of population update mechanisms in metaheuristic algorithms.</div></div>","PeriodicalId":50941,"journal":{"name":"Advanced Engineering Informatics","volume":"65 ","pages":"Article 103088"},"PeriodicalIF":9.9000,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advanced Engineering Informatics","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1474034624007390","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/2/3 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

The PID-based Search Algorithm (PSA) is a novel math-inspired metaheuristic algorithm. However, the traditional PSA, based on PID principles, only considers the current population information. To investigate the influence of Population Historical Information (PHI) on the convergence performance of PSA and design a more effective population evolution mechanism, we drew inspiration from the fractional-order PID and introduced the fractional-order Nabla operator, which is well-suited for modeling discrete systems characterized by memory and heredity, to improve PSA. We proposed three fractional-order variants of PSA, named FoPSA-I, FoPSA-II, and FoPSA-III, based on three types of historical information in the population update process: error, input, and position. Through fractional-order sensitivity analysis on CEC benchmark test functions and numerical experiments in relevant engineering applications, we found that among the three FoPSA variants, FoPSA-III, which considers historical position information, showed significant differences in convergence performance compared to PSA, whereas FoPSA-I and FoPSA-II showed minimal differences from PSA. Additionally, the p-values obtained from the Wilcoxon test further validated the differences among the three FoPSAs and PSA, with p-values for FoPSA-I, FoPSA-II, and FoPSA-III being 0.1446, 0.0475, and 0.0019, respectively. Finally, through mathematical analysis, we qualitatively explored the reasons for the differing convergence performance of the three FoPSA variants. The results indicate that considering historical position information in the PSA population update process can enhance population diversity and the algorithm’s convergence performance. This provides new insights into the design of population update mechanisms in metaheuristic algorithms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于分数阶pid的搜索算法:一种考虑历史信息的数学启发的元启发式技术
基于pid的搜索算法(PSA)是一种新颖的数学启发的元启发式算法。而传统的基于PID原理的PSA只考虑当前的人口信息。为了研究种群历史信息(PHI)对种群进化算法收敛性能的影响,设计更有效的种群进化机制,从分数阶PID中汲取灵感,引入了分数阶Nabla算子,该算子适合于对具有记忆和遗传特征的离散系统建模,从而改进了种群进化算法。基于种群更新过程中的三种历史信息:误差、输入和位置,我们提出了PSA的三种分数阶变体,分别命名为FoPSA-I、FoPSA-II和FoPSA-III。通过对CEC基准测试函数的分数阶灵敏度分析和相关工程应用的数值实验,我们发现在三种FoPSA变体中,考虑历史位置信息的FoPSA- iii与PSA的收敛性能差异显著,而FoPSA- i和FoPSA- ii与PSA的收敛性能差异极小。此外,Wilcoxon检验得到的p值进一步验证了三种fopsa与PSA之间的差异,FoPSA-I、FoPSA-II和FoPSA-III的p值分别为0.1446、0.0475和0.0019。最后,通过数学分析,定性地探讨了三种FoPSA变体收敛性能差异的原因。结果表明,在种群更新过程中考虑历史位置信息可以增强种群多样性,提高算法的收敛性能。这为元启发式算法中种群更新机制的设计提供了新的见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Advanced Engineering Informatics
Advanced Engineering Informatics 工程技术-工程:综合
CiteScore
12.40
自引率
18.20%
发文量
292
审稿时长
45 days
期刊介绍: Advanced Engineering Informatics is an international Journal that solicits research papers with an emphasis on 'knowledge' and 'engineering applications'. The Journal seeks original papers that report progress in applying methods of engineering informatics. These papers should have engineering relevance and help provide a scientific base for more reliable, spontaneous, and creative engineering decision-making. Additionally, papers should demonstrate the science of supporting knowledge-intensive engineering tasks and validate the generality, power, and scalability of new methods through rigorous evaluation, preferably both qualitatively and quantitatively. Abstracting and indexing for Advanced Engineering Informatics include Science Citation Index Expanded, Scopus and INSPEC.
期刊最新文献
Synergistic in-domain and out-of-domain learning to strengthen visual scene understanding in data-scarce, imbalanced construction settings Span entropy: A novel time series complexity measurement with a redesigned phase space reconstruction Collaborative planning model for mixed traffic flow in bottleneck zones considering compliance and the impact of human-driven vehicles A method for safety risk dynamic assessment in flight cockpit intelligent human-machine interaction Multi-objective differential evolution algorithm based on partial reinforcement learning intelligence for engineering design problems and physics-informed neural networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1