Locker and Drone Collaborative Distribution Completion Time Minimization Problem
Locker and drone collaborative distribution(LDCD),which has broad application prospects,is a non-contact delivery mode with high degree of automation.The minimum completion time scheduling problem in this mode was investigated,which involved making feasible transportation and parking plans for drones and lockers such that all the delivery tasks were executed as early as possible.This.problem was a hybrid one of vehicle routing and machine scheduling with both formulation and solution challenges.The original problem was transformed into an arc-selection and time-determination problem based on a proposed digraph model.Consequently,a 0-1 mixed integer linear program was put forward and a variable neighborhood search(VNS)algorithm was developed.The efficiency of the model and algorithm was verified by simulated experiments conducted on simulated instances which were created based on nine Chinese cities.
万方数据
维普
