Abstract
We study vehicle routing problems with constraints on the distance traveled by each vehicle or on the number of vehicles. The objective is to minimize the total distance traveled by vehicles. We design constant differential approximation algorithms for some of these problems. In particular we obtain differential bounds: \( \frac{1} {2} \) for Metric 3VRP, \( \frac{3} {5} \) for Metric 4VRP, \( \frac{2} {3} \) for Metric kVRP with k ≥ 5, \( \frac{1} {2} \) for the nonmetric case for any k ≥ 3, and 1/3 for Constrained VRP. We prove also that Min-Sum EkTSP is\( \frac{2} {3} \) differential approximable and has no differential approximation scheme, unless P = NP.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
G. Ausiello, A. D’Atri and M. Protasi, “Structure preserving reductions among convex optimization problems,” Journal of Computing and System Sciences 21 (1980) 136–153.
C. Bazgan, Approximation of optimization problems and total function of NP, Ph.D. Thesis (in French), Université Paris Sud (1998).
M. Bellmore and S. Hong, “Transformation of Multi-salesmen Problem to the Standard Traveling Salesman Problem,” Journal of the Association for Computing Machinery 21 (1974) 500–504.
W.J. Cook, W.H. Cunningham, W.R. Pulleyblank, and A. Schrijver Combinatorial Optimization John Wiley & Sons Inc New York 1998 (Chapter 5.5).
M. Demange and V. Paschos, “On an approximation measure founded on the links between optimization and polynomial approximation theory,” Theoretical Computer Science 158 (1996) 117–141.
L. Engebretsen and M. Karpinski, “Approximation hardness of TSP with bounded metrics,” http://www.nada.kth.se/~enge/papers/BoundedTSP.pdf
M. R. Garey and D. S. Johnson, “Computers andin tractability. A guide to the theory of NP-completeness,#x201D; Freeman, C.A. San Francisco (1979).
M. Haimovich and A. H. G. Rinnooy Kan, “Bounds and heuristics for capacitated routing problems,” Mathematics of Operations Research 10 (1985) 527–542.
M. Haimovich, A. H. G. Rinnooy Kan and L. Stougie, “ Analysis of Heuristics for Vehicle Routing Problems,” in Vehicle Routing Methods and Studies, Golden, Assad editors, Elsevier (1988) 47–61.
D. Hartvigsen, Extensions of Matching Theory. Ph.D. Thesis, Carnegie-Mellon University (1984).
R. Hassin and S. Khuller, “z-approximations,” Journal of Algorithms 41 (2001) 429–442.
D. G. Kirkpatrick and P. Hell, “On the completeness of a generalized matching problem,” Proc. of the 10th ACM Symposium on Theory and Computing (1978) 240–245.
C-L. Li, D. Simchi-Levi and M. Desrochers, “On the distance constrained vehicle routing problem,” Operations Research 404(1992) 790–799.
J. Monnot, “Differential approximation results for the traveling salesman and related problems,” Information Processing Letters 82 (2002) 229–235.
J. Monnot, V. Th. Paschos and S. Toulouse, “ Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2,” Proc. FCT (2001) 275–286.
C. Papadimitriou and M. Yannakakis, “The traveling salesman problem with distances one and two,” Mathematics of Operations Research 18(1) (1993) 1–11.
S. Sahni and T. Gonzalez, “P-complete approximation problems” Journal of the Association for Computing Machinery 23 (1976) 555–565.
E. Zemel, “Measuring the quality of approximate solution to zero-one programming problems,” Mathematical Operations Research 6(1981) 319–332.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bazgan, C., Hassin, R., Monnot, J. (2003). Differential Approximation for Some Routing Problems. In: Petreschi, R., Persiano, G., Silvestri, R. (eds) Algorithms and Complexity. CIAC 2003. Lecture Notes in Computer Science, vol 2653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44849-7_31
Download citation
DOI: https://doi.org/10.1007/3-540-44849-7_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40176-6
Online ISBN: 978-3-540-44849-5
eBook Packages: Springer Book Archive