The multi-item multi-period capacitated lot sizing problem with setups (CLST) is a well known optimization problem with wide applicability in real-world production planning problems. Based on a recently proposed Dantzig-Wolfe approach we present a novel math-heuristic algorithm for the CLST. The major contribution of this paper lies in the presentation of an algorithm that exploits exact techniques (Dantzig-Wolfe) in a metaheuristic fashion, in line with the novel trend of math-heuristic algorithms. To the best of the authors' knowledge, it is the first time that such technique is employed within a metaheuristic framework, with the aim of tackling challenging instances in short computational time. © 2012 Springer-Verlag.
CITATION STYLE
Caserta, M., & Voß, S. (2012). A math-heuristic Dantzig-Wolfe algorithm for the capacitated lot sizing problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7219 LNCS, pp. 31–41). https://doi.org/10.1007/978-3-642-34413-8_3
Mendeley helps you to discover research relevant for your work.