IDEAS home Printed from https://ideas.repec.org/a/spr/comgts/v21y2024i1d10.1007_s10287-023-00469-9.html
   My bibliography  Save this article

Nested Benders’s decomposition of capacity-planning problems for electricity systems with hydroelectric and renewable generation

Author

Listed:
  • Kenjiro Yagi

    (Tokushu Tokai Paper Co., Ltd.)

  • Ramteen Sioshansi

    (Carnegie Mellon University
    Carnegie Mellon University
    Carnegie Mellon University
    Carnegie Mellon University)

Abstract

Nested Benders’s decomposition is an efficient means to solve large-scale optimization problems with a natural time sequence of decisions. This paper examines the use of the technique to decompose and solve efficiently capacity-expansion problems for electricity systems with hydroelectric and renewable generators. To this end we develop an archetypal planning model that captures key features of hydroelectric and renewable generators and apply it to a case study that is based on the Columbia River system in the northwestern United States of America. We apply standard network and within-year temporal simplifications to reduce the problem’s size. Nevertheless, the remaining problem is large-scale and we demonstrate the use of nested Benders’s decomposition to solve it. We explore refinements of the decomposition method which yield further performance improvements. Overall, we show that nested Benders’s decomposition yields good computational performance with minimal loss of model fidelity.

Suggested Citation

  • Kenjiro Yagi & Ramteen Sioshansi, 2024. "Nested Benders’s decomposition of capacity-planning problems for electricity systems with hydroelectric and renewable generation," Computational Management Science, Springer, vol. 21(1), pages 1-31, June.
    • Handle: RePEc:spr:comgts:v:21:y:2024:i:1:d:10.1007_s10287-023-00469-9
    DOI: 10.1007/s10287-023-00469-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10287-023-00469-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10287-023-00469-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:comgts:v:21:y:2024:i:1:d:10.1007_s10287-023-00469-9. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.