Distribution loss minimization with guaranteed error bound

Takeru Inoue, Keiji Takano, Takayuki Watanabe, Jun Kawahara, Ryo Yoshinaka, Akihiro Kishimoto, Koji Tsuda, Shin Ichi Minato, Yasuhiro Hayashi

    Research output: Contribution to journalArticle

    38 Citations (Scopus)

    Abstract

    Determining loss minimum configuration in a distribution network is a hard discrete optimization problem involving many variables. Since more and more dispersed generators are installed on the demand side of power systems and they are reconfigured frequently, developing automatic approaches is indispensable for effectively managing a large-scale distribution network. Existing fast methods employ local updates that gradually improve the loss to solve such an optimization problem. However, they eventually get stuck at local minima, resulting in arbitrarily poor results. In contrast, this paper presents a novel optimization method that provides an error bound on the solution quality. Thus, the obtained solution quality can be evaluated in comparison to the global optimal solution. Instead of using local updates, we construct a highly compressed search space using a binary decision diagram and reduce the optimization problem to a shortest path-finding problem. Our method was shown to be not only accurate but also remarkably efficient; optimization of a large-scale model network with 468 switches was solved in three hours with 1.56% relative error bound.

    Original languageEnglish
    Article number6693788
    Pages (from-to)102-111
    Number of pages10
    JournalIEEE Transactions on Smart Grid
    Volume5
    Issue number1
    DOIs
    Publication statusPublished - 2014 Jan

    Fingerprint

    Electric power distribution
    Binary decision diagrams
    Switches

    Keywords

    • Distribution network
    • loss minimization
    • network reconfiguration
    • zero-suppressed binary decision diagram

    ASJC Scopus subject areas

    • Computer Science(all)

    Cite this

    Inoue, T., Takano, K., Watanabe, T., Kawahara, J., Yoshinaka, R., Kishimoto, A., ... Hayashi, Y. (2014). Distribution loss minimization with guaranteed error bound. IEEE Transactions on Smart Grid, 5(1), 102-111. [6693788]. https://doi.org/10.1109/TSG.2013.2288976

    Distribution loss minimization with guaranteed error bound. / Inoue, Takeru; Takano, Keiji; Watanabe, Takayuki; Kawahara, Jun; Yoshinaka, Ryo; Kishimoto, Akihiro; Tsuda, Koji; Minato, Shin Ichi; Hayashi, Yasuhiro.

    In: IEEE Transactions on Smart Grid, Vol. 5, No. 1, 6693788, 01.2014, p. 102-111.

    Research output: Contribution to journalArticle

    Inoue, T, Takano, K, Watanabe, T, Kawahara, J, Yoshinaka, R, Kishimoto, A, Tsuda, K, Minato, SI & Hayashi, Y 2014, 'Distribution loss minimization with guaranteed error bound', IEEE Transactions on Smart Grid, vol. 5, no. 1, 6693788, pp. 102-111. https://doi.org/10.1109/TSG.2013.2288976
    Inoue T, Takano K, Watanabe T, Kawahara J, Yoshinaka R, Kishimoto A et al. Distribution loss minimization with guaranteed error bound. IEEE Transactions on Smart Grid. 2014 Jan;5(1):102-111. 6693788. https://doi.org/10.1109/TSG.2013.2288976
    Inoue, Takeru ; Takano, Keiji ; Watanabe, Takayuki ; Kawahara, Jun ; Yoshinaka, Ryo ; Kishimoto, Akihiro ; Tsuda, Koji ; Minato, Shin Ichi ; Hayashi, Yasuhiro. / Distribution loss minimization with guaranteed error bound. In: IEEE Transactions on Smart Grid. 2014 ; Vol. 5, No. 1. pp. 102-111.
    @article{8fa15f2923814dfe8827dafc9cbd6e25,
    title = "Distribution loss minimization with guaranteed error bound",
    abstract = "Determining loss minimum configuration in a distribution network is a hard discrete optimization problem involving many variables. Since more and more dispersed generators are installed on the demand side of power systems and they are reconfigured frequently, developing automatic approaches is indispensable for effectively managing a large-scale distribution network. Existing fast methods employ local updates that gradually improve the loss to solve such an optimization problem. However, they eventually get stuck at local minima, resulting in arbitrarily poor results. In contrast, this paper presents a novel optimization method that provides an error bound on the solution quality. Thus, the obtained solution quality can be evaluated in comparison to the global optimal solution. Instead of using local updates, we construct a highly compressed search space using a binary decision diagram and reduce the optimization problem to a shortest path-finding problem. Our method was shown to be not only accurate but also remarkably efficient; optimization of a large-scale model network with 468 switches was solved in three hours with 1.56{\%} relative error bound.",
    keywords = "Distribution network, loss minimization, network reconfiguration, zero-suppressed binary decision diagram",
    author = "Takeru Inoue and Keiji Takano and Takayuki Watanabe and Jun Kawahara and Ryo Yoshinaka and Akihiro Kishimoto and Koji Tsuda and Minato, {Shin Ichi} and Yasuhiro Hayashi",
    year = "2014",
    month = "1",
    doi = "10.1109/TSG.2013.2288976",
    language = "English",
    volume = "5",
    pages = "102--111",
    journal = "IEEE Transactions on Smart Grid",
    issn = "1949-3053",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "1",

    }

    TY - JOUR

    T1 - Distribution loss minimization with guaranteed error bound

    AU - Inoue, Takeru

    AU - Takano, Keiji

    AU - Watanabe, Takayuki

    AU - Kawahara, Jun

    AU - Yoshinaka, Ryo

    AU - Kishimoto, Akihiro

    AU - Tsuda, Koji

    AU - Minato, Shin Ichi

    AU - Hayashi, Yasuhiro

    PY - 2014/1

    Y1 - 2014/1

    N2 - Determining loss minimum configuration in a distribution network is a hard discrete optimization problem involving many variables. Since more and more dispersed generators are installed on the demand side of power systems and they are reconfigured frequently, developing automatic approaches is indispensable for effectively managing a large-scale distribution network. Existing fast methods employ local updates that gradually improve the loss to solve such an optimization problem. However, they eventually get stuck at local minima, resulting in arbitrarily poor results. In contrast, this paper presents a novel optimization method that provides an error bound on the solution quality. Thus, the obtained solution quality can be evaluated in comparison to the global optimal solution. Instead of using local updates, we construct a highly compressed search space using a binary decision diagram and reduce the optimization problem to a shortest path-finding problem. Our method was shown to be not only accurate but also remarkably efficient; optimization of a large-scale model network with 468 switches was solved in three hours with 1.56% relative error bound.

    AB - Determining loss minimum configuration in a distribution network is a hard discrete optimization problem involving many variables. Since more and more dispersed generators are installed on the demand side of power systems and they are reconfigured frequently, developing automatic approaches is indispensable for effectively managing a large-scale distribution network. Existing fast methods employ local updates that gradually improve the loss to solve such an optimization problem. However, they eventually get stuck at local minima, resulting in arbitrarily poor results. In contrast, this paper presents a novel optimization method that provides an error bound on the solution quality. Thus, the obtained solution quality can be evaluated in comparison to the global optimal solution. Instead of using local updates, we construct a highly compressed search space using a binary decision diagram and reduce the optimization problem to a shortest path-finding problem. Our method was shown to be not only accurate but also remarkably efficient; optimization of a large-scale model network with 468 switches was solved in three hours with 1.56% relative error bound.

    KW - Distribution network

    KW - loss minimization

    KW - network reconfiguration

    KW - zero-suppressed binary decision diagram

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

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

    U2 - 10.1109/TSG.2013.2288976

    DO - 10.1109/TSG.2013.2288976

    M3 - Article

    AN - SCOPUS:84892623850

    VL - 5

    SP - 102

    EP - 111

    JO - IEEE Transactions on Smart Grid

    JF - IEEE Transactions on Smart Grid

    SN - 1949-3053

    IS - 1

    M1 - 6693788

    ER -