An Exact Solution Method for Truck-assisted Drone Routing Problem
编号:182 访问权限:仅限参会人 更新:2022-07-07 16:27:47 浏览:85次 张贴报告

报告开始:暂无开始时间(Asia/Shanghai)

报告时间:暂无持续时间

所在会场:[暂无会议] [暂无会议段]

演示文件

提示:该报告下的文件权限为仅限参会人,您尚未登录,暂时无法查看。

摘要
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.
关键词
drone-truck delivery;branch-and-bound algorithm;pruning;rendezvous node
报告人
Shuang Wang
Beihang University (Beijing University of Aeronautics and Astronautics)

发表评论
验证码 看不清楚,更换一张
全部评论
重要日期
  • 会议日期

    07月08日

    2022

    07月11日

    2022

  • 07月11日 2022

    报告提交截止日期

  • 07月11日 2022

    注册截止日期

主办单位
Chinese Overseas Transportation Association
Central South University (CSU)
联系方式
移动端
在手机上打开
小程序
打开微信小程序
客服
扫码或点此咨询