Journal article
A Decomposition Approach for the Inventory-Routing Problem
Transportation science, Vol.38(4), pp.488-502
11/01/2004
DOI: 10.1287/trsc.1030.0054
Abstract
In this paper, we present a solution approach for the inventory-routing problem. The inventory-routing problem is a variation of the vehicle-routing problem that arises in situations where a vendor has the ability to make decisions about the timing and sizing of deliveries, as well as the routing, with the restriction that customers are not allowed to run out of product. We develop a two-phase approach based on decomposing the set of decisions: A delivery schedule is created first, followed by the construction of a set of delivery routes. The first phase utilizes integer programming, whereas the second phase employs routing and scheduling heuristics. Our focus is on creating a solution methodology appropriate for large-scale real-life instances. Computational experiments demonstrating the effectiveness of our approach are presented.
Details
- Title: Subtitle
- A Decomposition Approach for the Inventory-Routing Problem
- Creators
- Ann Melissa Campbell - University of IowaMartin W. P. Savelsbergh - Georgia Institute of Technology
- Resource Type
- Journal article
- Publication Details
- Transportation science, Vol.38(4), pp.488-502
- DOI
- 10.1287/trsc.1030.0054
- ISSN
- 0041-1655
- eISSN
- 1526-5447
- Language
- English
- Date published
- 11/01/2004
- Academic Unit
- Business Analytics
- Record Identifier
- 9984380496502771
Metrics
3 Record Views