Routing problem of truck-drones joint distribution in initial stage of emergency response
In order to timely deliver emergency supplies to disaster stricken areas,reduce casualties,and minimize property damage during the early stages of emergency response,a truck-drone combined delivery mode for emergency supplies was proposed by combining the characteristics of relatively large truck capacity and fast drone operation speed.A model for the truck-drone routing problem(VRP-D)was developed based on the vehicle routing problem,with the objective of minimizing the total delivery time.The effectiveness of the model was validated through small-scale examples using the LINGO optimization solver,and it was compared with the traditional emergency supply delivery vehicle routing problem(VRP).The model was solved using a designed variable neighborhood search algorithm(VNS),and its performance was compared with the traditional genetic algorithm(GA).A sensitivity analysis was conducted on the drone's endurance range and maximum payload.The results show that the VNS algorithm has certain advantages in solving the model in terms of speed,accuracy,and stability.The quality of the solutions obtained by the VNS algorithm can be improved by up to 7.24％compared to those obtained by the GA algorithm.The quality of the solutions of the VRP-D model can be improved by up to 63.57％compared to the VRP model.Therefore,in the initial stages of emergency response,the use of the truck-drone combined delivery mode for emergency supplies is more efficient.When the drone's endurance range is increased to 70 min,the total waiting time at the disaster points no longer decreases.Similarly,when the drone's maximum payload is increased to 35 kg,the total waiting time at the disaster points also ceases to decrease,reflecting the inherent trade-off between the drone's endurance range and maximum payload.The study providing a theoretical basis for innovating new modes of emergency supply delivery.9 tabs,14 figs,28 refs.
NETL
NSTL
万方数据
