Fast Grid Splitting Detection for N-1 Contingency Analysis by Graph Computing

Autor:	Zhu, Yongli, Shi, Lingpeng, Dai, Renchang, Liu, Guangyi
Rok vydání:	2019
Předmět:	Computer Science - Distributed Parallel and Cluster Computing Computer Science - Databases Computer Science - Data Structures and Algorithms 68R10 D.1.3 F.1.2 D.3.2 H.2.4
Druh dokumentu:	Working Paper
Popis:	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. Comment: This paper has been accepted by the IEEE ISGT-ASIA 2019 conference, Chengdu, China, May.21-24, 2019
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1904.03587 Zobrazit plný text záznamu View this record from Arxiv