Efficient Day-Ahead Dispatch of Photovoltaic Sources in Monopolar DC Networks via an Iterative Convex Approximation

The objective of this research is to propose an efficient energy management system for photovoltaic (PV) generation units connected to monopolar DC distribution networks via convex optimization while considering a day-ahead dispatch operation scenario. A convex approximation is used which is based on linearization via Taylor’s series expansion to the hyperbolic relations between voltages and powers in the demand nodes. A recursive solution methodology is introduced via sequential convex programming to minimize the errors introduced by the linear approximation in the power balance constraints. Numerical results in the DC version of the IEEE 33-bus grid demonstrate the effectiveness of the proposed convex model when compared to different combinatorial optimization methods, with the main advantage that the optimal global solution is found thanks to the convexity of the solution space and the reduction of the error via an iterative solution approach. Different objective functions are analyzed to validate the effectiveness of the proposed iterative convex methodology (ICM), which corresponds to technical (energy losses reduction), economic (energy purchasing and maintenance costs), and environmental (equivalent emissions of CO 2 to the atmosphere in conventional sources) factors. The proposed ICM finds reductions of about 43.9754 % in daily energy losses, 26.9957 % in energy purchasing and operating costs, and 27.3771 % in CO 2 emissions when compared to the benchmark case in the DC version of the IEEE 33-bus grid. All numerical validations were carried out in the MATLAB programming environment using the SEDUMI and SDPT3 tools for convex programming and our own scripts for metaheuristic methods.