信息获取优化器:解决数值和约束工程优化问题的新型高效算法

Xiao Wu, Shaobo Li, Xinghe Jiang, Yanqiu Zhou
{"title":"信息获取优化器:解决数值和约束工程优化问题的新型高效算法","authors":"Xiao Wu, Shaobo Li, Xinghe Jiang, Yanqiu Zhou","doi":"10.1007/s11227-024-06384-3","DOIUrl":null,"url":null,"abstract":"<p>This paper addresses the increasing complexity of challenges in the field of continuous nonlinear optimization by proposing an innovative algorithm called information acquisition optimizer (IAO), which is inspired by human information acquisition behaviors and consists of three crucial strategies: information collection, information filtering and evaluation, and information analysis and organization to accommodate diverse optimization requirements. Firstly, comparative assessments of performance are conducted between the IAO and 15 widely recognized algorithms using the standard test function suites from CEC2014, CEC2017, CEC2020, and CEC2022. The results demonstrate that IAO is robustly competitive regarding convergence rate, solution accuracy, and stability. Additionally, the outcomes of the Wilcoxon signed rank test and Friedman mean ranking strongly validate the effectiveness and reliability of IAO. Moreover, the time comparison analysis experiments indicate its high efficiency. Finally, comparative tests on five real-world optimization difficulties affirm the remarkable applicability of IAO in handling complex issues with unknown search spaces. The code for the IAO algorithm is available at https://ww2.mathworks.cn/matlabcentral/fileexchange/169331-information-acquisition-optimizer.</p>","PeriodicalId":501596,"journal":{"name":"The Journal of Supercomputing","volume":"55 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Information acquisition optimizer: a new efficient algorithm for solving numerical and constrained engineering optimization problems\",\"authors\":\"Xiao Wu, Shaobo Li, Xinghe Jiang, Yanqiu Zhou\",\"doi\":\"10.1007/s11227-024-06384-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>This paper addresses the increasing complexity of challenges in the field of continuous nonlinear optimization by proposing an innovative algorithm called information acquisition optimizer (IAO), which is inspired by human information acquisition behaviors and consists of three crucial strategies: information collection, information filtering and evaluation, and information analysis and organization to accommodate diverse optimization requirements. Firstly, comparative assessments of performance are conducted between the IAO and 15 widely recognized algorithms using the standard test function suites from CEC2014, CEC2017, CEC2020, and CEC2022. The results demonstrate that IAO is robustly competitive regarding convergence rate, solution accuracy, and stability. Additionally, the outcomes of the Wilcoxon signed rank test and Friedman mean ranking strongly validate the effectiveness and reliability of IAO. Moreover, the time comparison analysis experiments indicate its high efficiency. Finally, comparative tests on five real-world optimization difficulties affirm the remarkable applicability of IAO in handling complex issues with unknown search spaces. The code for the IAO algorithm is available at https://ww2.mathworks.cn/matlabcentral/fileexchange/169331-information-acquisition-optimizer.</p>\",\"PeriodicalId\":501596,\"journal\":{\"name\":\"The Journal of Supercomputing\",\"volume\":\"55 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Journal of Supercomputing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s11227-024-06384-3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Journal of Supercomputing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s11227-024-06384-3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

针对连续非线性优化领域日益复杂的挑战,本文提出了一种名为信息获取优化器(IAO)的创新算法,该算法受到人类信息获取行为的启发,包含信息收集、信息过滤与评估、信息分析与组织三个关键策略,以适应多样化的优化需求。首先,利用 CEC2014、CEC2017、CEC2020 和 CEC2022 的标准测试功能套件,对 IAO 和 15 种广为认可的算法进行了性能比较评估。结果表明,IAO 在收敛速度、求解精度和稳定性方面都具有很强的竞争力。此外,Wilcoxon 符号秩检验和 Friedman 平均排名的结果也有力地验证了 IAO 的有效性和可靠性。此外,时间比较分析实验也表明了 IAO 的高效性。最后,在五个实际优化难题上进行的对比测试肯定了 IAO 在处理具有未知搜索空间的复杂问题上的显著适用性。IAO 算法的代码可在 https://ww2.mathworks.cn/matlabcentral/fileexchange/169331-information-acquisition-optimizer 上获取。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Information acquisition optimizer: a new efficient algorithm for solving numerical and constrained engineering optimization problems

Information acquisition optimizer: a new efficient algorithm for solving numerical and constrained engineering optimization problems

This paper addresses the increasing complexity of challenges in the field of continuous nonlinear optimization by proposing an innovative algorithm called information acquisition optimizer (IAO), which is inspired by human information acquisition behaviors and consists of three crucial strategies: information collection, information filtering and evaluation, and information analysis and organization to accommodate diverse optimization requirements. Firstly, comparative assessments of performance are conducted between the IAO and 15 widely recognized algorithms using the standard test function suites from CEC2014, CEC2017, CEC2020, and CEC2022. The results demonstrate that IAO is robustly competitive regarding convergence rate, solution accuracy, and stability. Additionally, the outcomes of the Wilcoxon signed rank test and Friedman mean ranking strongly validate the effectiveness and reliability of IAO. Moreover, the time comparison analysis experiments indicate its high efficiency. Finally, comparative tests on five real-world optimization difficulties affirm the remarkable applicability of IAO in handling complex issues with unknown search spaces. The code for the IAO algorithm is available at https://ww2.mathworks.cn/matlabcentral/fileexchange/169331-information-acquisition-optimizer.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信