A New Optimal Algorithm for the Joint Replenishment Problem
提出了一种新最优算法，用于求解联合补货问题中的最优严格循环策略和所有循环策略中的最优策略，实验表明该算法优于现有最优算法。
In this paper, we propose a new optimal algorithm for the Joint Replenishment Problem. The proposed algorithm can be used to determine the optimal strict-cyclic policy, as well as the optimal among all cyclic policies for the joint replenishment problem. Computational experiments on randomly generated problems reveal that the proposed algorithm performs better than existing optimal algorithms for the problem.