{"title":"基于椭圆第一定义和群体协同进化机制的工程优化问题多策略改进麻雀搜索算法","authors":"Gang Chen, Hu Sun","doi":"10.1007/s10586-024-04620-2","DOIUrl":null,"url":null,"abstract":"<p>The Sparrow Search Algorithm (SSA) is recognized for its rapid convergence and precision in engineering optimization, yet it faces the challenge of premature convergence on complex problems. To address this, a multi-strategy improved sparrow search algorithm (MISSA) is proposed to enhance the optimization performance and applicability in this study. For the first time in the algorithm, the first definition of ellipses is integrated into SSA to balance its exploration and exploitation capabilities. A group co-evolutionary mechanism is introduced to promote population diversity and suppress premature convergence. Unlike most existing work, ablation experiments are utilized to evaluate the effective impact of these enhancement strategies on SSA. Statistical results based on the Wilcoxon signed-rank test and Friedman test show that the dynamic regulator based on the first definition of ellipses has the greatest impact on improving the performance of SSA. Numerical experiments based on the CEC2017 benchmark problems are used as an optimization case to compare MISSA with the classical metaheuristic algorithm and other state-of-the-art variants of SSA. The results demonstrate the outstanding performance and immense potential of MISSA in problem-solving. The applicability of the proposed algorithm is validated through six actual engineering optimization problems, showcasing strong competitiveness in global optimization.</p>","PeriodicalId":501576,"journal":{"name":"Cluster Computing","volume":"42 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-strategy improved sparrow search algorithm based on first definition of ellipse and group co-evolutionary mechanism for engineering optimization problems\",\"authors\":\"Gang Chen, Hu Sun\",\"doi\":\"10.1007/s10586-024-04620-2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The Sparrow Search Algorithm (SSA) is recognized for its rapid convergence and precision in engineering optimization, yet it faces the challenge of premature convergence on complex problems. To address this, a multi-strategy improved sparrow search algorithm (MISSA) is proposed to enhance the optimization performance and applicability in this study. For the first time in the algorithm, the first definition of ellipses is integrated into SSA to balance its exploration and exploitation capabilities. A group co-evolutionary mechanism is introduced to promote population diversity and suppress premature convergence. Unlike most existing work, ablation experiments are utilized to evaluate the effective impact of these enhancement strategies on SSA. Statistical results based on the Wilcoxon signed-rank test and Friedman test show that the dynamic regulator based on the first definition of ellipses has the greatest impact on improving the performance of SSA. Numerical experiments based on the CEC2017 benchmark problems are used as an optimization case to compare MISSA with the classical metaheuristic algorithm and other state-of-the-art variants of SSA. The results demonstrate the outstanding performance and immense potential of MISSA in problem-solving. The applicability of the proposed algorithm is validated through six actual engineering optimization problems, showcasing strong competitiveness in global optimization.</p>\",\"PeriodicalId\":501576,\"journal\":{\"name\":\"Cluster Computing\",\"volume\":\"42 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Cluster Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s10586-024-04620-2\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cluster Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s10586-024-04620-2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Multi-strategy improved sparrow search algorithm based on first definition of ellipse and group co-evolutionary mechanism for engineering optimization problems
The Sparrow Search Algorithm (SSA) is recognized for its rapid convergence and precision in engineering optimization, yet it faces the challenge of premature convergence on complex problems. To address this, a multi-strategy improved sparrow search algorithm (MISSA) is proposed to enhance the optimization performance and applicability in this study. For the first time in the algorithm, the first definition of ellipses is integrated into SSA to balance its exploration and exploitation capabilities. A group co-evolutionary mechanism is introduced to promote population diversity and suppress premature convergence. Unlike most existing work, ablation experiments are utilized to evaluate the effective impact of these enhancement strategies on SSA. Statistical results based on the Wilcoxon signed-rank test and Friedman test show that the dynamic regulator based on the first definition of ellipses has the greatest impact on improving the performance of SSA. Numerical experiments based on the CEC2017 benchmark problems are used as an optimization case to compare MISSA with the classical metaheuristic algorithm and other state-of-the-art variants of SSA. The results demonstrate the outstanding performance and immense potential of MISSA in problem-solving. The applicability of the proposed algorithm is validated through six actual engineering optimization problems, showcasing strong competitiveness in global optimization.