Distribution Network Reconfiguration Algorithms: A Comparative Study

Distribution network reconfiguration is the main measure of distribution network optimization, its purpose is to determine the optimal topology of distribution network, is an effective measure to reduce network loss, its mathematical essence is a complex multi-objective nonlinear combinatorial optim...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:International Conference on Electronics Technology (Online) s. 472 - 478
Hlavní autori: Guo, Lingxu, Huang, Zhigang, Wang, Jing, Yu, Guangyao, Zhou, Yanzhen, Chong, Zhiqiang, Li, Zhenbin
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 13.05.2022
Predmet:
ISSN:2768-6515
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Distribution network reconfiguration is the main measure of distribution network optimization, its purpose is to determine the optimal topology of distribution network, is an effective measure to reduce network loss, its mathematical essence is a complex multi-objective nonlinear combinatorial optimization problem. This paper first introduces the methods of distribution network reconstruction, which are divided into three categories: heuristic algorithm, artificial intelligence algorithm and mathematical programming algorithm. It simply analyzes the advantages and disadvantages of three kinds of distribution network reconstruction algorithms, and then analyzes three commonly used distribution network reconstruction algorithms: switch opening and exchange (SOE),Mixed Integer second-order Cone Programming (MISOCP) based on DistFlow model and optimal matching loop flow method. Finally, IEEE33 nodes are used to test the effectiveness of three kinds of distribution network reconstruction methods. After comparative analysis of three kinds of distribution network reconstruction methods, it is concluded that SOE method is a more accurate and efficient method to solve the distribution network reconstruction problem.
ISSN:2768-6515
DOI:10.1109/ICET55676.2022.9824709