Chapter 4 Analysis of vehicle routing and inventory-routing problems

Handbooks in Operations Research and Management Science

Volumn 8, Issue C, 1995, Pages 297-373

  Federgruen, Awi ^a   Simchi Levi, David ^b  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b NORTHWESTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77957061075     PISSN: 09270507     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0927-0507(05)80108-2     Document Type: Review

References (67)

1. Altinkemer, K., Gavish, B., Heuristics for unequal weight delivery problems with a fixed error guarantee. Oper. Res. Letters 6 (1987), 149–158.
2. Altinkemer, K., Gavish, B., Heuristics for delivery problems with constant error guarantees. Transp. Sci. 24 (1990), 294–297.
3. Anily, S., Federgruen, A., One warehouse multiple retailer systems with vehicle routing costs. Manage. Sci. 36 (1990), 92–114.
4. Anily, S., Federgruen, A., A class of Euclidean routing problems with general route cost functions. Math. Oper. Res. 15 (1990), 268–285.
5. Anily, S., Federgruen, A., Structured partitioning problems. Oper. Res. 39 (1991), 130–149.
6. Anily, S., Federgruen, A., Rejoinder to: Comments on one warehouse multiple retailer systems with vehicle routing costs. Manage. Sci. 37 (1991), 1497–1499.
7. to appearAnily, S., Federgruen, A., Two-echelon distribution systems with vehicle routing costs and central inventories. 1992.
8. Assad, A.A., Modeling and implementation issues in vehicle routing. Golden, B.L., Assad, A.A., (eds.) Vehicle Routing: Methods and Studies, 1988, Elsevier Science Publishers, B.V., Berlin, 7–45.
9. Assad, A., Golden, B., Dahl, R., Dror, M., Design of an inventory/routing system for a large propane distribution firm. Gooding, C., (eds.) Proc. 1982 Southeast Tims Conference, Myrtle Beach, 1982, 315–320.
10. Beardwood, J., Halton, J.L., Hammersley, J.M., The shortest path through many points. Proc. Cam. Phil. Soc., 55, 1959, 299–327.
11. Beasley, J., Route first-cluster second methods for vehicle routing. Omega 11 (1983), 403–408.
12. Bell, W.J., Dalberto, L.M., Fisher, M.L., Greenfield, A.J., Jaikumar, J., Kedia, P., Mack, R.G., Prutzman, P.J., Improving the distribution of industrial gases with on-line computerized routing and scheduling optimizer. Interfaces 13 (1983), 4–23.
13. Bertsimas, J.D., van Ryzin, G., A stochastic and dynamic vehicle routing problem in the Euclidean plane. Oper. Res. 39 (1991), 601–615.
14. Bertsimas, J.D., van Ryzin, G., Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles. Oper. Res. 41 (1993), 60–76.
15. Bienstock, D., Bramel, J., Simchi-Levi, D., A probabilistic analysis of tour partitioning heuristics for the capacitated vehicle routing problem with unsplit demands. Math. Oper. Res. 18 (1993), 786–802.
16. Submitted toBraca, J., Bramel, J., Posner, B., Simchi-Levi, D., A computerized approach to the manhattan school bus routing project. IIE Trans, 1993.
17. Bramel, J., Coffman, E.G. Jr., Shor, P.W., Simchi-Levi, D., Probabilistic analysis of the capacitated vehicle routing problem with unsplit demands. Oper. Res. 40 (1992), 1095–1106.
18. Bramel, J., Li, C.L., Simchi-Levi, D., Probabilistic analysis of heuristics for the vehicle routing problem with time windows. Am. J. Math. Manage. Sci. 13 (1994), 267–322.
19. Bramel, J., Simchi-Levi, D., A location based heuristic for general routing problems. Working Paper, 1992, Columbia University.
20. Chakravarty, A.K., Orlin, J.B., Rothblum, V.G., A partitioning problem with additive objective with an application to optimal inventory groupings for joint replenishment. Oper. Res. 30 (1982), 1018–1020.
21. Chandra, P., Fisher, M.L., Coordination of production and distribution planning. Working Paper, 90-11-06, 1990, The Wharton School, University of Pennsylvania.
22. Chien, T.W., Balakrishnan, A., Wong, R.T., An integrated inventory allocation and vehicle routing problem. Transp. Sci. 23 (1989), 67–76.
23. Christofides, N., The vehicle routing problem. R.A.I.R.O. Rech. Oper. 10 (1976), 55–76.
24. Christofides, N., Worst-case analysis of a new heuristic for the travelling salesman problem. Report 388 Graduate School of Industrial Administration, 1976, Carnegie-Mellon University.
25. Christofides, N., Vehicle routing. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B., (eds.) The Traveling Salesman Problem, 1985, John Wiley & Sons Ltd., 431–448.
26. Christofides, N., Eilon, S., An algorithm for the vehicle dispatching problems. Oper. Res. Q. 20 (1969), 309–318.
27. Coffman, E.G. Jr., Garey, M.R., Johnson, D.S., Approximation algorithms for binpacking — an update survey. Ausiello, G., Lucertini, M., Serafini, P., (eds.) Algorithm Design for Computer System Design, 1984, Springer- Verlag, 49–106.
28. Coffman, E.G. Jr., Lueker, G.S., Rinnooy Kan, A.H.G., Asymptotic methods in the probabilistic analysis of sequencing and packing heuristics. Manage. Sci. 34 (1988), 266–290.
29. Coffman, E.G. Jr., Lueker, G.S., Probabilistic Analysis of Packing and Partitioning Algorithms. 1991, John Wiley & Sons Ltd., New York, N.Y.
30. Croes, A., A method for solving traveling salesman problems. Oper. Res. 5 (1958), 791–812.
31. Dror, M., Ball, M., Golden, B., A computational comparison of algorithms for the inventory routing problem. Ann. Oper. Res. 4 (1986), 3–23.
32. Dror, M., Ball, M., Inventory/routing: reduction from an annual to a short-period problem. Nav. Res. Logist. Q. 34 (1987), 891–905.
33. Federgruen, A., Zipkin, P., Solution techniques for some allocation problems. Math. Program. 25 (1983), 13–24.
34. Federgruen, A., Zipkin, P., A combined vehicle routing and inventory allocation problem. Oper. Res. 32 (1984), 1019–1032.
35. Fisher, M., Worst-case analysis of algorithms. Manage. Sci. 26 (1980), 1–17.
36. Chapter 1, this volumeFisher, M., Vehicle routing. Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L., (eds.) Handbooks on Operations Research and Management Science, Vol. 8, 1992, Network Routing, Elsevier Science, B.V., New York, N.Y.
37. Fisher, M., Jaikumar, R., A generalized assignment heuristic for vehicle routing. Networks 11 (1981), 109–124.
38. Gallego, G., Simchi-Levi, D., On the effectiveness of direct shipping strategy for the one warehouse multi-retailer R-systems. Manage. Sci. 36 (1990), 240–243.
39. Garey, M.R., Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979, Freeman, Amsterdam.
40. Gavish, B., A decision support system to manage the transportation needs of a large corporation. AIIE Trans. 13:1 (1981), 61–85.
41. Geoffrion, A.M., Generalized Benders decomposition. J. Optimization Theory Appl. 10 (1972), 237–260.
42. Gillett, B.E., Miller, L.R., A heuristic algorithm for the vehicle dispatch problem. Oper. Res. 22 (1974), 340–349.
43. Golden, B., Assad, A., Dahl, R., Analysis of a large scale vehicle routing problem with inventory component. Large Scale System 7 (1984), 181–190.
44. Haimovich, M., Rinnooy Kan, A.H.G., Bounds and heuristics for capacitated routing problems. Math. Oper. Res. 10 (1985), 527–542.
45. Haimovich, M., Rinnooy Kan, A.H.G., Stougie, L., Analysis of heuristics for vehicle routing problems. Golden, B.L., Assad, A.A., (eds.) Vehicle Routing: Methods and Studies, 1988, Elsevier Science, B.V., San Francisco, Calif, 47–61.
46. Hall, R.W., Comments on: One-warehouse multiple retailer systems with vehicle routing costs. Manage. Sci. 37 (1991), 1496–1497.
47. Karmarkar, N., Probabilistic analysis of some bin-packing algorithms. Proc. 23rd Annu. Symp. on Foundations of Computer Science, 1982, 107–111.
48. Karp, R.M., Probabilistic analysis of partitioning algorithms for the traveling salesman problem. Math. Oper. Res. 2:3 (1977), 209–224.
49. Laporte, G., Desrochers, M., Nobert, Y., Two exact algorithms for the distance-constrained vehicle routing problem. Networks 14 (1984), 161–172.
50. Laporte, G., Nobert, Y., Taillefer, S., Solving a family of multi-depot vehicle routing and location routing problems. Transp. Sci. 22 (1988), 161–172.
51. Lawler, E.L., Combinatorial Optimization: Networks and Matroids. 1976, Helt, Rinehart and Winston, Amsterdam.
52. Li, C.L., Simchi-Levi, D., Analysis of heuristics for the multidepot capacitated vehicle routing problems. ORSA J. Comput. 2 (1990), 64–73.
53. Li, C.L., Simchi-Levi, D., Desrochers, M., On the distance constrained vehicle routing problem. Oper. Res. 40 (1992), 790–800.
54. Lin, S., Kernighan, B., an effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21 (1973), 498–513.
55. Mirchandani, P.B., Francis, R.L., Discrete Location Theory. 1990, John Wiley and Sons, Inc, New York.
56. Chapter 2Muckstadt, J.M., Roundy, R.O., Analysis of multistage production systems. Graves, S.C., Rinnooy Kan, A.H.G., Zipkin, P.H., (eds.) Handbooks of Operations Research and Management Science, Vol. 4, 1992, Logistics of Products and Inventory Elsevier Science, B.V., New York.
57. Psaraftis, H.N., On the practical importance of asymptotic optimality in certain heuristic algorithms. Networks 14 (1984), 587–596.
58. Queyranne, M., Finding 94%-effective policies in linear time for some production inventory systems. University of British Columbia, Working Paper, 1987.
59. Rhee, W.T., Optimal bin packing with items of random sizes. Math. Oper. Res. 13 (1988), 140–151.
60. Rhee, W.T., Probabilistic analysis of a capacitated vehicle routing problem. Working Paper, 1991, The Ohio State University, Amsterdam.
61. Rhee, W.T., Talagrand, M., Martingale inequalities and NP-complete problems. Math. Oper. Res. 12 (1987), 177–181.
62. Roundy, R., 98% effective integer ratio lot sizing for one warehouse multi-retailer systems. Manage. Sci. 31 (1985), 1416–1430.
63. Simchi-Levi, D., Bramel, J., On the optimal solution value of the capacitated vehicle routing problem with unsplit demands. Working Paper, 1990, Columbia University.
64. Simchi-Levi, D., Bramel, J., Probabilistic analysis of heuristics for the capacitated vehicle routing problem with unsplit demands. Working Paper, 1990, Columbia University.
65. Simchi-Levi, D., Hierarchical planning for probabilistic distribution systems. Manage. Sci. 38 (1992), 198–211.
66. Solomon, M.M., On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints. Networks 14:4 (1986), 571–586.
67. Spaccamela, A.M., Rinnooy Kan, A.H.G., Stougie, L., Hierarchical vehicle routing problems. Networks 14:4 (1984), 571–586.