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

Annals of Mathematics and Artificial Intelligence

Volumn 69, Issue 2, 2013, Pages 207-224

  Caserta, Marco ^a   Voß, Stefan ^b  

^a IE BUSINESS SCHOOL   (Spain)

^b UNIVERSITY OF HAMBURG   (Germany)

Author keywords

Corridor method; Dantzig Wolfe algorithm; Lot sizing; Math heuristic (matheuristic); Perishability

Indexed keywords

EID: 84893741737     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10472-013-9339-9     Document Type: Article

References (30)

1. Aras, O. A: A Heuristic Solution Procedure for a Single-Facility Multi-Item Dynamic Lot Sizing and Sequencing Problem. PhD thesis, Syracuse University (1981).
2. Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., Vance, P. H.: Branch and price: column generation for huge integer programs. Oper. Res 46(3), 316-329 (1998).
3. Belvaux, G., Wolsey, L. A.: BC-PROD: a specialized branch-and-cut system for lot-sizing problems. Manage. Sci. 46(5), 724-738 (2000).
4. Box, G. E. P., Wilson, K. B.: On the experimental attainment of optimum conditions. J. R. Stat. Soc. Ser. B 13, 1-45 (1951).
5. Bruno, G., Genovese, A., Sgalambro, A.: An extension of the schedule optimization problem at a public transit terminal to the multiple destinations case. Public Transp. 3, 189-198 (2012).
6. Caserta, M., Quiñonez, E.: A cross entropy-Lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setups. Comput. Oper. Res. 36, 530-548 (2009).
7. Caserta, M., Voß, S.: A math-heuristic Dantzig-Wolfe algorithm for the capacitated lot sizing problem. Lecture Notes in Computer Science, vol. 7219, pp. 31-41 (2012). Presented at LION 6.
8. Constantino, M.: A cutting plane approach to capacitated lot-sizing with start-up costs. Math. Program. B75(3), 353-376 (1996).
9. Dantzig, G. B., Wolfe, P.: Decomposition principle for linear programs. Oper. Res. 8, 101-111 (1960).
10. Domschke, W., Scholl, A., Voß S.: Produktionsplanung: Ablauforganisatorische Aspekte, 2nd edn. Springer, Berlin (1997).
11. Dzielinski, M. A. H., Gomory, R. E.: Optimal programming of lot-sizing inventory and labor allocation. Manage. Sci. 11(9), 874-890 (1965).
12. Eppen, G. D., Martin, R. K.: Solving multi-item lot-sizing problems using variable redefinition. Oper. Res. 35(6), 832-848 (1987).
13. Erickson, R. E., Monma, C. L., Veinott, A. F.: Send-and-split methods for minimum-concave-cost network flows. Math. Oper. Res. 12, 634-664 (1987).
14. Jans, R., Degraeve, Z.: A new Dantzig-Wolfe reformulation and branch-and-price algorithm for the capacitated lot sizing problem with setup times. Oper. Res. 55(5), 909-920 (2007).
15. Jans, R., Degraeve, Z.: Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches. Eur. J. Oper. Res. 177(3), 1855-1875 (2007).
16. Jans, R., Degraeve, Z.: Modeling industrial lot sizing problems: a review. Int. J. Prod. Res. 46(6), 1619-1643 (2008).
17. Maniezzo, V., Stützle, T., Voß, S. eds.: Matheuristics - Hybridizing Metaheuristics and Mathematical Programming. Annals of Information Systems, vol. 10. Springer (2010).
18. Manne, A. S.: Programming of economic lot sizes. Manage. Sci. 4(2), 115-135 (1958).
19. Marinelli, F., Nenni, M. E., Sforza, A.: Capacitated lot sizing and scheduling with parallel machines and shared buffers: a case study in a packaging company. Ann. Oper. Res. 150, 177-192 (2007).
20. Miller, A. J., Nemhauser, G. L., Savelsbergh, M. W.: Solving Multi-Item Capacitated Lot-Sizing Problems with Setup Times by Branch and Cut. Core dp 2000/39, Université Catholique de Louvain, Louvain-la-Neuve, Belgium (2000).
21. Nahmias, S.: Perishable inventory theory: a review. Oper. Res. 30(4), 680-708 (1982).
22. Nemhauser, G. L., Wolsey, L. A.: Integer and Combinatorial Optimization. Wiley, New York (1999).
23. Pahl, J., Voß, S., Woodruff, D. L.: Production planning with deterioration constraints: a survey. In: Ceroni, J. A. (ed.) The Development of Collaborative Production and Service Systems in Emergent Economies, Proceedings of the 19th International Conference on Production Research, IFPR, pages Tu3. 4-6, 1-6. Valparaiso, Chile (2007).
24. Pochet, Y., Wolsey, L. A.: Polyhedra for lot sizing with Wagner-Whitin costs. Math. Program. B 67(1-3), 297-323 (1994).
25. Sniedovich, M., Voß, S.: The corridor method: a dynamic programming inspired metaheuristic. Control Cybern. 35(3), 551-578 (2006).
26. Trigeiro, W. W., Thomas, L. J., McClain, J. O.: Capacitated lot-sizing with setup times. Manage. Sci. 35(3), 353-366 (1989).
27. Vanderbeck, F., Savelsbergh, M. W. P.: A generic view of Dantzig-Wolfe decomposition in mixed integer programming. Oper. Res. Lett. 34(3), 296-306 (2006).
28. Voß, S.: The Steiner tree problem with hop constraints. Ann. Oper. Res. 86, 321-345 (1999).
29. Voß, S., Woodruff, D. L.: An Introduction to Computational Optimization Models for Production Planning in a Supply Chain, 2nd edn. Springer, Berlin (2006).
30. Wagner, H. M., Whitin, T. M.: Dynamic version of the economic lot size model. Manage. Sci. 5, 89-96 (1958).