论文标题
卡车和无人机的两回波路由问题
The two-echelon routing problem with truck and drones
论文作者
论文摘要
在本文中，我们研究了众所周知的两座车辆路由问题的新颖变体，其中卡车在第一个梯队上工作，用于运输包裹和一支无人机机队到中间仓库，而在第二层梯队中，无人机用于将包裹从中间仓库运送到客户。目的是将完成时间最小化，而不是像经典2-Echelon车辆路由问题一样，而不是运输成本。根据环境的不同，可以在一次中间仓库（单跳无人机）或几次（多个行程无人机）从卡车上发射无人机。首先提出了混合整数线性编程（MILP）模型，以数学形式提出问题并解决最佳小型实例。为了处理较大的实例，引入了基于贪婪随机自适应搜索程序（GRASP）的概念的元疗法。报告并分析了在不同情况下获得的实验结果。
In this paper, we study novel variants of the well-known two-echelon vehicle routing problem in which a truck works on the first echelon to transport parcels and a fleet of drones to intermediate depots while in the second echelon, the drones are used to deliver parcels from intermediate depots to customers. The objective is to minimize the completion time instead of the transportation cost as in classical 2-echelon vehicle routing problems. Depending on the context, a drone can be launched from the truck at an intermediate depot once (single trip drone) or several times (multiple trip drone). Mixed Integer Linear Programming (MILP) models are first proposed to formulate mathematically the problems and solve to optimality small-size instances. To handle larger instances, a metaheuristic based on the idea of Greedy Randomized Adaptive Search Procedure (GRASP) is introduced. Experimental results obtained on instances of different contexts are reported and analyzed.
