协同配送中异构无人机总旅行时间最小化
Minimizing Total Travel Time for Collaborative Package Delivery with Heterogeneous Drones
AI总结:
该研究提出了一种常数因子近似算法,用于解决异构无人机协同配送问题,通过树组合问题和对偶方法实现,验证了算法在大规模实例中的可扩展性和高质量调度能力。
摘要:
给定一组速度不同的无人机和一组包裹配送请求,协同配送问题要求为无人机制定一个调度方案,以协同完成所有包裹配送,并以所有无人机总旅行时间最小为目标。我们证明了非抢占性最佳调度(即一个无人机在接收到包裹后立即将其送达目的地)在最佳抢占性调度(多个无人机可以参与单个包裹的配送)方面最多仅差三倍。然后,我们提出了一种常数因子近似算法,用于计算最佳非抢占性调度。该算法将问题转化为树组合问题,并使用对偶方法来解决后者。我们实现了一个优化以提高实际效率的算法版本,并在大规模实例上进行了实验,使用合成和真实数据,证明了我们的算法具有可扩展性,并能生成高质量的调度方案。
英文摘要:
Given a fleet of drones with different speeds and a set of package delivery requests, the collaborative delivery problem asks for a schedule for the drones to collaboratively carry out all package deliveries, with the objective of minimizing the total travel time of all drones. We show that the best non-preemptive schedule (where a package that is picked up at its source is immediately delivered to its destination by one drone) is within a factor of three of the best preemptive schedule (where several drones can participate in the delivery of a single package). Then, we present a constant-factor approximation algorithm for the problem of computing the best non-preemptive schedule. The algorithm reduces the problem to a tree combination problem and uses a primal-dual approach to solve the latter. We have implemented a version of the algorithm optimized for practical efficiency and report the results of experiments on large-scale instances with synthetic and real-world data, demonstrating that our algorithm is scalable and delivers schedules of excellent quality.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。