arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2405.18566cs.DS
收藏

一种更快的带无人机旅行商问题启发式算法

A faster heuristic for the Traveling Salesman Problem with Drone

Instituto de Matemática e Computação – Universidade Federal de Itajubá(伊塔朱巴联邦大学数学与计算学院);Centro de Matemática, Computação e Cognição – Universidade Federal do ABC(ABC联邦大学数学、计算与认知中心);Departamento de Computação – Universidade Federal de São Carlos(圣卡洛斯联邦大学计算机系)

Pedro H. D. B. Hokama, Carla N. Lintzmayer, Mário C. San Felice

AI总结:

针对带无人机的旅行商问题变体h-FSTSP,提出惰性无人机性质以减少需考虑的起飞回收节点组合,基于此设计的算法比现有最优算法快84倍以上,且性能随规模增长稳定。

摘要:

给定一组客户点,飞行助手旅行商问题(Flying Sidekick Traveling Salesman Problem,FSTSP)指使用一辆卡车和一架无人机完成对这些客户的配送。无人机一次只能为一个客户配送,配送完成后返回卡车,之后可从卡车处再次起飞。该问题的目标是最小化为所有客户提供服务并让两种车辆都返回配送中心所需的时间。现有文献中的启发式算法普遍采用“先排序后拆分”的思路:先找到一条覆盖所有客户的哈密顿环h,然后移除部分客户交由无人机处理,同时确定无人机的起飞点和回收点。这类算法实际上是在最优求解h-FSTSP——这是FSTSP的一个变体,要求在求解过程中遵循给定的初始环h。我们提出了“惰性无人机性质(Lazy Drone Property)”,该性质保证h-FSTSP算法仅需考虑部分无人机起飞和回收的节点组合。我们还提出了一种利用该性质的算法,并通过实验结果验证了其在缩短这类算法运行时间方面的有效性。在文献基准测试集上,我们的算法速度比此前已知的最优算法快84倍以上。此外,平均而言,该算法考虑的起飞-回收点对数量与客户数量呈线性关系,表明该算法的性能在更大规模的算例上仍能保持稳定。

英文摘要:

Given a set of customers, the Flying Sidekick Traveling Salesman Problem (FSTSP) consists of using one truck and one drone to perform deliveries to them. The drone is limited to delivering to one customer at a time, after which it returns to the truck, from where it can be launched again. The goal is to minimize the time required to service all customers and return both vehicles to the depot. In the literature, we can find heuristics for this problem that follow the order-first split-second approach: find a Hamiltonian cycle h with all customers, and then remove some customers to be handled by the drone while deciding from where the drone will be launched and where it will be retrieved. Indeed, they optimally solve the h-FSTSP, which is a variation that consists of solving the FSTSP while respecting a given initial cycle h. We present the Lazy Drone Property, which guarantees that only some combinations of nodes for launch and retrieval of the drone need to be considered by algorithms for the h-FSTSP. We also present an algorithm that uses the property, and we show experimental results which corroborate its effectiveness in decreasing the running time of such algorithms. Our algorithm was shown to be more than 84 times faster than the previously best-known ones over the literature benchmark. Moreover, on average, it considered a number of launch and retrieval pairs that is linear on the number of customers, indicating that the algorithm's performance should be sustainable for larger instances.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