The Benders decomposition algorithm: A literature review

The Benders decomposition algorithm has been successfully applied to a wide range of difficult optimization problems. This paper presents a state-of-the-art survey of this algorithm, emphasizing its use in combinatorial optimization. We discuss the classical algorithm, the impact of the problem formulation on its convergence, and the relationship to other decomposition methods. We introduce a taxonomy of algorithmic enhancements and acceleration strategies based on the main components of the algorithm. The taxonomy provides the framework to synthesize the literature, and to identify shortcomings, trends and potential research directions. We also discuss the use of the Benders Decomposition to develop efficient (meta-)heuristics, describe the limitations of the classical algorithm, and present extensions enabling its application to a broader range of problems.

[1]  K. Ponnambalam,et al.  Hydro energy management optimization in a deregulated electricity market , 2006 .

[2]  Georgios K. D. Saharidis,et al.  Initialization of the Benders master problem using valid inequalities applied to fixed-charge network problems , 2011, Expert Syst. Appl..

[3]  Jean-François Cordeau,et al.  Benders Decomposition for Production Routing Under Demand Uncertainty , 2012, Oper. Res..

[4]  Nikolaos Papadakos,et al.  Integrated airline scheduling , 2009, Comput. Oper. Res..

[5]  M. Laughton,et al.  Large-scale mixed integer programming: Benders-type heuristics , 1984 .

[6]  Wei Jiang,et al.  An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions , 2013, Ann. Oper. Res..

[7]  T L Magnanti,et al.  TRANSPORTATION NETWORK ANALYSIS AND DECOMPOSITION METHODS , 1978 .

[8]  Stephen J. Wright,et al.  Decomposition Algorithms for Stochastic Programming on a Computational Grid , 2001, Comput. Optim. Appl..

[9]  Michel Minoux,et al.  Exact solution of multicommodity network optimization problems with general step cost functions , 1999, Oper. Res. Lett..

[10]  Michael A. Trick,et al.  A Benders'Approach to a Transportation Network Design Problem , 2009, CPAIOR.

[11]  Patrick De Causmaecker,et al.  A Combinatorial Benders' decomposition for the lock scheduling problem , 2015, Comput. Oper. Res..

[12]  Kaj Holmberg,et al.  On using approximations of the Benders master problem , 1994 .

[13]  T. Zheng,et al.  Solving corrective risk-based security-constrained optimal power flow with Lagrangian relaxation and Benders decomposition , 2016 .

[14]  Hanif D. Sherali,et al.  Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming , 2006, Math. Program..

[15]  Marianthi G. Ierapetritou,et al.  Resolution method for mixed integer bi-level linear problems based on decomposition technique , 2009, J. Glob. Optim..

[16]  Arthur M. Geoffrion,et al.  Elements of Large Scale Mathematical Programming Part II: Synthesis of Algorithms and Bibliography , 1970 .

[17]  Henrique Pacca Loureiro Luna,et al.  Benders decomposition for local access network design with two technologies , 2001, Discret. Math. Theor. Comput. Sci..

[18]  Samir Elhedhli,et al.  An interior-point Benders based branch-and-cut algorithm for mixed integer programs , 2010, Annals of Operations Research.

[19]  Günther R. Raidl,et al.  Decomposition based hybrid metaheuristics , 2015, Eur. J. Oper. Res..

[20]  Alysson M. Costa,et al.  Accelerating benders decomposition with heuristicmaster problem solutions , 2012 .

[21]  K. A. Ariyawansa,et al.  Performance of a benchmark parallel implementation of the Van Slyke and Wets algorithm for two-stage stochastic programs on the Sequent/Balance , 1991, Concurr. Pract. Exp..

[22]  Michel Gendreau,et al.  Accelerating Benders Decomposition by Local Branching , 2009, INFORMS J. Comput..

[23]  Stefano Serra Capizzano,et al.  Accelerated multigrid for graph Laplacian operators , 2015, Appl. Math. Comput..

[24]  Biao Huang,et al.  Guest Editorial: 4TH symposium on advanced control of industrial processes (ADCONIP) , 2012 .

[25]  Seyyed M. T. Fatemi Ghomi,et al.  Acceleration strategies of Benders decomposition for the security constraints power system expansion planning , 2015, Ann. Oper. Res..

