Price-Directed Replenishment of Subsets: Methodology and its Application to Inventory Routing

Manufacturing and Service Operations Management

Volumn 5, Issue 4, 2003, Pages 348-371

  Adelman, Daniel ^a  

^a UNIVERSITY OF CHICAGO   (United States)

Author keywords

Approximate Dynamic Programming; Inventory Routing; Price Directed Operations; Semi Markov Decision Processes

Indexed keywords

COSTS; DECISION MAKING; DYNAMIC PROGRAMMING; MARKOV PROCESSES; SALES;

INVENTORY ROUTING; PRICE-DIRECTED OPERATIONS;

INVENTORY CONTROL;

EID: 0345802362     PISSN: 15234614     EISSN: None     Source Type: Journal    
DOI: 10.1287/msom.5.4.348.24884     Document Type: Article

References (56)

1. Adelman, D. 1997. Remnant inventory systems. Ph.D. dissertation, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA.
2. _. 2004. A price-directed approach to stochastic inventory/routing. Oper. Res. Forthcoming.
3. _, G. L. Nemhauser. 1999. Price-directed control of remnant inventory systems. Oper. Res. 47 889-898.
4. _, _, M. Padron, R. Stubbs, R. Pandit. 1999. Allocating fibers in cable manufacturing. Manufacturing Service Oper. Management 1 21-35.
5. Anily, S., A. Federgruen. 1990. One warehouse multiple retailer systems with vehicle routing costs, Management Sci. 36 92-114.
6. Arapostathis, A., V. S. Borkar, E. Fernández-Gaucherand, M. K. Ghosh, S. I. Marcus. 1993. Discrete time controlled Markov processes with average cost criterion: A survey. SIAM J. Control Optim. 31 282-344.
7. Bell, W. J., L. M. Dalberto, M. L. Fisher, et al. 1983. Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces 13(6) 4-23.
8. Bellman, R. E. 1957. Dynamic Programming. Princeton University Press, Princeton, NJ.
9. _, S. E. Dreyfus. 1959. Functional approximations and dynamic programming. Math. Tables Other Aids Comput. 13 247-251.
10. _, R. Kalaba, B. Kotkin. 1973. Polynomial approximation - A new computational technique in dynamic programming allocation processes. Math. Comput. 17 155-161.
11. Berman, O., R. C. Larson. 2001. Deliveries in an inventory/routing problem using stochastic dynamic programming. Transportation Sci. 35 192-213.
12. Bertsekas, D. P., J. N. Tsitsiklis. 1996. Neuro-Dynamic Programming. Athena Scientific, MA.
13. Bertsimas, D., J. Niño-Mora. 2000. Restless bandits, linear programming relaxations, and a primal-dual index heuristic. Oper. Res. 48 80-90.
14. Bhattacharya, R. N., M. Majumdar. 1989. Controlled semi-Markov models under long-run average rewards. J. Statist. Planning Inference 22 223-242.
15. Bramel, J., D. Simchi-Levi. 1995. A location based heuristic for general routing problems. Oper. Res. 43 649-660.
16. 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.
17. Chan, L. M., A. Federgruen, D. Simchi-Levi. 1998. Probabilistic analyses and practical algorithms for inventory routing models. Oper. Res. 46 96-106.
18. Chen, R.-R., S. Meyn. 1999. Value iteration and optimization of multiclass queueing networks. Queueing Systems 32 65-97.
19. Dantzig, G. B. 1963. Linear Programming and Extensions. Princeton University Press, Princeton, NJ.
20. de Farias, D., B. Van Roy. 2003. The linear programming approach to approximate dynamic programming. Oper. Res. 51(6) 850-865.
21. Demski, J. 1994. Managerial Uses of Accounting Information. Kluwer Academic Publishers, Boston, MA.
22. Denardo, E. V., B. L. Fox. 1968. Multichain Markov renewal programs, SIAM J. Appl. Math. 16 468-487.
23. Dopuch, N., D. Drake. 1964. Accounting implications of a mathematical programming approach to the transfer price problem. J. Accounting Res. 2(Spring) 10-24.
24. Dror, M., M. Ball. 1987. Inventory routing: Reduction from an annual to a short-period problem. Naval Res. Logist. 34 891-905.
25. Dynkin, E. B., A. A. Yushkevich. 1979. Controlled Markov Processes. Springer, Berlin-Heidelberg, New York.
26. Federgruen, A., Y. S. Zheng. 1992. The joint replenishment problem with general joint cost structures. Oper. Res. 40 384-403.
27. Fisher, M. 1981. The Lagrangian relaxation method for solving integer programming problems. Management Sci. 27 1-18.
28. _. 1994. Optimal solution of vehicle routing problems using minimum κ-trees. Oper. Res. 42 626-642.
29. _, A. Greenfield, R. Jaikumar, P. Kedia. 1982. Real-time scheduling of a bulk delivery fleet: Practical application of Lagrangean relaxation. Technical report, The Wharton School, University of Pennsylvania, Philadelphia, PA.
30. Fox, B. 1966. Markov renewal programming by linear fractional programming. SIAM J. Appl. Math. 14 1418-1432.
31. Gans, N., G. van Ryzin. 1999. Dynamic vehicle dispatching: Optimal heavy traffic performance and practical insights. Oper. Res. 47 675-692.
32. Hassin, R., N. Megiddo. 1991. Exact computation of optimal inventory policies over an unbounded horizon. Math. Oper. Res. 16 534-546.
33. Hernández-Lerma, O. 1989. Adaptive Markov Control Processes. Springer-Verlag, New York.
34. _, J. B. Lasserre. 1996. Discrete-Time Markov Control Processes: Basic Optimality Criteria. Springer-Verlag.
35. Hirshleifer, J. 1956. On the economics of transfer pricing. J. Bus. 29(July) 172-184.
36. Jewell, W. S. 1963. Markov-renewal programming, I and II. Oper. Res. 11 938-971.
37. Kleywegt, A. J., V. S. Nori, M. W. Savelsbergh. 2002. The stochastic inventory routing problem with direct deliveries. Transportation Sci. 36 94-118.
38. Lasdon, L. S. 1970. Optimization Theory for Large Systems. Macmillan.
39. Luque-Vásquez, F., O. Hernández-Lerma. 1999. Semi-Markov control models with average costs. Appl. Math. (Warsaw) 26 315-331.
40. Powell, W. B., T. Carvalho. 1998. Dynamic control of logistics queueing networks for large scale fleet management. Transportation Sci. 32 90-109.
41. _, H. Topaloglu. 2003. Stochastic programming in transportation and logistics. A. Ruszczynski, A. Shapiro, eds. Handbook in Operations Research and Management Science: Stochastic Programming, Vol. 10. Elsevier, Amsterdam, The Netherlands.
42. Puterman, M. L. 1994. Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, New York.
43. Queyranne, M. 1987. Comment on "A dynamic programming algorithm for joint replenishment under general order cost functions." Management Sci. 33 131-133.
44. Reiman, M. I., R. Rubio, L. M. Wein. 1999. Heavy traffic analysis of the dynamic stochastic inventory-routing problem. Transportation Sci. 33 361-380.
45. Rosenblatt, M. J., M. Kaspi. 1985. A dynamic programming algorithm for joint replenishment under general order cost functions. Management Sci. 31 369-373.
46. Roundy, R. O., W. L. Maxwell, Y. T. Herer, S. R. Tayur, A. W. Getzler. 1991. A price-directed approach to real-time scheduling of production operations. IIE Trans. 23 149-160.
47. Rust, J. 1996. Numerical dynamic programming in economics. H. Amman, D. Kendrick, J. Rust, eds. Handbook of Computational Economics, Chapter 14. Elsevier, Amsterdam, The Netherlands, 614-722.
48. Schäl, M. 1992. On the second optimality equation for semi-Markov decision models. Math. Oper, Res. 17 470-486.
49. Schweitzer, P. J., A. Seidmann. 1985. Generalized polynomial approximations in Markovian decision processes. J. Math. Anal. Appl. 110 568-582.
50. Sigman, K., R. W. Wolff. 1993. A review of regenerative processes. SIAM Rev. 35 269-288.
51. Simpson, R. W. 1989. Using network flow techniques to find shadow prices for market and seat inventory control. MIT Flight Transportation Laboratory Memorandum M89-1, Cambridge, MA.
52. Singh, S. P., R. C. Yee. 1994. An upper bound on the loss from approximate optimal value functions. Machine Learning 16 227-233.
53. Sutton, R. S., A. G. Barto. 1998. Reinforcement Learning. MIT Press, Cambridge, MA.
54. Talluri, K., G. van Ryzin. 1998. An analysis of bid-price controls for network revenue management. Management Sci. 44 1577-1593.
55. Williamson, E. L. 1992. Airline network seat control. Ph.D. dissertation, MIT, Cambridge, MA.
56. Zipkin, P. 2000. Foundations of Inventory Management. McGraw-Hill.