Review of radial distribution network reconfiguration algorithms based on mathematical optimization theory

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27730%2F19%3A10242579" target="_blank" >RIV/61989100:27730/19:10242579 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Review of radial distribution network reconfiguration algorithms based on mathematical optimization theory

Popis výsledku v původním jazyce

The radial distribution network topology optimization problem (the reconfiguration problem) can be described as a problem of the determination which network feeder is to supply the electrical energy to individual consumption nodes; in other words, it can be described as a problem of the determination what the state of individual network switches should be (if opened or closed) to achieve the optimal network operation state. This optimal network operation state is mathematically described as a state where the value of the so-called object function is minimal or maximal (depending on the formula of this function). This type of problem is solved in many papers and the individual algorithms finding the optimal problem solution described in these papers differ from one another in various aspects. For example, these algorithms differ in their internal structure, computational complexity, or quality of the solution found. According to their internal structure, all reconfiguration algorithms are divided into four groups. This paper details one algorithm group and it is the group of algorithms based on mathematical optimization theory. This paper also describes the Optimal power flow (OPF) problem, a typical problem solved by the reconfiguration algorithms during the reconfiguration process, and six OPF-based reconfiguration algorithms that together provide a good understanding of the modern reconfiguration algorithms operation. The aim of this review paper is to explain to its readers how OPF-based reconfiguration algorithms find the optimal topology of a radial distribution network, and what properties these algorithms have. (C) Technical University of Košice 2019.

Název v anglickém jazyce

Review of radial distribution network reconfiguration algorithms based on mathematical optimization theory

Popis výsledku anglicky

The radial distribution network topology optimization problem (the reconfiguration problem) can be described as a problem of the determination which network feeder is to supply the electrical energy to individual consumption nodes; in other words, it can be described as a problem of the determination what the state of individual network switches should be (if opened or closed) to achieve the optimal network operation state. This optimal network operation state is mathematically described as a state where the value of the so-called object function is minimal or maximal (depending on the formula of this function). This type of problem is solved in many papers and the individual algorithms finding the optimal problem solution described in these papers differ from one another in various aspects. For example, these algorithms differ in their internal structure, computational complexity, or quality of the solution found. According to their internal structure, all reconfiguration algorithms are divided into four groups. This paper details one algorithm group and it is the group of algorithms based on mathematical optimization theory. This paper also describes the Optimal power flow (OPF) problem, a typical problem solved by the reconfiguration algorithms during the reconfiguration process, and six OPF-based reconfiguration algorithms that together provide a good understanding of the modern reconfiguration algorithms operation. The aim of this review paper is to explain to its readers how OPF-based reconfiguration algorithms find the optimal topology of a radial distribution network, and what properties these algorithms have. (C) Technical University of Košice 2019.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

20201 - Electrical and electronic engineering

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2019

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of the 10th International Scientific Symposium on Electrical Power Engineering, ELEKTROENERGETIKA 2019

ISBN

978-80-553-3324-3

ISSN

—

e-ISSN

—

Počet stran výsledku

5

Strana od-do

577-581

Název nakladatele

Technical University of Košice

Místo vydání

Košice

Místo konání akce

Stará Lesná

Datum konání akce

16. 9. 2019

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—