Extreme point-based heuristics for three-dimensional bin packing

INFORMS Journal on Computing

Volumn 20, Issue 3, 2008, Pages 368-384

  Crainic, Teodor Gabriel ^a   Perboli, Guido ^b   Tadei, Roberto ^b  

^a INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

^b POLITECNICO DI TORINO   (Italy)

Author keywords

Algorithms; Bin packing; Heuristic; Integer; Programming; Three dimensional packing

Indexed keywords

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

References (28)

1. Baldacci, R., M. A. Boschetti, 2007. A cutting plane approach for the two-dimensional orthogonal non-guillotine cutting problem. Eur. J. Oper. Res. 183 1136-1149. doi: 10.1016/j.ejor.2005. 11.060.
2. Beasley, J. E. 1985. An exact two-dimensional non-guillotine cutting stock tree search procedure. Oper. Res. 33 49-64.
3. Berkey, J. O., R Y. Wang. 1987. Two dimensional finite bin packing algorithms. J. Oper. Res. Soc. 38 423-429.
4. Boschetti, M. A. 2004. New lower bounds for the finite three-dimensional bin packing problem. Discrete Appl. Math. 140 241-258.
5. Boschetti, M. A., A. Mingozzi. 2003. The two-dimensional finite bin- packing problem. Part II: New lower and upper bounds. 40R 1 135-147.
6. Chung, F. K. R., M. R. Garey, D. S. Johnson. 1982. On packing two- dimensional bins. SIAM-J. Algebraic Discrete Methods 3 66-76.
7. 2PACK: A two-stage tabu search heuristic for the three-dimensional bin packing problem. Eur. J. Oper. Res. Forthcoming. doi: 10.1016/joejor.2007.06.063.
8. den Boef, E., J. Korst, S. Martello, D. Pisinger, D. Vigo. 2005. Erratum to the "three-dimensional bin packing problem": Robot-packable and orthogonal variants of packing problems. Oper. Res. 53 735-736.
9. Faroe, O., D. Pisinger, M. Zachariasen. 2003. Guided local search for the three-dimensional bin packing problem. INFORMS J. Comput. 15 267-283.
10. Fekete, S. P., J. Schepers. 1997. A new exact algorithm for general orthogonal d-dimensional knapsack problems. ESA '97, Springer Lecture Notes in Computer Science, Vol. 1284. Springer-Verlag, Berlin, 144-156.
11. Fekete, S. P., J. Schepers. 2001. New classes of lower bounds for bin packing problems. Math. Programming 91 11-31.
12. George, J. A., D. F. Robinson. 1980. A heuristic for packing boxes into a container. Comput, Oper. Res. 7 147-156.
13. Gilmore, P. C., R. E. Gomory. 1965. Multistage cutting problems of two and more dimensions. Oper. Res. 13 94-119.
14. Hadjiconstantinou, E., N. Christofides. 1995. An exact algorithm for general, orthogonal, two-dimensional knapsack problems. Eur. J. Oper. Res. 83 39-56.
15. Johnson, D. S. 1973. Near-optimal bin packing algorithms. Ph.D. thesis, Department of Mathematics, Massachusetts Institute of Technology, Cambridge.
16. Lodi, A., S. Martello, M. Monaci. 2002a. Two-dimensional packing problems: A survey. Eur. J. Oper. Res. 141 241-252.
17. Lodi, A., S. Martello, D. Vigo. 1999a. Approximation algorithms for the oriented two-dimensional bin packing problem. Eur. J. Opre. Res. 112 158-166.
18. Lodi, A., S. Martello, D. Vigo. 1999b. Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS J. Comput. 11 345-357.
19. Lodi, A., S. Martello, D. Vigo. 2002b. Heuristic algorithms for the three-dimensional bin packing problem. Eur. J. Oper. Res. 141 410-420.
20. Lodi, A., S. Martello, D. Vigo. 2004. TSpack: A unified tabu search code for multi-dimensional bin packing problems. Ann. Oper. Res. 131 203-213.
21. Martello, S., P. Toth. 1990. Knapsack Problems-Algorithms and Computer Implementations. John Wiley & Sons, Chichester, UK.
22. Martello, S., D. Vigo. 1998. Exact solution of the finite two dimensional bin packing problem. Management Sci. 44 388-399.
23. Martello, S., D. Pisinger, D. Vigo. 2000. The three-dimensional bin packing problem. Oper. Res. 48 256-267.
24. Martello, S., D. Pisinger, D. Vigo, E. den Boef, J. Korst. 2007. Algorithms for general and robot-packable variants of the three-dimensional bin packing problem. ACM Trans. Math. Software 33 7-19.
25. Monaci, M., P. Toth. 2006. A set-covering based heuristic approach for bin-packing problems. INFORMS J. Comput. 18 71-85.
26. Perboli, G. 2002. Bounds and heuristics for the packing problems. Ph.D. thesis, Politecnico di Torino, Torino, Italy, http:// www.orgroup.polito.it/ People/perboli/phd-thesys.pdf.
27. Pisinger, D. 2002. Heuristics for the container loading problem. Eur. J. Oper. Res. 141 382-392.
28. Standard Performance Evaluation Corporation. 2000. SPEC CPU2000 benchmarks. Retrieved April 4, 2008, http://www.spec.org/cpu2000/results/.