Solving the p-hub Median Problem Under Intentional Disruptions Using Simulated Annealing

Hubs are special facilities designed to act as switching, transshipment and sorting points in various distribution systems. Since hub facilities concentrate and consolidate flows, disruptions at hubs could have large effects on the performance of a hub network. In this paper, we have formulated the multiple allocation p-hub median problem under intentional disruptions as a bi-level game model. In this model, the follower’s objective is to identify those hubs the loss of which would most diminish service efficiency. Moreover, the leader’s objective is to identify the set of hubs to locate in order to minimize expected transportation cost while taking normal and failure conditions into account. We have applied two algorithms based on simulated annealing to solve the defined problem. In addition, the algorithms have been calibrated using the Taguchi method. Computational experiments on different instances indicate that the proposed algorithms would be efficient in practice.

[1]  Alan T. Murray,et al.  Strategic Network Restoration , 2010 .

[2]  Bernd Wagner,et al.  HubLocator: an exact solution method for the multiple allocation hub location problem , 2002, Comput. Oper. Res..

[3]  Hande Yaman,et al.  Allocation strategies in hub networks , 2011, Eur. J. Oper. Res..

[4]  Andreas T. Ernst,et al.  Preprocessing and cutting for multiple allocation hub location problems , 2004, Eur. J. Oper. Res..

[5]  James F. Campbell.  Hub location for time definite transportation , 2009, Comput. Oper. Res..

[6]  Alfredo Marín,et al.  Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique , 2007, Eur. J. Oper. Res..

[7]  J. G. Klincewicz,et al.  A dual algorithm for the uncapacitated hub location problem , 1996 .

[8]  Sibel A. Alumur,et al.  Network hub location problems: The state of the art , 2008, Eur. J. Oper. Res..

[9]  James F. Campbell.  Hub Location and the p-Hub Median Problem , 1996, Oper. Res..

[10]  Maria Paola Scaparra,et al.  Analysis of facility protection strategies against an uncertain number of attacks: The stochastic R-interdiction median problem with fortification , 2011, Comput. Oper. Res..

[11]  Mostafa Hajiaghaei-Keshteli,et al.  Genetic algorithms for coordinated scheduling of production and air transportation , 2010, Expert Syst. Appl..

[12]  Oded Berman,et al.  Locating Facilities in the Presence of Disruptions and Incomplete Information , 2009, Decis. Sci..

[13]  Zvi Drezner,et al.  Heuristic Solution Methods for Two Location Problems with Unreliable Facilities , 1987 .

[14]  Vedat Verter,et al.  Incorporating the threat of terrorist attacks in the design of public service facility networks , 2012, Optim. Lett..

[15]  Zvi Drezner,et al.  Locating service facilities whose reliability is distance dependent , 2003, Comput. Oper. Res..

[16]  Samir Elhedhli,et al.  Hub-and-spoke network design with congestion , 2005, Comput. Oper. Res..

[17]  James F. Campbell,et al.  Integer programming formulations of discrete hub location problems , 1994 .

[18]  Madhan Shridhar Phadke,et al.  Quality Engineering Using Robust Design , 1989 .

[19]  Tung-Kuan Liu,et al.  Improved immune algorithm for global numerical optimization and job-shop scheduling problems , 2007, Appl. Math. Comput..

[20]  Stefan Nickel,et al.  Hub location problems in transportation networks , 2011 .

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

[22]  Jesse R. O'Hanley,et al.  Optimizing system resilience: A facility protection model with recovery time , 2012, Eur. J. Oper. Res..

[23]  Richard L. Church,et al.  Introduction to the Special Issue on Location Modeling , 2010 .

[24]  Raid Al-Aomar,et al.  Incorporating robustness into Genetic Algorithm search of stochastic simulation outputs , 2006, Simul. Model. Pract. Theory.

[25]  Genichii Taguchi,et al.  Introduction to quality engineering. designing quality into products a , 1986 .

[26]  Richard L. Church,et al.  On a bi-level formulation to protect uncapacitated p-median systems with facility recovery time and frequent disruptions , 2010, Electron. Notes Discret. Math..

[27]  Sungsoo Park,et al.  Efficient solution procedure and reduced size formulations for p-hub location problems , 1998, Eur. J. Oper. Res..

[28]  Mercedes Landete,et al.  New formulations for the uncapacitated multiple allocation hub location problem , 2006, Eur. J. Oper. Res..

[29]  Mohammad Mehdi Sepehri,et al.  Linear bilevel programming solution by genetic algorithm , 2002, Comput. Oper. Res..

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

[31]  Ricardo Saraiva de Camargo,et al.  Benders decomposition for the uncapacitated multiple allocation hub location problem , 2008, Comput. Oper. Res..

