{"title":"输电网关键使用案例的选择方法","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":"{\"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}","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}
A Method for Selecting Critical Transmission Grid Usage Cases
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.