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

具有一致邻域的旅行商问题的改进界

Improved Bounds for the Traveling Salesman Problem with Neighborhoods on Uniform Disks

Ioana O. Bercea

摘要:

给定欧氏平面上半径为$R$的一组$n$圆盘,均匀圆盘上的邻域旅行商问题(TSPN)要求访问所有圆盘的最短行程。该问题是经典的旅行商问题(TSP)在点上的推广,并已在文献中得到广泛的研究。对于半径为$R$的不相交均匀圆盘的情况,Dumitrescu和Mitchell[2001]表明圆盘中心上的最优TSP巡回是TSPN版本的$3.547$ -近似。他们分析的核心是基于最佳TSPN巡回必须进行的迂回,以访问每个磁盘的中心,并表明在最坏的情况下,它最多是$2Rn$。Häme、Hyytiä和Hakula[2011]询问,当$R$很小时,这个界限是否紧,并确认它最多是$\sqrt{3}Rn$。我们进一步研究这个问题,并推导出最优TSPN巡回的结构性质来描述的情况下,在该情况下,该界小于$2Rn$。具体来说,我们表明,如果最佳的TSPN旅游是不是一条直线,至少有以下之一是保证是真的:界小于$1.999Rn$或中心的$TSP$是一个$2$ -近似。$2$的后一个界是我们一般所能得到的最佳界。我们的框架是基于使用的TSPN旅游的最优性,以确定局部结构的绕道是大的,然后使用它们的几何形状,以获得更好的下界的TSPN旅游的长度。这导致改进的近似因子$3.53$不相交均匀磁盘和$6.728$的一般情况下。我们进一步证明了Häme,Hyytiä和Hakula猜想对于三个圆盘的情形是成立的,并讨论了获得它的方法。在此过程中,我们将揭示TSPN问题在结构上不同于经典TSP的一种方式。

英文摘要:

Given a set of $n$ disks of radius $R$ in the Euclidean plane, the Traveling Salesman Problem With Neighborhoods (TSPN) on uniform disks asks for the shortest tour that visits all of the disks. The problem is a generalization of the classical Traveling Salesman Problem(TSP) on points and has been widely studied in the literature. For the case of disjoint uniform disks of radius $R$, Dumitrescu and Mitchell[2001] show that the optimal TSP tour on the centers of the disks is a $3.547$-approximation to the TSPN version. The core of their analysis is based on bounding the detour that the optimal TSPN tour has to make in order to visit the centers of each disk and shows that it is at most $2Rn$ in the worst case. Häme, Hyytiä and Hakula[2011] asked whether this bound is tight when $R$ is small and conjectured that it is at most $\sqrt{3}Rn$. We further investigate this question and derive structural properties of the optimal TSPN tour to describe the cases in which the bound is smaller than $2Rn$. Specifically, we show that if the optimal TSPN tour is not a straight line, at least one of the following is guaranteed to be true: the bound is smaller than $1.999Rn$ or the $TSP$ on the centers is a $2$-approximation. The latter bound of $2$ is the best that we can get in general. Our framework is based on using the optimality of the TSPN tour to identify local structures for which the detour is large and then using their geometry to derive better lower bounds on the length of the TSPN tour. This leads to an improved approximation factor of $3.53$ for disjoint uniform disks and $6.728$ for the general case. We further show that the Häme, Hyytiä and Hakula conjecture is true for the case of three disks and discuss the method used to obtain it. Along the way, we will uncover one way in which the TSPN problem is structurally different from the classical TSP.

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

↑