一种具有自适应和全局导向机制的改进大蔗鼠算法用于解决实际工程问题。

IF 3.9 3区 医学 Q1 ENGINEERING, MULTIDISCIPLINARY
Yepei Chen, Zhangzhi Tian, Kaifan Zhang, Feng Zhao, Aiping Zhao
{"title":"一种具有自适应和全局导向机制的改进大蔗鼠算法用于解决实际工程问题。","authors":"Yepei Chen, Zhangzhi Tian, Kaifan Zhang, Feng Zhao, Aiping Zhao","doi":"10.3390/biomimetics10090612","DOIUrl":null,"url":null,"abstract":"<p><p>This study presents an improved variant of the greater cane rat algorithm (GCRA), called adaptive and global-guided greater cane rat algorithm (AGG-GCRA), which aims to alleviate some key limitations of the original GCRA regarding convergence speed, solution precision, and stability. GCRA simulates the foraging behavior of the greater cane rat during both mating and non-mating seasons, demonstrating intelligent exploration capabilities. However, the original algorithm still faces challenges such as premature convergence and inadequate local exploitation when applied to complex optimization problems. To address these issues, this paper introduces four key improvements to the GCRA: (1) a global optimum guidance term to enhance the convergence directionality; (2) a flexible parameter adjustment system designed to maintain a dynamic balance between exploration and exploitation; (3) a mechanism for retaining top-quality solutions to ensure the preservation of optimal results.; and (4) a local perturbation mechanism to help escape local optima. To comprehensively evaluate the optimization performance of AGG-GCRA, 20 separate experiments were carried out across 26 standard benchmark functions and six real-world engineering optimization problems, with comparisons made against 11 advanced metaheuristic optimization methods. The findings indicate that AGG-GCRA surpasses the competing algorithms in aspects of convergence rate, solution precision, and robustness. In the stability analysis, AGG-GCRA consistently obtained the global optimal solution in multiple runs for five engineering cases, achieving an average rank of first place and a standard deviation close to zero, highlighting its exceptional global search capabilities and excellent repeatability. Statistical tests, including the Friedman ranking and Wilcoxon signed-rank tests, provide additional validation for the effectiveness and importance of the proposed algorithm. In conclusion, AGG-GCRA provides an efficient and stable intelligent optimization tool for solving various optimization problems.</p>","PeriodicalId":8907,"journal":{"name":"Biomimetics","volume":"10 9","pages":""},"PeriodicalIF":3.9000,"publicationDate":"2025-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12467549/pdf/","citationCount":"0","resultStr":"{\"title\":\"An Improved Greater Cane Rat Algorithm with Adaptive and Global-Guided Mechanisms for Solving Real-World Engineering Problems.\",\"authors\":\"Yepei Chen, Zhangzhi Tian, Kaifan Zhang, Feng Zhao, Aiping Zhao\",\"doi\":\"10.3390/biomimetics10090612\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>This study presents an improved variant of the greater cane rat algorithm (GCRA), called adaptive and global-guided greater cane rat algorithm (AGG-GCRA), which aims to alleviate some key limitations of the original GCRA regarding convergence speed, solution precision, and stability. GCRA simulates the foraging behavior of the greater cane rat during both mating and non-mating seasons, demonstrating intelligent exploration capabilities. However, the original algorithm still faces challenges such as premature convergence and inadequate local exploitation when applied to complex optimization problems. To address these issues, this paper introduces four key improvements to the GCRA: (1) a global optimum guidance term to enhance the convergence directionality; (2) a flexible parameter adjustment system designed to maintain a dynamic balance between exploration and exploitation; (3) a mechanism for retaining top-quality solutions to ensure the preservation of optimal results.; and (4) a local perturbation mechanism to help escape local optima. To comprehensively evaluate the optimization performance of AGG-GCRA, 20 separate experiments were carried out across 26 standard benchmark functions and six real-world engineering optimization problems, with comparisons made against 11 advanced metaheuristic optimization methods. The findings indicate that AGG-GCRA surpasses the competing algorithms in aspects of convergence rate, solution precision, and robustness. In the stability analysis, AGG-GCRA consistently obtained the global optimal solution in multiple runs for five engineering cases, achieving an average rank of first place and a standard deviation close to zero, highlighting its exceptional global search capabilities and excellent repeatability. Statistical tests, including the Friedman ranking and Wilcoxon signed-rank tests, provide additional validation for the effectiveness and importance of the proposed algorithm. In conclusion, AGG-GCRA provides an efficient and stable intelligent optimization tool for solving various optimization problems.</p>\",\"PeriodicalId\":8907,\"journal\":{\"name\":\"Biomimetics\",\"volume\":\"10 9\",\"pages\":\"\"},\"PeriodicalIF\":3.9000,\"publicationDate\":\"2025-09-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12467549/pdf/\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Biomimetics\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.3390/biomimetics10090612\",\"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/biomimetics10090612","RegionNum":3,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

本研究提出了一种改进的大甘蔗大鼠算法(GCRA),称为自适应全局导向大甘蔗大鼠算法(AGG-GCRA),旨在缓解原GCRA在收敛速度、求解精度和稳定性方面的一些关键局限性。GCRA模拟了大蔗鼠在交配季节和非交配季节的觅食行为,展示了智能探索能力。然而,当应用于复杂的优化问题时,原有算法仍然存在过早收敛和局部开发不足的问题。针对这些问题,本文介绍了GCRA的四个关键改进:(1)全局最优引导项,增强收敛方向性;(2)灵活的参数调整系统,以保持勘探与开采之间的动态平衡;(3)保留高质量解决方案的机制,以确保保存最佳结果;(4)局部摄动机制有助于逃避局部最优。为了全面评估AGG-GCRA的优化性能,在26个标准基准函数和6个实际工程优化问题上进行了20个单独的实验,并与11种先进的元启发式优化方法进行了比较。研究结果表明,AGG-GCRA算法在收敛速度、求解精度和鲁棒性等方面均优于同类算法。在稳定性分析中,AGG-GCRA在5个工程案例的多次运行中始终获得全局最优解,平均排名第一,标准差接近于零,突出了其卓越的全局搜索能力和出色的可重复性。统计检验,包括Friedman排序和Wilcoxon符号秩检验,为所提出算法的有效性和重要性提供了额外的验证。总之,AGG-GCRA为解决各种优化问题提供了一种高效、稳定的智能优化工具。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Improved Greater Cane Rat Algorithm with Adaptive and Global-Guided Mechanisms for Solving Real-World Engineering Problems.

This study presents an improved variant of the greater cane rat algorithm (GCRA), called adaptive and global-guided greater cane rat algorithm (AGG-GCRA), which aims to alleviate some key limitations of the original GCRA regarding convergence speed, solution precision, and stability. GCRA simulates the foraging behavior of the greater cane rat during both mating and non-mating seasons, demonstrating intelligent exploration capabilities. However, the original algorithm still faces challenges such as premature convergence and inadequate local exploitation when applied to complex optimization problems. To address these issues, this paper introduces four key improvements to the GCRA: (1) a global optimum guidance term to enhance the convergence directionality; (2) a flexible parameter adjustment system designed to maintain a dynamic balance between exploration and exploitation; (3) a mechanism for retaining top-quality solutions to ensure the preservation of optimal results.; and (4) a local perturbation mechanism to help escape local optima. To comprehensively evaluate the optimization performance of AGG-GCRA, 20 separate experiments were carried out across 26 standard benchmark functions and six real-world engineering optimization problems, with comparisons made against 11 advanced metaheuristic optimization methods. The findings indicate that AGG-GCRA surpasses the competing algorithms in aspects of convergence rate, solution precision, and robustness. In the stability analysis, AGG-GCRA consistently obtained the global optimal solution in multiple runs for five engineering cases, achieving an average rank of first place and a standard deviation close to zero, highlighting its exceptional global search capabilities and excellent repeatability. Statistical tests, including the Friedman ranking and Wilcoxon signed-rank tests, provide additional validation for the effectiveness and importance of the proposed algorithm. In conclusion, AGG-GCRA provides an efficient and stable intelligent optimization tool for solving various optimization problems.

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