Relief Mapping Assessment using Two-Echelon Vehicle Routing Problem with Drone

This study considers the two-echelon vehicle routing problem using drones in the postdisaster situation. The problem takes into account using a collaboration between a drone with a ground vehicle to conduct an information gathering so-called mapping operation. Each ground vehicle is associated with a drone. The first echelon depicts the routes travelled from depot to stopover point and from a stopover point to another stopover point. The first echelon is travelled by a ground vehicle to extend the limitation of drone's range coverage to gather information. The second echelon is the assignment of the drone to the target point. A target point is an area being mapped or in this case that is affected by the disaster. The problem is modelled as an integer linear programming problem denoted as 2EVRP-MOD. It is assumed that drone can only be released from a stopover point. The mapping operation is associated with the amount of area being covered at each target area. The objective is to minimize the total mapping operation time. The entire mapping operation time is limited by the drone flying capacity limit. The model is tested on a real-case dataset in Bekasi, Indonesia. The computational results show that the model can effectively provide a solution for the 2EVRP-MOD.