Abstract：The multi-item capacitated lot-sizing problem consists of determining the magnitude and the timing of some operations of durable results for several items in a finite number of processing periods so as to satisfy a known demand in each period. An approximation algorithm is described, which is based on simulated annealing algorithm. The method incorporates a primal partitioning scheme— with a network flow subproblem—to obtain good feasible solutions.
韩丽敏, 王飞, 冯允成. 解批量问题的模拟退火算法[J]. 北京航空航天大学学报, 1999, 25(5): 588-591.
Han Limin, Wang Fei, Feng Yuncheng. Simulated Annealing Heuristic for Lot-Sizing Problem. JOURNAL OF BEIJING UNIVERSITY OF AERONAUTICS AND A, 1999, 25(5): 588-591.
1 Eppen G D,Martin R K. Solving multi-item capacitated lot-sizing problems using variable redefinition. Operations Research,1987,35(6):832~848
2. Hindi K S. Solving the CLSP by a tabu search heuristic. J Opl Res Soc, 1996, 47(1):151~161
3. Eisenhut P S. A dynamic lot sizing algorithm with capacity constraints. AIIE Transactions,1975, 7(2):170~176
4. Bertsekas D P, Tseng P. Relaxation methods for minimum cost ordinary and generalized network flow problems. Operations Research, 1988, 36(1):93~114
5. Glove F,Laguna M. Modern heuristic techniques for combinatorial problems.Oxford:Blackwell Scientific Publishing, 1993
6. 刘 勇,康立山,陈毓屏.非数值并行算法——模拟退火算法.北京:科学出版社,1995
7. Lambrecht M R, Vanderveken H. Heuristic procedures for the single operation, multi-item loading problem. AIIE Transactions, 1979, 11(4):319~326
1999, Vol. 25 
