### Abstract

A method of applying network flow analyses during real time power system operation, to provide better network connectivity visualization, is developed and presented. Graph theory network flow analysis is capable of determining the maximum flow that can be transported between two nodes within a directed graph. These network flow algorithms are applied to a graphical representation of a power system topology to determine the minimum number of system branches needed to be lost in order to guarantee disconnecting the two nodes in the system that are selected. The number of system branches that are found serves as an approximate indicator of system vulnerabilities. The method used in these connectivity analyses makes use of well known graph theory network flow maximum flow algorithms, but also introduces a new algorithm for updating an old network flow solution for the loss of only a single system branch. The proposed new algorithm allows for significantly decreased solution time that is desired in a real-time environment. The value of using the proposed method is illustrated by using a detailed example of the 2008 island formation that occurred in the Entergy power system. The method was applied to a recreation of the 2008 event using a 20,000-bus model of the Entergy system to show both the proposed method's benefits as well as practicality of implementation.

Original language | English (US) |
---|---|

Journal | IEEE Transactions on Power Systems |

DOIs | |

State | Accepted/In press - Jan 18 2016 |

### Fingerprint

### ASJC Scopus subject areas

- Electrical and Electronic Engineering
- Energy Engineering and Power Technology

### Cite this

*IEEE Transactions on Power Systems*. https://doi.org/10.1109/TPWRS.2016.2515368

**Power System Connectivity Monitoring Using a Graph Theory Network Flow Algorithm.** / Werho, Trevor; Vittal, Vijay; Kolluri, Sharma; Wong, Sze Mei.

Research output: Contribution to journal › Article

*IEEE Transactions on Power Systems*. https://doi.org/10.1109/TPWRS.2016.2515368

}

TY - JOUR

T1 - Power System Connectivity Monitoring Using a Graph Theory Network Flow Algorithm

AU - Werho, Trevor

AU - Vittal, Vijay

AU - Kolluri, Sharma

AU - Wong, Sze Mei

PY - 2016/1/18

Y1 - 2016/1/18

N2 - A method of applying network flow analyses during real time power system operation, to provide better network connectivity visualization, is developed and presented. Graph theory network flow analysis is capable of determining the maximum flow that can be transported between two nodes within a directed graph. These network flow algorithms are applied to a graphical representation of a power system topology to determine the minimum number of system branches needed to be lost in order to guarantee disconnecting the two nodes in the system that are selected. The number of system branches that are found serves as an approximate indicator of system vulnerabilities. The method used in these connectivity analyses makes use of well known graph theory network flow maximum flow algorithms, but also introduces a new algorithm for updating an old network flow solution for the loss of only a single system branch. The proposed new algorithm allows for significantly decreased solution time that is desired in a real-time environment. The value of using the proposed method is illustrated by using a detailed example of the 2008 island formation that occurred in the Entergy power system. The method was applied to a recreation of the 2008 event using a 20,000-bus model of the Entergy system to show both the proposed method's benefits as well as practicality of implementation.

AB - A method of applying network flow analyses during real time power system operation, to provide better network connectivity visualization, is developed and presented. Graph theory network flow analysis is capable of determining the maximum flow that can be transported between two nodes within a directed graph. These network flow algorithms are applied to a graphical representation of a power system topology to determine the minimum number of system branches needed to be lost in order to guarantee disconnecting the two nodes in the system that are selected. The number of system branches that are found serves as an approximate indicator of system vulnerabilities. The method used in these connectivity analyses makes use of well known graph theory network flow maximum flow algorithms, but also introduces a new algorithm for updating an old network flow solution for the loss of only a single system branch. The proposed new algorithm allows for significantly decreased solution time that is desired in a real-time environment. The value of using the proposed method is illustrated by using a detailed example of the 2008 island formation that occurred in the Entergy power system. The method was applied to a recreation of the 2008 event using a 20,000-bus model of the Entergy system to show both the proposed method's benefits as well as practicality of implementation.

UR - http://www.scopus.com/inward/record.url?scp=84955143132&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84955143132&partnerID=8YFLogxK

U2 - 10.1109/TPWRS.2016.2515368

DO - 10.1109/TPWRS.2016.2515368

M3 - Article

AN - SCOPUS:84955143132

JO - IEEE Transactions on Power Systems

JF - IEEE Transactions on Power Systems

SN - 0885-8950

ER -