An accelerated Benders decomposition algorithm for reliable facility location problems in multi-echelon networks

Abstract In this paper, we present an accelerated Benders decomposition algorithm for solving the multi-echelon reliable capacitated facility location problem (ME-RCFLP). The objective is a tradeoff between system reliability, and total investment and operational costs while the facilities can be “hardened” (Increase their capacity and decrease their probability of full and partial failure) with more cost. We allow the facilities to have different partial and full failure rates, and more than one facility may be assigned to a client (partial assignment). A new scenario-based formulation is proposed for the problem to effectively cover the outcomes of uncertainty and it is used to introduce an efficient Benders decomposition algorithms as well as a sample average approximation algorithm (SAA) for solving the ME-RCFLP. Computational results show the validity of the proposed model and the efficiency of the proposed solution methods in solving the problem.

[1]  Oded Berman,et al.  Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects , 2007, Oper. Res..

[2]  Shabbir Ahmed,et al.  Supply chain design under uncertainty using sample average approximation and dual decomposition , 2009, Eur. J. Oper. Res..

[3]  Alper Murat,et al.  A swarm intelligence based sample average approximation algorithm for the capacitated reliable facility location problem , 2013 .

[4]  Georgios K. D. Saharidis,et al.  Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach , 2013, Ann. Oper. Res..

[5]  Hamidreza Maghsoudlou,et al.  Bi-objective optimization of a three-echelon multi-server supply-chain problem in congested systems: Modeling and solution , 2016, Comput. Ind. Eng..

[6]  Sarah Root,et al.  Supply chain design considering correlated failures and inspection in pharmaceutical and food supply chains , 2017, Comput. Ind. Eng..

[7]  Francisco Saldanha-da-Gama,et al.  Comparing classical performance measures for a multi-period, two-echelon supply chain network design problem with sizing decisions , 2013, Comput. Ind. Eng..

[8]  Yanfeng Ouyang,et al.  A continuum approximation approach to reliable facility location design under correlated probabilistic disruptions , 2010 .

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

[10]  Fariborz Jolai,et al.  Robust and reliable forward–reverse logistics network design under demand uncertainty and facility disruptions , 2014 .

[11]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .

[12]  Yanfeng Ouyang,et al.  Reliable Facility Location Design Under the Risk of Disruptions , 2010, Oper. Res..

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

[14]  Madjid Tavana,et al.  Multi-objective multi-layer congested facility location-allocation problem optimization with Pareto-based meta-heuristics , 2016 .

[15]  Qingwei Li,et al.  Reliable facility location design under disruptions , 2013, Comput. Oper. Res..

[16]  David P. Morton,et al.  Monte Carlo bounding techniques for determining solution quality in stochastic programs , 1999, Oper. Res. Lett..

[17]  Alexander Shapiro,et al.  The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study , 2003, Comput. Optim. Appl..

[18]  Lawrence V. Snyder,et al.  Reliability Models for Facility Location: The Expected Failure Cost Case , 2005, Transp. Sci..

[19]  Mark S. Daskin,et al.  A facility reliability problem: Formulation, properties, and algorithm , 2010 .

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

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

[22]  Yves Dallery,et al.  Scheduling of loading and unloading of crude oil in a refinery using event-based discrete time formulation , 2009, Comput. Chem. Eng..

[23]  E. Pohl,et al.  Sample average approximation applied to the capacitated-facilities location problem with unreliable facilities , 2009 .

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

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

[26]  Bashiri Mahdi,et al.  HEURISTIC METHODS BASED ON MINLP FORMULATION FOR RELIABLE CAPACITATED FACILITY LOCATION PROBLEMS , 2015 .

[27]  Hamidreza Navidi,et al.  A new approach to cooperative competition in facility location problems: Mathematical formulations and an approximation algorithm , 2017, Comput. Oper. Res..

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

[29]  Zuo-Jun Max Shen,et al.  The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation Algorithms , 2011, INFORMS J. Comput..

[30]  Andrew Lim,et al.  Reliable logistics networks design with facility disruptions , 2011 .