Fast identification of saturated cut-sets using graph search techniques. Biswas, R. S., Pal, A., Werho, T., & Vittal, V. In IEEE Power Energy Society General Meeting (PESGM), pages 1–5, Montreal, Canada, August, 2020. ![Fast identification of saturated cut-sets using graph search techniques [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper abstract bibtex 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.
@inproceedings{biswas_fast_2020,
address = {Montreal, Canada},
title = {Fast identification of saturated cut-sets using graph search techniques},
url = {https://ieeexplore.ieee.org/abstract/document/9281500},
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.},
booktitle = {IEEE Power Energy Society General Meeting (PESGM)},
author = {Biswas, Reetam Sen and Pal, Anamitra and Werho, Trevor and Vittal, Vijay},
month = aug,
year = {2020},
keywords = {Graph theory, Network flow, Power system disturbances, Power systems, Real-time systems, Saturated cut-set},
pages = {1--5},
}
Downloads: 0
{"_id":"zQ2j3ZgkMC8wSLk55","bibbaseid":"biswas-pal-werho-vittal-fastidentificationofsaturatedcutsetsusinggraphsearchtechniques-2020","author_short":["Biswas, R. S.","Pal, A.","Werho, T.","Vittal, V."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","address":"Montreal, Canada","title":"Fast identification of saturated cut-sets using graph search techniques","url":"https://ieeexplore.ieee.org/abstract/document/9281500","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.","booktitle":"IEEE Power Energy Society General Meeting (PESGM)","author":[{"propositions":[],"lastnames":["Biswas"],"firstnames":["Reetam","Sen"],"suffixes":[]},{"propositions":[],"lastnames":["Pal"],"firstnames":["Anamitra"],"suffixes":[]},{"propositions":[],"lastnames":["Werho"],"firstnames":["Trevor"],"suffixes":[]},{"propositions":[],"lastnames":["Vittal"],"firstnames":["Vijay"],"suffixes":[]}],"month":"August","year":"2020","keywords":"Graph theory, Network flow, Power system disturbances, Power systems, Real-time systems, Saturated cut-set","pages":"1–5","bibtex":"@inproceedings{biswas_fast_2020,\r\n\taddress = {Montreal, Canada},\r\n\ttitle = {Fast identification of saturated cut-sets using graph search techniques},\r\n\turl = {https://ieeexplore.ieee.org/abstract/document/9281500},\r\n\tabstract = {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.},\r\n\tbooktitle = {IEEE Power Energy Society General Meeting (PESGM)},\r\n\tauthor = {Biswas, Reetam Sen and Pal, Anamitra and Werho, Trevor and Vittal, Vijay},\r\n\tmonth = aug,\r\n\tyear = {2020},\r\n\tkeywords = {Graph theory, Network flow, Power system disturbances, Power systems, Real-time systems, Saturated cut-set},\r\n\tpages = {1--5},\r\n}\r\n","author_short":["Biswas, R. S.","Pal, A.","Werho, T.","Vittal, V."],"key":"biswas_fast_2020","id":"biswas_fast_2020","bibbaseid":"biswas-pal-werho-vittal-fastidentificationofsaturatedcutsetsusinggraphsearchtechniques-2020","role":"author","urls":{"Paper":"https://ieeexplore.ieee.org/abstract/document/9281500"},"keyword":["Graph theory","Network flow","Power system disturbances","Power systems","Real-time systems","Saturated cut-set"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://raw.githubusercontent.com/Anamitra-Pal-Lab/pal_website_bib/main/Pal_Web.bib","dataSources":["PSMoWF6dzSbsHMtyv","rskDWJrezLGLbzMaG","jsHnLhL5w3NJb9DP4","BiX5mb3NJhTTTfmp6","erL8QyfZFLAgqsmYY","A9LJA7JBBSjHNw5um","zWwhYvSfNTW4Rg2Rm"],"keywords":["graph theory","network flow","power system disturbances","power systems","real-time systems","saturated cut-set"],"search_terms":["fast","identification","saturated","cut","sets","using","graph","search","techniques","biswas","pal","werho","vittal"],"title":"Fast identification of saturated cut-sets using graph search techniques","year":2020}