[26]  Alysson M. Costa,et al.  Benders, metric and cutset inequalities for multicommodity capacitated network design , 2009, Comput. Optim. Appl..

[27]  Tzu-Liang Tseng,et al.  A hybrid algorithm for capacitated plant location problem , 2010, Expert Syst. Appl..

[28]  Charles A. Holloway.  A Generalized Approach to Dantzig-Wolfe Decomposition for Concave Programs , 1973, Oper. Res..

[29]  Jean-François Cordeau,et al.  Simultaneous Assignment of Locomotives and Cars to Passenger Trains , 1998, Oper. Res..

[30]  K. Aardal,et al.  A Benders decomposition based heuristic for the hierarchical production planning problem , 1990 .

[31]  John R. Birge,et al.  Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs , 1985, Oper. Res..

[32]  G. B. Dantzig,et al.  Solving stochastic linear programs on a Hypercube multicomputer. Technical report , 1991 .

[33]  Stefan Nickel,et al.  Multi-period hub location problems in transportation , 2015 .

[34]  A. Ruszczynski,et al.  Accelerating the regularized decomposition method for two stage stochastic linear problems , 1997 .

[35]  Churlzu Lim.  Relationship among Benders, Dantzig–Wolfe, and Lagrangian Optimization , 2011 .

[36]  John E. Beasley,et al.  Improving benders decomposition using a genetic algorithm , 2009, Eur. J. Oper. Res..

[37]  Sanjeeb Dash,et al.  Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse , 2017, INFORMS J. Comput..

[38]  R. Wets,et al.  L-SHAPED LINEAR PROGRAMS WITH APPLICATIONS TO OPTIMAL CONTROL AND STOCHASTIC PROGRAMMING. , 1969 .

[39]  Gilbert Laporte,et al.  A Priori Optimization of the Probabilistic Traveling Salesman Problem , 1994, Oper. Res..

[40]  Michael Poss,et al.  Benders Decomposition for the Hop-Constrained Survivable Network Design Problem , 2013, INFORMS J. Comput..

[41]  John M. Wilson,et al.  Introduction to Stochastic Programming , 1998, J. Oper. Res. Soc..

[42]  Shabbir Ahmed,et al.  Improving the Integer L-Shaped Method , 2016, INFORMS J. Comput..

[43]  Gitae Kim,et al.  Optimal inventory control in a multi-period newsvendor problem with non-stationary demand , 2015, Adv. Eng. Informatics.

[44]  J. Hooker,et al.  Logic-based Benders decomposition , 2003 .

[45]  Leon S. Lasdon,et al.  Solving Large Nonconvex Water Resources Management Models Using Generalized Benders Decomposition , 2001, Oper. Res..

[46]  Teodor Gabriel Crainic,et al.  Partial Decomposition Strategies for Two-Stage Stochastic Integer Programs , 2014 .

[47]  Fatma Gzara,et al.  Logic-based Benders decomposition for an inventory-location problem with service constraints , 2015 .

[48]  Yurii Nesterov,et al.  New variants of bundle methods , 1995, Math. Program..

[49]  Ulf Lorenz,et al.  Solving multistage quantified linear optimization problems with the alpha–beta nested Benders decomposition , 2015, EURO J. Comput. Optim..

[50]  Matteo Fischetti,et al.  Redesigning Benders Decomposition for Large-Scale Facility Location , 2017, Manag. Sci..

[51]  Jeremy A. Bloom,et al.  Solving an Electricity Generating Capacity Expansion Planning Problem by Generalized Benders' Decomposition , 1983, Oper. Res..

[52]  Javad Behnamian,et al.  Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation , 2014, Comput. Oper. Res..

[53]  Matteo Fischetti,et al.  A note on the selection of Benders’ cuts , 2010, Math. Program..

[54]  Hanif D. Sherali,et al.  On generating maximal nondominated Benders cuts , 2013, Ann. Oper. Res..

[55]  Jørgen Tind,et al.  L-shaped decomposition of two-stage stochastic programs with integer recourse , 1998, Math. Program..

[56]  Marianthi G. Ierapetritou,et al.  Speed-up Benders decomposition using maximum density cut (MDC) generation , 2013, Ann. Oper. Res..

[57]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[58]  Maria Grazia Scutellà,et al.  A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks , 2016, Eur. J. Oper. Res..

