-
Parallel Betweenness Computation in Graph Database for Contingency Selection
Parallel betweenness computation algorithms are proposed and implemented...
read it
-
Graph Based Power Flow Calculation for Energy Management System
Power flow calculation in EMS is required to accommodate a large and com...
read it
-
Exploration of Graph Computing in Power System State Estimation
With the increased complexity of power systems due to the integration of...
read it
-
Graph Computing based Fast Screening in Contingency Analysis
During last decades, contingency analysis has been facing challenges fro...
read it
-
Power Flow Analysis Using Graph based Combination of Iterative Methods and Vertex Contraction Approach
Compared with relational database (RDB), graph database (GDB) is a more ...
read it
-
Graph-based Preconditioning Conjugate Gradient Algorithm for N-1 Contingency Analysis
Contingency analysis (CA) plays a critical role to guarantee operation s...
read it
-
Analyzing the Structure of Mondrian's 1920-1940 Compositions
Mondrian was one of the most significant painters of the 20th century. H...
read it
Fast Grid Splitting Detection for N-1 Contingency Analysis by Graph Computing
In this study, a graph-computing based grid splitting detection algorithm is proposed for contingency analysis in a graph-based EMS (Energy Management System). The graph model of a power system is established by storing its bus-branch information into the corresponding vertex objects and edge objects of the graph database. Numerical comparison to an up-to-date serial computing algorithm is also investigated. Online tests on a real power system of China State Grid with 2752 buses and 3290 branches show that a 6 times speedup can be achieved, which lays a good foundation for advanced contingency analysis.
READ FULL TEXT
Comments
There are no comments yet.