Distribution network reconfiguration using iterative branch exchange and clustering technique.
No Thumbnail Available
Date
2023
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
The distribution network reconfiguration problem (DNRP) refers to the challenge of
searching for a given power distribution network configuration with better operating conditions,
such as minimized energy losses and improved voltage levels. To accomplish that, this paper
revisits the branch exchange heuristics and presents a method in which it is coupled with other
techniques such as evolutionary metaheuristics and cluster analysis. The methodology is applied
to four benchmark networks, the 33-, 70-, 84-, and 136-bus networks, and the results are compared
with those available in the literature, using the criteria of the number of power flow executions. The
methodology minimized the four systems starting from the initial configuration of the network. The
main contributions of this work are the use of clustering techniques to reduce the search space of
the DNRP; the consideration of voltage regulation banks and voltage-dependent loads in the feeder,
requiring the addition of a constraint to the mono-objective model to guarantee the transferred load
will be supplied at the best voltage magnitude level, and the application of the methodology in real
distribution networks to solve a set of 81 real DNRPs from CEMIG-D (the distribution branch of the
Energy Company of Minas Gerais). Four out of those are presented as case studies to demonstrate the
applicability of the approach, which efficiently found configurations with lower power and energy
losses with few PF runs.
Description
Keywords
Branch exchange, Cluster analysis, Distribution network reconfiguration, Evolutionary metaheuristics, Matpower
Citation
PEREIRA, E. C.; BARBOSA, C. H. N. de R.; VASCONCELOS, J. A. de. Distribution network reconfiguration using iterative branch exchange and clustering technique. Energies, v.16, n. 5, p. 2395-2415, 2023. Disponível em: <https://www.mdpi.com/1996-1073/16/5/2395>. Acesso em: 03 maio 2023.