大电网互联格局下的解列断面双阶段搜索方法  

Dual-stage Method for Islanding Surface Searching Under Interconnected Power System

作　　者：廖清芬[1] 王乙斐[1] 唐飞[1] 杨健[1] 刘涤尘[1] 查晓明[1] 

机构地区：[1]武汉大学电气工程学院,武汉430072

出　　处：《高电压技术》2015年第3期739-746,共8页High Voltage Engineering

基　　金：博士后科学基金(2014M552080);国家电网公司大电网重大专项资助项目课题(SGCC-MPLG029-2012)~~

摘　　要：针对大区互联电网受扰失稳后应及时进行解列的问题,提出了一种解列断面双阶段搜索方法。首先,基于有功对相角的灵敏度计算各母线节点之间的电气距离,利用K-medoids算法对互联电网进行预分区,再将子区域进行聚合,得到互联电网的初始简化结构图;然后,构建主动解列断面搜索的数学模型,设置有功不平衡功率最小的目标函数及约束条件;最后,利用改进的蚁群算法求解最优解列断面。结果表明所提出的双阶段解列断面搜索方法在不丢失可行解的情况下可将IEEE 118节点算例和某实际大电网算例分别简化为20节点与310节点的系统,并在不平衡功率分别为1.01 MW和189.1 MW搜索到了解列断面,总过程耗时分别为0.21 s与4.35 s,满足了解列搜索过程所要求的快速性与有效性。In accordance with the losing stability of an interconnected power system, we proposed a dual-stage solution method for islanding surface searching. Firstly, the electrical distance was calculated based on active power and voltage phase angle sensitivity and then the K-medoids were used to conduct partition to get a simplified system; Secondly, a mathematical model of active islanding was established and the minimum unbalanced power was taken as the objective function with some constraints; Finally, the improved ant colony optimization was used to seek the optimal results. Examples show that the IEEE-118 bus system and a real system can be simplified to a 20-bus system and a 310-bus system respectively by the proposed method, and the islanding surface can be identified when the unbalanced power reaches 1.01 MW and 189.1 MW. The time costs of this method on those two examples are 0.21 s and 4.35 s which meet the requirements of rapidity and validity.

关 键 词：解列断面搜索 电气距离 K-Medoids算法 电力系统 改进蚁群算法 化简 

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