A time-dependent vehicle routing problem for disaster response phase in multi-graph-based network

Logistics planning in disaster response phase involves dispatching commodities such as medical materials, personnel, food, etc. to affected areas as soon as possible to accelerate the relief operations. Since, transportation vehicles in disaster situations can be considered as scarce resources, thus, the efficient usage of them is substantially important. In this study, we provide a dynamic vehicle routing model for emergency logistics operations in the occurrence of natural disasters. The aim of the model is to find optimal routes for a fleet of vehicles to give emergency commodities to a set of affected areas by considering the existence of more than one arc between each two nodes in the network (multi-graph network). Proposed model considers FIFO property and focused on minimization of waiting time and total number of vehicles. Various problem instances have been provided to indicate the efficiency of the model. Finally, a brief sensitivity analysis is presented to investigate the impact of different parameters on the obtained solutions.

Keywords:

Time-dependent vehicle routing problem , Multi-graph , FIFO property , Disaster relief , Service time