A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size

European Journal of Operational Research

Volumn 218, Issue 1, 2012, Pages 251-260

  Furini, Fabio ^a   Malaguti, Enrico ^a   Medina Durán, Rosa ^a   Persiani, Alfredo ^a   Toth, Paolo ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Column generation; Combinatorial Optimization; Cutting; Packing

Indexed keywords

COLUMN GENERATION; COMPUTATIONAL EXPERIMENT; DIFFERENT SIZES; GUILLOTINE CUTS; GUILLOTINE CUTTING; HEURISTIC PROCEDURES; KNAPSACK PROBLEMS; MIXED INTEGER LINEAR PROGRAMMING MODEL; OPTIMALITY; STOCK SIZE; TWO-DIMENSIONAL CUTTING; TWO-DIMENSIONAL KNAPSACK PROBLEM;

COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CUTTING; DYNAMIC PROGRAMMING; HEURISTIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PACKING; TWO DIMENSIONAL;

INTEGER PROGRAMMING;

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

References (17)

1. R. Alvarez-Valdes, A. Parajon, and J.M. Tamarit A computational study of lp-based heuristic algorithms for two-dimensional guillotine cutting stock problems OR Spektrum 24 2002 179 192
2. G. Belov, G. Scheithauer, Models with variable strip widths for two-dimensional two-stage cutting, Technical Report MATH-NM-17-2003, Dresden University, 2003.
3. G.F. Cintra, F.K. Miyazawa, Y. Wakabayashi, and E.C. Xavier Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation European Journal of Operational Research 191 2008 61 85
4. F. Furini. Decomposition and reformulation of integer linear programming problems, 4OR (2011), doi: 10.1007/s10288-011-0178-4.
5. P.C. Gilmore, and R.E. Gomory A linear programming approach to the cutting stock problem Operations Research 9 1961 849 859
6. P.C. Gilmore, and R.E. Gomory A linear programming approach to the cutting stock problem - Part II Operations Research 11 1963 863 888
7. P.C. Gilmore, and R.E. Gomory Multistage cutting stock problems of two and more dimensions Operations Research 13 1965 94 120
8. A. Lodi, S. Martello, and M. Monaci Two-dimensional packing problems: a survey European Journal of Operational Research 141 2002 241 252 (Pubitemid 34623935)
9. A. Lodi, and M. Monaci Integer linear programming models for 2-staged two-dimensional knapsack problems Mathematical Programming 94 2003 178 257
10. E. Malaguti The vertex coloring problem and its generalizations 4OR 7 2009 101 104
11. S. Martello, and P. Toth Knapsack Problems: Algorithms and Computer Implementations 1990 John Wiley & Sons Chichester
12. J. Riehme, G. Scheithauer, and J. Terno The solution of two-stage guillotine cutting stock problems having extremely varying order demands European Journal of Operational Research 91 1996 543 552 (Pubitemid 126393165)
13. G. Wäscher, H. Haussner, and H. Schumann An improved typology of cutting and packing problems European Journal of Operational Research 183 2007 1109 1130 (Pubitemid 47030730)
14. COIN-OR linear program solver. An open source code for solving linear programming problems. .
15. Cutting stock with multiple stock size instances. .
16. IBM-CPLEX. .
17. OR-Library. .