Yanhui Xu , Yihao Gao , Yundan Cheng , Yuhang Sun , Xuesong Li , Xianxian Pan , Hao Yu
{"title":"Substation clustering based on improved KFCM algorithm with adaptive optimal clustering number selection","authors":"Yanhui Xu , Yihao Gao , Yundan Cheng , Yuhang Sun , Xuesong Li , Xianxian Pan , Hao Yu","doi":"10.1016/j.gloei.2023.08.010","DOIUrl":null,"url":null,"abstract":"<div><p>The premise and basis of load modeling are substation load composition inquiries and cluster analyses. However, the traditional kernel fuzzy C-means (KFCM) algorithm is limited by artificial clustering number selection and its convergence to local optimal solutions. To overcome these limitations, an improved KFCM algorithm with adaptive optimal clustering number selection is proposed in this paper. This algorithm optimizes the KFCM algorithm by combining the powerful global search ability of genetic algorithm and the robust local search ability of simulated annealing algorithm. The improved KFCM algorithm adaptively determines the ideal number of clusters using the clustering evaluation index ratio. Compared with the traditional KFCM algorithm, the enhanced KFCM algorithm has robust clustering and comprehensive abilities, enabling the efficient convergence to the global optimal solution</p></div>","PeriodicalId":36174,"journal":{"name":"Global Energy Interconnection","volume":null,"pages":null},"PeriodicalIF":1.9000,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Global Energy Interconnection","FirstCategoryId":"1087","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2096511723000695","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENERGY & FUELS","Score":null,"Total":0}
引用次数: 0
Abstract
The premise and basis of load modeling are substation load composition inquiries and cluster analyses. However, the traditional kernel fuzzy C-means (KFCM) algorithm is limited by artificial clustering number selection and its convergence to local optimal solutions. To overcome these limitations, an improved KFCM algorithm with adaptive optimal clustering number selection is proposed in this paper. This algorithm optimizes the KFCM algorithm by combining the powerful global search ability of genetic algorithm and the robust local search ability of simulated annealing algorithm. The improved KFCM algorithm adaptively determines the ideal number of clusters using the clustering evaluation index ratio. Compared with the traditional KFCM algorithm, the enhanced KFCM algorithm has robust clustering and comprehensive abilities, enabling the efficient convergence to the global optimal solution