与无人驾驶旅行推销员问题的基准案例和最佳解决办法 (Benchmark Instances and Optimal Solutions for the Traveling Salesman Problem with Drone)

The use of drones in logistics is gaining more and more interest, and drones are becoming a more viable and common way of distributing parcels in an urban environment. As a consequence, there is a flourishing production of articles in the field of operational optimization of the combined use of trucks and drones for fulfilling customers requests. The aim is minimizing the total time required to service all the customers, since this has obvious economical impacts. However in the literature there is not yet a widely recognized basic model, and there are not well assessed sets of instances and optimal solutions that can be considered as a benchmark to prove the effectiveness of new solution methods. The aim of this paper is to fill this gap. On one side we will clearly describe some of the most common components of the truck/drone routing problems and we will define nine basic problem settings, by combining these components. On the other side we will consider some of the instances used by many researchers and we will provide optimal solutions for all the problem settings previously identified. Instances and detailed solutions are then organized into benchmarks made publicly available as validation tools for future research methods.

翻译：无人驾驶飞机在物流方面的使用越来越引起人们的兴趣,无人驾驶飞机正在成为在城市环境中分配包裹的更加可行和常见的方式。因此,在满足客户要求时,在卡车和无人驾驶飞机的混合使用在业务上最优化方面正在兴旺地生产物品,目的是最大限度地减少为所有客户提供服务所需的全部时间,因为这样做具有明显的经济影响。然而,文献中还没有一个得到广泛承认的基本模式,也没有一套经过充分评估的事例和最佳解决办法,可以视为证明新解决办法有效性的基准。本文件的目的是填补这一空白。一方面,我们将明确描述卡车/运输工具中最常见的问题,并将通过综合这些组成部分来界定九个基本问题环境。另一方面,我们将考虑许多研究人员使用的一些实例,我们将为所有先前确定的问题环境提供最佳解决办法。然后,将实例和详细解决办法整理成基准,作为今后研究方法的验证工具,供公众使用。