arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1412.2123cs.DCcs.DS
收藏

无通信的分布式多仓库路径选择

Distributed Multi-Depot Routing without Communications

Dawsen Hwang, Patrick Jaillet, Zhengyuan Zhou

摘要:

我们考虑并制定了一类分布式多仓库路由问题,其中服务器访问一组请求,目的是最小化所有服务器的总行程。这些问题分为两类:分布式离线路由问题,其中所有需要访问的请求从一开始就知道;分布式在线路由问题,其中请求逐渐增加。我们的配方的一个关键和新颖的特点是,服务器之间的通信是不允许的,因此提出了一个有趣的和具有挑战性的问题:什么样的性能可以实现的最佳可能的解决方案相比,从一个全知的规划完美的通信能力?最坏情况(在所有可能的请求集实例上)的性能度量由近似比(离线情况)和竞争比(在线情况)给出。我们的第一个结果表明,在线和离线的问题是有效的等效:对于相同的请求集实例,近似比和竞争比的差异最多为2的附加因子,无论在线的情况下的发布日期。因此,我们可以将注意力限制在离线问题上。对于离线问题,我们证明了由Voronoi分区给出的近似比是m(服务器的数量)。对于两类车辆段配置,当车辆段形成一条线并且当车辆段对的距离之间的比率由次线性函数f(m)上界时(即,f(m)= o(m)),分别给出了次线性逼近比为O(logm)和Θ(f(m))的划分方案.我们还讨论了我们的公式中几个有趣的开放问题:特别是,我们的初始结果(关于两个故意选择的仓库类别)如何塑造我们对开放问题的猜想。

英文摘要:

We consider and formulate a class of distributed multi-depot routing problems, where servers are to visit a set of requests, with the aim of minimizing the total distance travelled by all servers. These problems fall into two categories: distributed offline routing problems where all the requests that need to be visited are known from the start; distributed online routing problems where the requests come to be known incrementally. A critical and novel feature of our formulations is that communications are not allowed among the servers, hence posing an interesting and challenging question: what performance can be achieved in comparison to the best possible solution obtained from an omniscience planner with perfect communication capabilities? The worst-case (over all possible request-set instances) performance metrics are given by the approximation ratio (offline case) and the competitive ratio (online case). Our first result indicates that the online and offline problems are effectively equivalent: for the same request-set instance, the approximation ratio and the competitive ratio differ by at most an additive factor of 2, irrespective of the release dates in the online case. Therefore, we can restrict our attention to the offline problem. For the offline problem, we show that the approximation ratio given by the Voronoi partition is m (the number of servers). For two classes of depot configurations, when the depots form a line and when the ratios between the distances of pairs of depots are upper bounded by a sublinear function f(m) (i.e., f(m) = o(m)), we give partition schemes with sublinear approximation ratios O(log m) and Θ(f(m)) respectively. We also discuss several interesting open problems in our formulations: in particular, how our initial results (on the two deliberately chosen classes of depots) shape our conjecture on the open problems.

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

↑