A hybrid placement strategy for the three-dimensional strip packing problem

European Journal of Operational Research

Volumn 209, Issue 3, 2011, Pages 219-227

  Allen, S D ^a   Burke, E K ^a   Kendall, G ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Cutting packing; Heuristics; Metaheuristics

Indexed keywords

BENCH-MARK PROBLEMS; CUTTING/PACKING; EMPIRICAL TESTING; FIXED WIDTH; HEURISTICS; META HEURISTICS; OTHER APPLICATIONS; PLACEMENT STRATEGY; POTENTIAL INDUSTRIES; RESOURCE-SCHEDULING; SOLUTION QUALITY; STOCK CUTTING; STRIP PACKING PROBLEM; TEST CASE; TEST RESULTS;

HEURISTIC ALGORITHMS; INDUSTRIAL APPLICATIONS; POLYSTYRENES;

THREE DIMENSIONAL;

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

References (30)

1. Allen, S.D., 2010. CrateViewer: Visualising {One, Two, Three}-Dimensional Packings. University of Nottingham. .
2. B.S. Baker, E.G. Coffman Jr., and Ronald L. Rivest Orthogonal packings in two dimensions SIAM Journal on Computing 9 4 1980 846 855
3. N. Bansal, X. Han, K. Iwama, M. Sviridenko, and G. Zhang Harmonic algorithm for 3-dimensional strip packing problem SODA '07: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms 2007 Society for Industrial and Applied Mathematics Philadelphia, PA, USA 1197 1206
4. E. Bischoff, and M. Ratcliff Issues in the development of approaches to container loading Omega 23 1995 377 390
5. Bortfeldt, A., Gehring, H., 1999. Two metaheuristics for strip packing problems. In: Proceedings band der 5th International Conference of the Decision Sciences Institute, Athen, vol. 2, pp. 1153-1156.
6. A. Bortfeldt, and D. Mack A heuristic for the three-dimensional strip packing problem European Journal of Operational Research 183 3 2007 1267 1279
7. E.K. Burke, G. Kendall, and G. Whitwell A new placement heuristic for the orthogonal stock cutting problem Operational Research 52 4 2004 655 671
8. E.K. Burke, G. Kendall, and G. Whitwell A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem INFORMS Journal on Computing 21 3 2009 505 516
9. B. Chazelle The bottom-left bin-packing heuristic: An efficient implementation IEEE Transactions on Computers 32 8 1983 697 707
10. E.G. Coffman Jr., M.R. Garey, and D.S. Johnson An application of bin-packing to multiprocessor scheduling SIAM Journal on Computing 7 1 1978 1 17
11. E.G. Coffman Jr., M.R. Garey, and D.S. Johnson Approximation algorithms for bin-packing - an updated survey 1984 Springer Vienna 49 106
12. T.G. Crainic, G. Perboli, and R. Tadei Extreme point-based heuristics for three-dimensional bin packing INFORMS Journal of Computers 20 3 2008 368 384
13. L. Faina An application of simulated annealing to the cutting stock problem European Journal of Operational Research 114 3 1999 542 556
14. M.R. Garey, and D.S. Johnson Computers and Intractability 1979 W.H. Freeman and Co. San Francisco, CA (A guide to the theory of NP-completeness, A Series of Books in the Mathematical Sciences)
15. F. Glover, and M. Laguna Tabu search C.R. Reeves, Modern Heuristic Techniques for Combinatorial Problems 1993 John Wiley & Sons, Inc. 70 150
16. E. Hopper, and B. Turton A review of the application of meta-heuristic algorithms to 2d strip packing problems Artificial Intelligence Review 16 4 2001 257 300
17. E. Hopper, and B.C.H. Turton A genetic algorithm for a 2d industrial packing problem Computers and Industrial Engineering 37 1-2 1999 375 378
18. E. Hopper, and B.C.H. Turton An empirical investigation of meta-heuristic and heuristic algorithms for a 2d packing problem European Journal of Operational Research 127 1 2001 34 57
19. W. Hower, M. Rosendahl, and D. Köstner Evolutionary algorithm design Artificial Intelligence in Design'96 1996 Kluwer Academic Publishers Dordrecht, Germany 663 680
20. K. Jansen, and R. Solis-Oba An asymptotic approximation algorithm for 3d-strip packing SODA '06: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm 2006 ACM New York, NY, USA 143 152
21. Karabulut, K., Inceoglu, M.M., 2004. A hybrid genetic algorithm for packing in 3d with deepest bottom left with fill method. In: ADVIS, pp. 441-450.
22. K.K. Lai, and J.W.M. Chan Developing a simulated annealing algorithm for the cutting stock problem Computers and Industrial Engineering 32 1 1997 115 127
23. K. Li, and K.-H. Cheng On three-dimensional packing SIAM Journal on Computing 19 5 1990 847 867
24. K. Li, and K.-H. Cheng Heuristic algorithms for on-line packing in three dimensions Journal of Algorithms 13 4 1992 589 605
25. D. Mack, A. Bortfeldt, and H. Gehring A parallel hybrid local search algorithm for the container loading problem International Transactions in Operational Research 11 5 2004 511 533
26. Miyazawa, F.K., Wakabayashi, Y., 2004. Packing problems with orthogonal rotations. In: LATIN, pp. 359-368.
27. M. Riff, X. Bonnaire, and B. Neveu A revision of recent approaches for two-dimensional strip-packing problems Engineering Applications of Artificial Intelligence 22 4-5 2009 823 827
28. S.A. Roberts Application of heuristic techniques to the cutting-stock problem for worktops Journal of Operational Research Society 35 5 1984 369 377
29. P. Walsh Advanced 3-D Game Programming Using DirectX 8.0 2002 Wordware Publishing Inc. TX, USA
30. G. Wäscher, H. Haußner, and H. Schumann An improved typology of cutting and packing problems European Journal of Operational Research 127 3 2007 1109 1130