An Exact Solution Method for Truck-assisted Drone Routing Problem
ID:182 View Protection:ATTENDEE Updated Time:2022-07-07 16:27:47 Hits:371 Poster Presentation

Start Time:Pending(Asia/Shanghai)

Duration:Pending

Session:No Session »

Presentation File

Tips: Only the registered participant can access the file. Please sign in first.

Abstract
Drone-truck combined delivery has huge potential for becoming an innovative last-mile solution for logistics. This paper presents a variation of drone-truck operation with the goal to minimize the completion time, where the truck provides a mobile recharging station for drones and drones serve all the customers. This problem can be decomposed into two elementary phases: a) truck with a drone arriving at rendezvous nodes and b) drone flying to the customer points. Our exact method is based on branch-and-bound, in which a tree node represents a customer subsequence and the lower bound is the objective value with optimal launch and retrieve locations for the fixed customer sequence. The best departing and collection sites for each tree node are obtained through custom cuts, which consider a customer-based pruning strategy and the interaction-based pruning between customers. Our experimental results show that the novel exact algorithm outperforms CPLEX in terms of computational time, while obtaining results on par regarding quality.
Keywords
drone-truck delivery;branch-and-bound algorithm;pruning;rendezvous node
Speaker
Shuang Wang
Beihang University (Beijing University of Aeronautics and Astronautics)

Submit Comment
Verify Code Change Another
All Comments
Important Date
  • Conference Date

    Jul 08

    2022

    to

    Jul 11

    2022

  • Jul 11 2022

    Contribution Submission Deadline

  • Jul 11 2022

    Registration deadline

Sponsored By
Chinese Overseas Transportation Association
Central South University (CSU)
Contact Information