A price-directed approach to stochastic inventory/routing

Operations Research

Volumn 52, Issue 4, 2004, Pages 499-514

  Adelman, Daniel ^a  

^a UNIVERSITY OF CHICAGO   (United States)

Author keywords

Dynamic programming optimal control, discounted infinite horizon: separable functional approximations; Inventory production, multi item: stochastic; Transportation, inventory routing: stochastic

Indexed keywords

DISCOUNTED INFINITE-HORIZON; INVENTORY ROUTING; MYOPIC POLICY; SEPARABLE FUNCTIONAL APPROXIMATIONS;

APPROXIMATION THEORY; DECISION THEORY; DYNAMIC PROGRAMMING; INVENTORY CONTROL; LINEAR PROGRAMMING; ROUTERS;

RANDOM PROCESSES;

EID: 4544373774     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.1040.0114     Document Type: Article

References (27)

1. Adelman, D. 2002. Price-directed replenishment of subsets: Methodology and its application to inventory routing. Manufacturing Service Oper. Management 5(3) 348-371.
2. Adelman, D. 2003. Internal transfer pricing for a decentralized operation with a shared supplier. Working paper, Graduate School of Business, The University of Chicago, Chicago, IL.
3. Adelman, D., G. L. Nemhauser. 1999. Price-directed control of remnant inventory systems. Oper. Res. 47 889-898.
4. Bell, E. T. 1934. Exponential numbers. Amer. Math. Monthly 41 411-419.
5. Bell, W. J., L. M. Dalberto, M. L. Fisher, A. J. Greenfield, R. Jaikumar, P. Kedia, R. G. Mack, P. J. Prutzman. 1983. Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces 13(6) 4-23.
6. Berman, O., R. C. Larson. 2001. Deliveries in an inventory/routing problem using stochastic dynamic programming. Transportation Sci. 35 192-213.
7. Bertsekas, D. P., J. N. Tsitsiklis. 1996. Neuro-Dynamic Programming. Athena Scientific.
8. Campbell, A., M. Savelsbergh, L. Clarke, A. Kleywegt. 1998. The inventory routing problem. T. G. Crainic, G. Laporte, eds. Fleet Management and Logistics. Kluwer Academic Publishers, Boston, MA, 95-112.
9. De Parias, D., B. Van Roy. 2003. The linear programming approach to approximate dynamic programming. Oper. Res. 51(6) 850-865.
10. Dror, M., M. Ball. 1987. Inventory routing: Reduction from an annual to a short-period problem. Naval Res. Logist. 34 891-905.
11. Federgruen, A., P. Zipkin. 1984. A combined vehicle routing and inventory allocation problem. Oper. Res. 32 1019-1037.
12. Gallego, G., A. Scheller-Wolf. 2000. Capacitated inventory problems with fixed order costs: Some optimal policy structure. Eur. J. Oper. Res. 126 603-613.
13. Gans, N., G. van Ryzin. 1999. Dynamic vehicle dispatching: Optimal heavy traffic performance and practical insights. Oper. Res. 47 675-692.
14. Godfrey, G. A., W. B. Powell. 2001. An adaptive, distribution-free approximation for the newsvendor problem with censored demands, with applications to inventory and distribution problems. Management Sci. 47 1101-1112.
15. Göthe-Lundgren, M., K. Jömsten, P. Värbrand. 1996. On the nucleolus of the basic vehicle routing game. Math. Programming 72 83-100.
16. Held, M., R. M. Karp. 1970. The traveling-salesman problem and minimum spanning trees. Oper. Res. 18 1138-1162.
17. Held, M., R. M. Karp. 1971. The traveling-salesman problem and minimum spanning trees: Part II. Math. Programming 1 6-25.
18. Kleywegt, A. J., V. S. Nori, M. W. Savelsbergh. 2002. The stochastic inventory routing problem with direct deliveries. Transportation Sci. 3694-118.
19. Kleywegt, A. J., V. S. Non, M. W. Savelsbergh. 2004. Dynamic programming approximations for a stochastic inventory routing problem, Transportation Sci. 38(1) 42-70.
20. Minkoff, A. S. 1993. A Markov decision model and decomposition heuristic for dynamic vehicle dispatching. Oper. Res. 41 77-90.
21. Powell, W. B., H. Topaloglu. 2002. Stochastic programming in transportation and logistics. A. Ruszczynski, A. Shapiro, eds. Handbook in Operations Research and Management Science: Stochastic Programming. Elsevier, Amsterdam, The Netherlands.
22. Puterman, M. L. 1994. Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley and Sons, New York.
23. Reiman, M. I., R. Rubio, L. M. Wein. 1999. Heavy traffic analysis of the dynamic stochastic inventory-routing problem. Transportation Sci. 33 361-380.
24. Schweitzer, P. J., A. Seidmann. 1985. Generalized polynomial approximations in Markovian decision processes. J. Math. Anal. Appl. 110 568-582.
25. Talluri, K., G. van Ryzin. 1998. An analysis of bid-price controls for network revenue management. Management Sci. 44 1577-1593.
26. Trudeau, P., M. Dror. 1992. Stochastic inventory routing: Route design with stockouts and route failures. Transportation Sci. 26 171-184.
27. Zipkin, P. 2000. Foundations of Inventory Management. McGraw-Hill, New York.