Model of debris collection operation after disasters and its application in urban area

Management of debris is a concern after any major disaster. In particular, debris removal after a disaster presents challenges unique to that disaster. Often, the debris removal process takes months or even years to finish. It is likely to be a concern for some time to come since there exists many factors that make it such a costly and complex operation. The cost is mostly arising from the cost of collection and transportation to the disposal sites. The debris collection and transportation routing problem is the subject of this study. The debris collection operation after disasters is a new capacitated arc routing problem (CARP). The uniqueness of this problem is due to the limited access from one section to the other, as a result of the blocked access by debris. Therefore a new constraint, which is developed in this study as access possibility constraint, has been added to the classical CARP. A tabu search meta-heuristics is also proposed to solve the augmented CARP formulation for the debris collection operation problem. Case studies on a test network as well as on realistic instances based on estimates of debris due to likely large-scale natural disaster in the Tokyo Metropolitan Area have also been reported at the end under various scenarios such as with or without intermediate depot as well as single vs. multiple vehicles (groups) operation.

[1]  Jafar Nouri,et al.  Strategic Management of Municipal Debris aftermath of an earthquake , 2008 .

[2]  Linet Özdamar,et al.  A dynamic logistics coordination model for evacuation and support in disaster response activities , 2007, Eur. J. Oper. Res..

[3]  Gilbert Laporte,et al.  A unified tabu search heuristic for vehicle routing problems with time windows , 2001, J. Oper. Res. Soc..

[4]  Roberto Baldacci,et al.  Exact methods based on node‐routing formulations for undirected arc‐routing problems , 2006, Networks.

[5]  G. Laporte,et al.  Discrete Optimization The multi-depot vehicle routing problem with inter-depot routes , 2007 .

[6]  Ángel Corberán,et al.  Separating capacity constraints in the CVRP using tabu search , 1998, Eur. J. Oper. Res..

[7]  Jiuh-Biing Sheu,et al.  An emergency logistics distribution approach for quick response to urgent relief demand in disasters , 2007 .

[8]  V. Popov,et al.  Waste Management And the Environment III , 2006 .

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

[10]  Nagahisa Hirayama,et al.  Establishment of disaster debris management based on quantitative estimation using natural hazard maps , 2010 .

[11]  Wen Lea Pearn,et al.  Transforming arc routing into node routing problems , 1987, Comput. Oper. Res..

[12]  Jiuh-Biing Sheu,et al.  A REVERSE LOGISTICS COST MINIMIZATION MODEL FOR THE TREATMENT OF HAZARDOUS WASTES , 2002 .

[13]  M. Dror Arc Routing : Theory, Solutions and Applications , 2000 .

[14]  Eiichi Taniguchi,et al.  UNDIRECTED CAPACITATED ARC ROUTING PROBLEM IN DEBRIS COLLECTION OPERATION AFTER DISASTERS , 2012 .

[15]  Bruce L. Golden,et al.  Chapter 5 Arc routing methods and applications , 1995 .

[16]  Gilbert Laporte,et al.  Modeling and Optimization of Vehicle Routing and Arc Routing Problems , 2006 .

[17]  Nicos Christofides The optimum traversal of a graph , 1973 .

[18]  Michel Gendreau,et al.  Arc Routing Problems, Part II: The Rural Postman Problem , 1995, Oper. Res..

[19]  Marcus Poggi de Aragão,et al.  Solving capacitated arc routing problems using a transformation to the CVRP , 2006, Comput. Oper. Res..

[20]  Kamlesh Mathur,et al.  Stochastic Vehicle Routing Problem with Restocking , 2000, Transp. Sci..

[21]  Michel Gendreau,et al.  An Introduction to Tabu Search , 2003, Handbook of Metaheuristics.

[22]  Michel Gendreau,et al.  Arc routing problems with time-dependent service costs , 2007, Eur. J. Oper. Res..

[23]  André Langevin,et al.  Synchronized arc routing for snow plowing operations , 2012, Comput. Oper. Res..

[24]  Wei Yi,et al.  Ant Colony Optimization for Disaster Relief Operations , 2007 .

[25]  Uwe Clausen,et al.  Dynamic vehicle routing with anticipation in disaster relief , 2012 .

[26]  Susana Relvas,et al.  Design and planning of supply chains with integration of reverse logistics activities under demand uncertainty , 2013, Eur. J. Oper. Res..

[27]  Gilbert Laporte,et al.  Arc Routing Problems, Part I: The Chinese Postman Problem , 1995, Oper. Res..

[28]  Maria Grazia Speranza,et al.  The periodic vehicle routing problem with intermediate facilities , 2002, Eur. J. Oper. Res..

[29]  Bruce L. Golden,et al.  Computational experiments with algorithms for a class of routing problems , 1983, Comput. Oper. Res..

[30]  Alain Hertz,et al.  Bounds and Heuristics for the Shortest Capacitated Paths Problem , 2002, J. Heuristics.

[31]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Capacitated Arc Routing Problem , 2000, Oper. Res..