Logistics Scheduling for UAV Based on Tabu Search Algorithm

Abstract

To improve the flexibility and efficiency of the logistics distribution system, a new type of logistics distribution mode, namely the Unmanned Aerial Vehicle and Shared Reception Box (UAV-SRB) logistics distribution mode, is studied. In this paper, we consider logistics scheduling problem of using multiple homogeneous UAVs to transport a batch of packages from one logistics center to multiple SRBs. The optimizing objective of this problem is to minimize the average mission execution time of UAVs. In addition, considering the capacity constraints of UAVs, a corresponding single-objective mathematical model is established. Combined with the actual logistics situation, we propose an Adaptive Tabu Search Algorithm (ATSA) to solve this problem. In order to improve the optimization performance, the algorithm designs adaptive tabu length and divides neighborhood space into several subsets according to different destinations. By comparing with other two heuristic algorithms (LSA and SA), the proposed algorithm is proved to be robust and effective for the research problem.