Scalable enumeration approach for maximizing hosting capacity of distributed generation

Yuji Takenobu*, Norihito Yasuda, Shin ichi Minato, Yasuhiro Hayashi

*この研究の対応する著者

研究成果査読

11 被引用数 (Scopus)

抄録

At the stage of planning distributed generation (DG) for a distribution network, the network configuration is a key factor in increasing the DG hosting capacity. The determination of a configuration that maximizes the hosting capacity is a highly complex, nonlinear combinatorial optimization problem. No existing method can yield the global optimal solution for practical-scale networks. Therefore, this paper proposes a scalable optimization method. Specifically, the proposed method enumerates all optimal configurations while simultaneously considering optimal DG placement. The proposed method first optimizes the DG placement for possible partial networks using a second-order cone programming technique. Next, it enumerates possible combinations of the partial networks while avoiding a combinatorial explosion using a highly compressed data structure. Finally, it finds the optimal configurations by exploring solutions over the data structure. In experiments involving a large-scale network containing 235 switches, our enumeration method obtained 1.49×1018 global optimal configurations in 17.1 h. Another powerful feature of our method is that it enables distribution system operators to select the preferred optimal configuration interactively.

本文言語English
ページ(範囲)867-876
ページ数10
ジャーナルInternational Journal of Electrical Power and Energy Systems
105
DOI
出版ステータスPublished - 2019 2

ASJC Scopus subject areas

  • エネルギー工学および電力技術
  • 電子工学および電気工学

フィンガープリント

「Scalable enumeration approach for maximizing hosting capacity of distributed generation」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル