A Decomposition Approach for the Inventory-Routing Problem

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.

[1]  Martin W. P. Savelsbergh,et al.  Delivery Volume Optimization , 2004, Transp. Sci..

[2]  Moshe Dror,et al.  Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework , 2002, Transp. Sci..

[3]  Guillermo Gallego,et al.  On the effectiveness of direct shipping strategy for the one-warehouse multi-retailer R -systems , 1990 .

[4]  Lawrence Bodin,et al.  Networks and vehicle routing for municipal waste collection , 1974, Networks.

[5]  Martin W. P. Savelsbergh,et al.  Dynamic Programming Approximations for a Stochastic Inventory Routing Problem , 2004, Transp. Sci..

[6]  Awi Federgruen,et al.  A Combined Vehicle Routing and Inventory Allocation Problem , 1984, Oper. Res..

[7]  D. Bonn,et al.  Two heads are better than one , 1999, Nature Methods.

[8]  Martin W. P. Savelsbergh,et al.  The Stochastic Inventory Routing Problem with Direct Deliveries , 2002, Transp. Sci..

[9]  Martin W. P. Savelsbergh,et al.  Algorithms for dynamic and stochastic logistics problems , 1999 .

[10]  Jonathan F. Bard,et al.  A GRASP for the Vehicle Routing Problem with Time Windows , 1995, INFORMS J. Comput..

[11]  Nicos Christofides,et al.  The period routing problem , 1984, Networks.

[12]  Moshe Dror,et al.  A computational comparison of algorithms for the inventory routing problem , 1985 .

[13]  Moshe Dror,et al.  A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities , 1998, Transp. Sci..

[14]  M O Ball.  ALLOCATION/ROUTING: MODELS AND ALGORITHMS. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1988 .

[15]  Teodor Gabriel Crainic,et al.  Fleet management and logistics , 1998 .

[16]  M. Savelsbergh,et al.  The Inventory Routing Problem , 1998 .

[17]  Bruce L. Golden,et al.  Analysis of a large scale vehicle routing problem with an inventory component , 1984 .

[18]  Moshe Dror,et al.  A branch and cut algorithm for the VRP with satellite facilities , 1998 .

[19]  Moshe Dror,et al.  Inventory/routing: Reduction from an annual to a short-period problem , 1987 .

[20]  Giuseppe Paletta,et al.  A Heuristic for the Periodic Vehicle Routing Problem , 1992, Transp. Sci..

[21]  Ann Melissa Campbell,et al.  4 THE INVENTORY ROUTING PROBLEM , 1998 .

[22]  Martin W. P. Savelsbergh,et al.  Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems , 2004, Transp. Sci..