Decomposing Inventory Routing Problems with Approximate Value Functions

@inproceedings{Toriello2010DecomposingIR,
  title={Decomposing Inventory Routing Problems with Approximate Value Functions},
  author={Alejandro Toriello and George L. Nemhauser and Martin W. P. Savelsbergh},
  year={2010}
}
We present a time decomposition for inventory routing problems. The methodology is based on valuing inventory with a concave piecewise linear function and then combining solutions to single-period subproblems using dynamic programming techniques. Computational experiments show that the resulting value function accurately captures the inventory’s value, and solving the multi-period problem as a sequence of single-period subproblems drastically decreases computational time without sacrificing… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 10 extracted citations

Fitting piecewise linear continuous functions

European Journal of Operational Research • 2012
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 37 references

Approximate dynamic programming: solving the curses of dimensionality

Optimization Methods and Software • 2009
View 6 Excerpts
Highly Influenced

Inventory routing problems: a logistical overview

JORS • 2007
View 5 Excerpts
Highly Influenced

Vehicle Routing

J.-F. Cordeau, G. Laporte, M.W.P. Savelsbergh, D. Vigo
C. Barnhart and G. Laporte, editors, Handbook in Operations Research and Management Science: Transportation, Volume 14, chapter 6, pages 367–428. Elsevier • 2007
View 5 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…