An Algorithm for the Joint Replenishment Problem with Multiple Resource Constraints
The deterministic joint replenishment problem with multiple resource constraints is presented and its mathematic model is set up. On the basis of that, a full analysis is given of the relationship between decision variables T (basic cycle time) and kj (replenishment frequency of item j) then bounds on T and kj are obtained. A modified simulated annealing algorithm is proposed to search the optimal value within a much tighter range and the problem is effectively solved. The results of the example indicate that the algorithm can get a good solution and is applicable to larger problems.
joint replenishment resource constraints decision variables simulated annealing
Hui Xu Shi-liang Jin Yue Hong
school of mechanical electronic engineering and automation Shanghai University Shanghai, China
国际会议
上海
英文
2007-09-21（万方平台首次上网日期，不代表论文的发表时间）