Metaheuristic Framework for a Disaster Logistics Problem with Time-Dependent Demands

This paper addresses a novel capacitated vehicle routing problem with time-dependent demands (CVRP-TDD) arising in a relief distribution situation in a region struck by the disaster. The locations closest to the epicenter are the ones hit hardest and the natural reaction of survivors is to flee from these points, called critical nodes. Lacks or delays in relief distribution amplify this behavior. To reduce this phenomenon, we aim to maximize the demand satisfied at the critical nodes. We present an optimal splitting procedure and a metaheuristic framework that can execute four different methods, by changing only three parameters. The results shows the good performance of two methods and highlight the efficiency of the splitting procedure.