A skyline heuristic for the 2D rectangular packing and strip packing problems

European Journal of Operational Research

Volumn 215, Issue 2, 2011, Pages 337-346

  Wei, Lijun ^a   Oon, Wee Chong ^a   Zhu, Wenbin ^b,c   Lim, Andrew ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^c HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Cutting and packing; Heuristics; Tabu search

Indexed keywords

BENCHMARK TESTS; BINARY SEARCH; CUTTING AND PACKING; GREEDY HEURISTICS; HEURISTICS; PACKING PROBLEMS; RECTANGULAR STRIPS; SIMPLE TABU SEARCH; STRIP PACKING PROBLEM;

BENCHMARKING;

TABU SEARCH;

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

References (47)

1. R. Alvarez-Valdes, F. Parreño, and J.M. Tamarit Reactive grasp for the strip-packing problem Computers & Operations Research 35 2008 1065 1083 (Pubitemid 47404761)
2. R. Alvarez-Valdes, F. Parreño, and J. Tamarit A branch and bound algorithm for the strip packing problem OR Spectrum 31 2009 431 459
3. O. Aik, and E. Özcan Bidirectional best-fit heuristic for orthogonal rectangular strip packing Annals of Operations Research 172 2009 405 427
4. A.R. Babu, and N.R. Babu Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms International Journal of Production Research 37 1999 1625 1643
5. B.S. Baker, E.G. Coffman, and R.L. Rivest Orthogonal packings in two dimensions SIAM Journal on Computing 9 1980 846 855
6. J.E. Beasley Algorithms for unconstrained two-dimensional guillotine cutting The Journal of the Operational Research Society 36 1985 297 306 (Pubitemid 15513982)
7. J.E. Beasley An exact two-dimensional non-guillotine cutting tree search procedure Operations Research 33 1985 49 64 (Pubitemid 15475049)
8. 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)
9. B.E. Bengtsson Packing rectangular piecesa heuristic approach The Computer Journal 25 1982 253 257
10. J.O. Berkey, and P.Y. Wang Two-dimensional finite bin-packing algorithms The Journal of the Operational Research Society 38 1987 423 429
11. A. Bortfeldt A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces European Journal of Operational Research 172 2006 814 837
12. A. Bortfeldt, and H. Gehring New large benchmark instances for the two-dimensional strip packing problem with rectangular pieces Proceedings of the 39th Annual Hawaii International Conference on System Sciences (HICSS'06) 2006 IEEE p. 30b (Pubitemid 44539258)
13. M.A. Boschetti, and L. Montaletti An exact algorithm for the two-dimensional strip-packing problem Operations Research 58 2010 1774 1791
14. E.K. Burke, G. Kendall, and G. Whitwell A new placement heuristic for the orthogonal stock-cutting problem Operations Research 52 2004 655 671
15. 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 2009 505 516
16. J. Carlier, F. Clautiaux, and A. Moukrim New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation Computers & Operations Research 34 2007 2223 2250 (Pubitemid 46073419)
17. Chazelle The bottom-left bin-packing heuristic: an efficient implementation IEEE Transactions on Computers C-32 1983 697 707 (Pubitemid 14472726)
18. N. Christofides, and C. Whitlock An algorithm for two-dimensional cutting problems Operations Research 25 1977 30 44
19. F. Clautiaux, J. Carlier, and A. Moukrim A new exact method for the two-dimensional bin-packing problem with fixed orientation Operations Research Letters 35 2007 357 364 (Pubitemid 46589661)
20. F. Clautiaux, J. Carlier, and A. Moukrim A new exact method for the two-dimensional orthogonal packing problem European Journal of Operational Research 183 2007 1196 1211 (Pubitemid 47030735)
21. F. Clautiaux, A. Jouglet, and J. Elhayek A new lower bound for the non-oriented two-dimensional bin-packing problem Operations Research Letters 35 2007 365 373 (Pubitemid 46589662)
22. F. Clautiaux, A. Jouglet, J. Carlier, and A. Moukrim A new constraint programming approach for the orthogonal packing problem Computers & Operations Research 35 2008 944 959 (Pubitemid 47368856)
23. K. Dowsland Some experiments with simulated annealing techniques for packing problems European Journal of Operational Research 68 1993 389 399 (Pubitemid 23680557)
24. S.P. Fekete, and J. Schepers A general framework for bounds for higher-dimensional orthogonal packing problems Mathematical Methods of Operations Research 60 2004 311 329
25. J.F. Gonalves A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem European Journal of Operational Research 183 2007 1212 1229
26. M. Hifi Exact algorithms for the guillotine strip cutting/packing problem Computers & Operations Research 25 1998 925 940
27. Hopper, E.; 2000. Two-dimensional packing utilising evolutionary algorithms and other meta-heuristic methods. Ph.D. thesis University of Wales, Cardiff School of Engineering.
28. 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)
29. W. Huang, D. Chen, and R. Xu A new heuristic algorithm for rectangle packing Computers & Operations Research 34 2007 3270 3280 (Pubitemid 46517856)
30. S. Imahori, and M. Yagiura The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio Computers & Operations Research 37 2010 325 333
31. M. Iori, S. Martello, and M. Monaci Metaheuristic algorithms for the strip packing problem P.M. Pardalos, V. Korotkikh, Optimization and Industry: New Frontiers Applied Optimization vol. 78 2003 Springer 159 179 (Chapter 7)
32. 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 2009 73 83
33. N. Lesh, J. Marks, A. McMahon, and M. Mitzenmacher Exhaustive approaches to 2d rectangular perfect packings Information Processing Letters 90 2004 7 14
34. S.C.H. Leung, and D. Zhang A new heuristic approach for the stock-cutting problems Engineering and Technology K: Business and Economic Sciences 2:2 2010 World Academy of Science 121 126
35. S.C.H. Leung, D. Zhang, C. Zhou, and T. Wu A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem Computers & Operations Research 39 2012 64 73 [Special Issue on Knapsack Problems and Applications.]
36. D. Liu, and H. Teng An improved bl-algorithm for genetic algorithm of the orthogonal packing of rectangles European Journal of Operational Research 112 1999 413 420
37. S. Martello, and D. Vigo Exact solution of the two-dimensional finite bin packing problem Management Science 44 1998 388 399 (Pubitemid 128568186)
38. S. Martello, M. Monaci, and D. Vigo An exact approach to the strip-packing problem INFORMS Journal on Computing 15 2003 310 319 (Pubitemid 39042723)
39. J.E. Oliveira, and J.S. Ferreira Algorithms for nesting problems Applied simulated annealing LNEMS vol. 396 1993 Springer 255 274
40. Pinto, E.; Oliveira, J.F.; 2005. Algorithm based on graphs for the non-guillotinable two-dimensional packing problem. In: Second ESICUP Meeting. Southampton, United Kingdom.
41. G. Scheithauer Lp-based bounds for the container and multi-container loading problem International Transactions in Operational Research 6 1999 199 213
42. P.Y. Wang, and C.L. Valenzela Data set generation for rectangular placement problems European Journal of Operational Research 134 2001 378 391 (Pubitemid 32723627)
43. 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)
44. L. Wei, D. Zhang, and Q. Chen A least wasted first heuristic algorithm for the rectangular packing problem Computers & Operations Research 36 2009 1608 1614
45. Y.-L. Wu, W. Huang, S.-c. Lau, C.K. Wong, and G.H. Young An effective quasi-human based heuristic for solving the rectangle packing problem European Journal of Operational Research 141 2002 341 358 (Pubitemid 34623941)
46. D. Zhang, Y. Liu, S. Chen, and X. Xie A meta-heuristic algorithm for the strip rectangular packing problem L. Wang, K. Chen, Ong Advances in Natural Computation chapter 157 Lecture Notes in Computer Science vol. 3612 2005 Springer Berlin/Heidelberg Berlin, Heidelberg 1235 1241 (Pubitemid 41449706)
47. D. Zhang, Y. Kang, and A. Deng A new heuristic recursive algorithm for the strip rectangular packing problem Computers & Operations Research 33 2006 2209 2217 (Pubitemid 41802286)