Open AccessMethod for evaluating the importance of power grid nodes based on PageRank algorithm
Author(s) -
Li Canbing,
Liu Wencan,
Cao Yijia,
Chen Hao,
Fang Baling,
Zhang Wei,
Shi Haiqing
Publication year - 2014
Publication title -
iet generation, transmission and distribution
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.92
H-Index - 110
eISSN - 1751-8695
pISSN - 1751-8687
DOI - 10.1049/iet-gtd.2014.0051
Subject(s) - computer science , blackout , pagerank , grid , algorithm , power grid , electric power system , graph , load balancing (electrical power) , power (physics) , node (physics) , topology (electrical circuits) , distributed computing , mathematics , theoretical computer science , engineering , physics , geometry , quantum mechanics , structural engineering , combinatorics
Cascading failures can easily occur and cause a major blackout in power grid when an important node breaks down. It is an essential problem to evaluate the importance of nodes in power system planning and operation. In this study, a method for evaluating the importance of power grid nodes based on PageRank (PR) algorithm is proposed. First, according to the comparison of the internet and power grid topology, a directed graph is established. Second, based on the directed graph, an index is proposed to estimate the importance of power grid nodes based on PR algorithm. Then, according to the characteristics of power grid, a modified algorithm, which takes the importance of nodal load, nodal load capacity and network topology into account, is proposed. Finally, case study shows the necessity of considering the factors to evaluate the importance of power grid nodes and the effective of index and algorithm to identify critical nodes in this study.