卡车和无人机的两级路由问题
The two-echelon routing problem with truck and drones
摘要：
在本文中，我们研究了著名的两级车辆路径问题的新变体，其中卡车在第一梯队上工作，将包裹和无人机车队运送到中间仓库，而在第二梯队中，无人机用于将包裹从中间仓库运送到客户。其目标是最小化完成时间，而不是在经典的2级车辆路径问题的运输成本。根据具体情况，无人机可以在中间仓库从卡车上发射一次（单程无人机）或多次（多次无人机）。首先提出了混合线性规划模型，将问题数学化，并求解最优小规模实例。为了处理更大的实例，引入了基于贪婪随机自适应搜索过程（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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
