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.
@article{arxiv.1904.03587,
title = {Fast Grid Splitting Detection for N-1 Contingency Analysis by Graph Computing},
author = {Yongli Zhu and Lingpeng Shi and Renchang Dai and Guangyi Liu},
journal= {arXiv preprint arXiv:1904.03587},
year = {2019}
}
Comments
This paper has been accepted by the IEEE ISGT-ASIA 2019 conference, Chengdu, China, May.21-24, 2019