[59]  Arthur M. Geoffrion,et al.  Elements of Large-Scale Mathematical Programming Part I: Concepts , 1970 .

[60]  David K. Smith,et al.  Mathematical Programming: Theory and Algorithms , 1986 .

[61]  A. J. Rubiales,et al.  Stabilization of the Generalized Benders Decomposition applied to Short-Term Hydrothermal Coordination Problem , 2013, IEEE Latin America Transactions.

[62]  I. Grossmann.  Review of Nonlinear Mixed-Integer and Disjunctive Programming Techniques , 2002 .

[63]  Mir Saman Pishvaee,et al.  An accelerated Benders decomposition algorithm for sustainable supply chain network design under uncertainty: A case study of medical needle and syringe supply chain , 2014 .

[64]  Stavros A. Zenios,et al.  Scalable Parallel Benders Decomposition for Stochastic Linear Programming , 1997, Parallel Comput..

[65]  John N. Hooker,et al.  A Hybrid Method for the Planning and Scheduling , 2005, Constraints.

[66]  Julia L. Higle,et al.  The C3 Theorem and a D2 Algorithm for Large Scale Stochastic Mixed-Integer Programming: Set Convexification , 2005, Math. Program..

[67]  Antonio Frangioni,et al.  Inexact stabilized Benders' decomposition approaches to chance-constrained problems with finite support , 2015 .

[68]  G. L. Nemhauser,et al.  A Modified Linear Program for Columnar Methods in Mathematical Programming , 1971, Oper. Res..

[69]  Andreas Grothey,et al.  A note on feasibility in Benders Decomposition , 2005 .

[70]  André Langevin,et al.  Scheduling and routing of automated guided vehicles: A hybrid approach , 2007, Comput. Oper. Res..

[71]  T. Santoso.  A stochastic programming approach for supply chain network design under uncertainty , 2004 .

[72]  Gilbert Laporte,et al.  The integer L-shaped method for stochastic integer programs with complete recourse , 1993, Oper. Res. Lett..

[73]  M. O'Kelly,et al.  Hub Location Problems with Price Sensitive Demands , 2015 .

[74]  Michel Gendreau,et al.  Accelerating Benders decomposition for closed-loop supply chain network design: Case of used durable products with different quality levels , 2016, Eur. J. Oper. Res..

[75]  I. Grossmann,et al.  A decomposition approach for the scheduling of a steel plant production , 2001 .

[76]  Dionne M. Aleman,et al.  Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling , 2017, Eur. J. Oper. Res..

[77]  Z. Caner Taskin,et al.  Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures , 2013, Comput. Oper. Res..

[78]  Mohammed Fazle Baki,et al.  Balancing transfer lines using Benders decomposition and ant colony optimisation techniques , 2014 .

[79]  Halit Üster,et al.  Tabu Search and Benders Decomposition Approaches for a Capacitated Closed-Loop Supply Chain Network Design Problem , 2009, Transp. Sci..

[80]  Mark Wallace,et al.  Hybrid Benders Decomposition Algorithms in Constraint Logic Programming , 2001, CP.

[81]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[82]  Takahito Kuno,et al.  Global optimization of nonconvex MINLP by a hybrid branch-and-bound and revised general benders decomposition approach , 2003 .

[83]  Ghasem Moslehi,et al.  A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach , 2017 .

[84]  M. D. Devine,et al.  A Modified Benders' Partitioning Algorithm for Mixed Integer Programming , 1977 .

[85]  Marianthi G. Ierapetritou,et al.  Accelerating Benders method using covering cut bundle generation , 2010, Int. Trans. Oper. Res..

[86]  J. Hooker,et al.  Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction , 2000 .

[87]  Jong Min Lee,et al.  Acceleration of Benders decomposition for mixed integer linear programming , 2011, 2011 International Symposium on Advanced Control of Industrial Processes (ADCONIP).

[88]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[89]  Teodor Gabriel Crainic,et al.  Partial Benders Decomposition Strategies for Two-Stage Stochastic Integer Programs , 2016 .

[90]  Ricardo Saraiva de Camargo,et al.  An improved Benders decomposition algorithm for the tree of hubs location problem , 2013, Eur. J. Oper. Res..

[91]  Paolo Toth,et al.  On exact solutions for the Minmax Regret Spanning Tree problem , 2014, Comput. Oper. Res..

