Xinsen Zhou , Jie Xing , Wenyong Gui , Ali Asghar Heidari , Zhennao Cai , Huiling Chen , Guoxi Liang
{"title":"Covariance matrix adaptation driven dynamic multi-population colony predation optimizer: Insights, qualitative analysis, and constrained engineering optimization","authors":"Xinsen Zhou , Jie Xing , Wenyong Gui , Ali Asghar Heidari , Zhennao Cai , Huiling Chen , 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}
引用次数: 0
Abstract
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 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.