Coordination of split deliveries in one-warehouse multi-retailer distribution systems

In this paper, we consider a distribution system where a warehouse is responsible for replenishing the inventories at multiple retailers by a fleet of vehicles of limited capacity. If a distribution policy of the system involves split deliveries, that is, the inventory of at least one retailer is replenished by using multiple vehicle routes, the coordination of the deliveries can further reduce the inventory cost of the retailer. We consider the coordination where two split deliveries are realized by direct shipping and multiple-stop shipping, respectively. To the best of our knowledge, this kind of coordination was never studied in the literature but can find its application in inventory routing problems. This paper proposes and analyses a class of coordination policies for the split deliveries which can reduce the inventory costs of the retailers without increasing transportation costs. A non-linear programming model is established for formulating the class of polices. Because the optimal coordination policy corresponding to an optimal solution of the model may be hard to find and/or implement, two simple but effective coordination policies are proposed. The inventory cost savings realized by the two policies are evaluated analytically and algorithmically. Our theoretical analysis and computational experiments show that both policies are effective. Under certain conditions, they can save 50% of the inventory costs at the retailers without increasing transportation costs.

[1]  Feng Chu,et al.  A new model and hybrid approach for large scale inventory routing problems , 2008, Eur. J. Oper. Res..

[2]  Claudia Archetti,et al.  To Split or not to Split: That is the Question , 2008 .

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

[4]  Kin Keung Lai,et al.  A partition approach to the inventory/routing problem , 2007, Eur. J. Oper. Res..

[5]  Shoshana Anily,et al.  An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem , 2004, Discret. Appl. Math..

[6]  Daniel Adelman,et al.  A Price-Directed Approach to Stochastic Inventory/Routing , 2004, Oper. Res..

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

[8]  D. Simchi-Levi,et al.  Probabilistic Analyses and Algorithms for Three-Level Distribution Systems , 1998 .

[9]  Awi Federgruen,et al.  Two-Echelon Distribution Systems with Vehicle Routing Costs and Central Inventories , 1993, Oper. Res..

[10]  Martin W. P. Savelsbergh,et al.  A Decomposition Approach for the Inventory-Routing Problem , 2004, Transp. Sci..

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

[12]  Moshe Dror,et al.  Savings by Split Delivery Routing , 1989, Transp. Sci..

[13]  Martin W. P. Savelsbergh,et al.  Worst-Case Analysis for Split Delivery Vehicle Routing Problems , 2006, Transp. Sci..

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

[15]  M. Dror,et al.  Split delivery routing , 1990 .

[16]  Kamlesh Mathur,et al.  An Efficient Heuristic Algorithm for a Two-Echelon Joint Inventory and Routing Problem , 2007, Transp. Sci..

[17]  Marshall L. Fisher,et al.  A Periodic Inventory Routing Problem at a Supermarket Chain , 2004, Oper. Res..

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

[19]  R. Hall Comments on “One-warehouse multiple retailer systems with vehicle routing costs” , 1991 .