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

Generation and Transmission Expansion Planning Using a Nested Decomposition Algorithm

Author

Listed:
  • Carlos Vergara

    (Department of Electrical Engineering, Universidad Técnica Federico Santa María, Valparaíso 2390123, Chile)

  • Esteban Gil

    (Department of Electrical Engineering, Universidad Técnica Federico Santa María, Valparaíso 2390123, Chile)

  • Victor Hinojosa

    (Department of Electrical Engineering, Universidad Técnica Federico Santa María, Valparaíso 2390123, Chile)

Abstract

This work presents an implementation of a Nested Decomposition Algorithm (NDA) applied to co-optimizing generation and transmission capacity expansion planning problems in power systems, including operational flexibility constraints. The proposed methodology has been gaining relevance in recent years, as it can efficiently solve large mixed-integer problems faster than the conventional extensive formulation (mixed-integer linear programming). Three case studies are conducted on two IEEE test power systems to evaluate the algorithm’s performance and cut configuration. The first case study compares the performance between the NDA and the extensive formulation. The second case study compares the performance of each cut type, analyzing differences in simulation times and algorithm convergence. The third case study proposes a set of cut patterns based on the prior outcomes, whose performance and convergence are tested. Based on the simulation results, conclusions are drawn about the capability and performance of the NDA applied to the capacity expansion planning problem. The study shows that obtaining results with reasonable convergence in less simulation time is possible using a particular pattern.

Suggested Citation

  • Carlos Vergara & Esteban Gil & Victor Hinojosa, 2024. "Generation and Transmission Expansion Planning Using a Nested Decomposition Algorithm," Energies, MDPI, vol. 17(7), pages 1-20, March.
    • Handle: RePEc:gam:jeners:v:17:y:2024:i:7:p:1509-:d:1361705
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/17/7/1509/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1996-1073/17/7/1509/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Abdin, Adam F. & Caunhye, Aakil & Zio, Enrico & Cardin, Michel-Alexandre, 2022. "Optimizing generation expansion planning with operational uncertainty: A multistage adaptive robust approach," Applied Energy, Elsevier, vol. 306(PA).
    Full references (including those not matched with items on IDEAS)

    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. Qiu, Haifeng & Gu, Wei & Liu, Pengxiang & Sun, Qirun & Wu, Zhi & Lu, Xi, 2022. "Application of two-stage robust optimization theory in power system scheduling under uncertainties: A review and perspective," Energy, Elsevier, vol. 251(C).
    2. Caputo, Cesare & Cardin, Michel-Alexandre & Ge, Pudong & Teng, Fei & Korre, Anna & Antonio del Rio Chanona, Ehecatl, 2023. "Design and planning of flexible mobile Micro-Grids using Deep Reinforcement Learning," Applied Energy, Elsevier, vol. 335(C).
    3. Xiong, Houbo & Yan, Mingyu & Guo, Chuangxin & Ding, Yi & Zhou, Yue, 2023. "DP based multi-stage ARO for coordinated scheduling of CSP and wind energy with tractable storage scheme: Tight formulation and solution technique," Applied Energy, Elsevier, vol. 333(C).
    4. Qiu, Haifeng & Sun, Qirun & Lu, Xi & Beng Gooi, Hoay & Zhang, Suhan, 2022. "Optimality-feasibility-aware multistage unit commitment considering nonanticipative realization of uncertainty," Applied Energy, Elsevier, vol. 327(C).
    5. Xiong, Houbo & Zhou, Yue & Guo, Chuangxin & Ding, Yi & Luo, Fengji, 2023. "Multi-stage risk-based assessment for wind energy accommodation capability: A robust and non-anticipative method," Applied Energy, Elsevier, vol. 350(C).

    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:17:y:2024:i:7:p:1509-:d:1361705. 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.