Computing Near-Optimal Policies in Generalized Joint Replenishment

We provide a practical methodology for solving the generalized joint replenishment (GJR) problem, based on a mathematical programming approach to approximate dynamic programming. We show how to automatically generate a value function approximation basis built upon piecewise-linear ridge functions by developing and exploiting a theoretical connection with the problem of finding optimal cyclic schedules. We provide a variant of the algorithm that is effective in practice, and we exploit the special structure of the GJR problem to provide a coherent, implementable framework.

[1]  Panos M. Pardalos,et al.  Approximate dynamic programming: solving the curses of dimensionality , 2009, Optim. Methods Softw..

[2]  Diego Klabjan,et al.  Existence of Optimal Policies for Semi-Markov Decision Processes Using Duality for Infinite Linear Programming , 2006, SIAM J. Control. Optim..

[3]  O. Hernández-Lerma,et al.  Discrete-time Markov control processes , 1999 .

[4]  Maurice Queyranne.  Comment on A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions , 1987 .

[5]  Daniel Adelman,et al.  Price-Directed Replenishment of Subsets: Methodology and Its Application to Inventory Routing , 2003, Manuf. Serv. Oper. Manag..

[6]  Ravindra K. Ahuja,et al.  Network Flows , 2011 .

[7]  Suresh Kumar Goyal.  Comment on A Dynamic Programming Approach for Joint Replenishment Under General Order Cost Functions , 1987 .

[8]  Warren B. Powell,et al.  Approximate Dynamic Programming - Solving the Curses of Dimensionality , 2007 .

[9]  Thomas L. Magnanti,et al.  A Comparison of Mixed - Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems , 2003, Manag. Sci..

[10]  Benjamin Van Roy,et al.  The Linear Programming Approach to Approximate Dynamic Programming , 2003, Oper. Res..

[11]  Daniel Adelman,et al.  A Price-Directed Approach to Stochastic Inventory/Routing , 2004, Oper. Res..

[12]  Diego Klabjan,et al.  An Infinite-Dimensional Linear Programming Algorithm for Deterministic Semi-Markov Decision Processes on Borel Spaces , 2007, Math. Oper. Res..

[13]  S. K. Goyal,et al.  A dynamic programming algorithm for joint replenishment under general order cost functions , 1987 .

[14]  Benjamin Van Roy,et al.  On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming , 2004, Math. Oper. Res..

[15]  W. Fleming.  Book Review: Discrete-time Markov control processes: Basic optimality criteria , 1997 .

[16]  Moshe Dror.  Routing Propane Deliveries , 2005 .

[17]  Meir J. Rosenblatt,et al.  Note---A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions , 1985 .

[18]  P. Schweitzer,et al.  Generalized polynomial approximations in Markovian decision processes , 1985 .

[19]  Diego Klabjan,et al.  Duality and Existence of Optimal Policies in Generalized Joint Replenishment , 2005, Math. Oper. Res..