An exact strip packing algorithm based on canonical forms

Computers and Operations Research

Volumn 39, Issue 12, 2012, Pages 2991-3011

  Arahori, Yohei ^a,b   Imamichi, Takashi ^a,c   Nagamochi, Hiroshi ^a  

^a KYOTO UNIVERSITY   (Japan)

^b TORAY INDUSTRIES INC   (Japan)

^c IBM JAPAN LTD   (Japan)

Author keywords

Branch and bound; Canonical form; One dimensional contiguous bin packing problem; Two dimensional strip packing problem

Indexed keywords

BIN PACKING PROBLEM; BRANCH AND BOUNDS; CANONICAL FORM; CANONICAL SOLUTIONS; COMPUTATIONAL EXPERIMENT; EXACT ALGORITHMS; FEASIBLE SOLUTION; FIXED WIDTH; LOWER BOUNDS; NP-HARD; OPTIMAL VALUES; RECTANGULAR CONTAINERS; SCHEDULING PROBLEM; SEARCH SPACES; STRIP PACKING; SUB-PROBLEMS; TWO-DIMENSIONAL STRIP;

BINS; BRANCH AND BOUND METHOD; ONE DIMENSIONAL; OPTIMAL SYSTEMS; STAIRS; TEXTILE INDUSTRY; TEXTILE PROCESSING; TWO DIMENSIONAL;

ALGORITHMS;

EID: 84862980535     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2012.03.003     Document Type: Article

References (37)

