Probabilistic assessment of service restoration in power distribution systems

Dialynas, E.N.; Michos, D.

doi:10.1109/61.97737

Cited by 11 publications

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Reference [11] focused on N − 1 security to ensure whether a network would be feasible under a cutset of any single line, but did not deal with a cutset of multiple lines. Reference [12] estimates the success rate of restoration process given a set of lines that have been cut with the availability of each switch, while the method proposed in this paper enumerates all cutsets that make the network unrestorable. Reference [13] tackled with emerging challenges connected with the smart grid like momentary interruptions, while the proposed method focuses the most fatal failure, that is, sustained interruptions.…”

mentioning

confidence: 99%

Distribution Network Verification for Secure Restoration by Enumerating All Critical Failures

Inoue

Yasuda

Kawano

et al. 2015

IEEE Trans. Smart Grid

View full text Add to dashboard Cite

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.

show abstract

mentioning

confidence: 99%