Análise de algoritmos de agrupamento aplicados aos problemas de reconfiguração de rede de distribuição

Thiago Eliandro de Oliveira Gomes; Vinícius Jacques Garcia; Laura Lisiane Callai dos Santos; Rui Anderson Ferrarezi Garcia

doi:10.20906/sbse.v2i1.3039

Thiago Eliandro de Oliveira Gomes Universidade Federal de Santa Maria, Santa Maria, Rio Grande do Sul
Vinícius Jacques Garcia Universidade Federal de Santa Maria, Santa Maria, Rio Grande do Sul
Laura Lisiane Callai dos Santos Universidade Federal de Santa Maria, Santa Maria, Rio Grande do Sul
Rui Anderson Ferrarezi Garcia Companhia Estadual de Distribuição de Energia Elétrica, Porto Alegre, Rio Grande do Sul

DOI: https://doi.org/10.20906/sbse.v2i1.3039

Keywords: Reconfiguration, Theory of graphs, Cluster analysis, Partitioning, Shortest path algorithm, Radial network

Abstract

In order to seek alternatives to accelerate the solution process in a reconfiguration problem, this article uses the notions of graph theory to propose the exploration of different techniques oriented to the topological decomposition of a distribution system and the search for paths with lower cost. The methodological process is divided into the presentation of algorithms for topological reduction, followed by the presentation of alternatives to the search for shortest paths. The results showed better performance for the decomposition performed by the Malgrange algorithm, bringing brevity to the process and similarity between the results of the short path search algorithms.