An enhanced genetic algorithm for unmanned aerial vehicle logistics scheduling
Xiaoxiang Yuan, Jie Zhu, Yixuan Li, Haiping Huang, Min Wu
Abstract
Abstract This paper examines a scheduling problem with heterogeneous logistics unmanned aerial vehicles (UAVs) in urban environment. Different from traditional vehicle routing problem (VRP), it introduces some new characteristics such as the loading capacity, the maximum flight time and the flight speed. As a variant of VRP, the considered scheduling problem is known to be an non‐deterministic Polynomial (NP)‐hard problem. The UAV scheduling problem model with the heterogeneous UAV settings is formulated first. Secondly, a genetic‐based algorithm framework is presented for solving the scheduling problem, in which the encoding/decoding method, the initial population generation method and genetic operations are delicately designed. In order to reduce the search space and faster the execution of this algorithm, a weight‐based loading method is adopted. For the purpose of performance evaluation and statistical analysis, the proposed algorithm is compared with the other two existing algorithms. The experimental results show that the presented algorithm can solve this problem efficiently.