Journal of Transportation Research

Journal of Transportation Research

A New Mathematical Model for a Multi-depot Vehicle Routing Problem in a Natural Disaster Situation and Solving by a Particle Swarm Optimization Algorithm

Authors
Saviz Saei 1
Ali Tavakoli-Moghaddam 2
Mehdi Alinaghian 3
1 Graduated M.Sc., Department of Industrial Engineering, Science & Research Branch, Islamic Azad University, Tehran, Iran
2 Professor, Department of Industrial Engineering & Systems, College of Engineering, University of Tehran, Tehran, Iran
3 Assistant Professor, Department of Industrial Engineering & Systems, Isfahan University of Technology, Isfahan
Abstract
Relief operation in a natural disaster situation is one of the applications of transportation problems. Transportation of the victims to the relief places such as hospitals, evacuation of afflicted areas is an important issue in the critical events, such as flood and earthquake. In this paper, a new mathematical model for a multi-depot vehicle routing problem is proposed that minimizes the earliest time of vehicles to the hospital depots. In this regard, vehicles are moved from started depots to critical places and then loaded the victims to take them to the hospitals. Afterwards in order to show its validation, the presented model is solved for small-sized problems by the Lingo software. Furthermore, it is solved for large-sized problems by particle swarm optimization (PSO) and improved PSO. Finally, the obtained results are compared and analyzed.
Keywords
Multi-depot vehicle routing problem
Natural disaster situation
Particle swarm optimization
-Sheu, J.B. (2007). Challenges of Emergency Logistics Management. Transportation Research Part E: Logistics and Transportation Review, 655-659.
-J.B. (2007). An emergency logistics distribution approach for quick response to urgent reliefdemand in disasters. Transportation Research Part E: Logistics and Transportation Review, 687-709.
-Altay, N., & Green, W. (2006). OR/MS research in disaster operations management. European Journal of Operation Research, 475-493.
-Berkone, D., Renaud, j., Rekik, M., & Ruiz, A. (2012). Transportation in disaster response operations. Socio-Economic Planning Science, 23-32.
Caunhye, A., Nie, X., & Pokharel, S. (2012). Optimization models in emergency logistics: A literature review. Socio-Economic Planning Sciences, 4-13.
-Ngueveu, S., Prins, C., & Wolfler Calvo, R. (2010). An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Computers and OPerations Research, 1877-1885.
-Jotshi, A., Gong, Q., & Batta, R. (2009). Dispatching and routing of emergency vehicles in disaster mitigation using data fusion. Socio-Economic Planning Sciences, 1-24.
-Haghani, A., & Chang Oh, S. (1996). Formulation and solution of a multi-commodity, multi-modal network flow model for disaster relief operations. Transportation Research Part A: Policy and Practice, 231-250.
-Barbarosoglu, G., Ozdamar, L., & Cevik, A. (2002). An interactive approach for hierarchical analysis of helicopter logistics in disaster relief operations. European Journal of Operation Research, 118-133.
-Ozdamar, L., Ekinci, E., & Kucukyazici. (2004). Emergency Logistics Planning in Natural Disasters. annals of Operations Research, 217-245.
-Tzeng, G., Cheng, H., & Huang, T. (2007). Multi-objective optimal planning for designing relief delivery systems. Transportation Research Part E: Logistics and Transportation Review, 673-686.
-Chern, C., Chen, y., & Kung, L. (2010). A heuristic relief transportation planning algorithm for emergency supply chain management. International Journal of Computer Mathematics, 1638-1664.
-Campbell, A., Vandebussche, D., & Hermann, W. (2008). Routing for Relief Efforts. Transportation Science, 127-145.
-Chang, C., & Chang, C. (2000). A linearization method for mixed 0–1 polynomial programs. Computers & Operations Research, 1005-1016.
-Glover, F., & Woolsey, E. (1974). Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program. Operation Research, 180-182.
-Eberhart, R., & Shi, Y. (1998). Comparison between genetic algorithms and particle swarm optimization. EvolutionaryProgramming VII Lecture Notes in Computer Science, 611-616.
-Osman, C. (1993). Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operation Research 41 , 421-451.
-Kennedy, J. R. (1997). A discrete binary version of the particle swarm algorithm. Systems, Man and Cybernetics (pp. 4104-4108(.