A math-heuristic Dantzig-Wolfe algorithm for the capacitated lot sizing problem

Link:
Autor/in:
Beteiligte Person:
  • Hamadi, Youssef
Verlag/Körperschaft:
Springer
Erscheinungsjahr:
2012
Medientyp:
Text
Schlagworte:
  • Corridor method
  • Dantzig-Wolfe algorithm
  • Lot sizing
  • Math-heuristic (matheuristic)
  • Perishability
Beschreibung:
  • 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.
Lizenz:
  • info:eu-repo/semantics/closedAccess
Quellsystem:
Forschungsinformationssystem der UHH
Interne Metadaten
Quelldatensatz
oai:www.edit.fis.uni-hamburg.de:publications/eebdbf88-aeb4-465f-8fd6-c15c61395f16