| Electronics | |
| A Second-Order Cone Programming Reformulation of the Economic Dispatch Problem of BESS for Apparent Power Compensation in AC Distribution Networks | |
| JesusC. Hernández1  OscarDanilo Montoya2  Alexander Molina-Cabrera3  Walter Gil-González4  FedericoMartin Serra5  | |
| [1] Department of Electrical Engineering, University of Jaén, Campus Lagunillas s/n, Edificio A3, 23071 Jaén, Spain;Facultad de Ingeniería, Universidad Distrital Francisco José de Caldas, Bogotá D.C 11021, Colombia;Facultad de Ingenierías, Universidad Tecnológica de Pereira, Pereira 660003, Colombia;Grupo GIIEN, Facultad de Ingeniería, Institución Universitaria Pascual Bravo, Campus Robledo, Medellín 050036, Colombia;Laboratorio de Control Automático (LCA), Facultad de Ingeniería y Ciencias Agropecuarias, Universidad Nacional de San Luis, Villa Mercedes, San Luis 5730, Argentina; | |
| 关键词: battery energy storage systems; economic dispatch problem; convex optimization; hyperbolic relaxation; second-order cone programming; | |
| DOI : 10.3390/electronics9101677 | |
| 来源: DOAJ | |
【 摘 要 】
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.
【 授权许可】
Unknown