关键词: 禁飞区, 时间依赖, 电动车-无人机协同配送, 同时取送货, 自适应大邻域搜索算法

Abstract: To address the problem of time-dependent electric vehicle routing problem (VRP) with drones, this paper comprehensively considers factors such as no-fly zones, simultaneous delivery and pickup, the ability to serve multiple customers in a single drone trip, and the impact of load and speed on energy consumption for both vehicles and drones. To minimize total delivery costs, it develops an optimization model for the electric vehicle routing problem with drones. Given the characteristics of the problem, the initial paths for both vehicles and drones are generated using multi-layer integer coding, and an adaptive large neighborhood search algorithm is designed to solve the model. The algorithm incorporates an operator scoring mechanism to adaptively select removal and insertion operators, along with an inferior solution acceptance criterion form simulated annealing to avoid local optima. The effectiveness of the model and algorithm is demonstrated through several examples, and the impact of factors such as detouring due to no-fly zones, the number of customers served per drone trip, and the lowest state of charge on the delivery scheme is analyzed. The research not only enriches the field of VRP but also expands its scope, providing a theoretical basis for logistics enterprises in optimizing their delivery schemes.

Key words: no-fly zone, time-dependent, electric vehicle-drone cooperative delivery, simultaneous delivery and pickup, adaptive large neighborhood search algorithm