Dynamic Programming Approximations for a Stochastic Inventory Routing Problem

Transportation Science

Volumn 38, Issue 1, 2004, Pages 42-70

  Kleywegt, Anton J ^a   Non, Vijay S ^a   Savelsbergh, Martin W P ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Freight transportation; Logistics; Stochastic inventory routing

Indexed keywords

APPROXIMATION THEORY; COSTS; DYNAMIC PROGRAMMING; INVENTORY CONTROL; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; RANDOM PROCESSES;

LOGISTICS ANALYSIS; STOCHASTIC INVENTORY ROUTING; VENDOR MANAGED INVENTORY REPLENISHMENT (VMI);

FREIGHT TRANSPORTATION;

EID: 1642324107     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.1030.0041     Document Type: Article

References (79)

1. Anily, S., A. Federgruen. 1990. One warehouse multiple retailer systems with vehicle routing costs. Management Sci. 36 92-114.
2. Anily, S., A. Federgruen. 1991. Rejoinder to comments on one warehouse multiple retailer systems with vehicle routing costs. Management Sci. 37 1497-1499.
3. Anily, S., A. Federgruen. 1993. Two-echelon distribution systems with vehicle routing costs and central inventories. Oper. Res. 41 37-47.
4. Bard, J. F., L. Huang, P. Jaillet, M. Dror. 1998. A decomposition approach to the inventory routing problem with satellite facilities. Transportation Sci. 32 189-203.
5. Barnes-Schuster, D., Y. Bassok. 1997. Direct shipping and the dynamic single-depot/multi-retailer inventory system. Eur. J. Oper. Res. 101 509-518.
6. Bassok, Y., R. Ernst. 1995. Dynamic allocations for multi-product distribution. Transportation Sci. 29 256-266.
7. Bell, W., L. Dalberto, M. Fisher, A. Greenfield, R. Jaikumar, P. Kedia, R. Mack, P. Prutzman. 1983. Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces 13 4-23.
8. Bellman, R., S. Dreyfus. 1959. Functional approximations and dynamic programming. Math. Tables Other Aids Comput. 13 247-251.
9. Bellman, R., R. Kalaba, B. Kotkin. 1963. Polynomial approximation - A new computational technique in dynamic programming: Allocation processes. Math. Comput. 17 155-161.
10. Bertazzi, L., G. Paletta, M. G. Speranza. 2002. Deterministic order-up-to level policies in an inventory routing problem. Transportation Sci. 36 119-132.
11. Bertsekas, D. P. 1975. Convergence of discretization procedures in dynamic programming. IEEE Trans. Auto, Control AC-20 415-419.
12. Bertsekas, D. P. 1995. Dynamic Programming and Optimal Control Athena Scientific, Belmont, MA.
13. Bertsekas, D. P., S. E. Shreve. 1978. Stochastic Optimal Control: The Discrete Time Case. Academic Press, New York.
14. Bertsekas, D. P., J. N. Tsitsiklis. 1996. Neuro-Dynamic Programming. Athena Scientific, New York.
15. Bramel, J., D. Simchi-Levi. 1995. A location based heuristic for general routing problems. Oper. Res. 43 649-660.
16. Burns, L. D., R. W. Hall, D. E. Blumenfeld, C. F. Daganzo. 1985. Distribution strategies that minimize transportation and inventory costs. Oper. Res. 33 469-490.
17. Çetinkaya, S., C. Y. Lee. 2000. Stock replenishment and shipment scheduling for vendor managed inventory systems. Management Sci. 46 217-232.
18. Chan, L. M. A., A. Federgruen, D. Simchi-Levi. 1998. Probabilistic analysis and practical algorithms for inventory-routing models. Oper. Res. 46 96-106.
19. Chang, C. S. 1966. Discrete-sample curve fitting using Chebyshev polynomials and the approximate determination of optimal trajectories via dynamic programming. IEEE Trans. Auto. Control AC-11 116-118.
20. Chen, V. C. P., D. Ruppert, C. A. Shoemaker. 1999. Applying experimental design and regression splines to high-dimensional continuous-state stochastic dynamic programming. Oper. Res. 47 38-53.
21. Chien, T. W., A. Balakrishnan, R. T. Wong. 1989. An integrated inventory allocation and vehicle routing problem. Transportation Sci. 23 67-76.
22. Chow, C. S., J. N. Tsitsiklis. 1991. An optimal one-way multigrid algorithm for discrete-time stochastic control. IEEE Trans. Auto. Control AC-36 898-914.
23. Christiansen, M. 1999. Decomposition of a combined inventory and time constrained ship routing problem. Transportation Sci. 33 3-16.
24. Christiansen, M., B. Nygreen. 1998a. A method for solving ship routing problems with inventory constraints. Ann. Oper. Res. 81 357-378.
25. Christiansen, M., B. Nygreen. 1998b. Modelling path flows for a combined ship routing and inventory management problem. Ann. Oper. Res. 82 391-412.
26. Collins, D. C. 1970. Reduction of dimensionality in dynamic programming via the method of diagonal decomposition. J. Math. Anal. Appl. 31 223-234.
27. Collins, D. C., E. S. Angel. 1971. The diagonal decomposition technique applied to the dynamic programming solution of elliptic partial differential equations. J. Math. Anal. Appl. 33 467-481.
28. Collins, D. C., A. Lew. 1970. A dimensional approximation in dynamic programming by structural decomposition. J. Math. Anal. Appl. 30 375-384.
29. Cook, W., A. Rohe. 1998. Computing minimum-weight perfect matchings. Preprint.
30. Courtois, P. J. 1977. Decomposability: Queueing and Computer System Applications. Academic Press, New York.
31. Courtois, P. J., P. Semal. 1984. Error bounds for the analysis by decomposition of non-negative matrices. G. Iazeolla, P. J. Courtois, A. Hordijk, eds. Mathematical Computer Performance and Reliability. Elsevier Science Publishers B.V., Amsterdam, The Netherlands, Chapter 2.2, 209-224.
32. Daniel, J. W. 1976. Splines and efficiency in dynamic programming. J. Math. Anal. Appl. 54 402-407.
33. De Farias, D. P., B. Van Roy. 2000. On the existence of fixed points for approximate value iteration and temporal-difference learning. J. Optim. Theory Appl. 105 589-608.
34. Dror, M., M. Ball. 1987. Inventory/routing: Reduction from an annual to a short period problem. Naval Res. Logist. Quart. 34 891-905.
35. Dror, M., L. Levy. 1986. Vehicle routing improvement algorithms: Comparison of a "greedy" and a matching implementation for inventory routing. Comput. Oper. Res. 13 33-45.
36. Dror, M., M. Ball, B. Golden. 1985. A computational comparison of algorithms for the inventory routing problem. Ann. Oper. Res. 4 3-23.
37. Edmonds, J. 1965a. Maximum matching and a polyhedron with 0,1-vertices. J. Res. National Bureau Standards 69B 125-130.
38. Edmonds, J. 1965b. Paths, trees and flowers. Canadian J. Math. 17 449-467.
39. Federgruen, A., P. Zipkin. 1984. A combined vehicle routing and inventory allocation problem. Oper. Res. 32 1019-1037.
40. Fox, B. L. 1973. Discretizing dynamic programs. J. Optim. Theory Appl. 11 228-234.
41. Gabow, H. N. 1990. Data structures for weighted matching and nearest common ancestors with linking. Proc. 1st Annual ACM-SIAM Sympos. Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 434-443.
42. Gallego, G., D. Simchi-Levi. 1990. On the effectiveness of direct shipping strategy for the one-warehouse multi-retailer R-systems. Management Sci. 36 240-243.
43. Gaur, V., M. L. Fisher. 2002. An optimization algorithm for the joint vehicle routing and inventory control problem and its implementation at a large supermarket chain. Preprint.
44. Golden, B., A. Assad, R. Dahl. 1984. Analysis of a large scale vehicle routing problem with an inventory component. Large Scale Systems 7 181-190.
45. Haurie, A., P. L'Ecuyer. 1986. Approximation and bounds in discrete event dynamic programming. IEEE Trans. Auto. Control AC-31 227-235.
46. Herer, Y. R. Roundy. 1997. Heuristics for a one-warehouse multi-retailer distribution problem with performance bounds. Oper. Res. 45 102-115.
47. Hinderer, K. 1976. Estimates for finite-stage dynamic programs. J. Math. Anal. Appl. 55 207-238.
48. Hinderer, K. 1978. On approximate solutions of finite-stage dynamic programs. M. L. Puterman, ed. Dynamic Programmming and its Applications. Academic Press, New York, 289-317.
49. Hinderer, K., G. Hübner. 1977. On exact and approximate solutions of unstructured finite-stage dynamic programs. H. C. Tijms, J. Wessels, eds. Markov Decision Theory: Proc. Adv. Sem. Markov Decision Theory (September 13-17, 1976), Amsterdam, The Netherlands, 57-76.
50. Kleywegt, A. J., V. S. Nori, M. W. P. Savelsbergh. 2002. The stochastic inventory routing problem with direct deliveries. Transportation Sci. 36 94-118.
51. Kushner, H. J. 1990. Numerical methods for continuous control problems in continuous time. SIAM J. Control Optim. 28 999-1048.
52. Kushner, H. J., P. Dupuis. 1992. Numerical Methods for Stochastic Control Problems in Continuous Time. Springer-Verlag, New York.
53. Larson, R. 1988. Transporting sludge to the 106 mile site: An inventory/routing model for fleet sizing and logistics system design. Transportation Sci. 22 186-198.
54. Meyn, S. P., R. L. Tweedie. 1993. Markov Chains and Stochastic Stability. Springer-Verlag, London, U.K.
55. Minkoff, A. S. 1993. A Markov decision model and decomposition heuristic for dynamic vehicle dispatching. Oper. Res. 41 77-90.
56. Morin, T. 1978. Computational advances in dynamic programming. M. L. Puterman, ed. Dynamic Programmming and its Applications. Academic Press, New York, 53-90.
57. Nelson, B. L., F. J. Matejcik. 1995. Using common random numbers for indifference-zone selection and multiple comparisons in simulation. Management Sci. 41 1935-1945.
58. Powell, W. B., T. A. Carvalho. 1998. Dynamic control of logistics queueing networks for large-scale fleet management. Transportation Sci. 32 90-109.
59. Puterman, M. L. 1994. Markov Decision Processes. John Wiley & Sons, Inc., New York.
60. Reiman, M. I., R. Rubio, L. M. Wein. 1999. Heavy traffic analysis of the dynamic stochastic inventory-routing problem. Transportation Sci. 33 361-380.
61. Rogers, D. P., R. D. Plante, R. T. Wong, J. R. Evans. 1991. Aggregation and disaggregation techniques and methodology in optimization. Oper. Res. 39 553-582.
62. Schweitzer, P. J., A. Seidman. 1985. Generalized polynomial approximations in Markovian decision processes. J. Math. Anal. Appl. 110 568-582.
63. Secomandi, N. 2000. Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Comput. Oper. Res. 27 1201-1225.
64. Stewart, G. W. 1984. On the structure of nearly uncoupled Markov chains. G. Iazeolla, P. J. Courtois, A. Hordijk, eds. Mathematical Computer Performance and Reliability. Elsevier Science Publishers B.V., Amsterdam, The Netherlands, Chapter 2.7, 287-302.
65. Sutton, R. S., A. G. Barto. 1998. Reinforcement Learning: An Introduction. MIT Press, Cambridge, MA.
66. Topkis, D. M. 1968. Optimal ordering and rationing policies in a nonstationary dynamic inventory model with n demand classes. Management Sci. 15 160-176.
67. Trudeau, P., M. Dror. 1992. Stochastic inventory routing: Route design with stockouts and route failures. Transportation Sci. 26 171-184.
68. Tsitsiklis, J. N., B. Van Roy. 1996. Feature-based methods for large-scale dynamic programming. Machine Learning 22 59-94.
69. Tsitsiklis, J. N., B. Van Roy. 1999a. Average cost temporal-difference learning. Automatica 35 1799-1808.
70. Tsitsiklis, J. N., B. Van Roy. 1999b. Optimal stopping of Markov processes: Hilbert space theory, approximation algorithms, and an application to pricing high-dimensional derivatives. IEEE Trans. Auto. Control 44 1840-1851.
71. Van Roy, B., J. N. Tsitsiklis. 1996. Stable linear approximations to dynamic programming for stochastic control problems with local transitions. Advances in Neural Information Processing Systems, Vol. 8. MIT Press, Cambridge, MA, 1045-1051.
72. Van Roy, B., D. P. Bertsekas, Y. Lee, J. N. Tsitsiklis. 1997. A neurodynamic programming approach to retailer inventory management. Proc. IEEE Conf. Decision Control, IEEE, New York, 4052-4058.
73. Viswanathan, S., K. Mathur. 1997. Integrating routing and inventory decisions in one-warehouse multiretailer multiproduct distribution systems. Management Sci. 43 294-312.
74. Webb, R., R. Larson. 1995. Period and phase of customer replenishment: A new approach to the strategic inventory/routing problem. Eur. J. Oper. Res. 85 132-148.
75. Whitt, W. 1978. Approximations of dynamic programs, I. Math. Oper. Res. 3 231-243.
76. Whitt, W. 1979a. A-priori bounds for approximations of Markov programs. J. Math. Anal. Appl. 71 297-302.
77. Whitt, W. 1979b. Approximations of dynamic programs, II. Math. Oper. Res. 4 179-185.
78. Wong, P. J. 1970a. An approach to reducing the computing time for dynamic programming. Oper. Res. 18 181-185.
79. Wong, P. J. 1970b. A new decomposition procedure for dynamic programming. Oper. Res. 18 119-131.