IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v26y2024i6p2121-2141.html
   My bibliography  Save this article

Adaptive Two-Stage Stochastic Programming with an Analysis on Capacity Expansion Planning Problem

Author

Listed:
  • Beste Basciftci

    (Department of Business Analytics, Tippie College of Business, University of Iowa, Iowa City, Iowa 52242)

  • Shabbir Ahmed

    (H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332)

  • Nagi Gebraeel

    (H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332)

Abstract

Problem definition : Multistage stochastic programming is a well-established framework for sequential decision making under uncertainty by seeking policies that can be dynamically adjusted as uncertainty is realized. Often, for example, because of contractual constraints, such flexible policies are not desirable, and the decision maker may need to commit to a set of actions for a certain number of periods. Two-stage stochastic programming might be better suited to such settings, where first-stage decisions do not adapt to the uncertainty realized. In this paper, we propose a novel alternative approach, named as adaptive two-stage stochastic programming, where each component of the decision policy requiring limited flexibility has its own revision point, a period prior to which the decisions are determined at the beginning of the planning until this revision point, and after which they are revised for adjusting to the uncertainty realized thus far until the end of the planning. We then analyze this approach over the capacity expansion planning problem, that may require limited flexibility over expansion decisions. Methodology/results : We provide a generic mixed-integer programming formulation for the adaptive two-stage stochastic programming problem with finite support, in particular, for scenario trees, and show that this problem is NP-hard in general. Next, we focus on the capacity expansion planning problem and derive bounds on the value of adaptive two-stage programming in comparison with the two-stage and multistage approaches in terms of revision points. We propose several heuristic solution algorithms based on this bound analysis. These algorithms either provide approximation guarantees or computational advantages in solving the resulting adaptive two-stage stochastic problem. Managerial implications : We provide insights on the choice of the revision times based on our analytical analysis. We further present an extensive computational study on a generation capacity expansion planning problem with different generation resources including renewable energy. We demonstrate the value of adopting adaptive two-stage approach against the existing policies under limited flexibility and highlight the efficiency of the proposed heuristics along with practical implications on the studied problem.

Suggested Citation

  • Beste Basciftci & Shabbir Ahmed & Nagi Gebraeel, 2024. "Adaptive Two-Stage Stochastic Programming with an Analysis on Capacity Expansion Planning Problem," Manufacturing & Service Operations Management, INFORMS, vol. 26(6), pages 2121-2141, November.
  • Handle: RePEc:inm:ormsom:v:26:y:2024:i:6:p:2121-2141
    DOI: 10.1287/msom.2023.0157
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/msom.2023.0157
    Download Restriction: no

    File URL: https://libkey.io/10.1287/msom.2023.0157?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
    ---><---

    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:inm:ormsom:v:26:y:2024:i:6:p:2121-2141. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.