On Euclidean vehicle routing with allocation

The (Euclidean) Vehicle Routing Allocation Problem (VRAP) is a generalization of Euclidean TSP. We do not require that all points lie on the salesman tour. However, points that do not lie on the tour are allocated, i.e., they are directly connected to the nearest tour point, paying a higher (per-unit) cost. More formally, the input is a set of points P ⊂ Rd and functions α : P → [0,∞) and s : P → [1,∞). We wish to compute a subset T ⊆ P and a salesman tour π through T such that the total length of the tour plus the total allocation cost is minimum. The allocation cost for a single point p ∈ P\T is α(p) + s(p) ċ d(p, q), where q ∈ T is the nearest point on the tour. We give a PTAS with complexity O(n logd+3 n) for this problem. Moreover, we propose a O(n polylog (n))-time PTAS for the Steiner variant of this problem. This dramatically improves a recent result of Armon et al. [2].

[1]  John E. Beasley,et al.  A tabu search algorithm for the single vehicle routing allocation problem , 2007, J. Oper. Res. Soc..

[2]  John E. Beasley,et al.  The Vehicle Routing-Allocation Problem: A unifying framework , 1996 .

[3]  Satish Rao,et al.  A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem , 1999, ESA.

[4]  Pankaj K. Agarwal,et al.  Geometric Range Searching and Its Relatives , 2007 .

[5]  Satish Rao,et al.  Approximating geometrical graphs via “spanners” and “banyans” , 1998, STOC '98.

[6]  Joseph S. B. Mitchell,et al.  Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems , 1999, SIAM J. Comput..

[7]  N. Foulds,et al.  Bookmobile routing and scheduling in Buskerud County , Norway , 2001 .

[8]  Satish Rao,et al.  Approximation schemes for Euclidean k-medians and related problems , 1998, STOC '98.

[9]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

[10]  Michiel H. M. Smid,et al.  Euclidean spanners: short, thin, and lanky , 1995, STOC '95.

[11]  Oded Schwartz,et al.  Cooperative TSP , 2006, ESA.

[12]  Joachim Gudmundsson,et al.  Improved Greedy Algorithms for Constructing Sparse Geometric Spanners , 2000, SWAT.

[13]  Kurt Mehlhorn,et al.  Proceedings of the 16th annual European symposium on Algorithms , 2008 .

[14]  Ronald L. Graham,et al.  Some NP-complete geometric problems , 1976, STOC '76.

[15]  Satish Rao,et al.  A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem , 2007, SIAM J. Comput..