PROJECT TITLE :

Distribution Network Verification for Secure Restoration by Enumerating All Critical Failures

ABSTRACT:

If many feeders are interrupted in a very severe accident, distribution networks ought to be restored by reconfiguring switches automatically with sensible grid technologies. Though there have been many restoration algorithms developed to find the new network configuration, they may fail to restore the entire network if the network were critically broken. The network’s design has to ensure that it is restorable below any potential failure for secure power delivery, but it is a computationally onerous task to look at all doable failures in an exceedingly giant-scale network with advanced electrical constraints. This paper proposes a unique technique to find all the essential (unrestorable) line cuts with great potency to verify the network design. The proposed method initial runs a fast screening algorithm primarily based on hitting set enumeration; the algorithm selects suspicious cuts while not naively examining all possible cuts. Next, unrestorable cuts are identified from the suspicious ones with another algorithm, which strictly tests the restorability of the network under each suspicious cut while not redundantly repeating serious power flow calculations. Thorough experiments on 2 distribution networks reveal that the proposed method can find thousands of unrestorable cuts from the trillions of potential cuts during a massive 432-Bus network with no significant false negatives.