Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lotsizing problem

Optimization Methods and Software

Volumn 25, Issue 2, 2010, Pages 299-319

  Pimentel, Carina Maria Oliveira ^a   Alvelos, Filipe Pereira E ^a   Valério De Carvalho, José Manuel ^a  

^a UNIVERSITY OF MINHO   (Portugal)

Author keywords

Branch and price and Dantzig Wolfe decomposition; Mixed integer programming; Production planning

Indexed keywords

BRANCH AND PRICE; BRANCH-AND-PRICE ALGORITHMS; CAPACITATED LOT SIZING PROBLEM; COMPUTATIONAL RESULTS; DANTZIG-WOLFE DECOMPOSITION; DECOMPOSITION MODEL; LINEAR RELAXATIONS; LOWER BOUNDS; MIXED INTEGER PROGRAMMING; MIXED INTEGER PROGRAMMING MODEL; MULTI-ITEM; ORIGINAL MODEL; PRODUCTION PLANNING; SET-UP TIME; SUB-PROBLEMS; THREE-BRANCH;

COSTS; DYNAMIC PROGRAMMING; PLANNING; PRODUCTION CONTROL; PRODUCTION ENGINEERING; PROJECT MANAGEMENT;

INTEGER PROGRAMMING;

EID: 77949566299     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780902992837     Document Type: Article

References (33)

1. F. Alvelos, Branch-and-price and multicommodity flows, Ph.D. Thesis. Universidade do Minho, 2005.
2. M. Aragão and E. Uchoa, Integer program reformulation for robust branch-and-cut-and-price algorithms,Working Paper, 2003.
3. C. Barnhart, E. Johnson, G. Nemhauser, M. Savelsberg, and P. Vance, Branch-and-price: column generation for solving huge integer programs, Oper. Res. 46(3) (1998), pp. 316-329.
4. G. Belvaux and L.A. Wolsey, bc-prod: A specialized branch-and-cut system for lot-sizing problems, Manage. Sci. 46 (2000), pp. 724-738.
5. G. Bitran and H.Yanasse, Computational complexity of the capacitated lot size problem,Manage. Sci. 28(10) (1982), pp. 1174-1186.
6. W.H. Chen and J.M. Thizy, Analysis of relaxations for the multi-item capacitated lot-sizing problem, Ann. Oper. Res. 26 (1990), pp. 29-72.
7. G.B. Dantzig and P.Wolfe, Decomposition principle for linear programs, Oper. Res. 8 (1960), pp. 101-111.
8. Z. Degraeve and R. Jans, A new Dantzig-Wolfe reformulation and branch-and-price algorithm for the capacitated lot sizing problem with set up times, Oper. Res. 55 (2007), pp. 909-920.
9. G. Desaulniers, J. Desrosiers, and M. Solomon, Column Generation (GERAD 25th Anniversary Series), Springer, NewYork, 2005.
10. M. Diaby, H. Bahl, M.H. Karwan, and S. Zionts, Capacitated lot-sizing and scheduling by Lagrangean relaxation, European J. Oper. Res. 59 (1992), pp. 444-458.
11. M. Diaby, H. Bahl, M.H. Karwan, and S. Zionts, A Lagrangean relaxation approach for very-large scale capacitated lot-sizing, Manage. Sci. 38(9) (1992), pp. 1329-1340.
12. A. Drexl and A. Kimms, Lot sizing and scheduling-survey and extensions, European J. Oper. Res. 99(2) (1997), pp. 221-235.
13. G.D. Eppen and R.K. Martin, Solving multi-item capacitated lot-sizing problems using variable redefinition, Oper. Res. 35 (1987), pp. 832-848.
14. L.R. Ford and D.R. Fulkerson, A suggested computation for maximal multicommodity network flows, Manage. Sci. 5(1) (1958), pp. 97-101.
15. A.M. Geoffrion, Lagrangean relaxation for integer programming, Math. Program. Study 2 (1974), pp. 82-114.
16. P.C. Gilmory and R.E. Gomory, Linear programming approach to the cutting stock problem: Part I, Oper. Res. 9 (1961), pp. 849-859.
17. P.C. Gilmory and R.E. Gomory, Linear programming approach to the cutting stock problem: Part II, Oper. Res. 11 (1963), pp. 863-888.
18. M.Guignard and S. Kim, Lagrangean decomposition:Amodel yielding stronger Lagrangean bounds,Math. Program. 39 (1987), pp. 215-228.
19. ILOG, CPLEX 8.1 User's Manual, 2002. Available at http://www.ilog.com.
20. R. Jans and Z. Degraeve, Improved lower bounds for the capacitated lot sizing problem with set up times, Oper. Res. Lett. 32 (2004), pp. 185-195.
21. B. Karimi, S. Ghomi, and J.Wilson, The capacitated lot sizing problem: A review of models and algorithms, Omega Int. J. Manage. Sci. 31 (2003), pp. 365-378.
22. R. Kuik, M. Salomon, and L. Wassenhove, Batching decisions: Structure and models, European J. Oper. Res. 75 (1994), pp. 243-263.
23. M.E. Lübbecke and J. Desrosiers, Selected topics in column generation, Oper. Res. 53(6) (2005), pp. 1007-1023.
24. A. Manne, Programming of economic lot sizes, Manage. Sci. 4(2) (1958), pp. 115-135.
25. S. Park, D. Kim, and K. Lee, An integer programming approach to the path selection problem, Proceedings of the 2003 International Network Optimization Conference, Evry/Paris, 2003.
26. N. Perrot and F. Vanderbeck, Knapsack problems with setups, Tech. Rep. Université Bordeaux, 2004.
27. Y. Pochet and L.A. Wolsey, Solving multi-item lot-sizing problems using strong cutting planes, Manage. Sci. 37 (1991), pp. 53-67.
28. Y. Pochet and L.A.Wolsey, Production Planning by Mixed Integer Programming, Springer, USA, 2006.
29. J.M. Thizy and L.N.V. Wassenhove, Lagrangean relaxation for the multi-item capacitated lot sizing problem: A heuristic implementation, IIE Transac. 17 (1985), pp. 308-313.
30. W.W. Trigeiro, L.J. Thomas, and J.O. McClain, Capacitated lot sizing with setup times, Manage. Sci. 35 (1989), pp. 353-366.
31. A.Wagelmans, S.V. Hoesel, and A. Kolen, Economic lot sizing: An O(n log n) algorithm that runs in linear time in the Wagner-Whitin case, Oper. Res. 40(1) (1992), pp. S145-S156.
32. H.Wagner and T. Whitin, Dynamic version of the economic lot size model, Manage. Sci. 5(1) (1958), pp. 89-96.
33. W.E. Wilhelm, A technical review of column generation in integer programming, Optim. Eng. 2(2) (2001), pp. 159-200.