[92]  Vittorio Maniezzo,et al.  Benders decomposition, Lagrangean relaxation and metaheuristic design , 2009, J. Heuristics.

[93]  François Soumis,et al.  An integrated aircraft routing, crew scheduling and flight retiming model , 2005, Comput. Oper. Res..

[94]  Curtiss Luong,et al.  An examination of Benders' decomposition approaches in large-scale healthcare optimization problems , 2015 .

[95]  Kaj Holmberg,et al.  On the convergence of cross decomposition , 1990, Math. Program..

[96]  Jong Min Lee,et al.  A tighter cut generation strategy for acceleration of Benders decomposition , 2012, Comput. Chem. Eng..

[97]  Thomas L. Magnanti,et al.  Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria , 1981, Oper. Res..

[98]  J. Christopher Beck.  Checking-Up on Branch-and-Check , 2010, CP.

[99]  Dennis L. Bricker,et al.  A Hybrid Benders/genetic algorithm for vehicle routing and scheduling problem , 2012 .

[100]  Csaba I. Fábián,et al.  Solving two-stage stochastic programming problems with level decomposition , 2007, Comput. Manag. Sci..

[101]  Deepak Ponvel Chermakani.  Optimal Aggregation of Blocks into Subproblems in Linear-Programs with Block-Diagonal-Structure , 2015, ArXiv.

[102]  Günther R. Raidl,et al.  Speeding Up Logic-Based Benders' Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problem , 2014, Hybrid Metaheuristics.

[103]  Michael Poss,et al.  An improved Benders decomposition applied to a multi-layer network design problem , 2009, Oper. Res. Lett..

[104]  Jean-François Cordeau,et al.  A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem , 2003, Comput. Oper. Res..

[105]  Thomas L. Magnanti,et al.  Tailoring Benders decomposition for uncapacitated network design , 1986 .

[106]  Tony J. Van Roy,et al.  Cross decomposition for mixed integer programming , 1983, Math. Program..

[107]  Erlendur S. Thorsteinsson.  Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming , 2001, CP.

[108]  A. M. Geoffrion.  Generalized Benders decomposition , 1972 .

[109]  John N. Hooker,et al.  Planning and Scheduling by Logic-Based Benders Decomposition , 2007, Oper. Res..

[110]  Xiang Li,et al.  Parallel nonconvex generalized Benders decomposition for natural gas production network planning under uncertainty , 2013, Comput. Chem. Eng..

[111]  Kerem Bülbül,et al.  Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows , 2018, Eur. J. Oper. Res..

[112]  Nikolaos Papadakos,et al.  Practical enhancements to the Magnanti-Wong method , 2008, Oper. Res. Lett..

[113]  Thierry Benoist,et al.  Constraint Programming Contribution to Benders Decomposition: A Case Study , 2002, CP.

[114]  Narayan Rangaraj,et al.  Exact approaches for static data segment allocation problem in an information network , 2015, Comput. Oper. Res..

[115]  Ignacio E. Grossmann,et al.  A cross-decomposition scheme with integrated primal–dual multi-cuts for two-stage stochastic programming investment planning problems , 2016, Math. Program..

[116]  Alysson M. Costa.  A survey on benders decomposition applied to fixed-charge network design problems , 2005, Comput. Oper. Res..

[117]  Ignacio E. Grossmann,et al.  Using MILP and CP for the Scheduling of Batch Chemical Processes , 2004, CPAIOR.

[118]  Thomas M. Liebling,et al.  Analysis of Backtrack Algorithms for Listing All Vertices and All Faces of a Convex Polyhedron , 1997, Comput. Geom..

[119]  Plácido Rogério Pinheiro,et al.  A Hybrid Approach of Bundle and Benders Applied Large Mixed Linear Integer Problem , 2013, J. Appl. Math..

[120]  Achim Koberstein,et al.  Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method , 2013, Eur. J. Oper. Res..

[121]  A. M. Geoffrion,et al.  Multicommodity Distribution System Design by Benders Decomposition , 1974 .

[122]  Marianthi G. Ierapetritou,et al.  Improving benders decomposition using maximum feasible subsystem (MFS) cut generation strategy , 2010, Comput. Chem. Eng..

[123]  Ignacio E. Grossmann,et al.  Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain , 2014, Comput. Oper. Res..

