A vlos compliance solution to ground/aerial parcel delivery problem

This paper presents an exact solution and a heuristic solution to a UAV-Assisted parcel delivery problem, in which UAVs can only be operated in Visual-Line-Of-Sight (VLOS) areas. In our proposed problem, we assume that trucks travel on road networks, and UAVs move in Euclidean spaces and can launch at any locations on roads. We first demonstrate the overview of our exact solution that iterates all permutations of destinations for an optimal delivery route. Given a specific delivery order, an intuitive approach needs to check all possible locations on roads in the VLOS areas and find a globally optimal location for every destination if UAVs are used for delivery. To avoid high computational cost of searching the optimal location at runtime, we propose an advanced index-based alternative, which computes optimal delivery routes in a pre-processing stage. Due to the nature of NP-hard problems, we also propose a heuristic approach that utilizes delivery groups for the proposed problem of practical size. All proposed solutions are evaluated through extensive experiments.