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.