A skyline-based heuristic for the 2D rectangular strip packing problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6704 LNAI, Issue PART 2, 2011, Pages 286-295

  Wei, Lijun ^a   Lim, Andrew ^a   Zhu, Wenbin ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

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

Author keywords

Heuristics; Packing; Tabu Search

Indexed keywords

BENCHMARK TESTS; BINARY SEARCH; GREEDY HEURISTICS; HEURISTICS; ITERATIVE DEEPENING; PACKING PROBLEMS; RECTANGULAR STRIPS; STRIP PACKING PROBLEM;

BENCHMARKING; INDUSTRIAL ENGINEERING; INTELLIGENT SYSTEMS;

TABU SEARCH;

EID: 79960475970     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21827-9_29     Document Type: Conference Paper

References (17)

1. Aşik, Ö., Özcan, E.: Bidirectional best-fit heuristic for orthogonal rectangular strip packing. Annals of Operations Research 172, 405-427 (2009), http://dx.doi.org/10.1007/s10479-009-0642-0
2. Alvarez-Valdes, R., Parreño, F., Tamarit, J.M.: Reactive GRASP for the strippacking problem. Computers & Operations Research 35(4), 1065-1083 (2008), http://dx.doi.org/10.1016/j.cor.2006.07.004
3. Babu, A.R., Babu, N.R.: Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms. International Journal of Production Research 37(7), 1625-1643 (1999), http://dx.doi.org/10.1080/002075499191166
4. Beasley, J.E.: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting. The Journal of the Operational Research Society 36(4), 297-306 (1985), http://dx.doi.org/10.2307/2582416
5. Beasley, J.E.: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure. Operations Research 33(1), 49-64 (1985), http://dx.doi.org/10. 2307/170866
6. Bengtsson, B.E.: Packing rectangular pieces heuristic approach. The Computer Journal 25, 253-257 (1982)
7. Berkey, J.O., Wang, P.Y.: Two-Dimensional Finite Bin-Packing Algorithms. The Journal of the Operational Research Society 38(5), 423-429 (1987), http://dx.doi.org/10.2307/2582731
8. Bortfeldt, A.: A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces. European Journal of Operational Research 172(3), 814-837 (2006), http://dx.doi.org/10.1016/j.ejor.2004.11.016
9. Burke, E.K., Kendall, G., Whitwell, G.: A New Placement Heuristic for the Orthogonal Stock-Cutting Problem. Operations Research 52(4), 655-671 (2004), http://dx.doi.org/10.1287/opre.1040.0109
10. Burke, E.K., Kendall, G., Whitwell, G.: A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem. INFORMS Journal on Computing 21(3), 505-516 (2009), http://dx.doi.org/10.1287/ijoc.1080. 0306
11. Christofides, N., Whitlock, C.: An Algorithm for Two-Dimensional Cutting Problems. Operations Research 25(1), 30-44 (1977), http://dx.doi.org/10.2307/ 169545
12. Hopper, E., Turton, B.C.H.: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. European Journal of Operational Research 128(1), 34-57 (2001), http://dx.doi.org/10.1016/S0377- 2217(99)00357-4
13. Hopper, E.: Two-dimensional packing utilising evolutionary algorithms and other meta-heuristic methods. Ph.D. thesis, University of Wales, Cardiff School of Engineering (May 2000)
14. Leung, S.C.H., Zhang, D.: A New Heuristic Approach for the Stock-Cutting Problems. In: Engineering and Technology K: Business and Economic Sciences 2:2, pp. 121-126. World Academy of Science (2010)
15. Martello, S., Vigo, D.: Exact Solution of the Two-Dimensional Finite Bin Packing Problem. Management Science 44(3), 388-399 (1998), http://dx.doi.org/10. 1287/mnsc.44.3.388
16. Pinto, E., Oliveira, J.F.: Algorithm based on graphs for the non-guillotinable twodimensional packing problem. In: Second ESICUP Meeting, Southampton, United Kingdom (May 2005)
17. Wang, P.: Data set generation for rectangular placement problems. European Journal of Operational Research 134(2), 378-391 (2001), http://dx.doi.org/10.1016/S0377-2217(00)00263-0