Depot location in degradable transport networks

Areas subject to natural or man-made disasters, such as earthquakes, fires, floods or attacks, are reliant on the residual transport network for the rescue of survivors and subsequent recovery. Pre-disaster planning requires assumptions about how the transport network may degrade. This paper presents a game theoretic approach modelling network degradation and applies this to depot location, with a case study based on Sichuan province in China, which is prone to earthquakes. To facilitate a cautious approach to depot location, the method assumes that the transport network is subject to attack by node-specific demons with the power to degrade links. The mixed strategy Nash equilibrium for the non-cooperative zero sum game between dispatchers and demons is used to define rescue hyperpaths. These in turn define the best depot locations. Two forms of the drop heuristic are used to find good depot locations.

[1]  George L. Vairaktarakis,et al.  Incorporation dynamic aspects and uncertainty in 1‐median location problems , 1999 .

[2]  Seokjin Kim,et al.  Facility location for large-scale emergencies , 2010, Ann. Oper. Res..

[3]  Alfred A. Kuehn,et al.  A Heuristic Program for Locating Warehouses , 1963 .

[4]  Mei-Shiang Chang,et al.  A scenario planning approach for the flood emergency logistics preparation problem under uncertainty , 2007 .

[5]  Maged Dessouky,et al.  A modeling framework for facility location of medical services for large-scale emergencies , 2007 .

[6]  Jiuh-Biing Sheu,et al.  Challenges of emergency logistics management , 2007 .

[7]  Michel Balinski,et al.  Integer Programming: Methods, Uses, Computations , 1965 .

[8]  Mark A. Turnquist,et al.  Pre-positioning of emergency supplies for disaster response , 2010 .

[9]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[10]  Charles ReVelle,et al.  Central Facilities Location , 2010 .

[11]  R. Sridharan.  The capacitated plant location problem , 1995 .

[12]  Polly Bart,et al.  Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph , 1968, Oper. Res..

[13]  F. E. Maranzana,et al.  On the Location of Supply Points to Minimize Transport Costs , 1964 .

[14]  R Tavakoli Moghadam,et al.  Applying Scatter Search Algorithm Based on TOPSIS to Multi-Objective Cellular Manufacturing System Design , 2010 .

[15]  J. Reese,et al.  Solution methods for the p-median problem: An annotated bibliography , 2006 .

[16]  Michael Florian,et al.  Optimal strategies: A new assignment model for transit networks , 1989 .

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  Nezih Altay,et al.  OR/MS research in disaster operations management , 2006, Eur. J. Oper. Res..

[19]  Zhi-Hua Hu,et al.  Post-disaster evacuation and temporary resettlement considering panic and panic spread , 2014, Transportation Research Part B: Methodological.

[20]  Benita M. Beamon,et al.  Facility location in humanitarian relief , 2008 .

[21]  Charles S. ReVelle,et al.  The Location of Emergency Service Facilities , 1971, Oper. Res..

[22]  Horst A. Eiselt,et al.  A bibliography for some fundamental problem categories in discrete location science , 2008, Eur. J. Oper. Res..

[23]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[24]  Fumitaka Kurauchi,et al.  A Game Theoretic Approach to the Determination of Hyperpaths in Transportation Networks , 2009 .

[25]  R. A. Whitaker.  A Tight Bound Drop Exchange Algorithm for Solving the p Median Problem , 1981 .

[26]  Seyed Jafar Sadjadi,et al.  A robust optimization model for p-median problem with uncertain edge lengths , 2010 .

[27]  David Alexander,et al.  Review of "World Disasters Report 1994", by International Federation of Red Cross and Red Crescent Societies , 1996 .

[28]  Richard L. Church,et al.  The maximal covering location problem , 1974 .

[29]  I. Averbakh,et al.  Minimax regret p-center location on a network with demand uncertainty , 1997 .

[30]  Bintong Chen,et al.  Minmax‐regret robust 1‐median location on a tree , 1998 .

[31]  Masoud Yaghini,et al.  AN EFFICIENT HYBRID METAHEURISTIC FOR CAPACITATED P-MEDIAN PROBLEM , 2010 .

[32]  T. L. Ray,et al.  Warehouse Location Under Continuous Economies of Scale , 1966 .

[33]  Maged M. Dessouky,et al.  Solution approaches for facility location of medical supplies for large-scale emergencies , 2007, Comput. Ind. Eng..

[34]  Rainer E. Burkard,et al.  Robust location problems with pos/neg weights on a tree , 2001, Networks.

[35]  Xiangtong Qi,et al.  A logistics scheduling model: scheduling and transshipment for two processing centers , 2006 .

[36]  Lawrence V. Snyder,et al.  Facility location under uncertainty: a review , 2006 .

[37]  Horst A. Eiselt,et al.  Location analysis: A synthesis and survey , 2005, Eur. J. Oper. Res..

[38]  Shaligram Pokharel,et al.  Optimization models in emergency logistics: A literature review , 2012 .

[39]  John E. Bell,et al.  Location optimization of strategic alert sites for homeland defense , 2011 .

[40]  Alexander Skabardonis,et al.  A spatial queuing model for the emergency vehicle districting and location problem , 2009 .

[41]  Oded Berman,et al.  Algorithms for the robust 1-center problem on a tree , 2000, Eur. J. Oper. Res..

[42]  S. Hakimi.  Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems , 1965 .

[43]  Isabel Correia,et al.  Facility Location Under Uncertainty , 2015 .

[44]  Igor Averbakh,et al.  Complexity of Robust Single Facility Location Problems on Networks with Uncertain Edge Lengths , 2003, Discret. Appl. Math..

[45]  Debarati Guha-Sapir,et al.  Annual Disaster Statistical Review 2009The numbers and trends , 2010 .

[46]  Vladimir Marianov,et al.  The P-median problem in a changing network: The case of Barcelona , 1998 .