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 algorit...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Frontiers in energy research Jg. 12
Hauptverfasser: Wang, Xinrui, Chen, Wengang, Tian, Ruimin, Ji, Yuze, Zhu, Jianfei
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Frontiers Media S.A 28.08.2024
Schlagworte:
bulk synchronous parallel computing model
distribution network
graph model
hierarchical forward-backward sweep
line loss calculation
ISSN:2296-598X, 2296-598X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2296-598X
2296-598X
DOI:10.3389/fenrg.2024.1465900