丹顶鹤优化:一种新的工程应用仿生元启发式算法。

IF 3.9 3区 医学 Q1 ENGINEERING, MULTIDISCIPLINARY
Jie Kang, Zhiyuan Ma
{"title":"丹顶鹤优化:一种新的工程应用仿生元启发式算法。","authors":"Jie Kang, Zhiyuan Ma","doi":"10.3390/biomimetics10090565","DOIUrl":null,"url":null,"abstract":"<p><p>This paper proposes a novel bio-inspired metaheuristic algorithm called the Red-crowned Crane Optimization (RCO) algorithm. This algorithm is developed by mathematically modeling four habits of red-crowned cranes: dispersing for foraging, gathering for roosting, dancing, and escaping from danger. The foraging strategy is used to search unknown areas to ensure the exploration ability, and the roosting behavior prompts cranes to approach better positions, thereby enhancing the exploitation performance. The crane dancing strategy further balances the local and global search capabilities of the algorithm. Additionally, the introduction of the escaping mechanism effectively reduces the possibility of the algorithm falling into local optima. The RCO algorithm is compared with eight popular optimization algorithms on a large number of benchmark functions. The results show that the RCO algorithm can find better solutions for 74% of the CEC-2005 test functions and 50% of the CEC-2022 test functions. This algorithm has a fast convergence speed and high search accuracy on most functions, and it can handle high-dimensional problems. The Wilcoxon signed-rank test results demonstrate the significant superiority of the RCO algorithm over other algorithms. In addition, applications to eight practical engineering problems further demonstrate its ability to find near-optimal solutions.</p>","PeriodicalId":8907,"journal":{"name":"Biomimetics","volume":"10 9","pages":""},"PeriodicalIF":3.9000,"publicationDate":"2025-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12467589/pdf/","citationCount":"0","resultStr":"{\"title\":\"Red-Crowned Crane Optimization: A Novel Biomimetic Metaheuristic Algorithm for Engineering Applications.\",\"authors\":\"Jie Kang, Zhiyuan Ma\",\"doi\":\"10.3390/biomimetics10090565\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>This paper proposes a novel bio-inspired metaheuristic algorithm called the Red-crowned Crane Optimization (RCO) algorithm. This algorithm is developed by mathematically modeling four habits of red-crowned cranes: dispersing for foraging, gathering for roosting, dancing, and escaping from danger. The foraging strategy is used to search unknown areas to ensure the exploration ability, and the roosting behavior prompts cranes to approach better positions, thereby enhancing the exploitation performance. The crane dancing strategy further balances the local and global search capabilities of the algorithm. Additionally, the introduction of the escaping mechanism effectively reduces the possibility of the algorithm falling into local optima. The RCO algorithm is compared with eight popular optimization algorithms on a large number of benchmark functions. The results show that the RCO algorithm can find better solutions for 74% of the CEC-2005 test functions and 50% of the CEC-2022 test functions. This algorithm has a fast convergence speed and high search accuracy on most functions, and it can handle high-dimensional problems. The Wilcoxon signed-rank test results demonstrate the significant superiority of the RCO algorithm over other algorithms. In addition, applications to eight practical engineering problems further demonstrate its ability to find near-optimal solutions.</p>\",\"PeriodicalId\":8907,\"journal\":{\"name\":\"Biomimetics\",\"volume\":\"10 9\",\"pages\":\"\"},\"PeriodicalIF\":3.9000,\"publicationDate\":\"2025-08-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12467589/pdf/\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Biomimetics\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.3390/biomimetics10090565\",\"RegionNum\":3,\"RegionCategory\":\"医学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Biomimetics","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.3390/biomimetics10090565","RegionNum":3,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种新的生物启发式算法——丹顶鹤优化算法(RCO)。该算法是通过对丹顶鹤的四种习性进行数学建模而开发出来的:分散觅食、聚集栖息、跳舞和躲避危险。通过觅食策略对未知区域进行搜索,保证了对未知区域的探索能力,而栖息行为会促使鹤靠近更好的位置,从而提高了开发性能。鹤舞策略进一步平衡了算法的局部和全局搜索能力。此外,转义机制的引入有效地降低了算法陷入局部最优的可能性。在大量的基准函数上,将RCO算法与八种常用的优化算法进行了比较。结果表明,RCO算法可以对74%的CEC-2005测试函数和50%的CEC-2022测试函数找到较好的解。该算法收敛速度快,对大多数函数的搜索精度高,能够处理高维问题。Wilcoxon符号秩检验结果表明,RCO算法明显优于其他算法。此外,在8个实际工程问题中的应用进一步证明了其寻找接近最优解的能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Red-Crowned Crane Optimization: A Novel Biomimetic Metaheuristic Algorithm for Engineering Applications.

This paper proposes a novel bio-inspired metaheuristic algorithm called the Red-crowned Crane Optimization (RCO) algorithm. This algorithm is developed by mathematically modeling four habits of red-crowned cranes: dispersing for foraging, gathering for roosting, dancing, and escaping from danger. The foraging strategy is used to search unknown areas to ensure the exploration ability, and the roosting behavior prompts cranes to approach better positions, thereby enhancing the exploitation performance. The crane dancing strategy further balances the local and global search capabilities of the algorithm. Additionally, the introduction of the escaping mechanism effectively reduces the possibility of the algorithm falling into local optima. The RCO algorithm is compared with eight popular optimization algorithms on a large number of benchmark functions. The results show that the RCO algorithm can find better solutions for 74% of the CEC-2005 test functions and 50% of the CEC-2022 test functions. This algorithm has a fast convergence speed and high search accuracy on most functions, and it can handle high-dimensional problems. The Wilcoxon signed-rank test results demonstrate the significant superiority of the RCO algorithm over other algorithms. In addition, applications to eight practical engineering problems further demonstrate its ability to find near-optimal solutions.

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