A mixed-integer convex model for the optimal placement and sizing of distributed generators in power distribution networks

Abstract

The optimal placement and sizing of distributed generators is a classical problem in power distribution networks that is usually solved using heuristic algorithms due to its high complexity. This paper proposes a different approach based on a mixed-integer second-order cone programming (MI-SOCP) model that ensures the global optimum of the relaxed optimization model. Second-order cone programming (SOCP) has demonstrated to be an efficient alternative to cope with the non-convexity of the power flow equations in power distribution networks. Of relatively new interest to the power systems community is the extension to MI-SOCP models. The proposed model is an approximation. However, numerical validations in the IEEE 33-bus and IEEE 69-bus test systems for unity and variable power factor confirm that the proposed MI-SOCP finds the best solutions reported in the literature. Being an exact technique, the proposed model allows minimum processing times and zero standard deviation, i.e., the same optimum is guaranteed at each time that the MI-SOCP model is solved (a significant advantage in comparison to metaheuristics). Additionally, load and photovoltaic generation curves for the IEEE 69-node test system are included to demonstrate the applicability of the proposed MI-SOCP to solve the problem of the optimal location and sizing of renewable generators using the multi-period optimal power flow formulation. Therefore, the proposed MI-SOCP also guarantees the global optimum finding, in contrast to local solutions achieved with mixed-integer nonlinear programming solvers available in the GAMS optimization software. All the simulations were carried out via MATLAB software with the CVX package and Gurobi solver.