摘要

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.

全文