An Alternating Direction Method of Multipliers for Optimizing (S, S) Policies in a Distribution System with Joint Replenishment Volume Constraints

In this paper, we study a two-echelon distribution system in which multiple products are jointly replenished at each stocking location and the inventory of each product at each location is controlled by an (s, S) policy. The transportation capacity in volume of products for each joint replenishment is limited, and linear rationing policies are used for both on-hand inventory and transportation capacity allocation in the system in case of lack. We propose a novel scenario-based model for the optimization of the (s, S) policies in the system that considers the rationing policies. Because of its high complexity when the number of scenarios is large, an Alternating Direction Method of Multipliers is proposed to solve the model. Based on real data, forty instances were generated and tested to evaluate the model and the solution method. Our numerical experiments show that for these instances this method could find a better solution in a much shorter computation time compared with CPLEX 12.9, whereas the latter often run out of memory for large-size instances on a personal computer. Moreover, the inventory policies found by this scenario-based optimization approach can reduce costs and improve fill rates compared with those currently used in Alibaba