Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem

INFORMS Journal on Computing

Volumn 19, Issue 1, 2007, Pages 36-51

  Pisinger, David ^a   Sigurd, Mikkel ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Algorithms; Branch and bound; programming; Cutting plane; production scheduling; Cutting stock; Integer; Programming

Indexed keywords

EID: 54449098516     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1060.0181     Document Type: Article

References (37)

1. Apt, K. R. 2003. Principles of Constraint Programming. Cambridge University Press, Cambridge, UK.
2. Belov, G. 2003. Problems, models and algorithms in one- and two- dimensional cutting. Ph.D. thesis, Institute of Numerical Mathematics, Technischen Universitat Dresden, Dresden, Germany.
3. Bengtsson, B. E. 1982. Packing rectangular pieces-A heuristic approach. Comput. J. 25 353-357.
4. Berkey J. O., P. Y. Wang. 1987. Two dimensional finite bin packing algorithms. J. Oper. Res. Soc. 38 423-429.
5. Bockmayr, A., T. Kasper. 1998. Branch-and-infer: A unifying framework for integer and finite domain constraint programming. INFORMS J. Comput. 10 287-300.
6. Boschetti, M. A., A. Mingozzi. 2003a. The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case. 40R 1 27-42.
7. Boschetti, M. A., A. Mingozzi. 2003b. The two-dimensional finite bin packing problem. Part II: New lower and upper bounds. 40R 2 135-148.
8. Caprara, A., M. Monaci. 2004. On the two-dimensional knapsack problem. Oper. Res. Lett. 32 5-14.
9. Chen, C. S., S. M. Lee, Q. S. Shen. 1995. An analytical model for the container loading problem. Eur. J. Oper. Res. 80 68-76.
10. Dell' Amico, M., S. Martello, D. Vigo. 2002. A lower bound for the non-oriented two-dimensional bin packing problem. Discrete Appl, Math. 118 13-24.
11. Dowsland, K. 1993. Some experiments with simulated annealing techniques for packing problems. Eur. J. Oper. Res. 68 389-399.
12. Eremin, A., M. Wallace. 2001. Hybrid Benders decomposition algorithms in constraint logic programming. T. Walsh, ed. CP 2001, Lecture Notes in Computer Science, Vol. 2239. Springer, Berlin, Germany, 1-15.
13. Faroe, O., D. Pisinger, M. Zachariasen. 2003. Guided local search for the three-dimensional bin packing problem. INFORMS J. Comput. 15 267-283.
14. Fekete, Sandor P., Joerg Schepers. 2001. New classes of lower bounds for the bin packing problem. Math. Programming 91 11-31.
15. Fekete, Sandor P., Joerg Schepers, Jan C. van der Veen. 2007. An exact algorithm for higher-dimensional orthogonal packing. Oper. Res. Forthcoming.
16. Gilmore, P. C, R. E. Gomory. 1961. A linear programming approach to the cutting stock problem. Oper. Res. 9 849-859.
17. Gilmore, P. C., R. E. Gomory. 1963. A linear programming approach to the cutting stock problem-Part II. Oper. Res. 13 94-119.
18. Gilmore, P. C., R. E. Gomory. 1965. Multistage cutting stock problems of two and more dimensions. Oper. Res. 13 94-120.
19. Hadjiconstantinou, E., N. Christofides. 1995. An exact algorithm for general, orthogonal, two-dimensional knapsack problems. Eur. J. Oper. Res. 83 39-56.
20. Hifi, M. 2001. Exact algorithms for large-scale unconstrained two and three staged unconstrained cutting problems. Comput. Optim. Appl. 18 63-88.
21. ILOG. 2000. ILOG CPLEX 7.0, Reference Manual. ILOG SA, Gentilly, France.
22. Junger, Michael, Stafan Thienel. 2000. The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization. Software Practice Experience 30(11) 1325-1352.
23. Junker, U., S. E. Karisch, N. Kohl, B. Vaaben, T. Fahle, M. Sellmann. 1999. Constraint programming based column generation for crew assignment. J. Jaffar, ed. Proc. CP'99, Lecture Notes in Computer Science, Vol. 1713. Springer, Berlin, Germany, 261-274.
24. Kellerer, H., U. Pferschy, D. Pisinger. 2004. Knapsack Problems. Springer, Berlin, Germany.
25. Lasdon, L. S. 1970. Optimization Theory for Large Systems. Macmillan, London, UK.
26. Lodi, A., S. Martello, D. Vigo. 1999. Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS J. Comput. 11 345-357.
27. Lodi, A., S. Martello, D. Vigo. 2002. Recent advances on two- dimensional bin packing problems. Discrete Appl. Math. 123 379-396.
28. Martello, S., D. Vigo. 1998. Exact solution of the two-dimensional finite bin packing problem. Management Sci. 44 388-399.
29. Martello, S., D. Pisinger, D. Vigo, Edgar den Boef, Jan Korst. 2007. Algorithms for general and robot-packable variants of the three-dimensional bin packing problem. ACM Trans. Math. Software 33(1).
30. Monaci, M., P. Toth 2006. A set-covering based heuristic approach for bin-packing problems. INFORMS J. Comput. 18(1) 71-85.
31. Onodera, H., Y. Taniguchi, K. Tamaru. 1991. Branch-and-bound placement for building block layout. Proc. 28th ACM/IEEE Design Automation Conf., ACM Press, New York, 433-439.
32. Padberg, M. 2000. Packing small boxes into a big box. Math. Methods Oper. Res. 52 1-21.
33. Parada, V., R. Palma, D. Sales, A. Gomes. 2000. A comparative numerical analysis for the guillotine two-dimensional cutting problem. Ann. Oper. Res. 96 245-254.
34. Pisinger, D., M. M. Sigurd. 2005. The two-dimensional bin packing problem with variable bin sizes and costs. Discrete Optim. 2 154-167.
35. Ryan, D. M., B. A. Foster. 1981. An integer programming approach to scheduling. A. Wren, ed. Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling. North- Holland, Amsterdam, The Netherlands, 269-280.
36. Voudouris, C. 1997. Guided local search for combinatorial optimisation problems. Ph.D. thesis, Department of Computer Science, University of Essex, Colchester, UK.
37. Voudouris, C, E. Tsang. 1999. Guided local search and its application to the traveling salesman problem. Eur. J. Oper. Res. 113 469-499.