Optimal investments in PV sources for grid-connected distribution networks: An application of the discrete–continuous genetic algorithm

Abstract

The problem of the optimal siting and sizing of photovoltaic (PV) sources in grid connected distribution networks is addressed in this study with a master–slave optimization approach. In the master optimization stage, a discrete–continuous version of the Chu and Beasley genetic algorithm (DCCBGA) is employed, which defines the optimal locations and sizes for the PV sources. In the slave stage, the successive approximation method is used to evaluate the fitness function value for each individual provided by the master stage. The objective function simultaneously minimizes the energy purchasing costs in the substation bus, and the investment and operating costs for PV sources for a planning period of 20 years. The numerical results of the IEEE 33-bus and 69-bus systems demonstrate that with the proposed optimization methodology, it is possible to eliminate about 27% of the annual operation costs in both systems with optimal locations for the three PV sources. After 100 consecutive evaluations of the DCCBGA, it was observed that 44% of the solutions found by the IEEE 33-bus system were better than those found by the BONMIN solver in the General Algebraic Modeling System (GAMS optimization package). In the case of the IEEE 69-bus system, the DCCBGA ensured, with 55% probability, that solutions with better objective function values than the mean solution value of the GAMS were found. Power generation curves for the slack source confirmed that the optimal siting and sizing of PV sources create the duck curve for the power required to the main grid; in addition, the voltage profile curves for both systems show that voltage regulation was always maintained between ±10% in all the time periods under analysis. All the numerical validations were carried out in the MATLAB programming environment with the GAMS optimization package.