IDEAS home Printed from https://ideas.repec.org/p/cor/louvco/2022018.html
   My bibliography  Save this paper

A Branch-and-Cut Algorithm for Chance-Constrained Multi-Area Reserve Sizing

Author

Listed:
  • Cho, Jehum

    (Université catholique de Louvain, LIDAM/CORE, Belgium)

  • Papavasiliou, Anthony

    (Université catholique de Louvain, LIDAM/CORE, Belgium)

Abstract

We implement an exact mixed-integer programming algorithm for the chance-constrained multi-area reserve sizing problem in the presence of transmission network constraints. The problem can be cast as a two-stage stochastic mixed integer linear program using sample approximation. Due to the complicated structure of the problem, existing methods attempt to find a feasible solution based on heuristics. However, a recent development of integer programming techniques allow us to reformulate the problem into a form where we can solve it to optimality. In this paper, we apply this integer programming approach to solve our problem to optimality and compare the results with that of the existing heuristics.

Suggested Citation

  • Cho, Jehum & Papavasiliou, Anthony, 2022. "A Branch-and-Cut Algorithm for Chance-Constrained Multi-Area Reserve Sizing," LIDAM Discussion Papers CORE 2022018, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvco:2022018
    as

    Download full text from publisher

    File URL: https://dial.uclouvain.be/pr/boreal/en/object/boreal%3A260463/datastream/PDF_01/view
    Download Restriction: no
    ---><---

    Citations

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


    Cited by:

    1. Shi, Jiantao & Guo, Ye & Wu, Wenchuan & Sun, Hongbin, 2024. "Scenario-oriented multi-area joint market clearing of energy and reserve under uncertainty," Applied Energy, Elsevier, vol. 361(C).

    More about this item

    Keywords

    Multi-area reserve sizing ; chance constraints ; probabilistic constraints ; mixed-integer programming;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:cor:louvco:2022018. 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: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.html .

    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.