The Stochastic Inventory Routing Problem with Direct Deliveries

Published Online:https://doi.org/10.1287/trsc.36.1.94.574

References

  • Anily S., Federgruen A. One warehouse multiple retailer systems with vehicle routing costs. Management Sci. (1990) 36:92–114LinkGoogle Scholar
  • Anily S., Federgruen A. Two-echelon distribution systems with vehicle routing costs and central inventories. Oper. Res. (1993) 41:37–47LinkGoogle Scholar
  • Bard J., Huang L., Jaillet P., Dror M. A decomposition approach to the inventory routing problem with satelitte facilities. Tranportation Sci. (1998) 32:189–203LinkGoogle Scholar
  • Barnes-Schuster D., Bassok Y. Direct shipping and the dynamic single-depot/multi-retailer inventory system. Eur. J. Oper. Res. (1997) 101:509–518CrossrefGoogle Scholar
  • Bassok Y., Ernst R. Dynamic allocations for multi-product distribution. Transportation Sci. (1995) 29:256–266LinkGoogle Scholar
  • Bell W., Dalberto L., Fisher M., Greenfield A., Jaikumar R., Kedia P., Mack R., Prutzman P. Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces (1983) 13:4–23LinkGoogle Scholar
  • Benjamin J. An analysis of inventory and transportation costs in a constrained network. Transportation Sci. (1989) 23:177–183LinkGoogle Scholar
  • Berman O., Larson R. C. Deliveries in an inventory routing problem using stochastic dynamic programming. (1999) . Technical Report, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
  • Bertsekas D. P. Convergence of discretization procedures in dynamic programming. IEEE Trans. on Automatic Control (1975) 20:415–419CrossrefGoogle Scholar
  • Bertsekas D. P.Dynamic Programming and Optimal Control (1995) (Athena Scientific, Belmont, MA) Google Scholar
  • Bertsekas D. P., Shreve S. E.Stochastic Optimal Control: The Discrete Time Case (1978) (Academic Press, New York) Google Scholar
  • Bertsekas D. P., Tsitsiklis J. N. Neuro-Dynamic Programming. (1996) (Athena Scientific, New York) Google Scholar
  • Blumenfeld D. E., Burns L. D., Daganzo C. F. Synchronizing production and transportation schedules. Transportation Res. (1991) 25B:23–37CrossrefGoogle Scholar
  • Blumenfeld D. E., Burns L. D., Diltz J. D., Daganzo C. F. Analyzing trade-offs between transportation, inventory and production costs on freight networks. Transportation Res. (1985) 19B:361–380CrossrefGoogle Scholar
  • Bose R. C. On the application of the theory of Galois fields to the problem of construction of Hyper-Graeco-Latin Squares. Sankhya (1938) 3:323–338Google Scholar
  • Bose R. C., Bush K. A. Orthogonal arrays of strength two and three. Ann. Math. Statist. (1952) 23:508–524CrossrefGoogle Scholar
  • Burns L. D., Hall R. W., Blumenfeld D. E., Daganzo C. F. Distribution strategies that minimize transportation and inventory costs. Oper. Res. (1985) 33:469–490LinkGoogle Scholar
  • Campbell A., Clarke L., Kleywegt A. J., Savelsbergh M. W. P., Crainic T. G., Laporte G. The inventory routing problem. Fleet Management and Logistics (1998) (Kluwer Academic Publishers, Dordrecht, The Netherlands) . Chapter 4CrossrefGoogle Scholar
  • Çetinkaya S., Lee C. Y. Stock replenishment and shipment scheduling for vendor managed inventory systems. Management Sci. (2000) 46:217–232LinkGoogle Scholar
  • Chan L. M. A., Federgruen A., Simchi-Levi D. Probabilistic analysis and practical algorithms for inventory-routing models. Oper. Res. (1998) 46:96–106LinkGoogle Scholar
  • Chandra P., Fisher M. Coordination of production and distribution planning. Eur. J. Oper. Res. (1994) 72:503–517CrossrefGoogle Scholar
  • Chien T. W. Determining profit-maximizing production/ shipping policies in a one-to-one direct shipping, stochastic demand environment. Eur. J. Oper. Res. (1993) 64:83–102CrossrefGoogle Scholar
  • Chien T. W., Balakrishnan A., Wong R. T. An integrated inventory allocation and vehicle routing problem. Transportation Sci. (1989) 23:67–76LinkGoogle Scholar
  • Chow C. S., Tsitsiklis J. N. An optimal one-way multigrid algorithm for discrete-time stochastic control. IEEE Trans. Automatic Control (1991) AC-36:898–914CrossrefGoogle Scholar
  • Christiansen M. Decomposition of a combined inventory and time constrained ship routing problem. Transportation Sci. (1999) 33:3–16LinkGoogle Scholar
  • Christiansen M., Nygreen B. A method for solving ship routing problems with inventory constraints. Ann. Oper. Res. (1998a) 81:357–378CrossrefGoogle Scholar
  • Christiansen M., Nygreen B. Modelling path flows for a combined ship routing and inventory management problem. Ann. Oper. Res. (1998b) 82:391–412CrossrefGoogle Scholar
  • Cohen M. A., Lee H. L. Strategic analysis of integrated production-distribution systems: Models and methods. Oper. Res. (1988) 36:216–228LinkGoogle Scholar
  • Dror M., Ball M. Inventory/routing: reduction from an annual to a short period problem. Naval Res. Logist. Quart. (1987) 34:891–905CrossrefGoogle Scholar
  • Dror M., Trudeau P. Cash flow optimization in delivery scheduling. Eur. J. Oper. Res. (1996) 88:504–515CrossrefGoogle Scholar
  • Dror M., Ball M., Golden B. A computational comparison of algorithms for the inventory routing problem. Ann. Oper. Res. (1985) 4:3–23CrossrefGoogle Scholar
  • Federgruen A., Simchi-Levi D., Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Analysis of vehicle routing and inventory-routing problems. Network Routing (1995) 8(North-Holland, Amsterdam, Netherlands)297–373Chapter 4CrossrefGoogle Scholar
  • Federgruen A., Zipkin P. A combined vehicle routing and inventory allocation problem. Oper. Res. (1984) 32:1019–1037LinkGoogle Scholar
  • Fumero F., Vercellis C. Synchronized development of production, inventory, and distribution schedules. Transportation Sci. (1999) 33:330–340LinkGoogle Scholar
  • Gallego G., Simchi-Levi D. On the effectiveness of direct shipping strategy for the one-warehouse multi-retailer R-systems. Management Sci. (1990) 36:240–243LinkGoogle Scholar
  • Golden B., Assad A., Dahl R. Analysis of a large scale vehicle routing problem with an inventory component. Large Scale Systems (1984) 7:181–190Google Scholar
  • Haimovich M., Rinnooy Kan A. H. G. Bounds and heuristics for capacitated routing problems. Math. Oper. Res. (1985) 10:527–542LinkGoogle Scholar
  • Jaillet P., Bard J., Huang L., Dror M. Delivery cost approximations for inventory rating problems in a rolling horizon framework. Transportion Sci. (2002) . ForthcomingLinkGoogle Scholar
  • Kleywegt A. J., Nori V. S., Savelsbergh M. W. P. The stochastic inventory routing problem. Technical Report. (2000) . The Logistics Institute, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GAGoogle Scholar
  • Kushner H. J., Dupuis P.Numerical Methods for Stochastic Control Problems in Continuous Time (1992) (Springer-Verlag, New York) CrossrefGoogle Scholar
  • Meyn S. P., Tweedie R. L.Markov Chains and Stochastic Stability (1993) (Springer-Verlag, London, UK) CrossrefGoogle Scholar
  • Minkoff A. S. A Markov decision model and decomposition heuristic for dynamic vehicle dispatching. Oper. Res. (1993) 77–90LinkGoogle Scholar
  • Mustard D., Lyness J. N., Blatt J. M. Numerical quadrature in n dimensions. Comput. J. (1963) 6:75–87CrossrefGoogle Scholar
  • Nahmias S., Smith S. A. Optimizing inventory levels in two-echelon retailer system with partial lost sales. Management Sci. (1994) 40:582–596LinkGoogle Scholar
  • Nelson B. L., Matejcik F. J. Using common random numbers for indifference-zone selection and multiple comparisons in simulation. Management Sci. (1995) 41:1935–1945LinkGoogle Scholar
  • Puterman M. L.Markov Decision Processes (1994) (John Wiley & Sons, New York) CrossrefGoogle Scholar
  • Pyke D. F., Cohen M. A. Performance characteristics stochastic integrated production-distribution systems. Eur. Oper. Res. (1993) 68:23–48CrossrefGoogle Scholar
  • Pyke D. F., Cohen M. A. Multiproduct integrated production-distribution systems. Eur. J. Oper. Res. (1994) 74:18–49CrossrefGoogle Scholar
  • Reiman M. I., Rubio R., Wein L. M. Heavy traffic analysis the dynamic stochastic inventory-routing problem. Transportation Sci. (1999) 33:361–380LinkGoogle Scholar
  • Ruszczyński A., Syski W. A method of aggregate stochastic subgradients with on-line stepsize rules for convex stochastic programming problems. Math. Programming Stud. (1986) 113–131CrossrefGoogle Scholar
  • Stroud A. H.Approximate Calculation of Multiple Integrals (1971) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
  • Thomas D. J., Griffin P. M. Coordinated supply chain management. Eur. J. Oper. Res. (1996) 94:1–15CrossrefGoogle Scholar
  • Trudeau P., Dror M. Stochastic inventory routing: Route design with stockouts and route failures. Transportation Sci. (1992) 171–184LinkGoogle Scholar
  • Tsitsiklis J. N., Van Roy B. An analysis of temporal-difference learning with function approximation. IEEE Trans. Automatic Control (1997) 42:674–690CrossrefGoogle Scholar
  • Van Roy B., Bertsekas D. P., Lee Y., Tsitsiklis J. N. neuro-dynamic programming approach to retailer inventory management. (1997) . Technical Report. Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.