TY - GEN

T1 - Optimization of grid expansion measures in low voltage grids using an integer linear optimization problem

AU - Schlömer, G.

AU - Hofmann, L.

N1 - Publisher Copyright: © 2016 IEEE. Copyright: Copyright 2017 Elsevier B.V., All rights reserved.

PY - 2016/9/1

Y1 - 2016/9/1

N2 - Distribution grids, especially the low-voltage (LV) and medium-voltage (MV) grids, recently face major changes. While in the past the supply of the customers was the focus of the grid construction, today the most important issues are the energy infeeds from decentralized power generation at a high simultaneity. This transformation requires a reinforcement and expansion of the LV- and MV-grids, as the strong photovoltaic related grid expansion has already shown in Germany. Many automatized grid expansion algorithms iteratively analyse and fix the highest voltage drop per meter, but are unable to find a solution that keeps cost at a minimum. In this paper a new approach to represent the conventional network expansion in the LV-level as an integer linear optimization problem (ILP) is presented. In the first step, with the help of Dijkstra's algorithm, different paths between the substation and the problematic grid nodes are identified. Subsequently the paths are sorted by identical sections and through the formulation of an ILP the most cost effective grid expansion measures are found.

AB - Distribution grids, especially the low-voltage (LV) and medium-voltage (MV) grids, recently face major changes. While in the past the supply of the customers was the focus of the grid construction, today the most important issues are the energy infeeds from decentralized power generation at a high simultaneity. This transformation requires a reinforcement and expansion of the LV- and MV-grids, as the strong photovoltaic related grid expansion has already shown in Germany. Many automatized grid expansion algorithms iteratively analyse and fix the highest voltage drop per meter, but are unable to find a solution that keeps cost at a minimum. In this paper a new approach to represent the conventional network expansion in the LV-level as an integer linear optimization problem (ILP) is presented. In the first step, with the help of Dijkstra's algorithm, different paths between the substation and the problematic grid nodes are identified. Subsequently the paths are sorted by identical sections and through the formulation of an ILP the most cost effective grid expansion measures are found.

KW - integer programming

KW - linear programming

KW - power distribution planning

KW - power grids

KW - problematic grid node identification

KW - substation path

KW - Dijkstra algorithm

KW - conventional network expansion

KW - automated grid expansion algorithms

KW - decentralized power generation

KW - energy infeeds

KW - medium voltage distribution grids

KW - low voltage distribution grids

KW - integer linear optimization problem

KW - low voltage grid

KW - grid expansion measure optimization

KW - Power cables

KW - Impedance

KW - Optimization

KW - Substations

KW - Planning

KW - Short-circuit currents

KW - Fuses

KW - Power grids

KW - smart grid

KW - grid expansion

KW - LV-grid optimization

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

U2 - 10.1109/powercon.2016.7753923

DO - 10.1109/powercon.2016.7753923

M3 - Conference contribution

SP - 1

EP - 6

BT - 2016 IEEE International Conference on Power System Technology, POWERCON 2016

ER -