A Periodic Inventory Routing Problem at a Supermarket Chain

Albert Heijn, BV, a supermarket chain in the Netherlands, faces a vehicle routing and delivery scheduling problem once every three to six months. Given hourly demand forecasts for each store, travel times and distances, cost parameters, and various transportation constraints, the firm seeks to determine a weekly delivery schedule specifying the times when each store should be replenished from a central distribution center, and to determine the vehicle routes that service these requirements at minimum cost. We describe the development and implementation of a system to solve this problem at Albert Heijn. The system resulted in savings of 4% of distribution costs in its first year of implementation and is expected to yield 12%-20% savings as the firm expands its usage. It also has tactical and strategic advantages for the firm, such as in assessing the cost impact of various logistics and marketing decisions, in performance measurement, and in competing effectively through reduced lead time and increased frequency of replenishment.

[1]  Gilbert Laporte,et al.  Classical Heuristics for the Capacitated VRP , 2002, The Vehicle Routing Problem.

[2]  Yehuda Bassok,et al.  Direct shipping and the dynamic single-depot/multi-retailer inventory system , 1997 .

[3]  Nicos Christofides,et al.  An Algorithm for the Vehicle-dispatching Problem , 1969 .

[4]  Awi Federgruen,et al.  One warehouse multiple retailer systems with vehicle routing costs , 1990 .

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

[6]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[7]  Martin W. P. Savelsbergh,et al.  Inventory Routing in Practice , 2002, The Vehicle Routing Problem.

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

[9]  David Simchi-Levi,et al.  Analysis of vehicle routing and inventory-routing problems , 1995 .

[10]  Louis M. Dalberto,et al.  Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling Optimizer , 1983 .

[11]  Robert E. Tarjan,et al.  Faster scaling algorithms for general graph matching problems , 1991, JACM.

[12]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[13]  David Simchi-Levi,et al.  A Location Based Heuristic for General Routing Problems , 1995, Oper. Res..

[14]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[15]  Marshall L. Fisher,et al.  Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees , 1994, Oper. Res..

[16]  Lap Mui Ann Chan,et al.  Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models , 1998, Oper. Res..

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

[18]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[19]  Richard T. Wong,et al.  An Integrated Inventory Allocation and Vehicle Routing Problem , 1989, Transp. Sci..

[20]  S. Micali,et al.  Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs , 1982, FOCS 1982.

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

[22]  David Simchi-Levi,et al.  The logic of logistics , 1997 .

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

[24]  Silvio Micali,et al.  Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[25]  A. Federgruen,et al.  Rejoinder to “Comments on one-warehouse multiple retailer systems with vehicle routing costs” , 1991 .

[26]  Richard C. Larson,et al.  Transporting Sludge to the 106-Mile Site: An Inventory/Routing Model for Fleet Sizing and Logistics System Design , 1988, Transp. Sci..

[27]  Vishal Gaur.  Essays in retail operations management , 2001 .

[28]  Richard C. Larson,et al.  Period and phase of customer replenishment: A new approach to the Strategic Inventory/Routing problem , 1995 .

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