Dynamic Programming Approximations for a Stochastic Inventory Routing Problem
暂无分享,去创建一个
Martin W. P. Savelsbergh | Anton J. Kleywegt | Vijay S. Nori | M. Savelsbergh | A. Kleywegt | V. Nori
[1] Richard C. Larson,et al. Transporting Sludge to the 106-Mile Site: An Inventory/Routing Model for Fleet Sizing and Logistics System Design , 1988, Transp. Sci..
[2] Randolph W. Hall,et al. Distribution Strategies that Minimize Transportation and Inventory Costs , 1985, Oper. Res..
[3] John N. Tsitsiklis,et al. Average cost temporal-difference learning , 1997, Proceedings of the 36th IEEE Conference on Decision and Control.
[4] Awi Federgruen,et al. Two-Echelon Distribution Systems with Vehicle Routing Costs and Central Inventories , 1993, Oper. Res..
[5] Alan S. Minkoff. A Markov Decision Model and Decomposition Heuristic for Dynamic Vehicle Dispatching , 1993, Oper. Res..
[6] E. Angel,et al. The diagonal decomposition technique applied to the dynamic programming solution of elliptic partial differential equations , 1971 .
[7] H. Kushner. Numerical Methods for Stochastic Control Problems in Continuous Time , 2000 .
[8] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[9] John N. Tsitsiklis,et al. Neuro-Dynamic Programming , 1996, Encyclopedia of Machine Learning.
[10] Awi Federgruen,et al. A Combined Vehicle Routing and Inventory Allocation Problem , 1984, Oper. Res..
[11] J. Tsitsiklis,et al. An optimal one-way multigrid algorithm for discrete-time stochastic control , 1991 .
[12] Lap Mui Ann Chan,et al. Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models , 1998, Oper. Res..
[13] R. Bellman,et al. FUNCTIONAL APPROXIMATIONS AND DYNAMIC PROGRAMMING , 1959 .
[14] G. W. Stewart. On the Structure of Nearly Uncoupled Markov Chains , 1983, Computer Performance and Reliability.
[15] Pierre Semal,et al. Error Bounds for the Analysis by Decomposition of Non-Negative Matrices , 1983, Computer Performance and Reliability.
[16] R. Bellman,et al. Polynomial approximation—a new computational technique in dynamic programming: Allocation processes , 1962 .
[17] B. Fox. Discretizing dynamic programs , 1973 .
[18] John N. Tsitsiklis,et al. Stable LInear Approximations to Dynamic Programming for Stochastic Control Problems with Local Transitions , 1995, NIPS.
[19] John N. Tsitsiklis,et al. Feature-based methods for large scale dynamic programming , 2004, Machine Learning.
[20] D. Bertsekas. Convergence of discretization procedures in dynamic programming , 1975 .
[21] Marielle Christiansen,et al. Modelling path flows for a combined ship routingand inventory management problem , 1998, Ann. Oper. Res..
[22] Louis M. Dalberto,et al. Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling Optimizer , 1983 .
[23] Chi Chang. Reply to comment on "Discrete-sample curve fitting using Chebyshev polynomials and the approximate determination of optimal trajectories via dynamic programming" , 1966 .
[24] D. C. Collins,et al. Dimensional approximation in dynamic programming by structural decomposition , 1970 .
[25] Bruce L. Golden,et al. Analysis of a large scale vehicle routing problem with an inventory component , 1984 .
[26] Dimitri P. Bertsekas,et al. Dynamic Programming and Optimal Control, Two Volume Set , 1995 .
[27] K. Hinderer. Estimates for finite-stage dynamic programs , 1976 .
[28] Moshe Dror,et al. A vehicle routing improvement algorithm comparison of a "greedy" and a matching implementation for inventory routing , 1986, Comput. Oper. Res..
[29] A. Federgruen,et al. Rejoinder to “Comments on one-warehouse multiple retailer systems with vehicle routing costs” , 1991 .
[30] D. C. Collins. Reduction of dimensionality in dynamic programming via the method of diagonal decomposition , 1970 .
[31] David Simchi-Levi,et al. A Location Based Heuristic for General Routing Problems , 1995, Oper. Res..
[32] Chung-Yee Lee,et al. Stock Replenishment and Shipment Scheduling for Vendor-Managed Inventory Systems , 2000 .
[33] James R. Evans,et al. Aggregation and Disaggregation Techniques and Methodology in Optimization , 1991, Oper. Res..
[34] John N. Tsitsiklis,et al. Optimal stopping of Markov processes: Hilbert space theory, approximation algorithms, and an application to pricing high-dimensional financial derivatives , 1999, IEEE Trans. Autom. Control..
[35] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .
[36] Richard L. Tweedie,et al. Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.
[37] Ward Whitt,et al. Approximations of Dynamic Programs, II , 1979, Math. Oper. Res..
[38] Moshe Dror,et al. Inventory/routing: Reduction from an annual to a short-period problem , 1987 .
[39] Awi Federgruen,et al. One warehouse multiple retailer systems with vehicle routing costs , 1990 .
[40] Nicola Secomandi,et al. Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands , 2000, Comput. Oper. Res..
[41] Yehuda Bassok,et al. Dynamic Allocations for Multi-Product Distribution , 1995, Transp. Sci..
[42] Lawrence M. Wein,et al. Heavy Traffic Analysis of the Dynamic Stochastic Inventory-Routing Problem , 1999, Transp. Sci..
[43] Peter J. Wong,et al. A New Decomposition Procedure for Dynamic Programming , 1970, Oper. Res..
[44] D. M. Topkis. OPTIMAL ORDERING AND RATIONING POLICIES IN A NONSTATIONARY DYNAMIC INVENTORY MODEL WITH n DEMAND CLASSES , 1968 .
[45] Warren B. Powell,et al. Dynamic Control of Logistics Queueing Networks for Large-Scale Fleet Management , 1998, Transp. Sci..
[46] J. Quadrat. Numerical methods for stochastic control problems in continuous time , 1994 .
[47] Benjamin Van Roy,et al. On the existence of fixed points for approximate value iteration and temporal-difference learning , 2000 .
[48] Robin Roundy,et al. Heuristics for a One-Warehouse Multiretailer Distribution Problem with Performance Bounds , 1997, Oper. Res..
[49] Guillermo Gallego,et al. On the effectiveness of direct shipping strategy for the one-warehouse multi-retailer R -systems , 1990 .
[50] Yehuda Bassok,et al. Direct shipping and the dynamic single-depot/multi-retailer inventory system , 1997 .
[51] B. Nelson,et al. Using common random numbers for indifference-zone selection and multiple comparisons in simulation , 1995 .
[52] Ward Whitt,et al. Approximations of Dynamic Programs, I , 1978, Math. Oper. Res..
[53] Martin W. P. Savelsbergh,et al. The Stochastic Inventory Routing Problem with Direct Deliveries , 2002, Transp. Sci..
[54] Peter J. Wong,et al. Letter to the Editor - An Approach to Reducing the Computing Time for Dynamic Programming , 1970, Oper. Res..
[55] Ward Whitt,et al. A priori bounds for approximations of Markov programs , 1979 .
[56] K. Hinderer. ON APPROXIMATE SOLUTIONS OF FINITE-STAGE DYNAMIC PROGRAMS , 1978 .
[57] Luca Bertazzi,et al. Deterministic Order-Up-To Level Policies in an Inventory Routing Problem , 2002, Transp. Sci..
[58] Marielle Christiansen,et al. A method for solving ship routing problemswith inventory constraints , 1998, Ann. Oper. Res..
[59] Moshe Dror,et al. Stochastic Inventory Routing: Route Design with Stockouts and Route Failures , 1989, Transp. Sci..
[60] P. L'Ecuyer,et al. Approximation and bounds in discrete event dynamic programming , 1983, The 23rd IEEE Conference on Decision and Control.
[61] Kamlesh Mathur,et al. Integrating routing and inventory decisions in one-warehouse multiretailer multiproduct distribution systems , 1997 .
[62] Moshe Dror,et al. A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities , 1998, Transp. Sci..
[63] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[64] Richard S. Sutton,et al. Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.
[65] James W. Daniel,et al. Splines and efficiency in dynamic programming , 1976 .
[66] P. Schweitzer,et al. Generalized polynomial approximations in Markovian decision processes , 1985 .
[67] Christine A. Shoemaker,et al. Applying Experimental Design and Regression Splines to High-Dimensional Continuous-State Stochastic Dynamic Programming , 1999, Oper. Res..
[68] Richard C. Larson,et al. Period and phase of customer replenishment: A new approach to the Strategic Inventory/Routing problem , 1995 .
[69] Benjamin Van Roy,et al. A neuro-dynamic programming approach to retailer inventory management , 1997, Proceedings of the 36th IEEE Conference on Decision and Control.
[70] Moshe Dror,et al. A computational comparison of algorithms for the inventory routing problem , 1985 .
[71] Harold N. Gabow,et al. Data structures for weighted matching and nearest common ancestors with linking , 1990, SODA '90.
[72] William J. Cook,et al. Computing Minimum-Weight Perfect Matchings , 1999, INFORMS J. Comput..
[73] Marielle Christiansen,et al. Decomposition of a Combined Inventory and Time Constrained Ship Routing Problem , 1999, Transp. Sci..
[74] Richard T. Wong,et al. An Integrated Inventory Allocation and Vehicle Routing Problem , 1989, Transp. Sci..
[75] Thomas L. Morin,et al. COMPUTATIONAL ADVANCES IN DYNAMIC PROGRAMMING , 1978 .