Proximity Benders: a decomposition heuristic for stochastic programs
Natashia Boland,
Matteo Fischetti (),
Michele Monaci and
Martin Savelsbergh
Additional contact information
Natashia Boland: Georgia Institute of Technology
Matteo Fischetti: University of Padova
Michele Monaci: University of Padova
Martin Savelsbergh: Georgia Institute of Technology
Journal of Heuristics, 2016, vol. 22, issue 2, No 3, 198 pages
Abstract:
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.
Keywords: Integer programming; Benders decomposition; Stochastic programming; Heuristics (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)
Downloads: (external link)
http://link.springer.com/10.1007/s10732-015-9306-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:joheur:v:22:y:2016:i:2:d:10.1007_s10732-015-9306-1
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10732
DOI: 10.1007/s10732-015-9306-1
Access Statistics for this article
Journal of Heuristics is currently edited by Manuel Laguna
More articles in Journal of Heuristics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().