IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v22y2016i2d10.1007_s10732-015-9306-1.html
   My bibliography  Save this article

Proximity Benders: a decomposition heuristic for stochastic programs

Author

Listed:
  • Natashia Boland

    (Georgia Institute of Technology)

  • Matteo Fischetti

    (University of Padova)

  • Michele Monaci

    (University of Padova)

  • Martin Savelsbergh

    (Georgia Institute of Technology)

Abstract

In this paper we present a heuristic approach to two-stage mixed-integer linear stochastic programming models with continuous second stage variables. A common solution approach for these models is Benders decomposition, in which a sequence of (possibly infeasible) solutions is generated, until an optimal solution is eventually found and the method terminates. As convergence may require a large amount of computing time for hard instances, the method may be unsatisfactory from a heuristic point of view. Proximity search is a recently-proposed heuristic paradigm in which the problem at hand is modified and iteratively solved with the aim of producing a sequence of improving feasible solutions. As such, proximity search and Benders decomposition naturally complement each other, in particular when the emphasis is on seeking high-quality, but not necessarily optimal, solutions. In this paper, we investigate the use of proximity search as a tactical tool to drive Benders decomposition, and computationally evaluate its performance as a heuristic on instances of different stochastic programming problems.

Suggested Citation

  • Natashia Boland & Matteo Fischetti & Michele Monaci & Martin Savelsbergh, 2016. "Proximity Benders: a decomposition heuristic for stochastic programs," Journal of Heuristics, Springer, vol. 22(2), pages 181-198, April.
    • Handle: RePEc:spr:joheur:v:22:y:2016:i:2:d:10.1007_s10732-015-9306-1
    DOI: 10.1007/s10732-015-9306-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-015-9306-1
    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/s10732-015-9306-1?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.

    References listed on IDEAS

    as
    1. Tobias Achterberg & Timo Berthold & Gregor Hendel, 2012. "Rounding and Propagation Heuristics for Mixed Integer Programming," Operations Research Proceedings, in: Diethard Klatte & Hans-Jakob Lüthi & Karl Schmedders (ed.), Operations Research Proceedings 2011, edition 127, pages 71-76, Springer.
    2. Walter Rei & Jean-François Cordeau & Michel Gendreau & Patrick Soriano, 2009. "Accelerating Benders Decomposition by Local Branching," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 333-345, May.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Stephen J. Maher, 2021. "Enhancing large neighbourhood search heuristics for Benders’ decomposition," Journal of Heuristics, Springer, vol. 27(4), pages 615-648, August.
    2. Fatemeh Sarayloo & Teodor Gabriel Crainic & Walter Rei, 2021. "A Learning-Based Matheuristic for Stochastic Multicommodity Network Design," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 643-656, May.
    3. Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
    4. Vahdani, Behnam & Mohammadi, Mehrdad & Thevenin, Simon & Gendreau, Michel & Dolgui, Alexandre & Meyer, Patrick, 2023. "Fair-split distribution of multi-dose vaccines with prioritized age groups and dynamic demand: The case study of COVID-19," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1249-1272.
    5. Daniel Baena & Jordi Castro & Antonio Frangioni, 2020. "Stabilized Benders Methods for Large-Scale Combinatorial Optimization, with Application to Data Privacy," Management Science, INFORMS, vol. 66(7), pages 3051-3068, July.
    6. Filipe Rodrigues & Agostinho Agra & Lars Magnus Hvattum & Cristina Requejo, 2021. "Weighted proximity search," Journal of Heuristics, Springer, vol. 27(3), pages 459-496, June.
    7. Ragheb Rahmaniani & Shabbir Ahmed & Teodor Gabriel Crainic & Michel Gendreau & Walter Rei, 2020. "The Benders Dual Decomposition Method," Operations Research, INFORMS, vol. 68(3), pages 878-895, May.

    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. M. Jenabi & S. M. T. Fatemi Ghomi & S. A. Torabi & Moeen Sammak Jalali, 2022. "An accelerated Benders decomposition algorithm for stochastic power system expansion planning using sample average approximation," OPSEARCH, Springer;Operational Research Society of India, vol. 59(4), pages 1304-1336, December.
    2. Elisangela Martins de Sá & Ivan Contreras & Jean-François Cordeau & Ricardo Saraiva de Camargo & Gilberto de Miranda, 2015. "The Hub Line Location Problem," Transportation Science, INFORMS, vol. 49(3), pages 500-518, August.
    3. Lim, Gino J. & Bard, Jonathan F., 2016. "Benders decomposition and an IP-based heuristic for selecting IMRT treatment beam anglesAuthor-Name: Lin, Sifeng," European Journal of Operational Research, Elsevier, vol. 251(3), pages 715-726.
    4. Mohammad Javad Feizollahi & Igor Averbakh, 2014. "The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 321-335, May.
    5. Azad, Nader & Hassini, Elkafi, 2019. "Recovery strategies from major supply disruptions in single and multiple sourcing networks," European Journal of Operational Research, Elsevier, vol. 275(2), pages 481-501.
    6. Ragheb Rahmaniani & Shabbir Ahmed & Teodor Gabriel Crainic & Michel Gendreau & Walter Rei, 2020. "The Benders Dual Decomposition Method," Operations Research, INFORMS, vol. 68(3), pages 878-895, May.
    7. Fausto Errico & Teodor Gabriel Crainic & Federico Malucelli & Maddalena Nonato, 2017. "A Benders Decomposition Approach for the Symmetric TSP with Generalized Latency Arising in the Design of Semiflexible Transit Systems," Transportation Science, INFORMS, vol. 51(2), pages 706-722, May.
    8. Belieres, Simon & Hewitt, Mike & Jozefowiez, Nicolas & Semet, Frédéric & Van Woensel, Tom, 2020. "A Benders decomposition-based approach for logistics service network design," European Journal of Operational Research, Elsevier, vol. 286(2), pages 523-537.
    9. Daniel Baena & Jordi Castro & Antonio Frangioni, 2020. "Stabilized Benders Methods for Large-Scale Combinatorial Optimization, with Application to Data Privacy," Management Science, INFORMS, vol. 66(7), pages 3051-3068, July.
    10. Gary Froyland & Stephen J. Maher & Cheng-Lung Wu, 2014. "The Recoverable Robust Tail Assignment Problem," Transportation Science, INFORMS, vol. 48(3), pages 351-372, August.
    11. Qipeng Zheng & Jianhui Wang & Panos Pardalos & Yongpei Guan, 2013. "A decomposition approach to the two-stage stochastic unit commitment problem," Annals of Operations Research, Springer, vol. 210(1), pages 387-410, November.
    12. Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
    13. Lixin Tang & Wei Jiang & Georgios Saharidis, 2013. "An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions," Annals of Operations Research, Springer, vol. 210(1), pages 165-190, November.
    14. Teodor Gabriel Crainic & Mike Hewitt & Francesca Maggioni & Walter Rei, 2021. "Partial Benders Decomposition: General Methodology and Application to Stochastic Network Design," Transportation Science, INFORMS, vol. 55(2), pages 414-435, March.
    15. M. Jenabi & S. Fatemi Ghomi & S. Torabi & S. Hosseinian, 2015. "Acceleration strategies of Benders decomposition for the security constraints power system expansion planning," Annals of Operations Research, Springer, vol. 235(1), pages 337-369, December.
    16. Stephen J. Maher, 2021. "Enhancing large neighbourhood search heuristics for Benders’ decomposition," Journal of Heuristics, Springer, vol. 27(4), pages 615-648, August.
    17. Shoufeng Ji & Qi Sun, 2017. "Low-Carbon Planning and Design in B&R Logistics Service: A Case Study of an E-Commerce Big Data Platform in China," Sustainability, MDPI, vol. 9(11), pages 1-27, November.
    18. Schepler, Xavier & Rossi, André & Gurevsky, Evgeny & Dolgui, Alexandre, 2022. "Solving robust bin-packing problems with a branch-and-price approach," European Journal of Operational Research, Elsevier, vol. 297(3), pages 831-843.
    19. Wakui, Tetsuya & Hashiguchi, Moe & Yokoyama, Ryohei, 2021. "Structural design of distributed energy networks by a hierarchical combination of variable- and constraint-based decomposition methods," Energy, Elsevier, vol. 224(C).
    20. Lichun Chen & Elise Miller-Hooks, 2012. "Resilience: An Indicator of Recovery Capability in Intermodal Freight Transport," Transportation Science, INFORMS, vol. 46(1), pages 109-123, February.

    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:joheur:v:22:y:2016:i:2:d:10.1007_s10732-015-9306-1. 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: 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.