A Novel Exploration Stage Approach to Improve Crayfish Optimization Algorithm: Solution to Real-World Engineering Design Problems.

IF 3.4 3区 医学 Q1 ENGINEERING, MULTIDISCIPLINARY
Harun Gezici
{"title":"A Novel Exploration Stage Approach to Improve Crayfish Optimization Algorithm: Solution to Real-World Engineering Design Problems.","authors":"Harun Gezici","doi":"10.3390/biomimetics10060411","DOIUrl":null,"url":null,"abstract":"<p><p>The Crayfish Optimization Algorithm (COA) has limitations that affect its optimization performance seriously. The competition stage of the COA uses a simplified mathematical model that concentrates on relations of distance between crayfish only. It is deprived of a stochastic variable and is not able to generate an applicable balance between exploration and exploitation. Such a case causes the COA to have early convergence, to perform poorly in high-dimensional problems, and to be trapped by local minima. Moreover, the low activation probability of the summer resort stage decreases the exploration ability more and slows down the speed of convergence. In order to compensate these shortcomings, this study proposes an Improved Crayfish Optimization Algorithm (ICOA) that designs the competition stage with three modifications: (1) adaptive step length mechanism inversely proportional to the number of iterations, which enables exploration in early iterations and exploitation in later stages, (2) vector mapping that increases stochastic behavior and improves efficiency in high-dimensional spaces, (3) removing the X<sub>shade</sub> parameter in order to abstain from early convergence. The proposed ICOA is compared to 12 recent meta-heuristic algorithms by using the CEC-2014 benchmark set (30 functions, 10 and 30 dimensions), five engineering design problems, and a real-world ROAS optimization case. Wilcoxon Signed-Rank Test, <i>t</i>-test, and Friedman rank indicate the high performance of the ICOA as it solves 24 of the 30 benchmark functions successfully. In engineering applications, the ICOA achieved an optimal weight (1.339965 kg) in cantilever beam design, a maximum load capacity (85,547.81 N) in rolling element bearing design, and the highest performance (144.601) in ROAS optimization. The superior performance of the ICOA compared to the COA is proven by the following quantitative data: 0.0007% weight reduction in cantilevers design (from 1.339974 kg to 1.339965 kg), 0.09% load capacity increase in bearing design (COA: 84,196.96 N, ICOA: 85,498.38 N average), 0.27% performance improvement in ROAS problem (COA: 144.072, ICOA: 144.601), and most importantly, there seems to be an overall performance improvement as the COA has a 4.13 average rank while the ICOA has 1.70 on CEC-2014 benchmark tests. Results indicate that the improved COA enhances exploration and successfully solves challenging problems, demonstrating its effectiveness in various optimization scenarios.</p>","PeriodicalId":8907,"journal":{"name":"Biomimetics","volume":"10 6","pages":""},"PeriodicalIF":3.4000,"publicationDate":"2025-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12191263/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Biomimetics","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.3390/biomimetics10060411","RegionNum":3,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

The Crayfish Optimization Algorithm (COA) has limitations that affect its optimization performance seriously. The competition stage of the COA uses a simplified mathematical model that concentrates on relations of distance between crayfish only. It is deprived of a stochastic variable and is not able to generate an applicable balance between exploration and exploitation. Such a case causes the COA to have early convergence, to perform poorly in high-dimensional problems, and to be trapped by local minima. Moreover, the low activation probability of the summer resort stage decreases the exploration ability more and slows down the speed of convergence. In order to compensate these shortcomings, this study proposes an Improved Crayfish Optimization Algorithm (ICOA) that designs the competition stage with three modifications: (1) adaptive step length mechanism inversely proportional to the number of iterations, which enables exploration in early iterations and exploitation in later stages, (2) vector mapping that increases stochastic behavior and improves efficiency in high-dimensional spaces, (3) removing the Xshade parameter in order to abstain from early convergence. The proposed ICOA is compared to 12 recent meta-heuristic algorithms by using the CEC-2014 benchmark set (30 functions, 10 and 30 dimensions), five engineering design problems, and a real-world ROAS optimization case. Wilcoxon Signed-Rank Test, t-test, and Friedman rank indicate the high performance of the ICOA as it solves 24 of the 30 benchmark functions successfully. In engineering applications, the ICOA achieved an optimal weight (1.339965 kg) in cantilever beam design, a maximum load capacity (85,547.81 N) in rolling element bearing design, and the highest performance (144.601) in ROAS optimization. The superior performance of the ICOA compared to the COA is proven by the following quantitative data: 0.0007% weight reduction in cantilevers design (from 1.339974 kg to 1.339965 kg), 0.09% load capacity increase in bearing design (COA: 84,196.96 N, ICOA: 85,498.38 N average), 0.27% performance improvement in ROAS problem (COA: 144.072, ICOA: 144.601), and most importantly, there seems to be an overall performance improvement as the COA has a 4.13 average rank while the ICOA has 1.70 on CEC-2014 benchmark tests. Results indicate that the improved COA enhances exploration and successfully solves challenging problems, demonstrating its effectiveness in various optimization scenarios.

一种改进小龙虾优化算法的新探索阶段方法:解决实际工程设计问题。
小龙虾优化算法(COA)的局限性严重影响了其优化性能。COA比赛阶段采用简化的数学模型,只关注小龙虾之间的距离关系。它被剥夺了一个随机变量,不能在勘探和开采之间产生一个适用的平衡。这种情况会导致COA具有较早的收敛性,在高维问题中表现不佳,并且会被局部最小值所困。此外,避暑阶段的低激活概率更降低了勘探能力,减缓了收敛速度。为了弥补这些不足,本研究提出了一种改进的小龙虾优化算法(ICOA),该算法对竞争阶段进行了三处修改:(1)与迭代次数成反比的自适应步长机制,使迭代早期的探索和后期的开发成为可能;(2)矢量映射增加了随机行为并提高了高维空间的效率;(3)去除Xshade参数以避免早期收敛。通过使用CEC-2014基准集(30个函数,10和30个维度),五个工程设计问题和一个现实世界的ROAS优化案例,将所提出的ICOA与12种最近的元启发式算法进行比较。Wilcoxon sign - rank检验,t检验和Friedman秩检验表明ICOA的高性能,因为它成功地解决了30个基准函数中的24个。在工程应用中,ICOA在悬臂梁设计中实现了最优自重(1.339965 kg),在滚动轴承设计中实现了最大承载能力(85,547.81 N),在ROAS优化中实现了最高性能(144.601)。通过以下量化数据证明了ICOA与COA相比的卓越性能:悬臂梁设计重量减轻0.0007%(从1.339974 kg降至1.339965 kg),轴承设计载荷能力提高0.09% (COA: 84196.96 N, ICOA: 854498.38 N), ROAS问题性能提高0.27% (COA: 144.072, ICOA:最重要的是,在CEC-2014基准测试中,COA的平均排名为4.13,而ICOA的平均排名为1.70,因此整体性能似乎有所提高。结果表明,改进的COA增强了勘探能力,并成功解决了具有挑战性的问题,证明了其在各种优化场景中的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Biomimetics
Biomimetics Biochemistry, Genetics and Molecular Biology-Biotechnology
CiteScore
3.50
自引率
11.10%
发文量
189
审稿时长
11 weeks
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信