确定性联合补充库存问题的模拟退火算法

Simulated Annealing Algorithm of Deterministic Joint Replenishment Problem

对确定性需求的联合补充库存问题许多文献已有不少启发式算法,这些算法都是基于枚举方式计算。通过分析该问题,应用现代优化理论,提出一个有效的模拟退火算法,通过算例表明,该算法可得出较优的、与最优解偏差较小的可行解,可以有效地解决此类问题。

During the last decades, many heuristic procedures for the joint replenishment problem have appeared in the literature. These procedures are based on the enumerative approach. In this paper we present an optimal approach based on simulated annealing theory. By this approach we can find a small deviation from the optimal value. The results of the example indicate that the algorithm can more effectively solve the problem.