Benders Decomposition for Bi-objective Linear Programs

In this paper, we develop a new decomposition technique for solving bi-objective linear programming problems. The proposed methodology combines the bi-objective simplex algorithm with Benders decomposition and can be used to obtain a complete set of extreme efficient solutions, and the corresponding set of extreme non-dominated points, for a bi-objective linear program. Using a Benders-like reformulation, the decomposition approach decouples the problem into a bi-objective master problem and a bi-objective subproblem, each of which is solved using the bi-objective parametric simplex algorithm. The master problem provides candidate extreme efficient solutions that the subproblem assesses for feasibility and optimality. As in standard Benders decomposition, optimality and feasibility cuts are generated by the subproblem and guide the master problem solve. This paper discusses bi-objective Benders decomposition from a theoretical perspective, proves the correctness of the proposed reformulation and addresses the need for so-called weighted optimality cuts. Furthermore, we present an algorithm to solve the reformulation and discuss its performance for three types of bi-objective optimisation problems.

[1]  D. Morton,et al.  Bi-objective multistage stochastic linear programming , 2022, Mathematical Programming.

[2]  H. Soleimani,et al.  Coordinated routing system for fire detection by patrolling trucks with drones , 2022, International Journal of Disaster Risk Reduction.

[3]  Stephen J. Maher.  Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework , 2021, Eur. J. Oper. Res..

[4]  Nicolas Jozefowiez,et al.  Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems , 2020, Eur. J. Oper. Res..

[5]  Sophie N. Parragh,et al.  A branch-and-Benders-cut algorithm for a bi-objective stochastic facility location problem , 2020, OR Spectrum.

[6]  Iván A. Contreras,et al.  Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design , 2019, Comput. Oper. Res..

[7]  Hassan Mina,et al.  An accelerated benders decomposition algorithm for a bi-objective green closed loop supply chain network design problem , 2019, Journal of Cleaner Production.

[8]  Natalia Kliewer,et al.  Robust Efficiency in Urban Public Transportation: Minimizing Delay Propagation in Cost-Efficient Bus and Driver Schedules , 2019, Transp. Sci..

[9]  Seyed Taghi Akhavan Niaki,et al.  A bi-objective robust optimization model for a blood collection and testing problem: an accelerated stochastic Benders decomposition , 2018, Annals of Operations Research.

[10]  Nicolas Jozefowiez,et al.  Column generation algorithms for bi-objective combinatorial optimization problems with a min–max objective , 2018, EURO J. Comput. Optim..

[11]  Nicolas Jozefowiez,et al.  An Exact Column Generation-Based Algorithm for Bi-objective Vehicle Routing Problems , 2018, ISCO.

[12]  David Pisinger,et al.  A Branch-and-Price algorithm for railway rolling stock rescheduling , 2017 .

[13]  Juan José Salazar González,et al.  Optimal Solutions to a Real-World Integrated Airline Scheduling Problem , 2017, Transp. Sci..

[14]  Germán Méndez-Giraldo,et al.  A Column Generation Approach for Solving a Green Bi-objective Inventory Routing Problem , 2016, IBERAMIA.

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

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

[17]  Matthias Ehrgott,et al.  A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem , 2015, Eur. J. Oper. Res..

[18]  R. Vanderbei,et al.  A parametric simplex algorithm for linear vector optimization problems , 2015, Math. Program..

[19]  Roberto Roberti,et al.  The Fixed Charge Transportation Problem: An Exact Algorithm Based on a New Integer Programming Formulation , 2015, Manag. Sci..

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

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

[22]  Laurence A. Wolsey,et al.  Covering Linear Programming with Violations , 2014, INFORMS J. Comput..

[23]  Nicolas Jozefowiez,et al.  Column Generation for Bi-Objective Vehicle Routing Problems with a Min-Max Objective , 2013, ATMOS.

[24]  Ehsan Salari,et al.  A column-generation-based method for multi-criteria direct aperture optimization , 2013, Physics in medicine and biology.

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

[26]  Yash P. Aneja,et al.  Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron , 2012, Oper. Res..

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

[28]  Harold P. Benson,et al.  An Outer Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple Objective Linear Programming Problem , 1998, J. Glob. Optim..

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

[30]  J. Cohon,et al.  Generating multiobjective trade-offs: an algorithm for bicriterion problems , 1979 .

[31]  Heinz Isermann,et al.  Technical Note - Proper Efficiency and the Linear Vector Maximum Problem , 1974, Oper. Res..

[32]  Ralph E. Steuer,et al.  A revised simplex method for linear multiple objective programs , 1973, Math. Program..

[33]  Matthias Ehrgott,et al.  A comparison of stochastic programming and bi-objective optimisation approaches to robust airline crew scheduling , 2011, OR Spectr..

[34]  Matthias Ehrgott,et al.  Column Generation in Integer Programming with Applications in Multicriteria Optimization , 2007 .

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

[36]  N. Kagan,et al.  A Benders' decomposition approach to the multi-objective distribution planning problem , 1993 .

[37]  Y. Aneja,et al.  BICRITERIA TRANSPORTATION PROBLEM , 1979 .

[38]  E. Polak,et al.  On Multicriteria Optimization , 1976 .