Xinrui Wang, Wengang Chen, Ruimin Tian, Yuze Ji, Jianfei Zhu
{"title":"基于图模型和分层前向后扫并行算法的配电网络快速功率流计算","authors":"Xinrui Wang, Wengang Chen, Ruimin Tian, Yuze Ji, Jianfei Zhu","doi":"10.3389/fenrg.2024.1465900","DOIUrl":null,"url":null,"abstract":"IntroductionIn response to the issues of complexity and low efficiency in line loss calculations for actual distribution networks, this paper proposes a fast power flow calculation method for distribution networks based on Neo4j graph models and a hierarchical forward-backward sweep parallel algorithm.MethodsFirstly, Neo4j is used to describe the distribution network structure as a simple graph model composed of nodes and edges. Secondly, a hierarchical forward-backward sweep method is adopted to perform power flow calculations on the graph model network. Finally, during the computation of distribution network subgraphs, the method is combined with the Bulk Synchronous Parallel (BSP) computing model to quickly complete the line loss analysis.Results and DiscussionResults from the IEEE 33-node test system demonstrate that the proposed method can calculate network losses quickly and accurately, with a computation time of only 0.175s, which is lower than the MySQL and Neo4j graph methods that do not consider hierarchical parallel computing.","PeriodicalId":12428,"journal":{"name":"Frontiers in Energy Research","volume":null,"pages":null},"PeriodicalIF":2.6000,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fast power flow calculation for distribution networks based on graph models and hierarchical forward-backward sweep parallel algorithm\",\"authors\":\"Xinrui Wang, Wengang Chen, Ruimin Tian, Yuze Ji, Jianfei Zhu\",\"doi\":\"10.3389/fenrg.2024.1465900\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"IntroductionIn response to the issues of complexity and low efficiency in line loss calculations for actual distribution networks, this paper proposes a fast power flow calculation method for distribution networks based on Neo4j graph models and a hierarchical forward-backward sweep parallel algorithm.MethodsFirstly, Neo4j is used to describe the distribution network structure as a simple graph model composed of nodes and edges. Secondly, a hierarchical forward-backward sweep method is adopted to perform power flow calculations on the graph model network. Finally, during the computation of distribution network subgraphs, the method is combined with the Bulk Synchronous Parallel (BSP) computing model to quickly complete the line loss analysis.Results and DiscussionResults from the IEEE 33-node test system demonstrate that the proposed method can calculate network losses quickly and accurately, with a computation time of only 0.175s, which is lower than the MySQL and Neo4j graph methods that do not consider hierarchical parallel computing.\",\"PeriodicalId\":12428,\"journal\":{\"name\":\"Frontiers in Energy Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.6000,\"publicationDate\":\"2024-08-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Frontiers in Energy Research\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.3389/fenrg.2024.1465900\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"ENERGY & FUELS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Frontiers in Energy Research","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.3389/fenrg.2024.1465900","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENERGY & FUELS","Score":null,"Total":0}
Fast power flow calculation for distribution networks based on graph models and hierarchical forward-backward sweep parallel algorithm
IntroductionIn response to the issues of complexity and low efficiency in line loss calculations for actual distribution networks, this paper proposes a fast power flow calculation method for distribution networks based on Neo4j graph models and a hierarchical forward-backward sweep parallel algorithm.MethodsFirstly, Neo4j is used to describe the distribution network structure as a simple graph model composed of nodes and edges. Secondly, a hierarchical forward-backward sweep method is adopted to perform power flow calculations on the graph model network. Finally, during the computation of distribution network subgraphs, the method is combined with the Bulk Synchronous Parallel (BSP) computing model to quickly complete the line loss analysis.Results and DiscussionResults from the IEEE 33-node test system demonstrate that the proposed method can calculate network losses quickly and accurately, with a computation time of only 0.175s, which is lower than the MySQL and Neo4j graph methods that do not consider hierarchical parallel computing.
期刊介绍:
Frontiers in Energy Research makes use of the unique Frontiers platform for open-access publishing and research networking for scientists, which provides an equal opportunity to seek, share and create knowledge. The mission of Frontiers is to place publishing back in the hands of working scientists and to promote an interactive, fair, and efficient review process. Articles are peer-reviewed according to the Frontiers review guidelines, which evaluate manuscripts on objective editorial criteria