The Optimal Scheduling Method Of Truck-Drone Delivery Donsidering Degional Destrictions

In recent years,drones have been widely used in the field of logistics due to their high speed and flexibility.However,the shortcomings of drones such as limited range and low load capacity make it difficult to meet the needs of modern logistics and distribution alone.Existing distribution models try to complete distribution tasks faster through trucks and drones by combining drones and trucks,but the existing studies do not give full play to the respective advantages of trucks and drones.And most studies do not take into account the widespread reality of restricted areas.In this context,this paper studies the optimal scheduling method of truck-drone distribution considering regional constraints.In this paper,a typical regional restriction-traffic restriction is selected.Two typical optimization problems and their optimization methods are proposed.Compared with the existing studies in the literature,our research takes into account the widespread practical factor of traffic restrictions and collaboratively optimizes the paths of trucks and drones.(1)A problem and optimization method for optimizing the delivery path of restricted traffic circles through the collaboration of trucks and drones are proposed.In which a truck carrying cargo travels along the outer boundary of the restricted traffic zone to send and receive a drone,and the drone is responsible for delivering the cargo to customers.The objective of the problem is to minimize the completion time of all delivery tasks.To efficiently solve this problem,we propose a hybrid metaheuristic optimization algorithm to cooperatively optimize the outer path of the truck and the inner path of the drone.The problem contains a sub-problem of the optimal intersection point of trucks and drones,and a sub-problem of the delivery sequence at customer points.In order to solve this complex scheduling problem effectively,In this paper,a hybrid metaheuristic and convex relaxation optimization method is proposed for solving the problem.The Simple Water Wave Optimization(Sim WWO)algorithm is used to solve the customer point delivery order subproblem,and convex relaxation is used to solve the truck-drone optimal intersection point subproblem.Experimental results on several problem instances of different sizes show that the algorithm used in this article has significant advantages in terms of convergence speed and obtaining the optimal solution compared to existing popular algorithms.(2)A problem and optimization method for distribution and retrieval path optimization problem in restricted areas with a combination of truck-drone are proposed.The problem contains the distribution and recovery of goods in the traffic restriction zone.In which a truck carrying cargo travels along the outer boundary of the restricted traffic zone to send and receive a drone,the drone is responsible for delivering the cargo to customers and receiving the cargo from customers.The objective of the problem is to minimize the completion time of all delivery and receive tasks.A hybrid metaheuristic and convex relaxation optimization method is used to solve it.After experimental comparison,our method shows obvious performance advantages.We applied the mothed to a representative area in Wuchang Street,Yuhang District,Hangzhou.