Optimal scheduling of photovoltaic generators in asymmetric bipolar DC grids using a robust recursive quadratic convex approximation
This paper presents a robust quadratic convex model for the optimal scheduling of photovoltaic generators in unbalanced bipolar DC grids. The proposed model is based on Taylor’s series expansion which relaxes the hyperbolic relation between constant power terminals and voltage profiles. Furthermore,...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2023 |
| País: | España |
| Institución: | Universidad de Jaén |
| Repositorio: | RUJA. Repositorio Institucional de la Producción Científica de la Universidad de Jaén |
| OAI Identifier: | oai:ruja.ujaen.es:10953/6580 |
| Acceso en línea: | https://www.mdpi.com/2075-1702/11/2/177 https://doi.org/10.3390/machines11020177 https://hdl.handle.net/10953/6580 |
| Access Level: | acceso abierto |
| Palabra clave: | renewable energy uncertainties unbalanced bipolar DC systems day-ahead operation studies exact optimization model energy losses reduction 621.35 |
| Sumario: | This paper presents a robust quadratic convex model for the optimal scheduling of photovoltaic generators in unbalanced bipolar DC grids. The proposed model is based on Taylor’s series expansion which relaxes the hyperbolic relation between constant power terminals and voltage profiles. Furthermore, the proposed model is solved in the recursive form to reduce the error generated by relaxations assumed. Additionally, uncertainties in PV generators are considered to assess the effectiveness of the proposed recursive convex. Several proposed scenarios for the numerical validations in a modified 21-bus test system were tested to validate the robust convex model’s performance. All the simulations were carried out in the MATLAB programming environment using Yalmip and Gurobi solver. Initially, a comparative analysis with three combinatorial optimization methods under three PV generation scenarios was performed. These scenarios consider levels of 0, 50, and 100% capacity of the PV systems. The results demonstrate the effectiveness of the proposed recursively solved convex model, which always achieves the global optimum for three levels of capacity of the PV generators, with solutions of 95.423 kW, 31.525 kW, and 22.985 kW for 0%, 50%, and 100% of the capacity PV rating, respectively. In contrast, the combinatorial optimization methods do not always reach these solutions. Furthermore, the power loss for the robust model is comparable to the deterministic model, increasing by 1.65% compared to the deterministic model. |
|---|