VRP文献赏读02：Optimization Approaches for the Traveling Salesman Problem with Drone

目录

摘要赏读

符号描述

问题假设

三类节点

操作Operator

理论分析

---

今天分享一篇2018年发表在TS上的关于TSPD的研究论文，论文信息如下：

原文链接

摘要赏读

The fast and cost-efficient home delivery of goods ordered online is logistically challenging. Many companies are looking for new ways to cross the last mile to their customers. One technology-enabled opportunity that recently has received much attention is the use of drones to support deliveries. An innovative last-mile delivery concept in which a truck collaborates with a drone to make deliveries gives rise to a new variant of the traveling salesman problem (TSP) that we call the TSP with drone. In this paper, we model this problem as an integer program and develop several fast route-first, cluster-second heuristics based on local search and dynamic programming. We prove worst-case approximation ratios for the heuristics and test their performance by comparing the solutions to the optimal solutions for small instances. In addition, we apply our heuristics to several artificial instances with different characteristics and sizes. Our experiments show that substantial savings are possible with this concept compared to truck-only delivery.

在线订购商品的快速和经济高效的上门交货在物流上具有挑战性。许多公司都在寻找新的方法，以跨越最后一英里的客户。最近备受关注的一个技术机遇是使用无人机来支持交付。一个创新的最后一英里交付概念，其中一辆卡车与无人机合作进行交付产生了一个新的变种的旅行推销员问题（TSP），我们称之为TSP与无人机。本文将该问题建模为一个整数规划问题，并在局部搜索和动态规划的基础上，开发了几种快速路径优先、聚类二次启发式算法。我们证明了启发式算法的最坏情况近似比，并通过比较小实例的最优解来测试它们的性能。此外，我们还将启发式方法应用于具有不同特征和大小的几个人工实例。我们的实验表明，与纯卡车运输相比，这种概念可以节省大量成本。【百度翻译，不喜勿喷】

符号描述