A minimal spanning tree algorithm for distribution networks configuration

摘要

A minimal spanning tree algorithm for distribution networks configurations is proposed. The paper approaches the formulation by the power losses' minimization in order to select a new configuration, keeping a radial configuration. This type of problem becomes a non-differentiable, mixed integer, and highly combinatorial in nature. The Kruskal's algorithm is used to determine the minimum spanning tree, which has the characteristic to run in polynomial time.