@inproceedings{8384b4e609164b7a9a4a1b6d65f745c3,
title = "Fast identification of saturated cut-sets using graph search techniques",
abstract = "When multiple outages occur in rapid succession, it is important to know quickly if the power transfer capability of different interconnections (or cut-sets) of the power network are limited. The algorithm developed in this paper identifies such limited cut-sets very fast, thereby enhancing the real-time situational awareness of power system operators. The significance of the proposed approach is described using the IEEE 39-bus test system, while its computational benefits are demonstrated using relatively large test-cases containing thousands of buses. The results indicate that the proposed network analysis can estimate the impact of an outage on any cut-set of the system and screen out the cut-set that gets saturated by the largest margin, very quickly.",
keywords = "Graph theory, Network flow, Power system disturbances, Saturated cut-set",
author = "Biswas, {Reetam Sen} and Anamitra Pal and Trevor Werho and Vijay Vittal",
note = "Publisher Copyright: {\textcopyright} 2020 IEEE.; 2020 IEEE Power and Energy Society General Meeting, PESGM 2020 ; Conference date: 02-08-2020 Through 06-08-2020",
year = "2020",
month = aug,
day = "2",
doi = "10.1109/PESGM41954.2020.9281500",
language = "English (US)",
series = "IEEE Power and Energy Society General Meeting",
publisher = "IEEE Computer Society",
booktitle = "2020 IEEE Power and Energy Society General Meeting, PESGM 2020",
}