1. G. Wäscher, H. Haußner, and H. Schumann An improved typology of cutting and packing problems European Journal of Operational Research 183 3 2007 1109 1130 (Pubitemid 47030730)
2. Turek J, Wolf JL, Yu PS. Approximate algorithms for scheduling parallelizable tasks. In: SPAA 1992: proceedings of the 4th annual ACM symposium on parallel algorithms and architectures. New York, NY, USA: ACM Press; 1992. p. 323-2. (Pubitemid 23624546)
3. E. Hopper, and B.C.H. Turton A review of the application of meta-heuristic algorithms to 2D strip packing problems Artificial Intelligence Review 16 4 2001 257 300 (Pubitemid 33109943)
4. S. Imahori, M. Yagiura, and T. Ibaraki Local search algorithms for the rectangle packing problem with general spatial costs Mathematical Programming 97 3 2003 543 569 (Pubitemid 44769759)
5. S. Martello, M. Monaci, and D. Vigo An exact approach to the strip-packing problem INFORMS Journal on Computing 15 3 2003 310 319 (Pubitemid 39042723)
6. B.S. Baker, E.G. Coffman Jr., and R.L. Rivest Orthogonal packings in two dimensions SIAM Journal on Computing 9 4 1980 846 855
7. B. Chazelle The bottom-left bin-packing heuristic: an efficient implementation IEEE Transactions on Computers 32 8 1983 697 707 (Pubitemid 14472726)
8. S. Jakobs On genetic algorithms for the packing of polygons European Journal of Operational Research 88 1 1996 165 181 (Pubitemid 126367100)
9. D. Liu, and H. Teng An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles European Journal of Operational Research 112 2 1999 413 420
10. E.K. Burke, G. Kendall, and G. Whitwell A new placement heuristic for the orthogonal stock-cutting problem Operations Research 52 4 2004 655 671
11. D. Zhang, Y. Kang, and A. Deng A new heuristic recursive algorithm for the strip rectangular packing problem Computers & Operations Research 33 8 2006 2209 2217 (Pubitemid 41802286)
12. W. Huang, and D. Chen An efficient heuristic algorithm for rectangle-packing problem Simulation Modelling Practice and Theory 15 10 2007 1356 1365 (Pubitemid 350102430)
13. L. Wei, D. Zhang, and Q. Chen A least wasted first heuristic algorithm for the rectangular packing problem Computers & Operations Research 36 5 2009 1608 1614
14. K. Dowsland Some experiments with simulated annealing techniques for packing problems European Journal of Operational Research 68 3 1993 389 399 (Pubitemid 23680557)
15. A. Bortfeldt A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces European Journal of Operational Research 172 3 2006 814 837
16. 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
17. 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 128 1 2001 34 57 (Pubitemid 32022961)
18. Iori M, Martello S, Monaci M. Metaheuristic algorithms for the strip packing problem. In: Applied optimization, vol. 78. Springer; 2003 [Chapter 7].
19. L.H.W. Yeung, and W.K.S. Tang Strip-packing using hybrid genetic approach Engineering Applications of Artificial Intelligence 17 2 2004 169 177
20. N. Lesh, J. Marks, A. Mcmahon, and M. Mitzenmacher New heuristic and interactive approaches to 2D rectangular strip packing Journal of Experimental Algorithmics 10 1-2 2005 1 18
21. R. Alvarez-Valdes, F. Parreño, and J.M. Tamarit Reactive GRASP for the strip-packing problem Computers & Operations Research 35 4 2008 1065 1083 (Pubitemid 47404761)
22. D.F. Zhang, S.D. Chen, and Y.J. Liu An improved heuristic recursive strategy based on genetic algorithm for the strip rectangular packing problem Acta Automatica Sinica 33 9 2007 911 916
23. H. Murata, K. Fujiyoshi, S. Nakatake, and Y. Kajitani VLSI module placement based on rectangle-packing by the sequence-pair IEEE Translational on Computer-aided Design of Integrated Circuits and Systems 15 12 1996 1518 1524 (Pubitemid 126780413)
24. S. Imahori, M. Yagiura, and T. Ibaraki Improved local search algorithms for the rectangle packing problem with general spatial costs European Journal of Operational Research 167 1 2005 48 67 (Pubitemid 40220002)
25. G. Belov, G. Scheithauer, and E.A. Mukhacheva One-dimensional heuristics adapted for two-dimensional rectangular strip packing Journal of the Operational Research Society 59 6 2008 823 832 (Pubitemid 351641215)
26. E.K. Burke, M.R. Hyde, and G. Kendall A squeaky wheel optimisation methodology for two-dimensional strip packing Computers & Operations Research 38 7 2011 1035 1044
27. Imahori S, Yagiura M, Nagamochi H. Practical algorithms for two-dimensional packing. Chapman & Hall/CRC computer & information science series, vol. 10. CRC Press; 2007 [Chapter 36].
28. N. Lesh, J. Marks, A. Mcmahon, and M. Mitzenmacher Exhaustive approaches to 2D rectangular perfect packings Information Processing Letters 90 1 2004 7 14
29. R. Alvarez-Valdes, F. Parreño, and J.M. Tamarit A branch and bound algorithm for the strip packing problem OR Spectrum 31 2 2009 431 459
30. S. Martello, D. Pisinger, and D. Vigo The three-dimensional bin packing problem Operations Research 48 2 2000 256 267
31. M. Kenmochi, T. Imamichi, K. Nonobe, M. Yagiura, and H. Nagamochi Exact algorithms for the two-dimensional strip packing problem with and without rotations European Journal of Operational Research 198 1 2009 73 83
32. A. Lodi, S. Martello, and M. Monaci Two-dimensional packing problems: a survey European Journal of Operational Research 141 2 2002 241 252 (Pubitemid 34623935)
33. M.R. Garey, and D.S. Johnson Computers and intractability: a guide to the theory of NP-completeness 1979 W. H. Freeman
34. T. Ibaraki Enumerative approaches to combinatorial optimization Annals of Operations Research 10-11 1-4 1988 3 342
35. Hopper E. Two-dimensional packing utilising evolutionary algorithms and other meta-heuristic methods. Ph.D. thesis. Cardiff University; 2000.
36. J.O. Berkey, and P.Y. Wang Two-dimensional finite bin-packing algorithms The Journal of the Operational Research Society 38 5 1987 423 429
37. S. Martello, and D. Vigo Exact solution of the two-dimensional finite bin packing problem Management Science 44 3 1998 388 399 (Pubitemid 128568186)