A Fix-and-Optimize Approach for the Multi-Level Capacitated Lot Sizing Problems
Autor: Stefan Helber and Florian Sahling
Nummer: 393, Mar 2008, pp. 22
JEL-Class: C61
Abstract:
This paper presents an optimization-based solution approach for the dynamic multi-level capacitated lot sizing problem (MLCLSP) with positive lead times. The key idea is to solve a series of mixed-integer programs in an iterative fix-and-optimize algorithm. Each of these programs is optimized over all real-valued variables, but only a small subset of binary setup variables. The remaining binary setup variables are tentatively fixed to values determined in previous iterations. The resulting algorithm is transparent, flexible, accurate and relatively fast. Its solution quality outperforms those of the approaches by Tempelmeier/Derstroff and by Stadtler.
Zusammenfassung:
/N
Diskussionspapier als PDF-Datei herunterladen
BibTeX-Datensatz herunterladen