Multi-Depot Multi-Trip Vehicle Routing with Total Completion Time Minimization

TL;DR

This paper introduces a new vehicle routing problem tailored for UAV rescue missions in disaster scenarios, providing a mathematical model and a fast heuristic solution applicable to various multi-depot multi-trip routing challenges.

Contribution

It formulates the novel MDMT-VRP-TCT problem, develops a MILP model, and proposes a matheuristic framework for efficient large-instance solutions.

Findings

The matheuristic effectively solves large problem instances.

The model accurately captures UAV rescue routing constraints.

Experimental results demonstrate solution quality and computational efficiency.

Abstract

Unmanned aerial vehicles (UAVs) are aircraft whose flights can be fully autonomous without any provision for human intervention. One of the most useful and promising domains where UAVs can be employed is natural disaster management. In this paper, we focus on an emergency scenario and propose the use of a fleet of UAVs that help rescue teams to individuate people needing help inside an affected area. We model this situation as an original graph theoretical problem called Multi-Depot Multi-Trip Vehicle Routing Problem with Total Completion Times minimization (MDMT-VRP-TCT); we go through some problems already studied in the literature that appear somehow similar to it and highlight the differences, propose a mathematical formulation for our problem as a MILP, design a matheuristic framework to quickly solve large instances, and experimentally test its performance. Beyond the proposed application, our solution works in any case in which a multi-depot multi-trip vehicle routing problem must be solved.