A second-order cone programming reformulation of the economic dispatch problem of bess for apparent power compensation in ac distribution networks

The problem associated with economic dispatch of battery energy storage systems (BESSs) in alternating current (AC) distribution networks is addressed in this paper through convex optimization. The exact nonlinear programming model that represents the economic dispatch problem is transformed into a...

Full description

Autores:
Montoya, Oscar Danilo
Gil-González, Walter
Martin Serra, Federico
Hernández, Jesus C.
Molina-Cabrera, Alexander
Tipo de recurso:
Fecha de publicación:
2020
Institución:
Universidad Tecnológica de Bolívar
Repositorio:
Repositorio Institucional UTB
Idioma:
eng
OAI Identifier:
oai:repositorio.utb.edu.co:20.500.12585/9562
Acceso en línea:
https://hdl.handle.net/20.500.12585/9562
https://www.mdpi.com/2079-9292/9/10/1677
Palabra clave:
Battery energy storage systems
Economic dispatch problem
Convex optimization
Hyperbolic relaxation
Second-order cone programming
Rights
openAccess
License
http://creativecommons.org/licenses/by-nc-nd/4.0/
Description
Summary:The problem associated with economic dispatch of battery energy storage systems (BESSs) in alternating current (AC) distribution networks is addressed in this paper through convex optimization. The exact nonlinear programming model that represents the economic dispatch problem is transformed into a second-order cone programming (SOCP) model, thereby guaranteeing the global optimal solution-finding due to the conic (i.e., convex) structure of the solution space. The proposed economic dispatch model of the BESS considers the possibility of injecting/absorbing active and reactive power, in turn, enabling the dynamical apparent power compensation in the distribution network. A basic control design based on passivity-based control theory is introduced in order to show the possibility of independently controlling both powers (i.e., active and reactive). The computational validation of the proposed SOCP model in a medium-voltage test feeder composed of 33 nodes demonstrates the efficiency of convex optimization for solving nonlinear programming models via conic approximations. All numerical validations have been carried out in the general algebraic modeling system