IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v16y2023i4p1729-d1063040.html
   My bibliography  Save this article

A Recursive Conic Approximation for Solving the Optimal Power Flow Problem in Bipolar Direct Current Grids

Author

Listed:
  • Oscar Danilo Montoya

    (Grupo de Compatibilidad e Interferencia Electromagnética (GCEM), Facultad de Ingeniería, Universidad Distrital Francisco José de Caldas, Bogotá 110231, Colombia)

  • Luis Fernando Grisales-Noreña

    (Department of Electrical Engineering, Faculty of Engineering, Universidad de Talca, Curicó 3340000, Chile)

  • Jesús C. Hernández

    (Department of Electrical Engineering, University of Jaén, Campus Lagunillas s/n, Edificio A3, 23071 Jaén, Spain)

Abstract

This paper proposes a recursive conic approximation methodology to deal with the optimal power flow (OPF) problem in unbalanced bipolar DC networks. The OPF problem is formulated through a nonlinear programming (NLP) representation, where the objective function corresponds to the minimization of the expected grid power losses for a particular load scenario. The NLP formulation has a non-convex structure due to the hyperbolic equality constraints that define the current injection/absorption in the constant power terminals as a function of the powers and voltages. To obtain an approximate convex model that represents the OPF problem in bipolar asymmetric distribution networks, the conic relation associated with the product of two positive variables is applied to all nodes with constant power loads. In the case of nodes with dispersed generation, a direct replacement of the voltage variables for their expected operating point is used. An iterative solution procedure is implemented in order to minimize the error introduced by the voltage linearization in the dispersed generation sources. The 21-bus grid is employed for all numerical validations. To validate the effectiveness of the proposed conic model, the power flow problem is solved, considering that the neutral wire is floating and grounded, and obtaining the same numerical results as the traditional power flow methods (successive approximations, triangular-based, and Taylor-based approaches): expected power losses of 95.4237 and 91.2701 kW, respectively. To validate the effectiveness of the proposed convex model for solving the OPF problem, three combinatorial optimization methods are implemented: the sine-cosine algorithm (SCA), the black-hole optimizer (BHO), and the vortex search algorithm (VSA). Numerical results show that the proposed convex model finds the global optimal solution with a value of 22.985 kW, followed by the VSA with a value of 22.986 kW. At the same time, the BHO and SCA are stuck in locally optimal solutions (23.066 and 23.054 kW, respectively). All simulations were carried out in a MATLAB programming environment.

Suggested Citation

  • Oscar Danilo Montoya & Luis Fernando Grisales-Noreña & Jesús C. Hernández, 2023. "A Recursive Conic Approximation for Solving the Optimal Power Flow Problem in Bipolar Direct Current Grids," Energies, MDPI, vol. 16(4), pages 1-19, February.
  • Handle: RePEc:gam:jeners:v:16:y:2023:i:4:p:1729-:d:1063040
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/16/4/1729/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1996-1073/16/4/1729/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Ivona Brajević & Predrag S. Stanimirović & Shuai Li & Xinwei Cao & Ameer Tamoor Khan & Lev A. Kazakovtsev, 2022. "Hybrid Sine Cosine Algorithm for Solving Engineering Optimization Problems," Mathematics, MDPI, vol. 10(23), pages 1-21, December.
    2. Oscar Danilo Montoya & Walter Gil-González & Jesus C. Hernández, 2023. "Optimal Power Flow Solution for Bipolar DC Networks Using a Recursive Quadratic Approximation," Energies, MDPI, vol. 16(2), pages 1-17, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Walter Gil-González & Oscar Danilo Montoya & Jesús C. Hernández, 2023. "Optimal Neutral Grounding in Bipolar DC Networks with Asymmetric Loading: A Recursive Mixed-Integer Quadratic Formulation," Energies, MDPI, vol. 16(9), pages 1-18, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Walter Gil-González & Oscar Danilo Montoya & Jesús C. Hernández, 2023. "Optimal Neutral Grounding in Bipolar DC Networks with Asymmetric Loading: A Recursive Mixed-Integer Quadratic Formulation," Energies, MDPI, vol. 16(9), pages 1-18, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jeners:v:16:y:2023:i:4:p:1729-:d:1063040. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.