[32]  Sibel A. Alumur,et al.  Hub location under uncertainty , 2012 .

[33]  Mercedes Landete,et al.  New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem , 2012, Eur. J. Oper. Res..

[34]  Mark S. Daskin,et al.  Planning for Disruptions in Supply Chain Networks , 2006 .

[35]  Morton E. O’Kelly,et al.  Routing Traffic at Hub Facilities , 2010 .

[36]  Shine-Der Lee,et al.  On solving unreliable planar location problems , 2001, Comput. Oper. Res..

[37]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

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

[39]  G. Anandalingam,et al.  Genetic algorithm based approach to bi-level linear programming , 1994 .

[40]  David E. Boyce,et al.  A general bilevel linear programming formulation of the network design problem , 1988 .

[41]  Andreas T. Ernst,et al.  Efficient algorithms for the uncapac-itated single allocation p-hub median problem , 1996 .

[42]  Andreas T. Ernst,et al.  An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems , 1998, INFORMS J. Comput..

[43]  Deniz Aksen,et al.  A bilevel fixed charge location model for facilities under imminent attack , 2012, Comput. Oper. Res..

[44]  R. Roy.  A Primer on the Taguchi Method , 1990 .

[45]  D. Skorin-Kapov,et al.  Tight linear programming relaxations of uncapacitated p-hub median problems , 1996 .

[46]  Alfredo Marín,et al.  Uncapacitated Euclidean Hub Location: Strengthened Formulation, New Facets and a Relax-and-cut Algorithm , 2005, J. Glob. Optim..

[47]  Andreas T. Ernst,et al.  Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem , 1998 .

[48]  Mostafa Zandieh,et al.  Scheduling open shops with parallel machines to minimize total completion time , 2011, J. Comput. Appl. Math..

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

[50]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[51]  U. Wen,et al.  A simple Tabu Search method to solve the mixed-integer linear bilevel programming problem , 1996 .

[52]  M. S. Phadke,et al.  Quality Engineering using Design of Experiments , 1989 .

[53]  T. R. Bement,et al.  Taguchi techniques for quality engineering , 1995 .

[54]  Ue-Pyng Wen,et al.  A hybrid neural network approach to bilevel programming problems , 2007, Appl. Math. Lett..

[55]  M. P. Scaparra,et al.  Optimizing Protection Strategies for Supply Chains: Comparing Classic Decision-Making Criteria in an Uncertain Environment , 2011 .

[56]  Jesse R. O'Hanley,et al.  Designing robust coverage networks to hedge against worst-case facility losses , 2008, Eur. J. Oper. Res..

[57]  Zvi Drezner,et al.  A defensive maximal covering problem on a network , 2009, Int. Trans. Oper. Res..

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

[59]  Bor-Wen Cheng,et al.  A study on flowshop scheduling problem combining Taguchi experimental design and genetic algorithm , 2007, Expert Syst. Appl..

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

[61]  Richard L. Church,et al.  A bilevel mixed-integer program for critical infrastructure protection planning , 2008, Comput. Oper. Res..

[62]  Li Hecheng,et al.  Exponential distribution-based genetic algorithm for solving mixed-integer bilevel programming problems , 2008 .

[63]  Mostafa Zandieh,et al.  An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness , 2009, Expert Syst. Appl..

[64]  Anthony Chen,et al.  Network-based Accessibility Measures for Vulnerability Analysis of Degradable Transportation Networks , 2007 .

[65]  Rafay Ishfaq,et al.  Production , Manufacturing and Logistics Hub location – allocation in intermodal logistic networks , 2010 .

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

[67]  James F. Campbell,et al.  Location and allocation for distribution systems with transshipments and transportion economies of scale , 1993, Ann. Oper. Res..

[68]  Maria Paola Scaparra,et al.  Hedging against disruptions with ripple effects in location analysis , 2012 .

[69]  Lih-Yuan Deng,et al.  Orthogonal Arrays: Theory and Applications , 1999, Technometrics.

[70]  Alistair I. Mees,et al.  Convergence of an annealing algorithm , 1986, Math. Program..

[71]  Richard L. Church,et al.  The stochastic interdiction median problem with disruption intensity levels , 2012, Ann. Oper. Res..

[72]  R. J. Kuo,et al.  Application of particle swarm optimization algorithm for solving bi-level linear programming problem , 2009, Comput. Math. Appl..

[73]  Horst W. Hamacher,et al.  Adapting polyhedral properties from facility to hub location problems , 2004, Discret. Appl. Math..

[74]  Richard L. Church,et al.  Identifying Critical Infrastructure: The Median and Covering Facility Interdiction Problems , 2004 .