一种结合分支切割和节点分割的网络分割新方法

Gulong Chen, Zheng Li, Jierui Yang, Yu Zhang, Zhaofeng Zhang
{"title":"一种结合分支切割和节点分割的网络分割新方法","authors":"Gulong Chen, Zheng Li, Jierui Yang, Yu Zhang, Zhaofeng Zhang","doi":"10.1117/12.2682288","DOIUrl":null,"url":null,"abstract":"With the continuous expansion of distribution network scale, the real-time performance of distribution network segmentation algorithm is increasingly difficult to meet the requirements of practical engineering. The result of network segmentation is actually to divide a whole into various smaller modules and calculate and solve these small modules respectively. Based on this, this paper adopts a new network segmentation method integrating branch cutting and node splitting. In this way, nodes and branches are operated accordingly. The boundary variables generated by this way include both the voltage on the split node and the current on the cut branch. Using a new model of distribution network - hierarchical topology model, the global optimization problem is transformed into a multi-stage segmentation problem. At the same time, the negative fast division of distribution network is realized by searching for split nodes and cutting branches. The simulation results of an example show that the algorithm is correct, effective and fast.","PeriodicalId":177416,"journal":{"name":"Conference on Electronic Information Engineering and Data Processing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A new network segmentation method integrating branch cutting and node splitting\",\"authors\":\"Gulong Chen, Zheng Li, Jierui Yang, Yu Zhang, Zhaofeng Zhang\",\"doi\":\"10.1117/12.2682288\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the continuous expansion of distribution network scale, the real-time performance of distribution network segmentation algorithm is increasingly difficult to meet the requirements of practical engineering. The result of network segmentation is actually to divide a whole into various smaller modules and calculate and solve these small modules respectively. Based on this, this paper adopts a new network segmentation method integrating branch cutting and node splitting. In this way, nodes and branches are operated accordingly. The boundary variables generated by this way include both the voltage on the split node and the current on the cut branch. Using a new model of distribution network - hierarchical topology model, the global optimization problem is transformed into a multi-stage segmentation problem. At the same time, the negative fast division of distribution network is realized by searching for split nodes and cutting branches. The simulation results of an example show that the algorithm is correct, effective and fast.\",\"PeriodicalId\":177416,\"journal\":{\"name\":\"Conference on Electronic Information Engineering and Data Processing\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-05-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference on Electronic Information Engineering and Data Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1117/12.2682288\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference on Electronic Information Engineering and Data Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.2682288","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随着配电网规模的不断扩大,配电网分割算法的实时性越来越难以满足实际工程的要求。网络分割的结果实际上是将一个整体划分为各个较小的模块,并分别对这些小模块进行计算和求解。在此基础上,本文采用了一种分支切割和节点分割相结合的网络分割方法。这样,节点和分支的操作就相应进行了。这种方式产生的边界变量既包括分裂节点上的电压,也包括切断支路上的电流。采用一种新的配电网模型——分层拓扑模型,将全局优化问题转化为多阶段分割问题。同时,通过搜索分裂节点和切断分支,实现了配电网的负快速划分。算例仿真结果表明,该算法是正确、有效、快速的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A new network segmentation method integrating branch cutting and node splitting
With the continuous expansion of distribution network scale, the real-time performance of distribution network segmentation algorithm is increasingly difficult to meet the requirements of practical engineering. The result of network segmentation is actually to divide a whole into various smaller modules and calculate and solve these small modules respectively. Based on this, this paper adopts a new network segmentation method integrating branch cutting and node splitting. In this way, nodes and branches are operated accordingly. The boundary variables generated by this way include both the voltage on the split node and the current on the cut branch. Using a new model of distribution network - hierarchical topology model, the global optimization problem is transformed into a multi-stage segmentation problem. At the same time, the negative fast division of distribution network is realized by searching for split nodes and cutting branches. The simulation results of an example show that the algorithm is correct, effective and fast.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信