Changjun Wu, Qingzhen Li, Qiaohua Wang, Huanlong Zhang, Xiaohui Song
{"title":"基于集群协作的混合北方大鹰优化算法","authors":"Changjun Wu, Qingzhen Li, Qiaohua Wang, Huanlong Zhang, Xiaohui Song","doi":"10.1007/s10586-024-04571-8","DOIUrl":null,"url":null,"abstract":"<p>To address the problems that the northern goshawk optimization algorithm (NGO) has a slow convergence speed and is highly susceptible to fall into local optimal solutions, this paper proposes a hybrid northern goshawk optimization algorithm based on cluster collaboration (HHNGO), which effectively improves the convergence speed and alleviates the problem of falling into the local optimum. Firstly, piecewise chaotic mapping is used to initialize the population, which makes the initial population more evenly distributed in the search space and improves the quality of the initial solution. Secondly, the prey recognition position update formula in the harris hawk optimization algorithm is introduced to improve the exploration phase. Meanwhile, a nonlinear factor can be added to accelerate the process which reaches the minimum difference between the prey best position and the average position of the eagle group. Thus the iteration number is reduced during the search process, and the convergence speed of the algorithm is improved. Finally, the Cauchy variation strategy is used to perturb the optimal solution of the algorithm. Then, its probability jumping out of the local optimal solution is increased, and the global search capability is enhanced. The experimental comparison is carried out to analyze the 12 standard functions, CEC-2019 and CEC-2021 test functions in HHNGO and PSO, GWO, POA, HHO, NGO, INGO, DFPSO, MGLMRFO, GMPBSA algorithms, and HHNGO is applied in PID parameter rectification. The results prove the feasibility and superiority of the proposed method.</p>","PeriodicalId":501576,"journal":{"name":"Cluster Computing","volume":"26 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A hybrid northern goshawk optimization algorithm based on cluster collaboration\",\"authors\":\"Changjun Wu, Qingzhen Li, Qiaohua Wang, Huanlong Zhang, Xiaohui Song\",\"doi\":\"10.1007/s10586-024-04571-8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>To address the problems that the northern goshawk optimization algorithm (NGO) has a slow convergence speed and is highly susceptible to fall into local optimal solutions, this paper proposes a hybrid northern goshawk optimization algorithm based on cluster collaboration (HHNGO), which effectively improves the convergence speed and alleviates the problem of falling into the local optimum. Firstly, piecewise chaotic mapping is used to initialize the population, which makes the initial population more evenly distributed in the search space and improves the quality of the initial solution. Secondly, the prey recognition position update formula in the harris hawk optimization algorithm is introduced to improve the exploration phase. Meanwhile, a nonlinear factor can be added to accelerate the process which reaches the minimum difference between the prey best position and the average position of the eagle group. Thus the iteration number is reduced during the search process, and the convergence speed of the algorithm is improved. Finally, the Cauchy variation strategy is used to perturb the optimal solution of the algorithm. Then, its probability jumping out of the local optimal solution is increased, and the global search capability is enhanced. The experimental comparison is carried out to analyze the 12 standard functions, CEC-2019 and CEC-2021 test functions in HHNGO and PSO, GWO, POA, HHO, NGO, INGO, DFPSO, MGLMRFO, GMPBSA algorithms, and HHNGO is applied in PID parameter rectification. The results prove the feasibility and superiority of the proposed method.</p>\",\"PeriodicalId\":501576,\"journal\":{\"name\":\"Cluster Computing\",\"volume\":\"26 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-06-23\",\"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-04571-8\",\"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-04571-8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A hybrid northern goshawk optimization algorithm based on cluster collaboration
To address the problems that the northern goshawk optimization algorithm (NGO) has a slow convergence speed and is highly susceptible to fall into local optimal solutions, this paper proposes a hybrid northern goshawk optimization algorithm based on cluster collaboration (HHNGO), which effectively improves the convergence speed and alleviates the problem of falling into the local optimum. Firstly, piecewise chaotic mapping is used to initialize the population, which makes the initial population more evenly distributed in the search space and improves the quality of the initial solution. Secondly, the prey recognition position update formula in the harris hawk optimization algorithm is introduced to improve the exploration phase. Meanwhile, a nonlinear factor can be added to accelerate the process which reaches the minimum difference between the prey best position and the average position of the eagle group. Thus the iteration number is reduced during the search process, and the convergence speed of the algorithm is improved. Finally, the Cauchy variation strategy is used to perturb the optimal solution of the algorithm. Then, its probability jumping out of the local optimal solution is increased, and the global search capability is enhanced. The experimental comparison is carried out to analyze the 12 standard functions, CEC-2019 and CEC-2021 test functions in HHNGO and PSO, GWO, POA, HHO, NGO, INGO, DFPSO, MGLMRFO, GMPBSA algorithms, and HHNGO is applied in PID parameter rectification. The results prove the feasibility and superiority of the proposed method.