Abstract
Unmanned aerial vehicles (UAVs) or simply drones are a fast growing technology with many applications in several sectors, one of them being the transportation of pharmaceuticals. In this work, we study the use of UAVs for transporting pharmaceuticals between hospitals, and we solve the specific problem of the placement of the stations where the UAVs will be based and controlled. The aim of this work is to calculate the minimum number of drone stations required, as well as their locations, to connect a set of hospitals. To achieve this, we consider both the range of the drones and the operational range of the stations, which is defined by the distance over which a drone can be controlled. We initially identify and exclude hospitals that cannot be served because they are beyond the range of drones or stations. Then, we apply a heuristic algorithm to generate an initial set of potential locations for the stations. This solution is given as input to a metaheuristic algorithm that is an adaptation of the well-known Tabu search algorithm. This algorithm improves the initial solution through an iterative process. We evaluated our algorithm through both numerical experiments and a realistic case study, confirming its efficiency and applicability to the task at hand.

This publication has 14 references indexed in Scilit: