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 -