论文标题
用于电力系统漏洞识别的图理论方法
A Graph Theoretic Approach to Power System Vulnerability Identification
论文作者
论文摘要
在主要的电力系统干扰期间，当多个组件中断以快速连续发生时，快速识别功能传输能力有限的传输互连变得至关重要。了解中断对这些关键互连的影响（称为饱和切割组）对于提高情境意识和采取正确的行动很重要。本文提出了一种新的图理论方法，用于分析偶然性是否会在网状电源网络中创建饱和的切割机。该算法的一个新功能是，它降低了解决方案时间，可以显着使该方法可在实时操作中生存。它还表明应减少通过临界互连的功率传输的最小量，以免发生后宿舍饱和。使用IEEE-118总线系统以及西方互连（WI）的17,000多个总线模型，证明了提出的增强情境意识算法的鲁棒性。与电力系统脆弱性评估不同方法进行的比较证明了在极端紧急情况下提议的协助电力系统操作的实用性。
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.
