一种改进的基于幽灵对立学习的爬行动物搜索算法用于全局优化问题

IF 4.8 2区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
H. Jia, Chenghao Lu, Di Wu, Changsheng Wen, Honghua Rao, L. Abualigah
{"title":"一种改进的基于幽灵对立学习的爬行动物搜索算法用于全局优化问题","authors":"H. Jia, Chenghao Lu, Di Wu, Changsheng Wen, Honghua Rao, L. Abualigah","doi":"10.1093/jcde/qwad048","DOIUrl":null,"url":null,"abstract":"\n In 2021, a meta-heuristic algorithm, Reptile Search Algorithm (RSA), was proposed. RSA mainly simulates the cooperative predatory behavior of crocodiles. Although RSA has a fast convergence speed, due to the influence of the crocodile predation mechanism, if the algorithm falls into the local optimum in the early stage, RSA will probably be unable to jump out of the local optimum, resulting in a poor comprehensive performance. Because of the shortcomings of RSA, introducing the local escape operator can effectively improve crocodiles' ability to explore space and generate new crocodiles to replace poor crocodiles. Benefiting from adding a restart strategy, when the optimal solution of RSA is no longer updated, the algorithm’s ability to jump out of the local optimum is effectively improved by randomly initializing the crocodile. Then joining Ghost opposition-based learning to balance the IRSA’s exploitation and exploration, the Improved RSA with Ghost Opposition-based Learning for the Global Optimization Problem (IRSA) is proposed. To verify the performance of IRSA, we used nine famous optimization algorithms to compare with IRSA in 23 standard benchmark functions and CEC2020 test functions. The experiments show that IRSA has good optimization performance and robustness, and can effectively solve six classical engineering problems, thus proving its effectiveness in solving practical problems.","PeriodicalId":48611,"journal":{"name":"Journal of Computational Design and Engineering","volume":null,"pages":null},"PeriodicalIF":4.8000,"publicationDate":"2023-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Improved Reptile Search Algorithm with Ghost Opposition-based Learning for Global Optimization Problems\",\"authors\":\"H. Jia, Chenghao Lu, Di Wu, Changsheng Wen, Honghua Rao, L. Abualigah\",\"doi\":\"10.1093/jcde/qwad048\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\n In 2021, a meta-heuristic algorithm, Reptile Search Algorithm (RSA), was proposed. RSA mainly simulates the cooperative predatory behavior of crocodiles. Although RSA has a fast convergence speed, due to the influence of the crocodile predation mechanism, if the algorithm falls into the local optimum in the early stage, RSA will probably be unable to jump out of the local optimum, resulting in a poor comprehensive performance. Because of the shortcomings of RSA, introducing the local escape operator can effectively improve crocodiles' ability to explore space and generate new crocodiles to replace poor crocodiles. Benefiting from adding a restart strategy, when the optimal solution of RSA is no longer updated, the algorithm’s ability to jump out of the local optimum is effectively improved by randomly initializing the crocodile. Then joining Ghost opposition-based learning to balance the IRSA’s exploitation and exploration, the Improved RSA with Ghost Opposition-based Learning for the Global Optimization Problem (IRSA) is proposed. To verify the performance of IRSA, we used nine famous optimization algorithms to compare with IRSA in 23 standard benchmark functions and CEC2020 test functions. The experiments show that IRSA has good optimization performance and robustness, and can effectively solve six classical engineering problems, thus proving its effectiveness in solving practical problems.\",\"PeriodicalId\":48611,\"journal\":{\"name\":\"Journal of Computational Design and Engineering\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":4.8000,\"publicationDate\":\"2023-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computational Design and Engineering\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1093/jcde/qwad048\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Design and Engineering","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1093/jcde/qwad048","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 1

摘要

2021年,提出了一种元启发式算法——爬行动物搜索算法(Reptile Search algorithm, RSA)。RSA主要模拟鳄鱼的合作捕食行为。RSA虽然收敛速度快,但由于鳄鱼捕食机制的影响,如果算法在早期陷入局部最优,RSA很可能无法跳出局部最优,导致综合性能较差。由于RSA的缺点,引入局部逃逸算子可以有效地提高鳄鱼探索空间的能力,产生新的鳄鱼来取代可怜的鳄鱼。得益于增加了重启策略,当RSA的最优解不再更新时,通过随机初始化鳄鱼有效地提高了算法跳出局部最优的能力。然后加入基于幽灵对抗的学习来平衡IRSA的开发和探索,提出了基于幽灵对抗学习的改进RSA全局优化问题(IRSA)。为了验证IRSA的性能,我们使用了9种著名的优化算法,在23个标准基准函数和CEC2020测试函数中与IRSA进行了比较。实验表明,IRSA具有良好的优化性能和鲁棒性,能够有效地求解6个经典工程问题,证明了其在解决实际问题中的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Improved Reptile Search Algorithm with Ghost Opposition-based Learning for Global Optimization Problems
In 2021, a meta-heuristic algorithm, Reptile Search Algorithm (RSA), was proposed. RSA mainly simulates the cooperative predatory behavior of crocodiles. Although RSA has a fast convergence speed, due to the influence of the crocodile predation mechanism, if the algorithm falls into the local optimum in the early stage, RSA will probably be unable to jump out of the local optimum, resulting in a poor comprehensive performance. Because of the shortcomings of RSA, introducing the local escape operator can effectively improve crocodiles' ability to explore space and generate new crocodiles to replace poor crocodiles. Benefiting from adding a restart strategy, when the optimal solution of RSA is no longer updated, the algorithm’s ability to jump out of the local optimum is effectively improved by randomly initializing the crocodile. Then joining Ghost opposition-based learning to balance the IRSA’s exploitation and exploration, the Improved RSA with Ghost Opposition-based Learning for the Global Optimization Problem (IRSA) is proposed. To verify the performance of IRSA, we used nine famous optimization algorithms to compare with IRSA in 23 standard benchmark functions and CEC2020 test functions. The experiments show that IRSA has good optimization performance and robustness, and can effectively solve six classical engineering problems, thus proving its effectiveness in solving practical problems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Computational Design and Engineering
Journal of Computational Design and Engineering Computer Science-Human-Computer Interaction
CiteScore
7.70
自引率
20.40%
发文量
125
期刊介绍: Journal of Computational Design and Engineering is an international journal that aims to provide academia and industry with a venue for rapid publication of research papers reporting innovative computational methods and applications to achieve a major breakthrough, practical improvements, and bold new research directions within a wide range of design and engineering: • Theory and its progress in computational advancement for design and engineering • Development of computational framework to support large scale design and engineering • Interaction issues among human, designed artifacts, and systems • Knowledge-intensive technologies for intelligent and sustainable systems • Emerging technology and convergence of technology fields presented with convincing design examples • Educational issues for academia, practitioners, and future generation • Proposal on new research directions as well as survey and retrospectives on mature field.
×
引用
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学术官方微信