Óptimo despliegue de redes de distribución con Generación Distribuida usando micro turbinas.

Abstract

This document shows the method to solve Distribution Network Deployment (DND) with Distributed Generation (DG), because of the constant urban increase that generates inconvenients in the process of planning the solution of the optimum deployment considers to minimize the connectivity costs reducing the pension losses with the GD incorporation. It is used the k-mean heuristic to divide users with the respective nodes, then through the analysis of minimal distances it is able to generate ideal routes to networks with the use of Steiner Tree’s minimal expansion tree Alison is to connect the DG through through an ideal deployment in a radial system. In this paper work we focus in determining the optimum rout of networks thinking about the technical and economic aspects, reducing deployment costs and improving the system’s trust. A distribution network to the optimum deployment is proposed with distributed generation minimizing distance and reducing costs in new RD, also heuristic was developed with the MATLAB simulator considering a 7 random generation nodes system in an XY plane.