.png){kind=icon}
Return
Loop-Based Encoding and Decoding Algorithms for Distribution Network Reconfiguration
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRD.2023.3247826.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The distribution network reconfiguration (DNR) improves the operational efficiency of the distribution network (DN) through changing the open/closed status of switches. However, since numerous switches are complexly connected, topology analysis to determine whether it is radial requires a lot of time and effort. This paper proposes an encoding and decoding algorithm based on the loop, the fundamental structure of the DN, for effectively finding the global optimal configuration in any DN. The encoding algorithm consisted of reduction, simplification, and loop search systematically organizes the DN, and significantly reduces the search space for the DNR problem. The decoding algorithm consisted of branch switch set (BSS) selection criteria and data modification provides the methods for strategically selecting the switches that satisfy the radial structure. Additionally, the independent operations of multiple sources can be applied to proposed algorithms easily through the virtual branch. The validity and performance of the proposed algorithms are verified through the DNR case study using a genetic algorithm (GA) in the IEEE 33, 69, and 118 bus DNs. In addition, a two-stage GA algorithm is implemented to improve the convergence speed and global optimization search rate. Finally, the performance of the proposed algorithm is compared to other methods.
Keywords:
Distribution network reconfiguration
genetic algorithm
global optimal configuration
loop based
loss minimization
topology analysis
Journal
IF:
3.7
Papers:
9.1K
Citations:
2.5W
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveA new approach for distribution feeder reconfiguration for loss reduction and service restoration
PREAI
ShareSaveShareSave
View more