Abstract
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 
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 
, where q ∈ T is the nearest point on the tour. We give a PTAS with complexity 
for this problem. Moreover, we propose a 
-time PTAS for the Steiner variant of this problem. This dramatically improves a recent result of Armon et al. [2].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Computational Geometry, Contemporary Mathematics, vol. 223, pp. 1–56. American Mathematical Socienty, Providence, RI (1999)
Armon, A., Avidor, A., Schwartz, O.: Cooperative TSP. In: Proceedings of the 14th Annual European Symposium on Algorithms, pp. 40–51 (2006)
Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. Journal of the ACM 45(5), 753–782 (1998)
Arora, S., Raghavan, P., Rao, S.: Approximation schemes for Euclidean k-medians and related problems. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 106–113 (1998)
Beasley, J.E., Nascimento, E.: The vehicle routing allocation problem: a unifying framework. TOP 4, 65–86 (1996)
Foulds, L.R., Wallace, S.W., Wilson, J., Sagvolden, L.: Bookmobile routing and scheduling in Buskerud County, Norway. In: Proceeding of the 36th Annual Conference of the Operational Research Society of New Zealand, pp. 67–77 (2001)
Garey, M., Graham, R., Johnson, D.: Some NP-complete geometric problems. In: Proceedings of the 8th Annual ACM Symposium on Theory of Computing, pp. 10–22 (1976)
Gudmundsson, J., Levcopoulos, C., Narasimhan, G.: Improved greedy algorithms for constructing sparse geometric spanners. In: Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, pp. 163–174 (2000)
Kolliopoulos, S., Rao, S.: A nearly linear-time approximation scheme for the euclidean k-median problem. In: Proceedings of the 7th Annual European Symposium on Algorithms, pp. 378–389 (1999)
Mitchell, J.S.B.: Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST and related problems. SIAM Journal on Computing 28(4), 1298–1309 (1999)
Rao, S.B., Smith, W.D.: Approximating geometrical graphs via ’spanners’ and ’banyans’. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 106–113. ACM Press, New York (1998)
Tipping, J.: Scheduling and routing grass mowers around Christchurch. In: Proceeding of the 37th Annual Conference of the Operational Research Society of New Zealand (2002)
Vogt, L., Poojari, C.A., Beasley, J.E.: A tabu search algorithm for the single vehicle routing allocation problem. Journal of the Operational Research Society (to appear)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Remy, J., Spöhel, R., Weißl, A. (2007). On Euclidean Vehicle Routing with Allocation. In: Dehne, F., Sack, JR., Zeh, N. (eds) Algorithms and Data Structures. WADS 2007. Lecture Notes in Computer Science, vol 4619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73951-7_52
Download citation
DOI: https://doi.org/10.1007/978-3-540-73951-7_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73948-7
Online ISBN: 978-3-540-73951-7
eBook Packages: Computer ScienceComputer Science (R0)