Modified Crayfish Optimization Algorithm with Adaptive Spiral Elite Greedy Opposition-based Learning and Search-hide Strategy for Global Optimization

IF 4.8 2区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Guanghui Li, Taihua Zhang, Chieh-Yuan Tsai, Yao Lu, Jun Yang, Liguo Yao
{"title":"Modified Crayfish Optimization Algorithm with Adaptive Spiral Elite Greedy Opposition-based Learning and Search-hide Strategy for Global Optimization","authors":"Guanghui Li, Taihua Zhang, Chieh-Yuan Tsai, Yao Lu, Jun Yang, Liguo Yao","doi":"10.1093/jcde/qwae069","DOIUrl":null,"url":null,"abstract":"\n Crayfish optimization algorithm (COA) is a novel, bionic, metaheuristic algorithm with high convergence speed and solution accuracy. However, in some complex optimization problems and real application scenarios, the performance of COA is not satisfactory. In order to overcome the challenges encountered by COA, such as being stuck in the local optimal and insufficient search range, this paper proposes four improvement strategies: search-hide, adaptive spiral elite greedy opposition-based learning (ASEG-OBL), competition-elimination, and chaos mutation. To evaluate the convergence accuracy, speed, and robustness of the modified crayfish optimization algorithm (MCOA), some simulation comparison experiments of 10 algorithms are conducted. Experimental results show that the MCOA achieved the minor Friedman test (FT) value in 23 test functions, CEC2014, and CEC2020, and achieved average superiority rates of 80.97%, 72.59%, and 71.11% in the Wilcoxon rank sum test (WT) respectively. In addition, MCOA shows high applicability and progressiveness in five engineering problems in actual industrial field. Moreover, MCOA achieved 80% and 100% superiority rate against COA on CEC2020 and the fixed-dimension function of 23 benchmark test functions. Finally, MCOA owns better convergence and population diversity.","PeriodicalId":48611,"journal":{"name":"Journal of Computational Design and Engineering","volume":null,"pages":null},"PeriodicalIF":4.8000,"publicationDate":"2024-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Design and Engineering","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1093/jcde/qwae069","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Crayfish optimization algorithm (COA) is a novel, bionic, metaheuristic algorithm with high convergence speed and solution accuracy. However, in some complex optimization problems and real application scenarios, the performance of COA is not satisfactory. In order to overcome the challenges encountered by COA, such as being stuck in the local optimal and insufficient search range, this paper proposes four improvement strategies: search-hide, adaptive spiral elite greedy opposition-based learning (ASEG-OBL), competition-elimination, and chaos mutation. To evaluate the convergence accuracy, speed, and robustness of the modified crayfish optimization algorithm (MCOA), some simulation comparison experiments of 10 algorithms are conducted. Experimental results show that the MCOA achieved the minor Friedman test (FT) value in 23 test functions, CEC2014, and CEC2020, and achieved average superiority rates of 80.97%, 72.59%, and 71.11% in the Wilcoxon rank sum test (WT) respectively. In addition, MCOA shows high applicability and progressiveness in five engineering problems in actual industrial field. Moreover, MCOA achieved 80% and 100% superiority rate against COA on CEC2020 and the fixed-dimension function of 23 benchmark test functions. Finally, MCOA owns better convergence and population diversity.
基于自适应螺旋精英对立学习和搜索隐藏策略的全局优化修正小龙虾优化算法
小龙虾优化算法(COA)是一种新颖的仿生元启发式算法,具有收敛速度快、求解精度高的特点。然而,在一些复杂的优化问题和实际应用场景中,COA 的性能并不尽如人意。为了克服 COA 遇到的难题,如陷入局部最优和搜索范围不足等,本文提出了四种改进策略:搜索隐藏、自适应螺旋精英贪婪对立学习(ASEG-OBL)、竞争消除和混沌突变。为了评估改进后的小龙虾优化算法(MCOA)的收敛精度、速度和鲁棒性,本文对 10 种算法进行了仿真对比实验。实验结果表明,MCOA 在 23 个测试函数、CEC2014 和 CEC2020 中取得了较小的 Friedman 检验(FT)值,在 Wilcoxon 秩和检验(WT)中分别取得了 80.97%、72.59% 和 71.11% 的平均优越率。此外,MCOA 在实际工业领域的五个工程问题中表现出较高的适用性和进步性。此外,在 CEC2020 和 23 个基准测试函数的定维函数上,MCOA 与 COA 相比分别取得了 80% 和 100% 的优越性。最后,MCOA 还具有更好的收敛性和群体多样性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
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学术官方微信