Approximating capacitated routing and delivery problems

SIAM Journal on Computing

Volumn 28, Issue 6, 1999, Pages 2133-2149

  Chalasani, Prasad ^a   Motwani, Rajeev ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; MATHEMATICAL MODELS; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

CAPACITATED DELIVERY; CAPACITATED VEHICLE ROUTING; MAXIMUM LATENCY PROBLEMS;

APPROXIMATION THEORY;

EID: 0033348662     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795295468     Document Type: Article

References (36)

1. K. ALTINKEMER AND B. GAVISH, Heuristics for delivery problems with constant error guarantees, Transportation Science, 24 (1990), pp. 294-297.
2. S. ANILY AND R. HASSIN, The swapping problem. Networks, 22 (1992), pp. 419-433.
3. S. ANILY AND G. MOSHEIOV, The traveling salesman problem with delivery and backhauls, Oper. Res. Lett., 16 (1994), pp. 11-18.
4. M. J. ATALLAH AND S. R. KOSARAJU, Efficient solutions to some transportation problems with applications to minimizing robot arm travel, SIAM J. Comput., 17 (1988), pp. 849-869.
5. B. AWERBUCH, Y. AZAR, A. BLUM, AND S. VEMPALA, Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen, in Proceedings of the 27th Annual ACM Symposium on the Theory of Computing, Las Vegas, NV, 1995, pp. 277-283.
6. L. BIANCO, A. MINGOZZI, S. RICCARDELLI, AND M. SPADONI, Exact and heuristic procedures for the traveling salesman problem with precedence constraints, based on dynamic programming, INFOR, 32 (1994), pp. 19-32.
7. A. BLUM, P. CHALASANI, D. COPPERSMITH, B. PULLEYBLANK, P. RAGHAVAN, AND M. SUDAN, The minimum latency problem, in Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, Montreal, Quebec, Canada, 1994, pp. 163-171.
8. A. BLUM, P. CHALASANI, AND S. VEMPALA, A constant-factor approximation for the k-MST problem in the plane, in Proceedings of the 27th Annual ACM Symposium on the Theory of Computing, Las Vegas, NV, 1995, pp. 294-302.
9. C. BREZOVEC, G. CORNUEJOLS, AND F. GLOVER, A matroid algorithm and its application to the efficient solution of two optimization problems on graphs, Math. Programming, 42 (1988), pp. 471-487.
10. B. CARLISLE AND K. Y. GOLDBERG, Report on TARDA, in Symposium on Theoretical Aspects of Rapid Deployment Automation, Adept Technology, San Jose, CA, 1994.
11. P. CHALASANI, R. MOTWANI, AND A. RAO, Approximation algorithms for robot grasp and delivery, in Proceedings of the 2nd International Workshop on Algorithmic Foundations of Robotics, Toulouse, France, 1990, pp. 347-362.
12. M. CHARIKAR, S. KHULLER, AND B. RAGHAVACHARI, Algorithms for capacitated vehicle routing, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, Dallas, TX, 1998, pp. 349-358.
13. N. CHRISTOFIDES, Worst-case analysis for a new heuristic for the traveling salesman problem, in Symposium on New Directions and Recent Results in Algorithms and Complexity, J. F. Traub, ed., Academic Press, New York, 1976.
14. N. CHRISTOFIDES, Vehicle routing, in The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shrnoys, eds., John Wiley, New York, 1985, pp. 431-448.
15. J. EDMONDS, Submodular functions, matroids and certain polyhedra, in Combinatorial Structures and Their Applications, Proceedings of Calgary International Conference, Calgary, AB, Canada, 1970, pp. 69-87.
16. J. EDMONDS, Matroid intersection, Ann. Discrete Math., 4 (1979), pp. 39-49.
17. M. L. FISHER, G. L. NEMHAUSER, AND L. A. WOLSEY, An analysis of approximations for finding a maximum weight Hamiltonian circuit, Oper. Res., 27 (1979), pp. 799-809.
18. K. R. FOX, B. GAVISH, AND S. C. GRAVES. Ann-constraint formulation of the (time-dependent) traveling salesman problem, Oper. Res., 28 (1980), pp. 1018-1021.
19. G. N. FREDERICKSON, M. HECHT, AND C. KIM, Approximation algorithms for some routing problems, SIAM J. Comput., 7 (1978), pp. 178-193.
20. A. M. FRIEZE, An Extension of Christofides' Heuristic to the k-person traveling salesman problem, Discrete Appl. Math., 6 (1983), pp. 79-83.
21. N. GARG AND D. S. HOCHBAUM, An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane, in Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, Montreal, Quebec, Canada, 1994, pp. 432-438.
22. M. GOEMANS AND J. KLEINBERG, An improved approximation ratio for the minimum, latency problem, in Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1996.
23. B. L. GOLDEN AND A. A. ASSAD, EDS., Vehicle Routing: Methods and Studies, North-Holland, Amsterdam, 1988.
24. P. HALL, On representatives of subsets, J. London Math. Soc., 10 (1935), pp. 26-30.
25. K. JANSEN, Bounds for the general capacitated routing problem, Networks, 23 (1993), pp. 165-173.
26. D. KONIG, Über graphen und ihre andwendung auf determinantentheorie und mengenlehre, Math. Ann., 77 (1916), pp. 453-465.
27. M. KUBO AND H. KAGUSAI, Heuristic algorithms for the single-vehicle dial-a-ride problem, J. Opcr. Res. Soc. Japan, 30 (1990), pp. 354-365.
28. J. A. HOOGEVEEN, Analysis of Christofides' heuristic: Some paths are more difficult than cycles, Oper. Res. Lett., 10 (1991), pp. 291-295.
29. E. LAWLER, Combinatorial Optimization: Networks and Matroids, Holt, Reinhart and Winston, New York, 1976.
30. T-Y. LI AND J-C. LATOMBE, On-line manipulation planning for two robot arms in a dynamic environment, in Proceedings of the 12th Annual IEEE International Conference on Robotics and Automation, 1995, pp. 1048-1055.
31. L. LOVÁSZ AND M. PLUMMER, Mathing Theory, North-Holland Math. Stud. 29, North-Holland, Amsterdam, 1986.
32. A. LUCENA, Time-dependent traveling salesman problem - the deliveryman case, Networks, 20 (1990), pp. 753-763.
33. J. MITCHELL, Guillotine subdivisions approximate polygonal subdivisions: A simple new method for the geometric k-MST problem, in Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1996.
34. H. PSAHAFTIS, Scheduling large-scale advance-request dial-a-ride systems, Amer. J. Math. Management Sci., 6 (1986), pp. 327-367.
35. R. RAVI, R. SUNDARAM, M. V. MARATHE, D. J. ROSENKRANTZ AND S. S. RAVI, Spanning trees short or small, in Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, Arlington, VA, 1994, pp. 546-555.
36. D. J. ROSENKRANTZ, R. E. STEARNS, AND P. M. LEWIS, An analysis of several heuristics for the traveling salesman problem, SIAM J. Comput., 6 (1977), pp. 563-581.