快速交货问题的一个有效算法
An Efficient Algorithm for the Fast Delivery Problem
摘要:
我们研究了一个问题,其中k个自主移动代理最初位于不同的节点的加权图(n个节点和m个边)。每个自主移动代理都有一个预定义的速度,只允许沿着图的边缘移动。我们感兴趣的是将最初位于源节点s中的包传递到目的地节点y。通过自主移动代理的集体努力来实现交付,这些自主移动代理可以在它们之间携带和交换包裹。其目标是计算一个交货时间表,最大限度地减少包裹的交货时间。在本文中,我们提出了一个O(kn log n + km)时间算法。这改进了以前的最先进的O(k^2 m + kn^2 + APSP)时间算法,其中APSP代表所有对最短路径问题的算法的运行时间。
英文摘要:
We study a problem where k autonomous mobile agents are initially located on distinct nodes of a weighted graph (with n nodes and m edges). Each autonomous mobile agent has a predefined velocity and is only allowed to move along the edges of the graph. We are interested in delivering a package, initially positioned in a source node s, to a destination node y. The delivery is achieved by the collective effort of the autonomous mobile agents, which can carry and exchange the package among them. The objective is to compute a delivery schedule that minimizes the delivery time of the package. In this paper, we propose an O(kn log n + km) time algorithm for this problem. This improves the previous state-of-the-art O(k^2 m + k n^2 + APSP) time algorithm for this problem, where APSP stands for the running-time of an algorithm for the All-Pairs Shortest Paths problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。