一种用于机械优化设计的融合多种策略的增强型吸引-排斥优化算法。

IF 3.9 3区 医学 Q1 ENGINEERING, MULTIDISCIPLINARY
Na Zhang, Ziwei Jiang, Gang Hu, Abdelazim G Hussien
{"title":"一种用于机械优化设计的融合多种策略的增强型吸引-排斥优化算法。","authors":"Na Zhang, Ziwei Jiang, Gang Hu, Abdelazim G Hussien","doi":"10.3390/biomimetics10090628","DOIUrl":null,"url":null,"abstract":"<p><p>Attraction-Repulsion Optimisation Algorithm (AROA) is a newly proposed metaheuristic algorithm for solving global optimisation problems, which simulates the equilibrium relating to the attraction and repulsion phenomenon that occurs in the natural world, and aims to achieve a good balance between the development exploration phases. Although AROA has a more significant performance compared to other classical algorithms on complex realistic constrained issues, it still has drawbacks in terms of diversity of solutions, convergence precision, and susceptibility to local stagnation. To further improve the global optimisation search and application ability of the AROA algorithm, this work puts forward an Improved Attraction-Repulsion Optimisation Algorithm based on multiple strategies, denoted as IAROA. Firstly, the elite dynamic opposite (EDO) learning strategy is used in the initialisation phase to enrich the information of the initial solution and obtain high-quality candidate solutions. Secondly, the dimension learning-based hunting (DLH) exploration tactics is imported to increase the candidate solution diversity and enhance the trade-off between local and global exploration. Next, the pheromone adjustment strategy (PAS) is used for some of the solutions according to the threshold value, which extends the search range of the algorithm and also accelerates the convergence process of the algorithm. Finally, the introduction of the Cauchy distribution inverse cumulative perturbation strategy (CDICP) improves the local search ability of the algorithm, avoids falling into the local optimum, and improves the convergence and accuracy of the algorithm. To validate the performance of IAROA, algorithms are solved by optimisation with the original AROA and 13 classical highly cited algorithms on the CEC2017 test functions, among six engineering design problems of varying complexity. The experimental results indicate that the proposed IAROA algorithm is superior in terms of optimisation precision, solution stability, convergence, and applicability and effectiveness on different problems, and is highly competitive in solving complex engineering design problems with constraints.</p>","PeriodicalId":8907,"journal":{"name":"Biomimetics","volume":"10 9","pages":""},"PeriodicalIF":3.9000,"publicationDate":"2025-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12467200/pdf/","citationCount":"0","resultStr":"{\"title\":\"IAROA: An Enhanced Attraction-Repulsion Optimisation Algorithm Fusing Multiple Strategies for Mechanical Optimisation Design.\",\"authors\":\"Na Zhang, Ziwei Jiang, Gang Hu, Abdelazim G Hussien\",\"doi\":\"10.3390/biomimetics10090628\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>Attraction-Repulsion Optimisation Algorithm (AROA) is a newly proposed metaheuristic algorithm for solving global optimisation problems, which simulates the equilibrium relating to the attraction and repulsion phenomenon that occurs in the natural world, and aims to achieve a good balance between the development exploration phases. Although AROA has a more significant performance compared to other classical algorithms on complex realistic constrained issues, it still has drawbacks in terms of diversity of solutions, convergence precision, and susceptibility to local stagnation. To further improve the global optimisation search and application ability of the AROA algorithm, this work puts forward an Improved Attraction-Repulsion Optimisation Algorithm based on multiple strategies, denoted as IAROA. Firstly, the elite dynamic opposite (EDO) learning strategy is used in the initialisation phase to enrich the information of the initial solution and obtain high-quality candidate solutions. Secondly, the dimension learning-based hunting (DLH) exploration tactics is imported to increase the candidate solution diversity and enhance the trade-off between local and global exploration. Next, the pheromone adjustment strategy (PAS) is used for some of the solutions according to the threshold value, which extends the search range of the algorithm and also accelerates the convergence process of the algorithm. Finally, the introduction of the Cauchy distribution inverse cumulative perturbation strategy (CDICP) improves the local search ability of the algorithm, avoids falling into the local optimum, and improves the convergence and accuracy of the algorithm. To validate the performance of IAROA, algorithms are solved by optimisation with the original AROA and 13 classical highly cited algorithms on the CEC2017 test functions, among six engineering design problems of varying complexity. The experimental results indicate that the proposed IAROA algorithm is superior in terms of optimisation precision, solution stability, convergence, and applicability and effectiveness on different problems, and is highly competitive in solving complex engineering design problems with constraints.</p>\",\"PeriodicalId\":8907,\"journal\":{\"name\":\"Biomimetics\",\"volume\":\"10 9\",\"pages\":\"\"},\"PeriodicalIF\":3.9000,\"publicationDate\":\"2025-09-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12467200/pdf/\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Biomimetics\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.3390/biomimetics10090628\",\"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/biomimetics10090628","RegionNum":3,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

吸引-排斥优化算法(AROA)是一种新提出的求解全局优化问题的元启发式算法,它模拟自然界中发生的吸引和排斥现象的平衡,旨在实现开发勘探阶段之间的良好平衡。尽管在复杂的现实约束问题上,AROA算法的性能比其他经典算法更为显著,但在解的多样性、收敛精度、易局部停滞等方面仍存在不足。为了进一步提高AROA算法的全局优化搜索和应用能力,本文提出了一种基于多策略的改进型吸引-排斥优化算法,记为IAROA。首先,在初始化阶段采用精英动态相反(EDO)学习策略,丰富初始解的信息,获得高质量的候选解;其次,引入基于维度学习的搜索(DLH)搜索策略,增加候选解的多样性,增强局部和全局搜索的权衡性;其次,根据阈值对部分解采用信息素调整策略(PAS),扩大了算法的搜索范围,也加快了算法的收敛过程。最后,引入柯西分布逆累积摄扰策略(CDICP),提高了算法的局部搜索能力,避免了算法陷入局部最优,提高了算法的收敛性和精度。为了验证IAROA的性能,在6个不同复杂程度的工程设计问题中,通过对原始AROA和13种经典高被引算法在CEC2017测试函数上的优化求解算法。实验结果表明,本文提出的IAROA算法在优化精度、解的稳定性、收敛性以及对不同问题的适用性和有效性等方面都具有优势,在求解具有约束条件的复杂工程设计问题方面具有很强的竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
IAROA: An Enhanced Attraction-Repulsion Optimisation Algorithm Fusing Multiple Strategies for Mechanical Optimisation Design.

Attraction-Repulsion Optimisation Algorithm (AROA) is a newly proposed metaheuristic algorithm for solving global optimisation problems, which simulates the equilibrium relating to the attraction and repulsion phenomenon that occurs in the natural world, and aims to achieve a good balance between the development exploration phases. Although AROA has a more significant performance compared to other classical algorithms on complex realistic constrained issues, it still has drawbacks in terms of diversity of solutions, convergence precision, and susceptibility to local stagnation. To further improve the global optimisation search and application ability of the AROA algorithm, this work puts forward an Improved Attraction-Repulsion Optimisation Algorithm based on multiple strategies, denoted as IAROA. Firstly, the elite dynamic opposite (EDO) learning strategy is used in the initialisation phase to enrich the information of the initial solution and obtain high-quality candidate solutions. Secondly, the dimension learning-based hunting (DLH) exploration tactics is imported to increase the candidate solution diversity and enhance the trade-off between local and global exploration. Next, the pheromone adjustment strategy (PAS) is used for some of the solutions according to the threshold value, which extends the search range of the algorithm and also accelerates the convergence process of the algorithm. Finally, the introduction of the Cauchy distribution inverse cumulative perturbation strategy (CDICP) improves the local search ability of the algorithm, avoids falling into the local optimum, and improves the convergence and accuracy of the algorithm. To validate the performance of IAROA, algorithms are solved by optimisation with the original AROA and 13 classical highly cited algorithms on the CEC2017 test functions, among six engineering design problems of varying complexity. The experimental results indicate that the proposed IAROA algorithm is superior in terms of optimisation precision, solution stability, convergence, and applicability and effectiveness on different problems, and is highly competitive in solving complex engineering design problems with constraints.

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