基于PageRank改进算法的电网脆弱线路快速辨识(一):理论基础

Rapid Identification of Vulnerable Lines in Power Grid Using Modified Page Rank Algorithm——Part Ⅰ: Theoretical Foundation

作为两篇系列文章的第一篇,该文结合网络拓扑和电网运行状态,提出了一种适用于快速辨识电网脆弱线路的Page Rank改进算法并阐明其原理。首先,介绍Page Rank基本算法,并讨论了将其直接应用于辨识电网脆弱线路的局限性。其次,为了克服以上局限性,提出相关性网络和衍生网络的概念,然后在此基础上建立分析线路脆弱度Page Rank改进模型。最后,基于此模型给出线路脆弱度计算的解析表达式,并提出快速辨识脆弱线路的方法。

As the first part of this two-part paper, this paper proposed a modified Page Rank algorithm which is based on network topology and operation status of power systems and suitable for the rapid identification of vulnerable lines. The principle of the modified Page Rank algorithm was clarified in detail. Firstly, the basic Page Rank algorithm was introduced and the limitations of using it to directly recognize vulnerable lines in power grid were discussed. Secondly, in order to overcome above limitations, this paper put forward the concept of correlated network and derived network, and set up a modified Page Rank model to analysis the vulnerability of lines. Finally, an analytical expression for the calculation of line vulnerability was presented based on this model, and a method for rapid identifying vulnerable lines was proposed.