One warehouse multiple retailer systems with vehicle routing costs
Management Science
Probabilistic Analyses and Algorithms for Three-Level Distribution Systems
Management Science
Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models
Operations Research
Dynamic Programming Approximations for a Stochastic Inventory Routing Problem
Transportation Science
A Periodic Inventory Routing Problem at a Supermarket Chain
Operations Research
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
An Efficient Heuristic Algorithm for a Two-Echelon Joint Inventory and Routing Problem
Transportation Science
A Price-Directed Approach to Stochastic Inventory/Routing
Operations Research
A Decomposition Approach for the Inventory-Routing Problem
Transportation Science
Worst-Case Analysis for Split Delivery Vehicle Routing Problems
Transportation Science
Computers and Industrial Engineering
Expert Systems with Applications: An International Journal
A local search method for periodic inventory routing problem
Expert Systems with Applications: An International Journal
Hi-index | 0.01 |
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.