Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Physical Sciences and Mathematics
A Horizon Decomposition Approach For The Capacitated Lot-Sizing Problem With Setup Times, Ioannis Fragkos, Zeger Degraeve, Bert De Reyck
A Horizon Decomposition Approach For The Capacitated Lot-Sizing Problem With Setup Times, Ioannis Fragkos, Zeger Degraeve, Bert De Reyck
Research Collection Lee Kong Chian School Of Business
We introduce horizon decomposition in the context of Dantzig-Wolfe decomposition, and apply it to the capacitated lot-sizing problem with setup times. We partition the problem horizon in contiguous overlapping intervals and create subproblems identical to the original problem, but of smaller size. The user has the flexibility to regulate the size of the master problem and the subproblem via two scalar parameters. We investigate empirically which parameter configurations are efficient, and assess their robustness at different problem classes. Our branch-and-price algorithm outperforms state-of-the-art branch-and-cut solvers when tested to a new data set of challenging instances that we generated. Our methodology …
Period Decompositions For The Capacitated Lot Size Problem With Setup Times, Silvio Alexandre De Araujo, Bert De Reyck, Zeger Degraeve, Ioannis Fragkos, Raf Jans
Period Decompositions For The Capacitated Lot Size Problem With Setup Times, Silvio Alexandre De Araujo, Bert De Reyck, Zeger Degraeve, Ioannis Fragkos, Raf Jans
Research Collection Lee Kong Chian School Of Business
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 …