| Full text | |
| Author(s): |
de Araujo, Silvio Alexandre
[1]
;
De Reyck, Bert
[2]
;
Degraeve, Zeger
[3, 4]
;
Fragkos, Ioannis
[5]
;
Jans, Raf
[6, 7]
Total Authors: 5
|
| Affiliation: | [1] Univ Estadual Paulista, Dept Matemat Aplicada, BR-15054000 Sao Jose Do Rio Preto, SP - Brazil
[2] UCL, UCL Sch Management, London WC1E 6BT - England
[3] Univ Melbourne, Melbourne Business Sch, Carlton, Vic 3053 - Australia
[4] London Business Sch, Dept Management Sci & Operat, London NW1 4SA - England
[5] Erasmus Univ, Rotterdam Sch Management, NL-3062 PA Rotterdam - Netherlands
[6] HEC Montreal, Montreal, PQ H3T 2A7 - Canada
[7] Gerad, Montreal, PQ H3T 2A7 - Canada
Total Affiliations: 7
|
| Document type: | Journal article |
| Source: | INFORMS JOURNAL ON COMPUTING; v. 27, n. 3, p. 431-448, SUM 2015. |
| Web of Science Citations: | 13 |
| Abstract | |
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. (AU) | |
| FAPESP's process: | 14/01203-5 - Integrated lot sizing problems and related problems |
| Grantee: | Silvio Alexandre de Araujo |
| Support Opportunities: | Regular Research Grants |