A Graph Theoretic Approach to Power System Vulnerability Identification. Biswas, R. S., Pal, A., Werho, T., & Vittal, V. IEEE Transactions on Power Systems, 36(2):923–935, March, 2021.
A Graph Theoretic Approach to Power System Vulnerability Identification [link]Paper  abstract   bibtex   
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.
@article{biswas_graph_2021,
	title = {A {Graph} {Theoretic} {Approach} to {Power} {System} {Vulnerability} {Identification}},
	volume = {36},
	url = {https://ieeexplore.ieee.org/abstract/document/9144487},
	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.},
	number = {2},
	journal = {IEEE Transactions on Power Systems},
	author = {Biswas, Reetam Sen and Pal, Anamitra and Werho, Trevor and Vittal, Vijay},
	month = mar,
	year = {2021},
	keywords = {Flow graphs, Graph theory, Load flow, network flow, power system disturbances, Power system faults, Power system stability, power system vulnerability, Power transmission lines, Real-time systems, saturated cut-set},
	pages = {923--935},
}

Downloads: 0