IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v57y2023i5p1252-1275.html
   My bibliography  Save this article

Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs

Author

Listed:
  • Cristian Ramírez-Pico

    (Faculty of Engineering and Sciences, Universidad Adolfo Ibáñez, Santiago 7941169, Chile)

  • Ivana Ljubić

    (ESSEC Business School of Paris, 95021 Cergy-Pontoise, France)

  • Eduardo Moreno

    (Faculty of Engineering and Sciences, Universidad Adolfo Ibáñez, Santiago 7941169, Chile)

Abstract

Benders decomposition is one of the most applied methods to solve two-stage stochastic problems (TSSP) with a large number of scenarios. The main idea behind the Benders decomposition is to solve a large problem by replacing the values of the second-stage subproblems with individual variables and progressively forcing those variables to reach the optimal value of the subproblems, dynamically inserting additional valid constraints, known as Benders cuts. Most traditional implementations add a cut for each scenario (multicut) or a single cut that includes all scenarios. In this paper, we present a novel Benders adaptive-cuts method , where the Benders cuts are aggregated according to a partition of the scenarios, which is dynamically refined using the linear program-dual information of the subproblems. This scenario aggregation/disaggregation is based on the Generalized Adaptive Partitioning Method (GAPM), which has been successfully applied to TSSPs. We formalize this hybridization of Benders decomposition and the GAPM by providing sufficient conditions under which an optimal solution of the deterministic equivalent can be obtained in a finite number of iterations. Our new method can be interpreted as a compromise between the Benders single-cuts and multicuts methods, drawing on the advantages of both sides, by rendering the initial iterations faster (as for the single-cuts Benders) and ensuring the overall faster convergence (as for the multicuts Benders). Computational experiments on three TSSPs [the Stochastic Electricity Planning, Stochastic Multi-Commodity Flow, and conditional value-at-risk (CVaR) Facility Location] validate these statements, showing that the new method outperforms the other implementations of Benders methods, as well as other standard methods for solving TSSPs, in particular when the number of scenarios is very large. Moreover, our study demonstrates that the method is not only effective for the risk-neutral decision makers, but also that it can be used in combination with the risk-averse CVaR objective.

Suggested Citation

  • Cristian Ramírez-Pico & Ivana Ljubić & Eduardo Moreno, 2023. "Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs," Transportation Science, INFORMS, vol. 57(5), pages 1252-1275, September.
  • Handle: RePEc:inm:ortrsc:v:57:y:2023:i:5:p:1252-1275
    DOI: 10.1287/trsc.2022.0073
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2022.0073
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.2022.0073?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:ortrsc:v:57:y:2023:i:5:p:1252-1275. 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.