中国电机工程学报2016，Vol.36Issue(23)：6363-6370,8.DOI:10.13334/j.0258-8013.pcsee.161352
基于PageRank改进算法的电网脆弱线路快速辨识（一）：理论基础
Rapid Identification of Vulnerable Lines in Power Grid Using Modified PageRank Algorithm--Part I:Theoretical Foundation
摘要
Abstract
ABSTRACT:As the first part of this two-part paper, this paper proposed a modified PageRank 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 PageRank algorithm was clarified in detail. Firstly, the basic PageRank 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 PageRank 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.关键词
连锁故障/PageRank改进算法/电网/脆弱线路/快速辨识Key words
cascading failure/modified PageRank algorithm/power grid/vulnerable lines/rapid identification分类
信息技术与安全科学引用本文复制引用
马志远,刘锋,沈沉,张爽,田蓓..基于PageRank改进算法的电网脆弱线路快速辨识（一）：理论基础[J].中国电机工程学报,2016,36(23):6363-6370,8.基金项目
国家自然科学基金项目(51321005)；国网宁夏电力公司电力科学研究院资助项目(5229DK14000Z)。Project Supported by National Natural Science Foundation of China (51321005) （51321005）
Electric Power Research Institute of State Grid Ningxia Electric Power Company (5229DK14000Z) （5229DK14000Z）
