Identification of Key Transmission Sections for Power System Static Security Based on Maximum Flow and Minimum Cut

Abstract

A maximum flow and minimum cut theorem based scheme is proposed for the identification of the key transmission sections in a power grid. The proposed algorithm transforms the power grid into a directed weighted graph with the consideration of the power flow and the capacity margin of the power grid during the minimum cut scanning. The searching results are stored in a search tree storage and the transmission sections are obtained through the network segmentation. All the transmission sections with "N-1" and "N-2" overload risks can be quickly and accurately identified and follows the cut set characteristics. The power limit of the transmission sections considering the static safety constraints are calculated based on the power transfer factor. Performance and feasibility of the proposed method are verified in the 39-bus New England system and the IEEE 300-bus system.