Title
Fast Grid Splitting Detection for N-1 Contingency Analysis by Graph Computing.
Abstract
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.
Year
DOI
Venue
2019
10.1109/ISGT-Asia.2019.8880879
IEEE Innovative Smart Grid Technologies-Asia
DocType
Volume
Citations 
Journal
abs/1904.03587
0
PageRank 
References 
Authors
0.34
0
4
Name
Order
Citations
PageRank
Yongli Zhu111.79
Lingpeng Shi200.34
Renchang Dai302.03
Guangyi Liu422336.37