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 n points P ⊂ Rd and functions α : P → [0, ∞) and β : 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) + β(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 an O (n polylog (n))-time PTAS for the Steiner variant of this problem. This dramatically improves a recent result of Armon et al. [3].

• Type: Conference
• Year: 2007
• Where: WADS
• Authors: Jan Remy, Reto Spöhel, Andreas Weißl
• Keywords: Algorithms, Nearest Tour Point, Salesman Tour, Vehicle Routing Allocation, WADS 2007