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

抄録

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.

収録刊行物

• IEEE Transactions on Smart Grid

  IEEE Transactions on Smart Grid 5 (1), 102-111, 2014-01-06

  IEEE

キーワード

• binary decision diagrams
• distributed power generation
• distribution networks
• losses
• minimisation
• power supply quality
• search problems
• switchgear
• binary decision diagram
• dispersed generator
• distribution loss minimization
• guaranteed error bound
• hard discrete optimization problem
• highly compressed search space
• large-scale distribution network
• large-scale model network
• power system
• shortest path-finding problem
• switch
• Boolean functions
• Data structures;Junctions;Minimization;Optimization;Vectors;Vegetation;Distribution network;loss minimization;network reconfiguration;zero-suppressed binary decision diagram

詳細情報

• CRID: 1050577309353342592
• NII論文ID: 120005895800
• NII書誌ID: AA12479464
• ISSN: 19493053
• ISSN: 19493061
• DOI: 10.1109/tsg.2013.2288976
• HANDLE: 10061/11183
• Web Site: https://naist.repo.nii.ac.jp/records/4004
• Web Site: http://xplorestaging.ieee.org/ielx7/5165411/6693741/06693788.pdf?arnumber=6693788
• 本文言語コード: en
• 資料種別: journal article
• データソース種別:
  • IRDB
  • Crossref
  • CiNii Articles
  • KAKEN