A Method for Selecting Critical Transmission Grid Usage Cases

Jiayan Liu, Dennis Klein, Yang Zhou, C. Rehtanz
{"title":"A Method for Selecting Critical Transmission Grid Usage Cases","authors":"Jiayan Liu, Dennis Klein, Yang Zhou, C. Rehtanz","doi":"10.1109/IECON.2019.8927159","DOIUrl":null,"url":null,"abstract":"When performing transmission network analysis, the computational expense of underlying network calculations is a basic problem. For instance, sensitivity analysis in network planning will be inapplicable due to the large number of components, the hourly resolution of time steps and the complexity of N-1 calculations, if considering all data. Anyway, only the most critical network loadings are relevant for the outcome of analysis. For this reason, this paper proposes a method for selecting those time steps that cover the most critical network loadings. At first, the critical range of each line is been defined. Than the scope of critical data is reduced by K-means clustering. Finally a global searching method is adapted to find the most important data. In this way, subsequent network calculations can be applied with acceptable effort and still high accuracy. A case study on the real German transmission network is carried out to validate the method.","PeriodicalId":187719,"journal":{"name":"IECON 2019 - 45th Annual Conference of the IEEE Industrial Electronics Society","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IECON 2019 - 45th Annual Conference of the IEEE Industrial Electronics Society","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IECON.2019.8927159","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

When performing transmission network analysis, the computational expense of underlying network calculations is a basic problem. For instance, sensitivity analysis in network planning will be inapplicable due to the large number of components, the hourly resolution of time steps and the complexity of N-1 calculations, if considering all data. Anyway, only the most critical network loadings are relevant for the outcome of analysis. For this reason, this paper proposes a method for selecting those time steps that cover the most critical network loadings. At first, the critical range of each line is been defined. Than the scope of critical data is reduced by K-means clustering. Finally a global searching method is adapted to find the most important data. In this way, subsequent network calculations can be applied with acceptable effort and still high accuracy. A case study on the real German transmission network is carried out to validate the method.
输电网关键使用案例的选择方法
在进行传输网分析时,底层网络计算的计算费用是一个基本问题。例如,如果考虑所有数据,由于组件数量多,时间步长每小时的分辨率和N-1计算的复杂性,网络规划中的灵敏度分析将不适用。无论如何,只有最关键的网络负载才与分析结果相关。因此,本文提出了一种方法来选择覆盖最关键网络负载的时间步长。首先,定义了每条线的临界范围。然后用K-means聚类方法缩小关键数据的范围。最后,采用全局搜索的方法寻找最重要的数据。这样,后续的网络计算可以用可接受的努力和仍然具有较高的精度。通过对德国实际输电网的算例分析,验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信