协方差矩阵自适应驱动的动态多种群群体捕食优化器:见解,定性分析和约束工程优化

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Xinsen Zhou , Jie Xing , Wenyong Gui , Ali Asghar Heidari , Zhennao Cai , Huiling Chen , Guoxi Liang
{"title":"协方差矩阵自适应驱动的动态多种群群体捕食优化器:见解,定性分析和约束工程优化","authors":"Xinsen Zhou ,&nbsp;Jie Xing ,&nbsp;Wenyong Gui ,&nbsp;Ali Asghar Heidari ,&nbsp;Zhennao Cai ,&nbsp;Huiling Chen ,&nbsp;Guoxi Liang","doi":"10.1016/j.asoc.2025.113041","DOIUrl":null,"url":null,"abstract":"<div><div>The Colony Predation Algorithm (CPA) is a straightforward population-based algorithm with few control parameters. Nevertheless, its initial design has limitations, including a tendency for local optimization and limited search ability, leading to subpar solutions. In response to these concerns, a novel approach named the Covariance Matrix Adaptive-Driven Dynamic Multi-Population Colony Predation Algorithm (ICPA) is introduced. Qualitative analysis experiments are carried out to determine ICPA's feasibility, including historical search trajectory analyses and balanced diversity assessments. Additionally, a comparative study involving 11 well-known algorithms, 11 state-of-the-art algorithms, and four champion algorithms (EBOwithCMAR, SPS_L_SHADE_EIG, LSHADE_cnEpSi, and LSHADE) using the IEEE CEC 2014 test suite confirmed its superior optimization capabilities. Statistical tests consistently rank ICPA first on the Friedman test (with scores of 2.17, 3.37, and 2.27) and demonstrate its outperformance of state-of-the-art algorithms in at least 40 % of tested functions in the Wilcoxon sign-rank test. The Bonferroni Dunn post-hoc statistical test reveals that ICPA significantly outperforms 61.53 % of the compared algorithms. Additionally, the efficacy of ICPA was evaluated on seven constrained real-world engineering problems, encompassing gear train design, speed reducer design, multi-disc clutch and brake design, cantilever beam design, three-bar truss design, I-beam design, and combined economic emission dispatch. The experimental outcomes underscore the potential of ICPA in addressing practical engineering challenges, thereby validating its optimization effectiveness. Utilizing extensive experimentation and comparative analyses, the feasibility, superiority, and effectiveness of ICPA have been substantiated, encompassing both qualitative and quantitative perspectives.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"175 ","pages":"Article 113041"},"PeriodicalIF":7.2000,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Covariance matrix adaptation driven dynamic multi-population colony predation optimizer: Insights, qualitative analysis, and constrained engineering optimization\",\"authors\":\"Xinsen Zhou ,&nbsp;Jie Xing ,&nbsp;Wenyong Gui ,&nbsp;Ali Asghar Heidari ,&nbsp;Zhennao Cai ,&nbsp;Huiling Chen ,&nbsp;Guoxi Liang\",\"doi\":\"10.1016/j.asoc.2025.113041\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The Colony Predation Algorithm (CPA) is a straightforward population-based algorithm with few control parameters. Nevertheless, its initial design has limitations, including a tendency for local optimization and limited search ability, leading to subpar solutions. In response to these concerns, a novel approach named the Covariance Matrix Adaptive-Driven Dynamic Multi-Population Colony Predation Algorithm (ICPA) is introduced. Qualitative analysis experiments are carried out to determine ICPA's feasibility, including historical search trajectory analyses and balanced diversity assessments. Additionally, a comparative study involving 11 well-known algorithms, 11 state-of-the-art algorithms, and four champion algorithms (EBOwithCMAR, SPS_L_SHADE_EIG, LSHADE_cnEpSi, and LSHADE) using the IEEE CEC 2014 test suite confirmed its superior optimization capabilities. Statistical tests consistently rank ICPA first on the Friedman test (with scores of 2.17, 3.37, and 2.27) and demonstrate its outperformance of state-of-the-art algorithms in at least 40 % of tested functions in the Wilcoxon sign-rank test. The Bonferroni Dunn post-hoc statistical test reveals that ICPA significantly outperforms 61.53 % of the compared algorithms. Additionally, the efficacy of ICPA was evaluated on seven constrained real-world engineering problems, encompassing gear train design, speed reducer design, multi-disc clutch and brake design, cantilever beam design, three-bar truss design, I-beam design, and combined economic emission dispatch. The experimental outcomes underscore the potential of ICPA in addressing practical engineering challenges, thereby validating its optimization effectiveness. Utilizing extensive experimentation and comparative analyses, the feasibility, superiority, and effectiveness of ICPA have been substantiated, encompassing both qualitative and quantitative perspectives.</div></div>\",\"PeriodicalId\":50737,\"journal\":{\"name\":\"Applied Soft Computing\",\"volume\":\"175 \",\"pages\":\"Article 113041\"},\"PeriodicalIF\":7.2000,\"publicationDate\":\"2025-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Soft Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1568494625003527\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494625003527","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

群体捕食算法(CPA)是一种简单的基于种群的算法,控制参数很少。然而,它最初的设计有局限性,包括局部优化的倾向和有限的搜索能力,导致不合格的解决方案。针对这些问题,提出了协方差矩阵自适应驱动动态多种群种群捕食算法(ICPA)。定性分析实验包括历史搜索轨迹分析和平衡多样性评估,以确定ICPA的可行性。此外,使用IEEE CEC 2014测试套件对11种知名算法、11种最先进算法和4种冠军算法(EBOwithCMAR、SPS_L_SHADE_EIG、LSHADE_cnEpSi和LSHADE)进行了比较研究,证实了其卓越的优化能力。统计测试始终将ICPA在弗里德曼测试中排名第一(得分为2.17,3.37和2.27),并证明其在Wilcoxon符号-秩测试中至少40% %的测试函数中优于最先进的算法。Bonferroni Dunn事后统计检验表明,ICPA显著优于61.53 %的比较算法。此外,还针对轮系设计、减速器设计、多盘离合器和制动器设计、悬臂梁设计、三杆桁架设计、工字钢设计和联合经济排放调度等7个约束工程问题对ICPA的有效性进行了评估。实验结果强调了ICPA在解决实际工程挑战方面的潜力,从而验证了其优化有效性。通过大量的实验和比较分析,从定性和定量两个角度证实了ICPA的可行性、优越性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Covariance matrix adaptation driven dynamic multi-population colony predation optimizer: Insights, qualitative analysis, and constrained engineering optimization
The Colony Predation Algorithm (CPA) is a straightforward population-based algorithm with few control parameters. Nevertheless, its initial design has limitations, including a tendency for local optimization and limited search ability, leading to subpar solutions. In response to these concerns, a novel approach named the Covariance Matrix Adaptive-Driven Dynamic Multi-Population Colony Predation Algorithm (ICPA) is introduced. Qualitative analysis experiments are carried out to determine ICPA's feasibility, including historical search trajectory analyses and balanced diversity assessments. Additionally, a comparative study involving 11 well-known algorithms, 11 state-of-the-art algorithms, and four champion algorithms (EBOwithCMAR, SPS_L_SHADE_EIG, LSHADE_cnEpSi, and LSHADE) using the IEEE CEC 2014 test suite confirmed its superior optimization capabilities. Statistical tests consistently rank ICPA first on the Friedman test (with scores of 2.17, 3.37, and 2.27) and demonstrate its outperformance of state-of-the-art algorithms in at least 40 % of tested functions in the Wilcoxon sign-rank test. The Bonferroni Dunn post-hoc statistical test reveals that ICPA significantly outperforms 61.53 % of the compared algorithms. Additionally, the efficacy of ICPA was evaluated on seven constrained real-world engineering problems, encompassing gear train design, speed reducer design, multi-disc clutch and brake design, cantilever beam design, three-bar truss design, I-beam design, and combined economic emission dispatch. The experimental outcomes underscore the potential of ICPA in addressing practical engineering challenges, thereby validating its optimization effectiveness. Utilizing extensive experimentation and comparative analyses, the feasibility, superiority, and effectiveness of ICPA have been substantiated, encompassing both qualitative and quantitative perspectives.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Applied Soft Computing
Applied Soft Computing 工程技术-计算机:跨学科应用
CiteScore
15.80
自引率
6.90%
发文量
874
审稿时长
10.9 months
期刊介绍: Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities. Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.
×
引用
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学术官方微信