A matheuristic for the vehicle routing problem with drones and its variants

Daniel Schermer,Mahdi Moeini,Oliver Wendt

Transportation Research Part C: Emerging Technologies（2019）

引用 122|浏览4

暂无评分

摘要

•We study the Vehicle Routing Problem with Drones.•Formulate the problem as a MILP and introduce several sets of valid inequalities.•Investigate different variants of the problem.•Introduce an effective Matheuristic approach for solving the problem.•And report numerical results of our comprehensive computational experiments.

查看译文

关键词

Vehicle Routing Problem,Drones,Logistics,Last-mile delivery,Valid inequalities,Matheuristics,Heuristics,Large-scale instances

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要