Improved snow geese algorithm for engineering applications and clustering optimization

The Snow Goose Algorithm (SGA) is a new meta-heuristic algorithm proposed in 2024, which has been proved to have good optimization effect, but there are still problems that are easy to fall into local optimal and premature convergence. In order to further improve the optimization performance of the...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Scientific reports Ročník 15; číslo 1; s. 4506 - 95
Hlavní autori: Bian, Haihong, Li, Can, Liu, Yuhan, Tong, Yuxuan, Bing, Shengwei, Chen, Jincheng, Ren, Quance, Zhang, Zhiyuan
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: London Nature Publishing Group UK 06.02.2025
Nature Publishing Group
Nature Portfolio
Predmet:
ISSN:2045-2322, 2045-2322
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The Snow Goose Algorithm (SGA) is a new meta-heuristic algorithm proposed in 2024, which has been proved to have good optimization effect, but there are still problems that are easy to fall into local optimal and premature convergence. In order to further improve the optimization performance of the algorithm, this paper proposes an improved Snow Goose algorithm (ISGA) based on three strategies according to the real migration habits of snow geese: (1) Lead goose rotation mechanism. (2) Honk-guiding mechanism. (3) Outlier boundary strategy. Through the above strategies, the exploration and development ability of the original algorithm is comprehensively enhanced, and the convergence accuracy and convergence speed are improved. In this paper, two standard test sets of IEEE CEC2022 and IEEE CEC2017 are used to verify the excellent performance of the improved algorithm. The practical application ability of ISGA is tested through 8 engineering problems, and ISGA is employed to enhance the effect of the clustering algorithm. The results show that compared with the comparison algorithm, the proposed ISGA has a faster iteration speed and can find better solutions, which shows its great potential in solving practical optimization problems.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:2045-2322
2045-2322
DOI:10.1038/s41598-025-88080-7