基于分段迭代法的PMU的优化配置研究  

Research on optimal PMU allocation based on section iterative method

作　　者：赵辉[1,2] 赵少华[1] 王红君[1] 岳有军[1] 

机构地区：[1]天津市复杂控制理论与应用重点实验室(天津理工大学),天津300384 [2]天津农学院,天津300384

出　　处：《电测与仪表》2016年第13期14-18,共5页Electrical Measurement & Instrumentation

基　　金：天津市科技支撑计划项目(13ZCZDGX03800;10ZCKFGX03400);天津市自然科学基金项目(09JCZDJC23900)

摘　　要：对电力系统中有限个数目PMU的优化配置进行研究。采用分段迭代法对PMU的优化配置进行研究。该法假设最初每个节点均安装有PMU。第一阶段和第二阶段的迭代算法用来去除那些不太重要的节点的PMU配置,并保留节点位置重要的PMU的配置。第三阶段的迭代算法则对前两阶段的PMU数目进行进一步的最小化,并且充分考虑电力系统全网的可观性,使得该法达到PMU的最优配置。通过在IEEE 14和IEEE 30节点上进行仿真验证,并与现有的优先算法在计算时间上进行对比,证明该法在计算时间上的优越性,及该法的有效性。This paper conduct the research on the optimal allocation of a limited number of PMU in power system device. A three-stage method will be adopted to study theoptimal allocation of PMU. The method assumes that each bus is installed with PMU initially. The first stage and the second stage of iterative algorithmis are used to remove those less important buses of the PMU configuration,and keep the important position of the buses PMU configuration. The third stage of iterative algorithm makes a further minimize of the first stage and the second stage,and considering the observability of power system,to ensure the optimal configuration of PMU. According to the simulation verification on IEEE 14 bus and IEEE 30 bus system,and compare with the existing priority algorithm in computation time,the results show that the proposed method has superiority in computation time,and the validity of this method.

关 键 词：PMU 迭代算法 IEEE节点系统 优化配置 可观性 

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