The rapid evolution of unmanned aerial vehicle(UAV)technology and autonomous capabilities has positioned UAV as promising last-mile delivery means.Vehicle and onboard UAV collaborative delivery is introduced as a nove...The rapid evolution of unmanned aerial vehicle(UAV)technology and autonomous capabilities has positioned UAV as promising last-mile delivery means.Vehicle and onboard UAV collaborative delivery is introduced as a novel delivery mode.Spatiotemporal collaboration,along with energy consumption with payload and wind conditions play important roles in delivery route planning.This paper introduces the traveling salesman problem with time window and onboard UAV(TSPTWOUAV)and emphasizes the consideration of real-world scenarios,focusing on time collaboration and energy consumption with wind and payload.To address this,a mixed integer linear programming(MILP)model is formulated to minimize the energy consumption costs of vehicle and UAV.Furthermore,an adaptive large neighborhood search(ALNS)algorithm is applied to identify high-quality solutions efficiently.The effectiveness of the proposed model and algorithm is validated through numerical tests on real geographic instances and sensitivity analysis of key parameters is conducted.展开更多
With the rapid development of low-altitude economy and unmanned aerial vehicles (UAVs) deployment technology, aerial-ground collaborative delivery (AGCD) is emerging as a novel mode of last-mile delivery, where the ve...With the rapid development of low-altitude economy and unmanned aerial vehicles (UAVs) deployment technology, aerial-ground collaborative delivery (AGCD) is emerging as a novel mode of last-mile delivery, where the vehicle and its onboard UAVs are utilized efficiently. Vehicles not only provide delivery services to customers but also function as mobile ware-houses and launch/recovery platforms for UAVs. This paper addresses the vehicle routing problem with UAVs considering time window and UAV multi-delivery (VRPU-TW&MD). A mixed integer linear programming (MILP) model is developed to mini-mize delivery costs while incorporating constraints related to UAV energy consumption. Subsequently, a micro-evolution aug-mented large neighborhood search (MEALNS) algorithm incor-porating adaptive large neighborhood search (ALNS) and micro-evolution mechanism is proposed. Numerical experiments demonstrate the effectiveness of both the model and algorithm in solving the VRPU-TW&MD. The impact of key parameters on delivery performance is explored by sensitivity analysis.展开更多
基金Fundamental Research Funds for the Central Universities(2024JBZX038)National Natural Science F oundation of China(62076023)。
文摘The rapid evolution of unmanned aerial vehicle(UAV)technology and autonomous capabilities has positioned UAV as promising last-mile delivery means.Vehicle and onboard UAV collaborative delivery is introduced as a novel delivery mode.Spatiotemporal collaboration,along with energy consumption with payload and wind conditions play important roles in delivery route planning.This paper introduces the traveling salesman problem with time window and onboard UAV(TSPTWOUAV)and emphasizes the consideration of real-world scenarios,focusing on time collaboration and energy consumption with wind and payload.To address this,a mixed integer linear programming(MILP)model is formulated to minimize the energy consumption costs of vehicle and UAV.Furthermore,an adaptive large neighborhood search(ALNS)algorithm is applied to identify high-quality solutions efficiently.The effectiveness of the proposed model and algorithm is validated through numerical tests on real geographic instances and sensitivity analysis of key parameters is conducted.
基金supported by the Fundamental Research Funds for the Central Universities(2024JBZX038)the National Natural Science Foundation of China(62076023).
文摘With the rapid development of low-altitude economy and unmanned aerial vehicles (UAVs) deployment technology, aerial-ground collaborative delivery (AGCD) is emerging as a novel mode of last-mile delivery, where the vehicle and its onboard UAVs are utilized efficiently. Vehicles not only provide delivery services to customers but also function as mobile ware-houses and launch/recovery platforms for UAVs. This paper addresses the vehicle routing problem with UAVs considering time window and UAV multi-delivery (VRPU-TW&MD). A mixed integer linear programming (MILP) model is developed to mini-mize delivery costs while incorporating constraints related to UAV energy consumption. Subsequently, a micro-evolution aug-mented large neighborhood search (MEALNS) algorithm incor-porating adaptive large neighborhood search (ALNS) and micro-evolution mechanism is proposed. Numerical experiments demonstrate the effectiveness of both the model and algorithm in solving the VRPU-TW&MD. The impact of key parameters on delivery performance is explored by sensitivity analysis.
