联合补充库存的拉格朗日松弛与退火算法

A Ragelari Relaxation Method and Annealing Algorithm of Joint Replenishment Problem

针对确定性需求的联合生产补充(JRP)问题,有多种启发式算法,但这些算法或不能保证最优或计算复杂。本文利用现代优化方法模拟退火算法和拉格朗日松驰算法,设计出一种新的算法,通过算例表明该算法可得出较优的可行解,可以更有效地解决实际问题。

There are several heuristic algorithms for joint replenishment inventory problems, but among which none can guarantee to yield an optimal solution or the computation is complex. This paper presents a new algorithm based on simulated annealing algorithm and Ragelari relaxation algorithm. The algorithm is illustrated with an example, and the result indicates that the algorithm can efficiently solve the problem.