Analysis of solution space-dependent performance of simulated annealing: The case of the multi-level capacitated lot sizing problem

Computers and Operations Research

Volumn 27, Issue 9, 2000, Pages 895-903

  Barbarosoglu, Gülay ^a   Özdamar, Linet ^b  

^a BOGAZICI UNIVERSITY   (Turkey)

^b ISTANBUL KULTUR UNIVERSITY   (Turkey)

Author keywords

Capacitated lot sizing with setup times; Neighbourhood transition schemes; Simulated annealing

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; INVENTORY CONTROL; MATHEMATICAL MODELS; PROCESS CONTROL; SIMULATED ANNEALING;

MULTI-LEVEL CAPACITATED LOT SIZING PROBLEMS (MLCLSP);

PRODUCTION CONTROL;

ANNEALING;

EID: 0034073578     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(99)00064-7     Document Type: Article

References (13)

1. Tempelmeir H., Derstroff M. A Lagrangean-based heuristic for dynamic multi-item multi-level constrained lot sizing with setup times. Management Science. 42:1996;738-757.
2. Billington P.J., Blackburn J., Maes J., Millen R., Van Wassenhove L.N. Multi-item lot sizing in capacitated multi-stage serial systems. IIE Transactions. 26:1994;12-18.
3. Maes J., McClain J.O., Van Wassenhove L.N. Multi-level capacitated lot sizing complexity and LP-based heuristics. European Journal of Operational Research. 53:1991;131-148.
4. Chen W.H., Thizy J.M. Analysis of relaxations for the multi-item capacitated lot sizing problem. Annals of Operations Research. 26:1990;29-72.
5. Kuik R., Salomon M., Van Wassenhove L.N., Maes J. Linear programming, simulated annealing and tabu search heuristics for lot sizing in bottleneck assembly systems. IIE Transactions. 11:1993;319-326.
6. Bitran G.R., Yanasse H.H. Computational complexity of the capacitated lot size problem. Management Science. 28:1982;1174-1186.
7. Garey M, Johnson D. Computers and intractability: a guide to the theory of NP-completeness. San Francisco CA: Freeman, 1979.
8. Kirkpatrick A., Gelatt C.D. Jr., Vechi M.P. Optimization by simulated annealing. Management Science. 220:1983;671-680.
9. Osman I.H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research. 41:1993;421-452.
10. Connolly D.T. General purpose simulated annealing. Journal of Operational Research. 43:1992;495-505.
11. Abramson D, Dang H, Krishnamoorthy M. A comparison of two methods for solving 0-1 integer programmes using a general purpose simulated annealing algorithm. Working Paper, School of Computing and Information Technology, Griffith University, Australia, 1996.
12. Ingberg L. Simulated annealing: practice versus theory. Journal of Mathematical Computational Modelling. 18:1994;29-57.
13. "Ozdamar L., Bozyel M.A. Simultaneous lot sizing and loading of product families on parallel facilities of different classes. International Journal of Production Research. 36:1998;1305-1324.