[124]  Andrzej Ruszczynski,et al.  A regularized decomposition method for minimizing a sum of polyhedral functions , 1986, Math. Program..

[125]  Teodor Gabriel Crainic,et al.  A Benders Decomposition Approach for the Symmetric TSP with Generalized Latency Arising in the Design of Semiflexible Transit Systems , 2017, Transp. Sci..

[126]  Hercules Vladimirou,et al.  Computational assessment of distributed decomposition methods for stochastic linear programs , 1998, Eur. J. Oper. Res..

[127]  Jean-François Cordeau,et al.  Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling , 2000, Transp. Sci..

[128]  S. Minner,et al.  Benders Decomposition for Discrete–Continuous Linear Bilevel Problems with application to traffic network design , 2014 .

[129]  Golbon Zakeri,et al.  Inexact Cuts in Benders Decomposition , 1999, SIAM J. Optim..

[130]  Ignacio E. Grossmann,et al.  Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods , 2002 .

[131]  Jérôme Malick,et al.  Quadratic stabilization of Benders decomposition , 2014 .

[132]  Ricardo Saraiva de Camargo,et al.  A hybrid Outer-Approximation/Benders Decomposition algorithm for the single allocation hub location problem under congestion , 2011, Oper. Res. Lett..

[133]  Mauro Dell'Amico,et al.  Combinatorial Benders' Cuts for the Strip Packing Problem , 2014, Oper. Res..

[134]  Matteo Fischetti,et al.  Proximity Benders: a decomposition heuristic for stochastic programs , 2016, J. Heuristics.

[135]  Lewis Ntaimo,et al.  Adaptive multicut aggregation for two-stage stochastic linear programs with recourse , 2010, Eur. J. Oper. Res..

[136]  Louis-Martin Rousseau,et al.  Combining Benders decomposition and column generation for multi-activity tour scheduling , 2018, Comput. Oper. Res..

[137]  John R. Birge,et al.  Introduction to Stochastic programming (2nd edition), Springer verlag, New York , 2011 .

[138]  Salvador Perez Canto,et al.  Application of Benders' decomposition to power plant preventive maintenance scheduling , 2008, Eur. J. Oper. Res..

[139]  Lixin Tang,et al.  A hybrid algorithm of tabu search and benders decomposition for multi-product production distribution network design , 2009, 2009 IEEE International Conference on Automation and Logistics.

[140]  Matteo Fischetti,et al.  Combinatorial Benders' Cuts for Mixed-Integer Linear Programming , 2006, Oper. Res..

[141]  Vipul Jain,et al.  Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems , 2001, INFORMS J. Comput..

[142]  Teodor Gabriel,et al.  Parallel Meta-heuristic Search , 2016 .

[143]  S. Elhedhli,et al.  A nested benders decomposition approach for telecommunication network planning , 2010 .

[144]  Gilbert Laporte,et al.  Benders Decomposition for Large-Scale Uncapacitated Hub Location , 2011, Oper. Res..

[145]  Richard M. Karp,et al.  The Implicit Hitting Set Approach to Solve Combinatorial Optimization Problems with an Application to Multigenome Alignment , 2013, Oper. Res..

[146]  Hui Lin,et al.  Exact and Heuristic Algorithms for Data-Gathering Cluster-Based Wireless Sensor Network Design Problem , 2014, IEEE/ACM Transactions on Networking.

[147]  Jean-François Cordeau,et al.  An integrated model for logistics network design , 2006, Ann. Oper. Res..

[148]  I. Grossmann,et al.  Convergence properties of generalized benders decomposition , 1991 .

[149]  Teodor Gabriel Crainic,et al.  Parallel Meta-Heuristics , 2010 .

[150]  Gautam Mitra,et al.  A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition , 2012, Math. Program. Comput..

[151]  Peiling Wu,et al.  A demand-shifting feasibility algorithm for Benders decomposition , 2003, Eur. J. Oper. Res..

[152]  Hanif D. Sherali,et al.  A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse , 2002, J. Glob. Optim..

[153]  T. Ralphs,et al.  Decomposition Methods , 2010 .

[154]  Halit Üster,et al.  Benders decomposition algorithms for the fixed-charge relay network design in telecommunications , 2014, Telecommun. Syst..

[155]  Michel Minoux,et al.  Mathematical Programming , 1986 .