Dimensionamiento óptimo de generación distribuida en redes de distribución basado en la teoría de grafos

Abstract

The main objective of this article is to show a solution for an optimal sizing of distributed generation (GD) in distribution networks using graph theory. For this purpose it uses the Minimal Spanning Tree (MST) algorithm, within the MST exist two types of algorithms highly used in electric distribution systems, those are: Prim and Dijkstra. Prim’s algorithm solves the minimal spanning tree, in this case the shortest path between distribution nodes, whereas that, Dijkstra’s algorithm find the nearest path of several elements which conduct to a single objective. In this manner a typical urban housing scenario was selected, where is possible sizing an electric distribution system, which locates geo-referenced the following elements: distributed transformers, GD units and final users. Prim’s algorithm obtains the optimal route of the médium voltaje and it depends on the location of end users, and Dijkstra’s algortihm obtains the low voltaje path between distributed transformers and end users. The GD units coupled with distribution low voltage node, providing to the electric distribution system, improving the voltaje profile, reducing power losses generated by the existent distance of the conductors.