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

References

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