引用本文:王方雨,刘文颖,田浩,梁琛,郑晶晶.基于网络分块算法的静态安全快速计算方法[J].电力自动化设备,2017,37(4):
WANG Fangyu,LIU Wenying,TIAN Hao,LIANG Chen,ZHENG Jingjing.Fast static security calculation based on network partition algorithm[J].Electric Power Automation Equipment,2017,37(4):
【打印本页】   【HTML】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览 12490次   下载 1473  
基于网络分块算法的静态安全快速计算方法
王方雨1, 刘文颖1, 田浩1, 梁琛2, 郑晶晶2
1.华北电力大学 电气与电子工程学院,北京 102206;2.国网甘肃省电力公司电力科学研究院,甘肃 兰州 730050
摘要:
传统的静态安全分析需要对预想故障集中的预想故障进行多次网络重构和潮流计算,计算量和计算时间随电网规模的增大而快速增加,使得静态安全分析在实时分析和预警中不能满足全网分析的需求。提出一种基于网络分块算法的新型迭代方法,将全网合理划分为较为均匀的子网络,降低网络矩阵的维数,通过边界协调变量联系各子网络,有效提高计算速度。基于静态安全分析中故障潮流的特点提出适用于该算法的弱收敛性条件,该收敛条件使得每步迭代的计算量随迭代次数增加快速减少。仿真分析证明所提收敛条件容易达到,使得所提算法具有良好的收敛性。
关键词:  网络分块算法  协调变量  故障潮流  改进牛拉法  弱收敛条件  静态安全
DOI:10.16081/j.issn.1006-6047.2017.04.031
分类号:TM73
基金项目:国家科技支撑计划(2015BAA01B04);国家电网公司科技项目(52272214002C)
Fast static security calculation based on network partition algorithm
WANG Fangyu1, LIU Wenying1, TIAN Hao1, LIANG Chen2, ZHENG Jingjing2
1.School of Electrical & Electronic Engineering, North China Electrical Power University, Beijing 102206, China;2.State Grid Gansu Electric Power Company Electric Power Research Institute, Lanzhou 730050, China
Abstract:
Since multiple network reconfiguration and power-flow calculation should be carried out for each fault in the anticipated fault set during traditional static security analysis, the calculation amount and calculation time increase rapidly along with the expansion of power grid, which makes it impossible to satisfy the demand of grid-wide real-time analysis and warning. An iterative method based on network partitioning algorithm is proposed, which reasonably and quite evenly divides the whole grid into sub-networks to reduce the dimension of network matrix and coordinates the sub-networks via boundary variables to effectively enhance the calculation speed. A weak convergence condition is proposed according to the characteristics of the fault power-flow of static security analysis, which makes the calculation amount decrease rapidly along with the increase of iteration turns. Simulation verifies that, since the proposed convergence condition is easy to satisfy, the proposed method has better convergence.
Key words:  network partition algorithm  coordination variable  fault power-flow  modified Newton-Raphson method  weak convergence condition  static security

用微信扫一扫

用微信扫一扫