A Graph Theoretic Approach to Power System Vulnerability Identification

TL;DR

This paper introduces a fast graph theoretic method to identify critical saturated cut-sets in power systems during outages, improving real-time situational awareness and operational decision-making.

Contribution

It presents a novel, computationally efficient algorithm for assessing power system vulnerability to contingencies, capable of real-time application and indicating necessary power transfer reductions.

Findings

Algorithm significantly reduces solution time.

Effective on large-scale power system models.

Proven utility in real-time operational scenarios.

Abstract

During major power system disturbances, when multiple component outages occur in rapid succession, it becomes crucial to quickly identify the transmission interconnections that have limited power transfer capability. Understanding the impact of an outage on these critical interconnections (called saturated cut-sets) is important for enhancing situational awareness and taking correct actions. This paper proposes a new graph theoretic approach for analyzing whether a contingency will create a saturated cut-set in a meshed power network. A novel feature of the proposed algorithm is that it lowers the solution time significantly making the approach viable for real-time operations. It also indicates the minimum amount by which the power transfer through the critical interconnections should be reduced so that post-contingency saturation does not occur. Robustness of the proposed algorithm for enhanced situational awareness is demonstrated using the IEEE-118 bus system as well as a 17,000+ bus model of the Western Interconnection (WI). Comparisons made with different approaches for power system vulnerability assessment prove the utility of the proposed scheme for aiding power system operations during extreme exigencies.