Period decompositions for the capacitated lot sizing problem with setup times
I N F O R M S Journal on Computing: charting new directions in OR and CS , Volume 27 - Issue 3 p. 431- 448
We study the multi-item capacitated lot sizing problem with setup times. Based on two strong reformulations of the problem, we present a transformed reformulation and valid inequalities that speed up column generation and Lagrange relaxation. We demonstrate computationally how both ideas enhance the performance of our algorithm and show theoretically how they are related to dual space reduction techniques. We compare several solution methods and propose a new efficient hybrid scheme that combines column generation and Lagrange relaxation in a novel way. Computational experiments show that the proposed solution method for finding lower bounds is competitive with textbook approaches and state-of-The-Art approaches found in the literature. Finally, we design a branch-And-price-based heuristic and report computational results. The heuristic scheme compares favorably or outperforms other approaches.
|Accepted by Karen Aardal, Branch and price, Column generation, Heuristics History, Lagrange relaxation, Lot sizing|
|ERIM Top-Core Articles|
|I N F O R M S Journal on Computing: charting new directions in OR and CS|
|Organisation||Rotterdam School of Management (RSM), Erasmus University|
De Araujo, S.A, De Reyck, B, Degraeve, Z, Fragkos, I, & Jans, R.F. (2015). Period decompositions for the capacitated lot sizing problem with setup times. I N F O R M S Journal on Computing: charting new directions in OR and CS, 27(3), 431–448. doi:10.1287/ijoc.2014.0636