Accelerating column generation for variable sized bin-packing problems

European Journal of Operational Research

Volumn 183, Issue 3, 2007, Pages 1333-1352

  Alves, Cláudio ^a   Valerio de Carvalho J M ^a  

^a UNIVERSITY OF MINHO   (Portugal)

Author keywords

Column generation; Convergence; Integer programming; Multiple length cutting stock; Variable sized bin packing

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING;

COLUMN GENERATION; MULTIPLE LENGTH CUTTING STOCK; VARIABLE SIZED BIN-PACKING;

INTEGER PROGRAMMING;

EID: 34447097540     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.07.033     Document Type: Article

References (34)

1. C. Alves, J.M. Valério de Carvalho, A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem, Working Paper, Universidade do Minho, Portugal, 2006.
2. Beasley J.E. OR-library: Distributing test problems by electronic email. Journal of the Operational Research Society 41 (1990) 1069-1072
3. Belov G., and Scheithauer G. A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. European Journal of Operational Research 141 (2002) 274-294
4. H. Ben Amor, Stabilisation de l'algorithme de génération de colonnes, PhD Thesis, École Polytechnique de Montréal, Canada, 2002.
5. H. Ben Amor, J. Desrosiers, J.M. Valério de Carvalho, Dual-optimal inequalities for stabilized column generation, Operations Research, in press.
6. Chu C., and La R. Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms. SIAM Journal on Computing 30 6 (2001) 2069-2083
7. Degraeve Z., and Peeters M. Optimal integer solutions to industrial cutting-stock problems: Part 2, Benchmark results. INFORMS Journal on Computing 15 1 (2003) 58-81
8. J. Desrosiers, M. Luebbecke, Selected topics in column generation, Technical Paper, Les Cahiers du GERAD G-2002-64, Canada, 2002.
9. du Merle O., Goffin J., and Vial J. On improvements to the analytic center cutting plane method. Computational Optimization and Applications 11 (1998) 37-52
10. du Merle O., Villeneuve D., Desrosiers J., and Hansen P. Stabilized column generation. Discrete Mathematics 194 (1999) 229-237
11. Dyckhoff H. A typology of cutting and packing problems. European Journal of Operational Research 44 (1990) 145-159
12. Friesen D., and Langston M. Variable sized bin packing. SIAM Journal on Computing 15 (1986) 222-230
13. Garey M., and Johnson D.S. Computers and Intractability. A Guide to the Theory of NP-Completeness (1979), W. H. Freeman and Company
14. Gilmore P.C., and Gomory R.E. A linear programming approach to the cutting stock problem. Operations Research 9 (1961) 849-859
15. Gilmore P.C., and Gomory R.E. A linear programming approach to the cutting stock problem - Part ii. Operations Research 11 (1963) 863-888
16. Hiriart-Urruty J.-B., and Lemaréchal C. Convex analysis and minimization algorithms II: Advanced theory and bundle methods (1993), Springer-Verlag, Berlin
17. Holthaus O. Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths. European Journal of Operational Research 141 (2002) 295-312
18. ILOG, CPLEX 6.5, User's Manual, 1999.
19. B. Kallehauge, J. Larsen, O. Madsen, Lagrangean duality applied on vehicle routing with time windows, Technical Paper, Technical University of Denmark, Informatics and Mathematical Modelling IMM-TR-2001-9, Kgs Lyngby, Denmark, 2001.
20. Kantorovich L. Mathematical methods of organising and planning production (translated from a report in Russian, dated 1939). Management Science 6 (1960) 366-422
21. Marsten R., Hogan W., and Blankenship J. The Boxstep method for large-scale optimization. Operations Research 23 (1975) 389-405
22. Martello S., and Toth P. Knapsack Problems: Algorithms and Computer Implementations (1990), Wiley, New York
23. M. Monaci. Algorithms for packing and scheduling problems, PhD Thesis, Università di Bologna, 2002.
24. Murgolo F. An efficient approximation scheme for variable-sized bin packing. SIAM Journal on Computing 16 (1987) 149-161
25. Nemhauser G.L., and Wolsey L.A. Integer and Combinatorial Optimization (1988), Wiley, New York
26. Roodman G. Near optimal solutions to one-dimensional cutting stock problem. Computers and Operations Research 13 (1986) 713-719
27. Rogers D., Plante R., Wong R., and Evans J. Aggregation and disaggregation techniques and methodology in optimization. Operations Research 39 (1991) 553-582
28. J.E. Schoenfield, Fast, exact solution of bin-packing problems without linear programming, Technical Paper, US Army Space and Missile Defense Command, Alabama, USA, 2002.
29. Valério de Carvalho J.M. Exact solution of bin-packing problems using column generation and branch-and-bound. Annals of Operations Research 86 (1999) 629-659
30. Valério de Carvalho J.M. LP models for bin-packing and cutting stock problems. European Journal of Operational Research 141 (2002) 253-273
31. Valério de Carvalho J.M. Using extra dual cuts to accelerate convergence in column generation. INFORMS Journal on Computing 17 2 (2005) 175-182
32. Vance P. Branch-and-price algorithms for the one-dimensional cutting stock problem. Computational Optimization and Applications 9 (1998) 211-228
33. D. Villeneuve, J. Desrosiers, M. Lübbecke, F. Soumis, On compact formulations for integer programs solved by column generation, Technical Paper, Les Cahiers du GERAD G-2003-6, Canada, 2003.
34. G. Wäscher, H. Haussner, H. Schumann, An improved typology of cutting and packing problems, European Journal of Operational Research, this issue, doi:10.1016/j.ejor.2005.12.047.