基于图神经网络的电网子网划分研究。

IF 2.7 2区 数学 Q1 MATHEMATICS, APPLIED
Chaos Pub Date : 2025-04-01 DOI:10.1063/5.0239576
Hongjun Wang, Yanli Zou, Tingli Qin, Hai Zhang, Jinmei Hu, Miao Chen
{"title":"基于图神经网络的电网子网划分研究。","authors":"Hongjun Wang, Yanli Zou, Tingli Qin, Hai Zhang, Jinmei Hu, Miao Chen","doi":"10.1063/5.0239576","DOIUrl":null,"url":null,"abstract":"<p><p>With the increasing scale of power systems, their reliability analysis and calculation become more complex and difficult. Community structure, as an important topological characteristic of complex networks, plays a prominent role in power grid research and application. The current methods for community division of power networks are mainly based on the topological characteristics of the network, with less consideration of the power balance of the subnetwork, which requires larger-scale machine-cutting or load-cutting operations when the subnetwork operates independently after the grid is unbundled. To solve this problem, this paper proposes a community segmentation method for power networks based on graph neural networks that integrally considers the topology of the network and the power balance of the network. Node attributes such as node degree, betweenness, and power value are selected as node features to help the model capture more correlations between nodes. The traditional K-means algorithm is also optimized and improved, and the method of selecting generator nodes as the clustering centers is proposed to ensure that there are generator nodes supplying energy in each community. Experiments are conducted on the IEEE standard test systems, and the effectiveness of the method proposed in this paper is verified by comparing it with other community segmentation methods.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"35 4","pages":""},"PeriodicalIF":2.7000,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Study of power grid subnet partition based on graph neural network.\",\"authors\":\"Hongjun Wang, Yanli Zou, Tingli Qin, Hai Zhang, Jinmei Hu, Miao Chen\",\"doi\":\"10.1063/5.0239576\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>With the increasing scale of power systems, their reliability analysis and calculation become more complex and difficult. Community structure, as an important topological characteristic of complex networks, plays a prominent role in power grid research and application. The current methods for community division of power networks are mainly based on the topological characteristics of the network, with less consideration of the power balance of the subnetwork, which requires larger-scale machine-cutting or load-cutting operations when the subnetwork operates independently after the grid is unbundled. To solve this problem, this paper proposes a community segmentation method for power networks based on graph neural networks that integrally considers the topology of the network and the power balance of the network. Node attributes such as node degree, betweenness, and power value are selected as node features to help the model capture more correlations between nodes. The traditional K-means algorithm is also optimized and improved, and the method of selecting generator nodes as the clustering centers is proposed to ensure that there are generator nodes supplying energy in each community. Experiments are conducted on the IEEE standard test systems, and the effectiveness of the method proposed in this paper is verified by comparing it with other community segmentation methods.</p>\",\"PeriodicalId\":9974,\"journal\":{\"name\":\"Chaos\",\"volume\":\"35 4\",\"pages\":\"\"},\"PeriodicalIF\":2.7000,\"publicationDate\":\"2025-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Chaos\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1063/5.0239576\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Chaos","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1063/5.0239576","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

随着电力系统规模的不断扩大,其可靠性分析与计算变得越来越复杂和困难。社区结构作为复杂网络的重要拓扑特征,在电网研究和应用中发挥着突出的作用。目前的社区电网划分方法主要基于网络的拓扑特性,较少考虑子网的功率均衡,在电网解绑后,当子网独立运行时,需要进行更大规模的切机或切负荷操作。为了解决这一问题,本文提出了一种基于图神经网络的电网社区分割方法,该方法综合考虑了电网的拓扑结构和电网的功率均衡。选择节点属性(如节点度、节点间度和功率值)作为节点特征,帮助模型捕获节点之间更多的相关性。对传统的K-means算法进行了优化和改进,提出了选择发电机节点作为聚类中心的方法,以保证每个社区都有发电机节点供电。在IEEE标准测试系统上进行了实验,并与其他社区分割方法进行了比较,验证了本文方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Study of power grid subnet partition based on graph neural network.

With the increasing scale of power systems, their reliability analysis and calculation become more complex and difficult. Community structure, as an important topological characteristic of complex networks, plays a prominent role in power grid research and application. The current methods for community division of power networks are mainly based on the topological characteristics of the network, with less consideration of the power balance of the subnetwork, which requires larger-scale machine-cutting or load-cutting operations when the subnetwork operates independently after the grid is unbundled. To solve this problem, this paper proposes a community segmentation method for power networks based on graph neural networks that integrally considers the topology of the network and the power balance of the network. Node attributes such as node degree, betweenness, and power value are selected as node features to help the model capture more correlations between nodes. The traditional K-means algorithm is also optimized and improved, and the method of selecting generator nodes as the clustering centers is proposed to ensure that there are generator nodes supplying energy in each community. Experiments are conducted on the IEEE standard test systems, and the effectiveness of the method proposed in this paper is verified by comparing it with other community segmentation methods.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Chaos
Chaos 物理-物理:数学物理
CiteScore
5.20
自引率
13.80%
发文量
448
审稿时长
2.3 months
期刊介绍: Chaos: An Interdisciplinary Journal of Nonlinear Science is a peer-reviewed journal devoted to increasing the understanding of nonlinear phenomena and describing the manifestations in a manner comprehensible to researchers from a broad spectrum of disciplines.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信