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

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.