Models and algorithms for three-stage two-dimensional bin packing

European Journal of Operational Research

Volumn 183, Issue 3, 2007, Pages 1304-1327

  Puchinger, Jakob ^a   Raidl, Günther R ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Branch and price; Column generation; Evolutionary algorithms; Hybrid algorithms; Metaheuristics; Two dimensional bin packing

Indexed keywords

CONSTRAINT THEORY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; MATHEMATICAL MODELS; OPERATIONS RESEARCH; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

BRANCH-AND-PRICE; COLUMN GENERATION; HYBRID ALGORITHMS; REAL-WORLD APPLICATIONS; TWO-DIMENSIONAL BIN-PACKING;

EVOLUTIONARY ALGORITHMS;

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

References (30)

1. Lodi A., Martello S., and Vigo D. Recent advances on two-dimensional bin packing problems. Discrete Applied Mathematics 123 (2002) 373-390
2. Dyckhoff H., Scheithauer G., and Terno J. Cutting and packing: An annotated bibliography. In: Dell'Amico M., Maffioli F., and Martello S. (Eds). Annotated Bibliographies in Combinatorial Optimization (1997), Wiley 393-412
3. A. Fritsch, Verschnittoptimierung durch iteriertes Matching, Master's thesis, University of Osnabrück, Germany, 1994.
4. Puchinger J., Raidl G.R., and Koller G. Solving a real-world glass cutting problem. Evolutionary Computation in Combinatorial Optimization-EvoCOP 2004. In: Gottlieb J., and Raidl G.R. (Eds). LNCS vol. 3004 (2004), Springer 162-173
5. 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.
6. Vanderbeck F. On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm. Operations Research 48 1 (2000) 111-128
7. Berkey J.O., and Wang P.Y. Two-dimensional finite bin packing algorithms. Journal of the Operational Research Society 38 (1987) 423-429
8. Gilmore P.C., and Gomory R.E. A linear programming approach to the cutting-stock problem (part I). Operations Research 9 (1961) 849-859
9. Gilmore P.C., and Gomory R.E. Multistage cutting-stock problems of two and more dimensions. Operations Research 13 (1965) 90-120
10. Oliveira J.F., and Ferreira J.S. A faster variant of the Gilmore and Gomory technique for cutting stock problems. JORBEL-Belgium Journal of Operations Research, Statistics and Computer Science 34 1 (1994) 23-38
11. Monaci M., and Toth P. A set-covering based heuristic approach for bin-packing problems. INFORMS Journal on Computing 18 1 (2006) 71-85
12. Lodi A., Martello S., and Vigo D. Models and bounds for two-dimensional level packing problems. Journal of Combinatorial Optimization 8 3 (2004) 363-379
13. Vanderbeck F. A nested decomposition approach to a 3-stage 2-dimensional cutting stock problem. Management Science 47 2 (1998) 864-879
14. E. Hopper, Two-dimensional packing utilising evolutionary algorithms and other meta-heuristic methods, Ph.D. thesis, University of Wales, Cardiff, UK, 2000.
15. Martello S., and Vigo D. Exact solutions of the two-dimensional finite bin packing problem. Management Science 44 (1998) 388-399
16. D. Pisinger, M.M. Sigurd, Using decomposition techniques and constraint programming for solving the two-dimensional bin packing problem, INFORMS Journal on Computing, to appear, 2006.
17. M.M. Sigurd, Column generation methods and application, Ph.D. thesis, University of Copenhagen, Denmark, 2004.
18. Lodi A., Martello S., and Vigo D. Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS Journal on Computing 11 (1999) 345-357
19. Puchinger J., and Raidl G.R. An evolutionary algorithm for column generation in integer programming: An effective approach for 2D bin packing. Parallel Problem Solving from Nature-PPSN VIII. In: Yao X., et al. (Ed). LNCS vol. 3242 (2004), Springer 642-651
20. Desaulniers G., Desrosiers J., and Solomon M.M. Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems. In: Ribeiro C.C., and Hansen P. (Eds). Essays and Surveys in Metaheuristics (2001), Kluwer, Boston 309-324
21. Gilmore P.C., and Gomory R.E. A linear programming approach to the cutting-stock problem (part II). Operations Research 11 (1963) 363-888
22. Desrosiers J., and Lübbecke M.E. Selected topics in column generation. Operations Research 53 6 (2005) 1007-1023
23. H. Ben Amor, J. Desrosiers, J.M. Valério de Carvalho, Dual-optimal inequalities for stabilized column generation, Operations Research, to appear, 2005.
24. Valério de Carvalho J. Using extra dual cuts to accelerate convergence in column generation. INFORMS Journal on Computing 17 2 (2005) 175-182
25. Barnhart C., Johnson E.L., Nemhauser G.L., Savelsbergh M.W.P., and Vance P.H. Branch-and-price: Column generation for solving huge integer programs. Operations Research 46 3 (1998) 316-329
26. Martin A. General mixed integer programming: Computational issues for branch-and-cut algorithms. Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions. In: Jünger M., and Naddef D. (Eds). LNCS vol. 2241 (2001), Springer 1-25
27. G.R. Filho, L.A.N. Lorena, Constructive genetic algorithm and column generation: An application to graph coloring, in: Proceedings of APORS 2000-The Fifth Conference of the Association of Asian-Pacific Operations Research Societies within IFORS, 2000.
28. Bäck T., Fogel D.B., and Michalewicz Z. Handbook of Evolutionary Computation (1997), Oxford University Press, New York
29. Michalewicz Z. Genetic Algorithms + Data Structures = Evolution Programs (1996), Springer, Berlin
30. Lougee-Heimer R. The common optimization interface for operations research: Promoting open-source software in the operations research community. IBM Journal of Research and Development 47 1 (2003) 57-66