A Multi-Period Evacuation Vehicle Routing Problem Model

Abstract:

In this paper, we proposed an optimization model that addresses the evacuation routing problem for flood disaster when evacuees trying to move from affected areas to safe places using public transportation. A focus is on the situation of evacuating during high water level when special high vehicles are needed. The objective is to minimize the total traveled distance through evacuation periods where a limited number of vehicles is given. We formulated the problem as a mixed integer programming model based on the capacitated vehicle routing problem with multiple evcuation periods where demand changing by the time. The proposed model has been tested on a real-world case study affected by the severe flooding in Thailand, 2011.

• Periodical: Advanced Materials Research (Volumes 931-932)
• Pages: 578-582
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.931-932.578
• Online since: May 2014
• Authors: Sunarin Chanta*, Ornurai Sangsawang
• Keywords: Evacuation, Flooding, Multi-Period, Vehicle Routing Problem

References

[1] Debby Guha-Sapir, Femke Vos, Regina Below with Sylvain Ponserre. Annual Disaster Statistical Review 2011: The numbers and trends. WHO collaborating Centre for Research on the Epidemiology of Disasters – CRED, Universite Catholique de Louvain, (2011).

[2] G.B. Dantzig, and J.H. Ramser. The truck dispatching problem. Management Science, 6(1), 1959, 80-91.

DOI: 10.1287/mnsc.6.1.80

[3] C. Malandraki and M.S. Daskin MS, Time dependent vehicle routing problems: formulations, properties and heuristic algorithms. Transportation Science, 26(3), 1992, 185-200.

DOI: 10.1287/trsc.26.3.185

[4] S. Ichoua, M. Gendreau, and J.Y. Potvin, Vehicle dispatching with time-dependent travel times. European Journal of Operational Research, 144(2), 2003, 379-96.

DOI: 10.1016/s0377-2217(02)00147-9

[5] A.L. Kok, E. W. Hans, and J.M.J. Schutten, Vehicle routing under time-dependent travel times: The impact of congestion avoidance. Computers & Operations Research, 39, 2012, 910-918.

DOI: 10.1016/j.cor.2011.05.027

[6] B.L. Golden, T.L. Magnanti, T.L., and H.Q. Nguyen, Implementing vehicle routing algorithms. Networks, 7(2), 1977, 113-148.

DOI: 10.1002/net.3230070203

[7] C.E. Miller, A.W. Tucker, R.A. Zemlin, Integer programming formulations and traveling salesman problems, Journal of the Association for Computing Machinery, 7, 1960, 326-329.

DOI: 10.1145/321043.321046

[8] Kara, I., Laporte, G., and Bektas, T. A note on the lifted Miller–Tucker–Zemlin subtour elimination constraints for the capacitated vehicle routing problem. European Journal of Operational Research, 158, 2004, 793-795.

DOI: 10.1016/s0377-2217(03)00377-1

[9] City Municipality, http: /www. ladsawai. go. th/about/15/, last accessed on 26 December, (2013).

[10] S. Saenwiset, and S. Pondet, A study on the behavior of flood victims and transportation plan for evacuating victims to safe point. Special Project for Bachelor of Industrial Management, King Monkut's University of Technology North Bangkok, (2012).

[11] P. Sandee, and A. Chamnanmoh, A study on vehicle routing for flooding evacuation at high water level. Special Project for Bachelor of Industrial Management, King Monkut's University of Technology North Bangkok, (2012).