Algoritmo de programación dinámica para conexión/desconexión diaria de compensación capacitiva en redes de distribución.

Abstract

This research presents a develop of an algorithm for the optimal dispatch of capacitors based on dynamic programming to reduce total loss in distribution systems. To reach that objective a program to solve power flow in distribution feeder (FORWARD/BACKWARD) is incorporated, which needs a demand projection of 24 periods per day. Recursive solution is the method of dynamic programming applied to solve an objective function: to reduce the system total loss using the voltage limits as restrictions. This research could be used to determine the period of the day where it is the best to keep capacitors connected or disconnected and give that instruction to the operator.