Extreme Point-Based Heuristics for Three-Dimensional Bin Packing

References

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