Applying the Crow Search Algorithm for the Optimal Integration of PV Generation Units in DC Networks
This paper presents an efficient master–slave methodology to solve the problem of integrating photovoltaic (PV) generators into DC grids for a planning period of 20 years. The problem is mathematically formulated as Mixed-Integer Nonlinear Programming (MINLP) with the objective of minimizing the tot...
- Autores:
-
Grisales-Noreña, Luis Fernando
Cortés-Caicedo, Brandon
Alcalá, Gerardo
Montoya, Oscar Danilo
- Tipo de recurso:
- Fecha de publicación:
- 2023
- Institución:
- Universidad Tecnológica de Bolívar
- Repositorio:
- Repositorio Institucional UTB
- Idioma:
- eng
- OAI Identifier:
- oai:repositorio.utb.edu.co:20.500.12585/12282
- Palabra clave:
- Placement;
Active Distribution Network;
Voltage Stability
LEMB
- Rights
- openAccess
- License
- http://creativecommons.org/licenses/by-nc-nd/4.0/
Summary: | This paper presents an efficient master–slave methodology to solve the problem of integrating photovoltaic (PV) generators into DC grids for a planning period of 20 years. The problem is mathematically formulated as Mixed-Integer Nonlinear Programming (MINLP) with the objective of minimizing the total annual operating cost. The main stage, consisting of a discrete-continuous version of the Crow search algorithm (DCCSA), is in charge of determining the installation positions of the PV generators and their corresponding power ratings. On the other hand, at the slave level, the successive approximation power flow method is used to determine the objective function value. Numerical results on 33- and 69-bus test systems demonstrate the applicability, efficiency and robustness of the developed approach with respect to different methodologies previously discussed in the scientific literature, such as the vortex search algorithm, the generalized normal distribution optimizer and the particle swarm optimization algorithm. Numerical tests are performed in the MATLAB programming environment using proprietary scripts. © 2023 by the authors. |
---|