基于最大流最小截集定理的解列断面搜索方法  

A Searching Method for Power System Controlled Islanding Surfaces Based on Maximum Flow-Minimum Cut Theorem

作　　者：夏成军[1] 陈翠琼[1] 涂亮 门锟 

机构地区：[1]华南理工大学电力学院,广东省广州市510640 [2]南方电网科学研究院有限责任公司,广东省广州市510080

出　　处：《电网技术》2015年第12期3485-3490,共6页Power System Technology

基　　金：国家高技术研究发展计划(863计划)(2012AA050209)~~

摘　　要：如何在系统发生失稳后快速寻找最优解列断面,是实施主动解列需要解决的重要问题。为解决系统规模增大而引起求解过程中的非确定性多项式难题,提出一种基于最大流最小截集定理的最优解列断面搜索方法。首先根据系统失步后发电机的分群信息,以最大流最小截集定理为依据构造容量网络;然后利用Ford-Fulkerson标号法缩小解列断面搜索空间;最后以不平衡功率最小为约束确定最优解列断面。通过新英格兰39节点系统算例验证了该方法的有效性及快速性。Key problem for controlled islanding is to find out optimal islanding surfaces promptly and accurately. Based on maximum flow-minimum cut theorem, a searching method for optimal islanding scheme is proposed to solve non-deterministic polynomial（PN） problem when it comes to large-scale power system. Firstly, according to generators＇ grouping information after loss of stability, system networks with capacity are built based on maximum flow-minimum cut theorem. Secondly, Ford-Fulkerson labeling algorithm is used to reduce searching space. Finally, based on demand of minimal net power imbalance within islands, optimal islanding surface is obtained. Simulations on New England 39-bus system validate effectiveness and rapidity of the proposed approach.

关 键 词：电力系统 失步 解列策略 最大流最小截集定理 Ford-Fulkerson标号法 

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