A two-stage intelligent search algorithm for the two-dimensional strip packing problem

European Journal of Operational Research

Volumn 215, Issue 1, 2011, Pages 57-69

  Leung, Stephen C H ^a   Zhang, Defu ^b   Sim, Kwang Mong ^c  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b XIAMEN UNIVERSITY   (China)

^c Gwangju Institute of Science and Technology (GIST)   (South Korea)

Author keywords

Heuristic search; Packing problem; Simulated annealing

Indexed keywords

BENCH-MARK PROBLEMS; COMPUTATION TIME; COMPUTATIONAL EXPERIMENT; COMPUTATIONAL RESULTS; GUILLOTINE CONSTRAINT; HEURISTIC SEARCH; INTELLIGENT SEARCH ALGORITHM; LOCAL SEARCH; MULTISTART; PACKING PROBLEM; SCORING RULES; SEARCH CAPABILITIES; SIMULATED ANNEALING ALGORITHMS; TWO STAGE; TWO-DIMENSIONAL STRIP; ZERO WASTE;

HEURISTIC ALGORITHMS; LEARNING ALGORITHMS; TWO DIMENSIONAL;

SIMULATED ANNEALING;

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

References (41)

1. R. Alvarez-Valdes, F. Parreño, and J.M. Tamarit Reactive GRASP for the strip-packing problem Computers and Operations Research 35 2008 1065 1083 (Pubitemid 47404761)
2. 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
3. J.E. Beasley An exact two-dimensional non-guillotine cutting tree search procedure Operations Research 33 1985 49 64 (Pubitemid 15475049)
4. J.E. Beasley Algorithms for unconstrained two-dimensional guillotine cutting Journal of the Operational Research Society 36 1985 297 306 (Pubitemid 15513982)
5. 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 2008 823 832 (Pubitemid 351641215)
6. J.O. Berkey, and P.Y. Wang Two-dimensional finite bin packing algorithms Journal of the Operational Research Society 38 1987 423 429 (Pubitemid 17618937)
7. 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
8. 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
9. 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
10. B. Chazelle The bottom-left bin packing heuristic: an efficient implementation IEEE Transaction on Computers 32 8 1983 697 707 (Pubitemid 14472726)
11. N. Christofides, and E. Hadjiconstantinou An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts European Journal of Operational Research 83 1995 21 38
12. N. Christofides, and C. Whitlock An algorithm for two-dimensional cutting problems Operations Research 25 1997 30 44
13. Y. Cui, Y. Yang, X. Cheng, and P. Song A recursive branch-and- bound algorithm for the rectangular guillotine strip packing problem Computers and Operations Research 35 4 2008 1281 1291 (Pubitemid 47404770)
14. Dagli, C.H, Hajakbari, A.; 1990. Simulated annealing approach for solving stock cutting problem. In: Proceedings of IEEE International Conference on Systems, Man, Cybernetics, Los Angeles. IEEE, Washington, DC, pp. 221-223.
15. C.H. Dagli, and P. Poshyanonda New approaches to nesting rectangular patterns Journal of Intelligent Manufacturing 8 1997 177 190 (Pubitemid 127506236)
16. K.A. Dowsland, and W.B. Dowsland Packing problems European Journal of Operational Research 56 1992 2 14
17. K.A. Dowsland, E.A. Herbert, G. Kendall, and E.K. Burke Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems European Journal of Operational Research 168 2006 390 402 (Pubitemid 41329854)
18. S.P. Fekete, J. Schepers, and J.C. van der Veen An exact algorithm for higher-dimensional orthogonal packing Operations Research 55 2007 569 590
19. J.F. Gonalves A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem European Journal of Operational Research 183 2007 1212 1229
20. 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 2001 34 57 (Pubitemid 32022961)
21. M. Hifi, and R. M'Hallah An exact algorithm for constrained two-dimensional two-staged cutting problems Operations Research 53 1 2005 140 150 (Pubitemid 40320221)
22. M. Hifi, and R. M'Hallah A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes International Transactions in Operational Research 10 2003 1 22
23. D.S. Hochbaum, and W. Maass Approximation schemes for covering and packing problems in image processing and VLSI Journal of ACM 32 1 1985 130 136 (Pubitemid 15599048)
24. W. Huang, D. Chen, and R. Xu A new heuristic algorithm for rectangle packing Computers and Operations Research 34 11 2007 3270 3280 (Pubitemid 46517856)
25. M. Iori, S. Martello, and M. Monaci Metaheuristic algorithms for the strip packing problem P.M. Paradolos, V. Korotkith, Optimization and Industry: New Frontiers 2003 The Netherlands Kluwer Academic Publishers 159 179
26. S. Jakobs On genetic algorithms for the packing of polygons European Journal of Operational Research 88 1996 165 181 (Pubitemid 126367100)
27. M. Kenmochi, I. Takashi, N. Koji, Y. Mutsunori, and N. Hiroshi Exact algorithms for the two-dimensional strip packing problem with and without rotations European Journal of Operational Research 198 2009 73 83
28. K.K. Lai, and J.W.M. Chan Developing a simulated annealing algorithm for the cutting stock problem Computers and Industrial Engineering 32 1 1996 115 127 (Pubitemid 126653438)
29. N. Lesh, J. Marks, A. McMahon, and M. Mitzenmacher New heuristic and interactive approaches to 2D rectangular strip packing ACM Journal of Experimental Algorithmics 10 2005 1 18
30. S. Leung, and D. Zhang A fast layer-based heuristic for non-guillotine strip packing Expert Systems with Applications 38 10 2011 13032 13042
31. A. Lodi, S. Martello, and D. Vigo Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems INFORMS Journal on Computing 11 1999 345 357
32. A. Lodi, S. Martello, and M. Monaci Two-dimensional packing problems: a survey European Journal of Operational Research 141 2002 241 252 (Pubitemid 34623935)
33. 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)
34. F.G. Ortmann, N. Ntene, and J.H. van Vuuren New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems European Journal of Operational Research 203 2 2010 306 315
35. Pinto, E.; Oliveira, J.F.; 2005. Algorithm based on graphs for the non-guillotinable two-dimensional packing problem. in: Second ESICUP Meeting, Southampton.
36. A. Ramesh Babu, and N. Ramesh Babu Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms International Journal of Production Research 37 7 1999 1625 1643
37. Valenzuela, C.L.; Wang, P.Y.; 2001. Heuristics for large strip packing problems with guillotine patterns: an empirical study. In: Proceedings of the 4th Metaheuristics International Conference. University of Porto, Porto, Portugal, pp. 417-421.
38. G. Wäscher, H. Haußner, and H. Schumann An improved typology of cutting and packing problems European Journal of Operational Research 183 2007 1109 1130 (Pubitemid 47030730)
39. L. Wei, D. Zhang, and Q. Chen A least wasted first heuristic algorithm for the rectangular packing problem Computers and Operations Research 36 5 2009 1608 1614
40. D. Zhang, Y. Kang, and A. Deng A new heuristic recursive algorithm for the strip rectangular packing problem Computers and Operations Research 33 8 2006 2209 2217 (Pubitemid 41802286)
41. D. Zhang, S. Han, and W. Ye A bricklaying heuristic algorithm for the orthogonal rectangular packing problem Chinese Journal of Computers 23 3 2008 509 515 (Pubitemid 351511686)