Pahwa, SakshiYoussef, M.Schumm, Phillip R. B.Scoglio, Caterina M.Schulz, Noel N.2013-09-262013-09-262013-09-01http://hdl.handle.net/2097/16520Intentional islanding of a power system can be an emergency response for isolating failures that might propagate and lead to major disturbances. Some of the islanding techniques suggested previously do not consider the power flow model; others are designed to minimize load shedding only within the islands. Often these techniques are computationally expensive. We aim to find approaches to partition power grids into islands to minimize the load shedding not only in the region where the failures start, but also in the topological complement of the region. We propose a new constraint programming formulation for optimal islanding in power grid networks. This technique works efficiently for small networks but becomes expensive as size increases. To address the scalability problem, we propose two grid partitioning methods based on modularity, properly modified to take into account the power flow model. They are modifications of the Fast Greedy algorithm and the Bloom algorithm, and are polynomial in running time. We tested these methods on the available IEEE test systems. The Bloom type method is faster than the Fast Greedy type, and can potentially provide results in networks with thousands of nodes. Our methods provide solutions which retain at least 40–50% of the system load. Overall, our methods efficiently balance load shedding and scalability.en-USThis Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).https://rightsstatements.org/page/InC/1.0/?language=enCascadingMitigationIntentional islandingConstraint programmingFast GreedyBloomText