电网内关键输电截集识别

IF 9.4 1区 工程技术 Q1 ENGINEERING, INDUSTRIAL
Lu Nan, Siduo Hu, Yuhang Chen, Chuan He
{"title":"电网内关键输电截集识别","authors":"Lu Nan,&nbsp;Siduo Hu,&nbsp;Yuhang Chen,&nbsp;Chuan He","doi":"10.1016/j.ress.2025.111360","DOIUrl":null,"url":null,"abstract":"<div><div>It is crucial to quickly and accurately identify the critical transmission cut-sets to ensure the secure operation of power grids. This paper proposes a method for identifying the critical transmission cut-sets which form major flowgates from generators to loads within the power grid. Specially, the active power transaction between generator and load buses is proposed to derive the critical transmission cut-sets with the improved PageRank Algorithm. Firstly, the nodal criticality of buses is quantified on the basis of improved PageRank algorithm where the Google matrix and the relinking vector are modified. Furthermore, a new topology for identifying critical transmission cut-sets is constructed according to the nodal criticality of buses and the network transformation. The transmission cut-sets identification problem is thus converted into shortest paths searching in the new topology. The searching area is determined based on the active power transaction between generator and load buses. Finally, the set of transmission lines forming the critical transmission cut-sets, with highest criticalities between generator and load buses, are identified by searching the shortest paths. Numerical examples show that the proposed method can efficiently and accurately identify the critical transmission cut-sets within power grids, and provide guidance for system monitoring and protection.</div></div>","PeriodicalId":54500,"journal":{"name":"Reliability Engineering & System Safety","volume":"264 ","pages":"Article 111360"},"PeriodicalIF":9.4000,"publicationDate":"2025-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Critical transmission cut-sets identification within power grids\",\"authors\":\"Lu Nan,&nbsp;Siduo Hu,&nbsp;Yuhang Chen,&nbsp;Chuan He\",\"doi\":\"10.1016/j.ress.2025.111360\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>It is crucial to quickly and accurately identify the critical transmission cut-sets to ensure the secure operation of power grids. This paper proposes a method for identifying the critical transmission cut-sets which form major flowgates from generators to loads within the power grid. Specially, the active power transaction between generator and load buses is proposed to derive the critical transmission cut-sets with the improved PageRank Algorithm. Firstly, the nodal criticality of buses is quantified on the basis of improved PageRank algorithm where the Google matrix and the relinking vector are modified. Furthermore, a new topology for identifying critical transmission cut-sets is constructed according to the nodal criticality of buses and the network transformation. The transmission cut-sets identification problem is thus converted into shortest paths searching in the new topology. The searching area is determined based on the active power transaction between generator and load buses. Finally, the set of transmission lines forming the critical transmission cut-sets, with highest criticalities between generator and load buses, are identified by searching the shortest paths. Numerical examples show that the proposed method can efficiently and accurately identify the critical transmission cut-sets within power grids, and provide guidance for system monitoring and protection.</div></div>\",\"PeriodicalId\":54500,\"journal\":{\"name\":\"Reliability Engineering & System Safety\",\"volume\":\"264 \",\"pages\":\"Article 111360\"},\"PeriodicalIF\":9.4000,\"publicationDate\":\"2025-06-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Reliability Engineering & System Safety\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0951832025005617\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, INDUSTRIAL\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Reliability Engineering & System Safety","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0951832025005617","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, INDUSTRIAL","Score":null,"Total":0}
引用次数: 0

摘要

快速、准确地识别关键输电割集对保证电网的安全运行至关重要。本文提出了一种确定电网内从发电机到负荷构成主要流门的临界输电割集的方法。特别提出了发电机与负载总线之间的有功交易,利用改进的PageRank算法推导出关键传输割集。首先,在改进PageRank算法的基础上,对谷歌矩阵和重链接向量进行修正,量化公交节点临界性;在此基础上,根据母线节点的临界性和网络变换构造了一种新的临界传输割集识别拓扑。将传输割集识别问题转化为新拓扑下的最短路径搜索问题。根据发电机与负荷母线之间的有功交易确定搜索区域。最后,通过搜索最短路径,确定发电机和负载母线之间临界度最高的关键传输割集。数值算例表明,该方法能有效、准确地识别电网内的关键输电割集,为系统监测和保护提供指导。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Critical transmission cut-sets identification within power grids
It is crucial to quickly and accurately identify the critical transmission cut-sets to ensure the secure operation of power grids. This paper proposes a method for identifying the critical transmission cut-sets which form major flowgates from generators to loads within the power grid. Specially, the active power transaction between generator and load buses is proposed to derive the critical transmission cut-sets with the improved PageRank Algorithm. Firstly, the nodal criticality of buses is quantified on the basis of improved PageRank algorithm where the Google matrix and the relinking vector are modified. Furthermore, a new topology for identifying critical transmission cut-sets is constructed according to the nodal criticality of buses and the network transformation. The transmission cut-sets identification problem is thus converted into shortest paths searching in the new topology. The searching area is determined based on the active power transaction between generator and load buses. Finally, the set of transmission lines forming the critical transmission cut-sets, with highest criticalities between generator and load buses, are identified by searching the shortest paths. Numerical examples show that the proposed method can efficiently and accurately identify the critical transmission cut-sets within power grids, and provide guidance for system monitoring and protection.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Reliability Engineering & System Safety
Reliability Engineering & System Safety 管理科学-工程:工业
CiteScore
15.20
自引率
39.50%
发文量
621
审稿时长
67 days
期刊介绍: Elsevier publishes Reliability Engineering & System Safety in association with the European Safety and Reliability Association and the Safety Engineering and Risk Analysis Division. The international journal is devoted to developing and applying methods to enhance the safety and reliability of complex technological systems, like nuclear power plants, chemical plants, hazardous waste facilities, space systems, offshore and maritime systems, transportation systems, constructed infrastructure, and manufacturing plants. The journal normally publishes only articles that involve the analysis of substantive problems related to the reliability of complex systems or present techniques and/or theoretical results that have a discernable relationship to the solution of such problems. An important aim is to balance academic material and practical applications.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信