Scalable enumeration approach for maximizing hosting capacity of distributed generation

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

Research output: Contribution to journalArticle

Abstract

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.

LanguageEnglish
Pages867-876
Number of pages10
JournalInternational Journal of Electrical Power and Energy Systems
Volume105
DOIs
Publication statusPublished - 2019 Feb 1

Fingerprint

Distributed power generation
Data structures
Combinatorial optimization
Electric power distribution
Explosions
Cones
Switches
Planning
Experiments

Keywords

  • Distributed generation
  • Network configuration
  • Second-order cone programming (SOCP)
  • ZDD vector (ZDDV)
  • Zero-suppressed binary decision diagram (ZDD)

ASJC Scopus subject areas

  • Energy Engineering and Power Technology
  • Electrical and Electronic Engineering

Cite this

Scalable enumeration approach for maximizing hosting capacity of distributed generation. / Takenobu, Yuji; Yasuda, Norihito; Minato, Shin ichi; Hayashi, Yasuhiro.

In: International Journal of Electrical Power and Energy Systems, Vol. 105, 01.02.2019, p. 867-876.

Research output: Contribution to journalArticle

@article{dbe999aea9a340848ec7bee94d8f3c3d,
title = "Scalable enumeration approach for maximizing hosting capacity of distributed generation",
abstract = "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.",
keywords = "Distributed generation, Network configuration, Second-order cone programming (SOCP), ZDD vector (ZDDV), Zero-suppressed binary decision diagram (ZDD)",
author = "Yuji Takenobu and Norihito Yasuda and Minato, {Shin ichi} and Yasuhiro Hayashi",
year = "2019",
month = "2",
day = "1",
doi = "10.1016/j.ijepes.2018.09.010",
language = "English",
volume = "105",
pages = "867--876",
journal = "International Journal of Electrical Power and Energy Systems",
issn = "0142-0615",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Scalable enumeration approach for maximizing hosting capacity of distributed generation

AU - Takenobu, Yuji

AU - Yasuda, Norihito

AU - Minato, Shin ichi

AU - Hayashi, Yasuhiro

PY - 2019/2/1

Y1 - 2019/2/1

N2 - 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.

AB - 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.

KW - Distributed generation

KW - Network configuration

KW - Second-order cone programming (SOCP)

KW - ZDD vector (ZDDV)

KW - Zero-suppressed binary decision diagram (ZDD)

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

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

U2 - 10.1016/j.ijepes.2018.09.010

DO - 10.1016/j.ijepes.2018.09.010

M3 - Article

VL - 105

SP - 867

EP - 876

JO - International Journal of Electrical Power and Energy Systems

T2 - International Journal of Electrical Power and Energy Systems

JF - International Journal of Electrical Power and Energy Systems

SN - 0142-0615

ER -