TY - JOUR

T1 - Distribution network verification for secure restoration by enumerating all critical failures

AU - Inoue, Takeru

AU - Yasuda, Norihito

AU - Kawano, Shunsuke

AU - Takenobu, Yuji

AU - Minato, Shin Ichi

AU - Hayashi, Yasuhiro

N1 - Publisher Copyright:
© 2010-2012 IEEE.

PY - 2015/3/1

Y1 - 2015/3/1

N2 - If several feeders are interrupted in a severe accident, distribution networks should be restored by reconfiguring switches automatically with smart grid technologies. Although there have been several restoration algorithms developed to find the new network configuration, they might fail to restore the whole network if the network were critically damaged. The network's design has to guarantee that it is restorable under any possible failure for secure power delivery, but it is a computationally hard task to examine all possible failures in a large-scale network with complex electrical constraints. This paper proposes a novel method to find all the critical (unrestorable) line cuts with great efficiency to verify the network design. The proposed method first runs a fast screening algorithm based on hitting set enumeration; the algorithm selects suspicious cuts without 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 without redundantly repeating heavy power flow calculations. Thorough experiments on two distribution networks reveal that the proposed method can find thousands of unrestorable cuts from the trillions of possible cuts in a large 432-Bus network with no significant false negatives.

AB - If several feeders are interrupted in a severe accident, distribution networks should be restored by reconfiguring switches automatically with smart grid technologies. Although there have been several restoration algorithms developed to find the new network configuration, they might fail to restore the whole network if the network were critically damaged. The network's design has to guarantee that it is restorable under any possible failure for secure power delivery, but it is a computationally hard task to examine all possible failures in a large-scale network with complex electrical constraints. This paper proposes a novel method to find all the critical (unrestorable) line cuts with great efficiency to verify the network design. The proposed method first runs a fast screening algorithm based on hitting set enumeration; the algorithm selects suspicious cuts without 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 without redundantly repeating heavy power flow calculations. Thorough experiments on two distribution networks reveal that the proposed method can find thousands of unrestorable cuts from the trillions of possible cuts in a large 432-Bus network with no significant false negatives.

KW - Distribution network

KW - hitting set

KW - network reconfiguration

KW - restoration

KW - zero-suppressed binary decision diagram (ZDD)

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

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

U2 - 10.1109/TSG.2014.2359114

DO - 10.1109/TSG.2014.2359114

M3 - Article

AN - SCOPUS:85027924114

SN - 1949-3053

VL - 6

SP - 843

EP - 852

JO - IEEE Transactions on Smart Grid

JF - IEEE Transactions on Smart Grid

IS - 2

M1 - 6915711

ER -