Skip to main content

Advertisement

SpringerLink
Log in

A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

This paper presents a quasi-human algorithm for the rectangular strip packing problem without guillotine constraint. The basic version of the algorithm works according to seven heuristic selection rules, which are designed to select a corner-occupying action. The strengthened version of the algorithm adopts a branching scheme in which the basic version of the algorithm is applied in a heuristic series of parallel branches. Computational tests carried on eight sets of well-known benchmark instances show that the algorithm is efficient for approximately solving the problem. In comparison with the best algorithms in the literature, the algorithm performs better for zero-waste instances and large scale non-zero-waste instances.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  • Alvarez-Valdes A, Parreno F, Tamarit JM (2009) A branch and bound algorithm for the strip packing problem. OR Spect 31(2):431–459

    Article  MathSciNet  MATH  Google Scholar 

  • Beasley JE (1985a) Algorithms for unconstrained two-dimensional guillotine cutting. J Oper Res Soc 36(4):297–306

    Article  MathSciNet  MATH  Google Scholar 

  • Beasley JE (1985b) An exact two-dimensional non-guillotine cutting tree search procedure. Oper Res 33:49–64

    Article  MathSciNet  MATH  Google Scholar 

  • Bengtsson BE (1982) Packing rectangular pieces—a heuristic approach. Comput J 25:353–357

    Article  MathSciNet  Google Scholar 

  • Berkey JO, Wang PY (1987) Two-dimensional finite bin packing algorithms. J Oper Res Soc 38:423–429

    Article  MATH  Google Scholar 

  • Bortfeldt A (2006) A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces. Eur J Oper Res 172(3):814–837

    Article  MathSciNet  MATH  Google Scholar 

  • Burke EK, Kendall G, Whitwell G (2004) A new placement heuristic for the orthogonal stock-cutting problem. Oper Res 52(4):655–671

    Article  MATH  Google Scholar 

  • Christofides N, Whitlock C (1977) An algorithm for two-dimensional cutting problems. Oper Res 25(1):30–44

    Article  MATH  Google Scholar 

  • Cui YD, Yang YL, Cehng X, Song PH (2008) A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem. Comput Oper Res 35(4):1281–1291

    Article  MATH  Google Scholar 

  • He K, Jin Y, Huang WQ (2013) Heuristic for two-dimensional strip packing problem with 90 rotations. Expert Syst Appl 40:5542–5550

    Article  Google Scholar 

  • Hifi M (1998) Exact algorithms for the guillotine strip cutting/packing problem. Comput Oper Res 25:925–940

    Article  MATH  Google Scholar 

  • Hochbaum DS, Maass W (1985) Approximation schemes for covering and packing problems in image processing and VLSI. J ACM 32(1):130–136

    Article  MathSciNet  MATH  Google Scholar 

  • Hopper E, Turton BCH (2001) An empirical investigation of meta-heuristic and heuristic algorithm for a 2D packing problem. Eur J Oper Res 128(1):34–57

    Article  MATH  Google Scholar 

  • Huang WQ, He K (2009) A carving degree approach for the single container loading problem. Eur J Oper Res 196(1):93–101

    Article  MathSciNet  MATH  Google Scholar 

  • Huang WQ, He K (2009) A pure quasi-human algorithm for solving the cuboid packing problem. Sci China Ser F 52(1):52–58

    Article  MathSciNet  MATH  Google Scholar 

  • Huang WQ, Chen DB, Xu RC (2007) A new heuristic algorithm for rectangle packing. Comput Oper Res 34(11):3270–3280

    Article  MathSciNet  MATH  Google Scholar 

  • Jiang JQ, Liang YC, Shi XH, Lee HP (2004) A hybrid algorithm based on PSO and SA and its application for two-dimensional non-guillotine cutting stock problem. Lecture Notes in Computer Science, vol 3007, pp 666–669

  • Leung TW, Chan CK, Troutt MD (2003) Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem. Eur J Oper Res 145(3):530–542

    Article  MathSciNet  MATH  Google Scholar 

  • Leung SCH, Zhang DF (2011) A fast layer-based heuristic for non-guillotine strip packing. Expert Syst Appl 38:13032–13042

    Article  MathSciNet  Google Scholar 

  • Leung SCH, Zhang DF, Sim KM (2011) A two-stage intelligent search algorithm for the two-dimensional strip packing problem. Eur J Oper Res 215(1):57–69

    Article  Google Scholar 

  • Lodi A, Martello S, Vigo D (1999) Heuristic and metaheuristic approaches for a class of two dimensional bin packing problem. INFORMS J Comput 11(2):345–357

    Article  MathSciNet  MATH  Google Scholar 

  • Martello S, Vigo D (1998) Exact solution of the two-dimensional finite bin packing problem. Manag Sci 25:253–257

    MATH  Google Scholar 

  • Pinto E, Oliverira JF (2005) Algorithm based on graphs for the non-guillotinable two-dimensional packing problem. Second ESICP Meeting, Southampton

  • Valenzuela CL, Wang PY (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, pp 417–421

  • Wei LJ, Zhang DF, Chen QS (2009) A least wasted first heuristic algorithm for the rectangular packing problem. Comput Oper Res 36(5):1608–1614

    Article  MathSciNet  MATH  Google Scholar 

  • Zhang DF, Wei LJ, Leung SCH, Chen QS (2013) A binary search heuristic algorithm based on randomized local search for the rectangular strip-packing problem. INFORMS J Comput 25(2):332–345

    Article  Google Scholar 

Download references

Acknowledgments

The authors would like to thank the anonymous referees for their helpful comments which contributed to the improvement of this paper. This research was supported by the National Natural Science Foundation of China (Grant Nos. 61262011, 61100055, 61472293), the Natural Science Foundation of Hubei Province under Grant No. 2014CFC1121, and by the Natural Science Foundation of Jiangxi Province under Grant No. 20142BAB207024.

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, Wuhan University of Science and Technology, Wuhan, 430081, Hubei, China

    Lei Wang

  2. Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System, Wuhan, 430081, Hubei, China

    Lei Wang

  3. School of Software and Communication Engineering, Jiangxi University of Finance and Economics, Nanchang, 330023, Jiangxi, China

    Aihua Yin

Authors
  1. Lei Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aihua Yin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lei Wang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, L., Yin, A. A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang. J Comb Optim 32, 416–444 (2016). https://doi.org/10.1007/s10878-015-9961-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-015-9961-z

Keywords

Search

Navigation