{"title":"用于解决全局最优问题的改进型沙猫群优化算法","authors":"Heming Jia, Jinrui Zhang, Honghua Rao, Laith Abualigah","doi":"10.1007/s10462-024-10986-x","DOIUrl":null,"url":null,"abstract":"<div><p>The sand cat swarm optimization algorithm (SCSO) is a metaheuristic algorithm proposed by Amir Seyyedabbasi et al. SCSO algorithm mimics the predatory behavior of sand cats, which gives the algorithm a strong optimized performance. However, as the number of iterations of the algorithm increases, the moving efficiency of the sand cat decreases, resulting in the decline of search ability. The convergence speed of the algorithm gradually decreases, and it is easy to fall into local optimum, and it is difficult to find a better solution. In order to improve the search and movement efficiency of the sand cat, and enhance the global optimization ability and convergence performance of the algorithm, an improved sand cat Swarm Optimization (ISCSO) algorithm was proposed. In ISCSO algorithm, we propose a low-frequency noise search strategy and a spiral contraction walking strategy according to the habit of sand cat, and add random opposition-based learning and restart strategy. The frequency factor was used to control the search direction of the sand cat, and the spiral contraction hunting was carried out, which effectively improved the randomness of the population, expanded the search range of the algorithm, enhanced the moving efficiency of the sand cat, and accelerated the convergence speed of the algorithm. We use 23 standard benchmark functions and IEEE CEC2014 benchmark functions to compare ISCSO with 10 algorithms, and prove the effectiveness of the improved strategy. Finally, ISCSO was evaluated using five constrained engineering design problems. In the results of these problems, using ISCSO has 3.08%, 0.23%, 0.37%, 22.34%, 1.38% improvement compared with the original algorithm respectively, which proves the effectiveness of the improved strategy in practical application problems. The source code website for ISCSO is https://github.com/Ruiruiz30/ISCSO-s-code.</p></div>","PeriodicalId":8449,"journal":{"name":"Artificial Intelligence Review","volume":"58 1","pages":""},"PeriodicalIF":10.7000,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10462-024-10986-x.pdf","citationCount":"0","resultStr":"{\"title\":\"Improved sandcat swarm optimization algorithm for solving global optimum problems\",\"authors\":\"Heming Jia, Jinrui Zhang, Honghua Rao, Laith Abualigah\",\"doi\":\"10.1007/s10462-024-10986-x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The sand cat swarm optimization algorithm (SCSO) is a metaheuristic algorithm proposed by Amir Seyyedabbasi et al. SCSO algorithm mimics the predatory behavior of sand cats, which gives the algorithm a strong optimized performance. However, as the number of iterations of the algorithm increases, the moving efficiency of the sand cat decreases, resulting in the decline of search ability. The convergence speed of the algorithm gradually decreases, and it is easy to fall into local optimum, and it is difficult to find a better solution. In order to improve the search and movement efficiency of the sand cat, and enhance the global optimization ability and convergence performance of the algorithm, an improved sand cat Swarm Optimization (ISCSO) algorithm was proposed. In ISCSO algorithm, we propose a low-frequency noise search strategy and a spiral contraction walking strategy according to the habit of sand cat, and add random opposition-based learning and restart strategy. The frequency factor was used to control the search direction of the sand cat, and the spiral contraction hunting was carried out, which effectively improved the randomness of the population, expanded the search range of the algorithm, enhanced the moving efficiency of the sand cat, and accelerated the convergence speed of the algorithm. We use 23 standard benchmark functions and IEEE CEC2014 benchmark functions to compare ISCSO with 10 algorithms, and prove the effectiveness of the improved strategy. Finally, ISCSO was evaluated using five constrained engineering design problems. In the results of these problems, using ISCSO has 3.08%, 0.23%, 0.37%, 22.34%, 1.38% improvement compared with the original algorithm respectively, which proves the effectiveness of the improved strategy in practical application problems. The source code website for ISCSO is https://github.com/Ruiruiz30/ISCSO-s-code.</p></div>\",\"PeriodicalId\":8449,\"journal\":{\"name\":\"Artificial Intelligence Review\",\"volume\":\"58 1\",\"pages\":\"\"},\"PeriodicalIF\":10.7000,\"publicationDate\":\"2024-11-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s10462-024-10986-x.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Artificial Intelligence Review\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s10462-024-10986-x\",\"RegionNum\":2,\"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":"Artificial Intelligence Review","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10462-024-10986-x","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
Improved sandcat swarm optimization algorithm for solving global optimum problems
The sand cat swarm optimization algorithm (SCSO) is a metaheuristic algorithm proposed by Amir Seyyedabbasi et al. SCSO algorithm mimics the predatory behavior of sand cats, which gives the algorithm a strong optimized performance. However, as the number of iterations of the algorithm increases, the moving efficiency of the sand cat decreases, resulting in the decline of search ability. The convergence speed of the algorithm gradually decreases, and it is easy to fall into local optimum, and it is difficult to find a better solution. In order to improve the search and movement efficiency of the sand cat, and enhance the global optimization ability and convergence performance of the algorithm, an improved sand cat Swarm Optimization (ISCSO) algorithm was proposed. In ISCSO algorithm, we propose a low-frequency noise search strategy and a spiral contraction walking strategy according to the habit of sand cat, and add random opposition-based learning and restart strategy. The frequency factor was used to control the search direction of the sand cat, and the spiral contraction hunting was carried out, which effectively improved the randomness of the population, expanded the search range of the algorithm, enhanced the moving efficiency of the sand cat, and accelerated the convergence speed of the algorithm. We use 23 standard benchmark functions and IEEE CEC2014 benchmark functions to compare ISCSO with 10 algorithms, and prove the effectiveness of the improved strategy. Finally, ISCSO was evaluated using five constrained engineering design problems. In the results of these problems, using ISCSO has 3.08%, 0.23%, 0.37%, 22.34%, 1.38% improvement compared with the original algorithm respectively, which proves the effectiveness of the improved strategy in practical application problems. The source code website for ISCSO is https://github.com/Ruiruiz30/ISCSO-s-code.
期刊介绍:
Artificial Intelligence Review, a fully open access journal, publishes cutting-edge research in artificial intelligence and cognitive science. It features critical evaluations of applications, techniques, and algorithms, providing a platform for both researchers and application developers. The journal includes refereed survey and tutorial articles, along with reviews and commentary on significant developments in the field.