Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries

Naval Research Logistics

Volumn 46, Issue 6, 1999, Pages 654-670

  Anily, Shoshana ^a   Bramel, Julien ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b The Sanford C Bernstein Co Center for Leadership and Ethics   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONSUMER PRODUCTS; FREIGHT TRANSPORTATION; SET THEORY; TRANSPORTATION ROUTES;

CAPACITATED TRAVELING SALESMAN PROBLEM PICKUPS AND DELIVERIES; VEHICLE CAPACITY;

TRAVELING SALESMAN PROBLEM;

EID: 0033347983     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(199909)46:6<654::AID-NAV4>3.0.CO;2-A     Document Type: Article

References (12)

1. K. Altinkemer and B. Gavish, Heuristics for delivery problems with constant error guarantees, Transportation Sci 24 (1990), 294-297.
2. S. Anily and R. Hassin, The Swapping Problem, Networks 22 (1992), 419-433.
3. S. Anily and G. Mosheiov, The Traveling Salesman Problem with delivery and backhauls, Oper Res Lett 16 (1994), 11-18.
4. E.M. Arkin, R. Hassin, and L. Klein, Restricted delivery problems on a network, Networks 29 (1997), 205-216.
5. J. Braca, J. Bramel, B. Posner, and D. Simchi-Levi, A computerized approach to the New York City School Bus Routing Problem, IIE Trans 29 (1994), 693-702.
6. D.O. Casco, B.L. Golden, and E.A. Wasil, "Vehicle routing with backhauls: Models, algorithms, and case studies," Vehicle routing: Methods and studies, B.L. Golden and A.A. Assad (Editors), North-Holland, Amsterdam, 1988, 127-147.
7. P. Chalasani and R. Motwani, Approximating capacitated routing and delivery problems, Working Paper, Department of Computer Science, Stanford University, Palo Alto, CA, 1995.
8. N. Christofides, Worst-case analysis of a new heuristic for the Traveling Salesman Problem, Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 1976.
9. M. Haimovich and A.H.G. Rinnooy Kan, Bounds and heuristics for capacitated routing problems, Math Oper Res 10 (1985), 527-542.
10. E.L. Lawler, Combinatorial optimization: Networks and matroids. Holt, Rinehart and Winston, New York, 1976.
11. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys (Editors), The Traveling Salesman Problem: A guided tour of combinatorial optimization, Wiley, New York, 1985.
12. C.L. Li and D. Simchi-Levi, Worst-case analysis of heuristics for the multi-depot capacitated vehicle routing problems, ORSA J Comput 2 (1990), 64-73.