基于最大流算法的复杂电力网络脆弱性分析  

Vulnerability Analysis of Complex Power Network Based on Maximum Flow Algorithm

作　　者：雷敏[1] 莫霜叶 LEI Min;MO Shuangye(College of Electrical and Information Engineering,Hunan University of Technology,Zhuzhou Hunan 412007,China)

机构地区：[1]湖南工业大学电气与信息工程学院,湖南株洲412007

出　　处：《湖南工业大学学报》2019年第3期55-61,共7页Journal of Hunan University of Technology

摘　　要：结合电力网络的电气特征,提出一种基于复杂网络理论和网络最大流算法得到定位电力网络关键线路的方法。首先,通过计算电力网络导纳矩阵,对连接线赋予相应权重;然后,基于网络最大流算法算出连接线最大流量,并综合导纳及线路最大流量值作为识别关键线路新的状态指标。最后,对IEEE 39节点系统和IEEE 118节点系统进行仿真分析。结果表明,该系统对随机攻击具有较强的鲁棒性,随机选择和移除元件对系统效率几乎没有影响,但对有高中心性指数的线路蓄意攻击后,网络效率急剧下降,IEEE 39系统约下降了60%,IEEE 118系统约下降了40%。Combined with the electrical characteristics of power network, a method has thus been proposed based on complex network theory and network maximum flow algorithm to locate the key lines of power network. Firstly, by calculating the power network admittance matrix, the connecting lines are assigned with corresponding weights. Then, based on the maximum flow algorithm of the network, the maximum flow of the connecting line can be worked out, with a synthesis of the admittance and maximum flow of the line as new state indicators for identifying key lines. Finally, the simulation analysis has been carried out of the 39-node system and 118-node system of the IEEE. The results show that the system has strong robustness to random attacks, with the efficiency of the system almost unaffected by the random selection and removal of components, while the efficiency of the network decreases sharply with deliberate attacks on lines with high centrality index, with a decrease by about 60% the efficiency of the IEEE 39 system and a decrease by about 40% the efficiency of the IEEE 118 system.

关 键 词：复杂网络理论 脆弱性 介值指标 最大流算法 

分 类 号：TM711.1[电气工程—电力系统及自动化]