Approximationalgorithms for some vehicle routing problems

We study vehicle routing problems with constraints on the distance traveled by each vehicle or on the number of vehicles. The objective is either to minimize the total distance traveled by vehicles or to minimize the number of vehicles used. We design constant differential approximation algorithms for kVRP. Note that, using the differential bound for METRIC 3VRP, we obtain the randomized standard ratio 197 99 +, ∀ > 0. This is an improvement of the best-known bound of 2 given by Haimovich et al. (Vehicle Routing Methods and Studies, Golden, Assad, editors, Elsevier, Amsterdam, 1988). For natural generalizations of this problem, called EDGE COST VRP, VERTEX COST VRP, MIN VEHICLE and kTSP we obtain constant differential approximation algorithms and we show that these problems have no differential approximation scheme, unless P = NP. © 2004 Elsevier B.V. All rights reserved.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  Chul E. Kim,et al.  Approximation Algorithms for Some Routing Problems , 1978, SIAM J. Comput..

[3]  Mandell Bellmore,et al.  Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem , 1974, JACM.

[4]  Jérôme Monnot.  Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) , 2005, Eur. J. Oper. Res..

[5]  Marek Karpinski,et al.  Approximation Hardness of TSP with Bounded Metrics , 2001, ICALP.

[6]  Mihalis Yannakakis,et al.  The Traveling Salesman Problem with Distances One and Two , 1993, Math. Oper. Res..

[7]  Magnús M. Halldórsson,et al.  Approximating k-Set Cover and Complementary Graph Coloring , 1996, IPCO.

[8]  Santosh S. Vempala,et al.  On The Approximability Of The Traveling Salesman Problem , 2006, Comb..

[9]  Refael Hassin,et al.  Maximizing the Number of Unused Colors in the Vertex Coloring Problem , 1994, Inf. Process. Lett..

[10]  David G. Kirkpatrick,et al.  On the completeness of a generalized matching problem , 1978, STOC.

[11]  Alexander H. G. Rinnooy Kan,et al.  Bounds and Heuristics for Capacitated Routing Problems , 1985, Math. Oper. Res..

[12]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[13]  Leen Stougie,et al.  ANALYSIS OF HEURISTICS FOR VEHICLE ROUTING PROBLEMS. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1988 .

[14]  Vangelis Th. Paschos,et al.  Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2 , 2001, FCT.

[15]  Samir Khuller,et al.  z-Approximations , 2001, J. Algorithms.

[16]  Joseph F. Pekny,et al.  A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph , 1994, INFORMS J. Comput..

[17]  Eitan Zemel.  Measuring the Quality of Approximate Solutions to Zero-One Programming Problems , 1981, Math. Oper. Res..

[18]  Leen Stougie,et al.  ANALYSIS OF HEURISTICS FOR VEHICLE ROUTING PROBLEMS , 1988 .

[19]  Chung-Lun Li,et al.  On the Distance Constrained Vehicle Routing Problem , 1992, Oper. Res..

[20]  Refael Hassin,et al.  Better approximations for max TSP , 2000, Inf. Process. Lett..

[21]  Jérôme Monnot.  Differential approximation results for the traveling salesman and related problems , 2002, Inf. Process. Lett..

[22]  Giorgio Ausiello,et al.  Structure Preserving Reductions among Convex Optimization Problems , 1980, J. Comput. Syst. Sci..