用于约束优化在线求解的鹰栖息优化器

Ameer Tamoor Khan , Shuai Li , Yinyan Zhang , Predrag S. Stanimirovic
{"title":"用于约束优化在线求解的鹰栖息优化器","authors":"Ameer Tamoor Khan ,&nbsp;Shuai Li ,&nbsp;Yinyan Zhang ,&nbsp;Predrag S. Stanimirovic","doi":"10.1016/j.memori.2022.100021","DOIUrl":null,"url":null,"abstract":"<div><p>The paper proposes a novel nature-inspired optimization technique called Eagle Perching Optimizer (EPO). It is an addition to the family of swarm-based meta-heuristic algorithms. It mimics eagles’ perching nature to find prey (food). The EPO is based on the exploration and exploitation of an eagle when it descends from the height such that it formulates its trajectory in a way to get to the optimal solution (prey). The algorithm takes bigger chunks of search space and looks for the optimal solution. The optimal solution in that chunk becomes the search space for the next iteration, and this process is continuous until EPO converges to the optimal global solution. We performed the theoretical analysis of EPO, which shows that it converges to the optimal solution. The simulation includes three sets of problems, i.e., uni-model, multi-model, and constrained real-world problems. We employed EPO on the benchmark problems and compared the results with state-of-the-art meta-heuristic algorithms. For the real-world problems, we used a cantilever beam, three-bar truss, and gear train problems to test the robustness of EPO and later made the comparison. The comparison shows that EPO is comparable with other known meta-heuristic algorithms.</p></div>","PeriodicalId":100915,"journal":{"name":"Memories - Materials, Devices, Circuits and Systems","volume":"4 ","pages":"Article 100021"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Eagle perching optimizer for the online solution of constrained optimization\",\"authors\":\"Ameer Tamoor Khan ,&nbsp;Shuai Li ,&nbsp;Yinyan Zhang ,&nbsp;Predrag S. Stanimirovic\",\"doi\":\"10.1016/j.memori.2022.100021\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The paper proposes a novel nature-inspired optimization technique called Eagle Perching Optimizer (EPO). It is an addition to the family of swarm-based meta-heuristic algorithms. It mimics eagles’ perching nature to find prey (food). The EPO is based on the exploration and exploitation of an eagle when it descends from the height such that it formulates its trajectory in a way to get to the optimal solution (prey). The algorithm takes bigger chunks of search space and looks for the optimal solution. The optimal solution in that chunk becomes the search space for the next iteration, and this process is continuous until EPO converges to the optimal global solution. We performed the theoretical analysis of EPO, which shows that it converges to the optimal solution. The simulation includes three sets of problems, i.e., uni-model, multi-model, and constrained real-world problems. We employed EPO on the benchmark problems and compared the results with state-of-the-art meta-heuristic algorithms. For the real-world problems, we used a cantilever beam, three-bar truss, and gear train problems to test the robustness of EPO and later made the comparison. The comparison shows that EPO is comparable with other known meta-heuristic algorithms.</p></div>\",\"PeriodicalId\":100915,\"journal\":{\"name\":\"Memories - Materials, Devices, Circuits and Systems\",\"volume\":\"4 \",\"pages\":\"Article 100021\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Memories - Materials, Devices, Circuits and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2773064622000159\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Memories - Materials, Devices, Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2773064622000159","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文提出了一种新的受自然启发的优化技术,称为Eagle Perching Optimizer(EPO)。它是对基于群的元启发式算法家族的补充。它模仿了鹰栖息寻找猎物(食物)的天性。EPO是基于对鹰从高空下降时的探索和利用,从而制定其轨迹以获得最佳解决方案(猎物)。该算法占用较大的搜索空间,并寻找最优解。该块中的最优解成为下一次迭代的搜索空间,并且这个过程是连续的,直到EPO收敛到最优全局解。我们对EPO进行了理论分析,结果表明它收敛于最优解。模拟包括三组问题,即单模型、多模型和约束现实世界问题。我们在基准问题上使用了EPO,并将结果与最先进的元启发式算法进行了比较。对于实际问题,我们使用悬臂梁、三杆特拉斯和齿轮系问题来测试EPO的鲁棒性,并随后进行了比较。比较表明,EPO与其他已知的元启发式算法具有可比性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Eagle perching optimizer for the online solution of constrained optimization

The paper proposes a novel nature-inspired optimization technique called Eagle Perching Optimizer (EPO). It is an addition to the family of swarm-based meta-heuristic algorithms. It mimics eagles’ perching nature to find prey (food). The EPO is based on the exploration and exploitation of an eagle when it descends from the height such that it formulates its trajectory in a way to get to the optimal solution (prey). The algorithm takes bigger chunks of search space and looks for the optimal solution. The optimal solution in that chunk becomes the search space for the next iteration, and this process is continuous until EPO converges to the optimal global solution. We performed the theoretical analysis of EPO, which shows that it converges to the optimal solution. The simulation includes three sets of problems, i.e., uni-model, multi-model, and constrained real-world problems. We employed EPO on the benchmark problems and compared the results with state-of-the-art meta-heuristic algorithms. For the real-world problems, we used a cantilever beam, three-bar truss, and gear train problems to test the robustness of EPO and later made the comparison. The comparison shows that EPO is comparable with other known meta-heuristic algorithms.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Development of an analog topology for a multi-layer neuronal network A graphene-based toxic detection approach Optimization of deep learning algorithms for large digital data processing using evolutionary neural networks The application of organic materials used in IC advanced packaging:A review Design and evaluation of clock-gating-based approximate multiplier for error-tolerant applications
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1