Distribution network verification for secure restoration by enumerating all critical failures

Takeru Inoue, Norihito Yasuda, Shunsuke Kawano, Yuji Takenobu, Shin Ichi Minato, Yasuhiro Hayashi

    Research output: Contribution to journalArticle

    4 Citations (Scopus)

    Abstract

    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.

    Original languageEnglish
    Article number6915711
    Pages (from-to)843-852
    Number of pages10
    JournalIEEE Transactions on Smart Grid
    Volume6
    Issue number2
    DOIs
    Publication statusPublished - 2015 Mar 1

    Fingerprint

    Electric power distribution
    Restoration
    Accidents
    Screening
    Switches
    Experiments

    Keywords

    • Distribution network
    • hitting set
    • network reconfiguration
    • restoration
    • zero-suppressed binary decision diagram (ZDD)

    ASJC Scopus subject areas

    • Computer Science(all)

    Cite this

    Distribution network verification for secure restoration by enumerating all critical failures. / Inoue, Takeru; Yasuda, Norihito; Kawano, Shunsuke; Takenobu, Yuji; Minato, Shin Ichi; Hayashi, Yasuhiro.

    In: IEEE Transactions on Smart Grid, Vol. 6, No. 2, 6915711, 01.03.2015, p. 843-852.

    Research output: Contribution to journalArticle

    Inoue, Takeru ; Yasuda, Norihito ; Kawano, Shunsuke ; Takenobu, Yuji ; Minato, Shin Ichi ; Hayashi, Yasuhiro. / Distribution network verification for secure restoration by enumerating all critical failures. In: IEEE Transactions on Smart Grid. 2015 ; Vol. 6, No. 2. pp. 843-852.
    @article{16dfc61c9ed348718051b11b2a3b32a7,
    title = "Distribution network verification for secure restoration by enumerating all critical failures",
    abstract = "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.",
    keywords = "Distribution network, hitting set, network reconfiguration, restoration, zero-suppressed binary decision diagram (ZDD)",
    author = "Takeru Inoue and Norihito Yasuda and Shunsuke Kawano and Yuji Takenobu and Minato, {Shin Ichi} and Yasuhiro Hayashi",
    year = "2015",
    month = "3",
    day = "1",
    doi = "10.1109/TSG.2014.2359114",
    language = "English",
    volume = "6",
    pages = "843--852",
    journal = "IEEE Transactions on Smart Grid",
    issn = "1949-3053",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "2",

    }

    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

    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

    VL - 6

    SP - 843

    EP - 852

    JO - IEEE Transactions on Smart Grid

    JF - IEEE Transactions on Smart Grid

    SN - 1949-3053

    IS - 2

    M1 - 6915711

    ER -