- Title
- Decomposing inventory routing problems with approximate value functions
- Creator
- Toriello, Alejandro; Nemhauser, George; Savelsbergh, Martin
- Relation
- Naval Research Logistics (NRL) Vol. 57, Issue 8, p. 718-727
- Publisher Link
- http://dx.doi.org/10.1002/nav.20433
- Publisher
- John Wiley & Sons
- Resource Type
- journal article
- Date
- 2010
- Description
- 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 multiperiod problem as a sequence of single-period subproblems drastically decreases computational time without sacrificing solution quality.
- Subject
- inventory routing; mixed-integer program; approximate dynamic program
- Identifier
- http://hdl.handle.net/1959.13/937746
- Identifier
- uon:12610
- Identifier
- ISSN:1520-6750
- Language
- eng
- Reviewed
- Hits: 522
- Visitors: 523
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|