Skip to main content
Springer Nature Link
Log in

A Skyline-Based Heuristic for the 2D Rectangular Strip Packing Problem

  • Conference paper
Modern Approaches in Applied Intelligence (IEA/AIE 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6704))

Abstract

In this paper, we propose a greedy heuristic for the 2D rectangular packing problem that represents packings using a skyline. To solve the 2D rectangular strip packing problem, we make use of this heuristic as a subroutine in an iterative deepening binary search on the maximum height of the packing that incorporates a tabu search mechanic. Our approach outperforms all existing approaches on several sets of standard benchmark test cases for the 2D strip packing problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aşık, Ö., Ö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

    Article  MathSciNet  MATH  Google Scholar 

  2. Alvarez-Valdes, R., Parreño, F., Tamarit, J.M.: Reactive GRASP for the strip-packing problem. Computers & Operations Research 35(4), 1065–1083 (2008), http://dx.doi.org/10.1016/j.cor.2006.07.004

    Article  MATH  Google Scholar 

  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

    Article  MATH  Google Scholar 

  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

    Article  MATH  Google Scholar 

  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

    Article  MathSciNet  MATH  Google Scholar 

  6. Bengtsson, B.E.: Packing rectangular pieces heuristic approach. The Computer Journal 25, 253–257 (1982)

    Article  MathSciNet  Google Scholar 

  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

    Article  MATH  Google Scholar 

  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

    Article  MathSciNet  MATH  Google Scholar 

  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

    Article  MATH  Google Scholar 

  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

    Article  MATH  Google Scholar 

  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

    Article  MATH  Google Scholar 

  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

    Article  MATH  Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  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

    Article  MATH  Google Scholar 

  16. Pinto, E., Oliveira, J.F.: Algorithm based on graphs for the non-guillotinable two-dimensional packing problem. In: Second ESICUP Meeting, Southampton, United Kingdom (May 2005)

    Google Scholar 

  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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management Sciences, City University of Hong Kong, Tat Chee Ave, Kowloon Tong, Hong Kong

    Lijun Wei & Andrew Lim

  2. Department of Computer Science, Hong Kong Univ. of Science and Technology, Clear Water Bay, Kowloon, Hong Kong

    Wenbin Zhu

Authors
  1. Lijun Wei
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrew Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wenbin Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer and Inforamtion Science, Center for Science and Technology, Syracuse University, 13244-4100, Syracuse, NY, USA

    Kishan G. Mehrotra  & Chilukuri K. Mohan  & 

  2. Department of Electrical Engineering and Computer Science, Syracuse University, 13244, Syracuse, NY, USA

    Jae C. Oh  & Pramod K. Varshney  & 

  3. Department of Computer Science, Texas State University San Marcos, 601 University Drive, 78666-4616, San Marcos, TX, USA

    Moonis Ali

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wei, L., Lim, A., Zhu, W. (2011). A Skyline-Based Heuristic for the 2D Rectangular Strip Packing Problem. In: Mehrotra, K.G., Mohan, C.K., Oh, J.C., Varshney, P.K., Ali, M. (eds) Modern Approaches in Applied Intelligence. IEA/AIE 2011. Lecture Notes in Computer Science(), vol 6704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21827-9_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21827-9_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21826-2

  • Online ISBN: 978-3-642-21827-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics