Title :
A minimal spanning tree algorithm for distribution networks configuration
Author :
Montoya, D.P. ; Ramirez, J.M.
Author_Institution :
Dept. of Electr. Power Syst., CINVESTAV, Guadalajara, Mexico
Abstract :
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.
Keywords :
distribution networks; polynomials; trees (mathematics); Kruskal´s algorithm; distribution networks configuration; minimal spanning tree algorithm; polynomial time; power losses minimization; radial configuration; Genetic algorithms; Linear programming; Minimization; Polynomials; Reactive power; Search problems; Switches; Distribution systems reconfiguration; Minimal Spanning Tree; Power loss reduction;
Conference_Titel :
Power and Energy Society General Meeting, 2012 IEEE
Conference_Location :
San Diego, CA
Print_ISBN :
978-1-4673-2727-5
Electronic_ISBN :
1944-9925
DOI :
10.1109/PESGM.2012.6344718
