Skip to main content
SpringerLink
Log in

Triple-solution approach for the strip packing problem with two-staged patterns

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

Abstract

A triple-solution approach for the rectangular level strip packing problem is presented, where m item types with specified demands are packed in levels into a strip with definite width and infinite height to minimize the occupied height, with the constraint that the items in the same level cannot be placed one on top of the other. The approach contains two phases and considers three types of solutions. In phase one, two types of solutions, obtained respectively from solving residual problems using column generation and from looking ahead, are considered and the best is selected as phase-one solution. In phase two, an integer programming model is solved over the levels generated in phase-one to obtain phase-two solution. Finally the better one of the phase-one and phase-two solutions are selected. Computational results indicate that the approach is effective for both the instances with strongly heterogeneous items and those with weakly heterogeneous items.

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

Similar content being viewed by others

References

  • Alvarez-Valdes R, Parreño F, Tamarit JM (2008) Reactive GRASP for the strip-packing problem. Comput Oper Res 35:1065–1083

    Article  MATH  Google Scholar 

  • Alvarez-Valdes R, Parreño F, Tamarit JM (2009) A branch and bound algorithm for the strip packing problem. OR Spectr 31:431–459

    Article  MathSciNet  MATH  Google Scholar 

  • Bettinelli A, Ceselli A, Righini G (2008) A branch-and-price algorithm for the two-dimensional level strip packing problem. 4OR-Q J Oper Res 6(4):361–374

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Cintra GF, Miyazawa FK, Wakabayashi Y, Xavier EC (2008) Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. Eur J Oper Res 191:61–85

  • Coffman EG, Garey MR, Johnson DS, Tarjan RE (1980) Performance bounds for level-oriented two-dimensional packing algorithms. SIAM J Comput 9:808–826

    Article  MathSciNet  MATH  Google Scholar 

  • Coffman EG, Shor PW (1990) Average-case analysis of cutting and packing in two dimensions. Eur J Oper Res 44:134–144

    Article  MathSciNet  MATH  Google Scholar 

  • Côté J-F, Dell’Amico M, Iori M (2014) Combinatorial benders’ cuts for the strip packing problem. Oper Res 62:643–661

    Article  MathSciNet  MATH  Google Scholar 

  • Cui Y, Zhao Z (2013) Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns. Eur J Oper Res 231:288–298

    Article  MathSciNet  MATH  Google Scholar 

  • Cui Y-P, Cui Y, Tang T (2015) Sequential heuristic for the two-dimensional bin-packing problem. Eur J Oper Res 240:43–53

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  • Lodi A, Martello S, Vigo D (1999) Heuristics and meta-heuristic approaches for a class of two-dimensional bin packing problems. INFORMS J Comput 11:345–357

    Article  MathSciNet  MATH  Google Scholar 

  • Lodi A, Martello S, Vigo D (2004) Models and bounds for two-dimensional level packing problems. J Comb Optim 8:363–379

    Article  MathSciNet  MATH  Google Scholar 

  • Mrad M (2015) An arc flow-based optimization approach for the two-stage guillotine strip packing problem. J Oper Res Soc 66:1850–1859

    Article  Google Scholar 

  • Ntene N, van Vuuren JH (2009) A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem. Discret Optim 6:174–188

    Article  MathSciNet  MATH  Google Scholar 

  • Silva E, Alvelos F, Valério de Carvalho JM (2010) An integer programming model for two- and three-stage two-dimensional cutting stock problems. Eur J Oper Res 205:699–708

    Article  MATH  Google Scholar 

  • Wei L, Oon W-C, Zhu W, Lim A (2013) A goal-driven approach to the 2D bin packing and variable-sized bin packing problems. Eur J Oper Res 224:110–121

    Article  MathSciNet  MATH  Google Scholar 

  • Wei L, Qin Hu, Cheang B, Xu X (2016) An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem. Int Trans Oper Res 23:65–92

    Article  MathSciNet  MATH  Google Scholar 

  • Wäscher G, Haussner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183:1109–1130

Download references

Acknowledgments

This research is part of Projects 71371058 and 61363026 supported by National Natural Science Foundation of China.

Author information

Authors and Affiliations

  1. School of Business Administration, South China University of Technology, Guangzhou, 510640, China

    Yi-Ping Cui & Yongwu Zhou

  2. College of Computer Science and Electronic Information, Guangxi University, Nanning, 530004, China

    Yaodong Cui

Authors
  1. Yi-Ping Cui
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yongwu Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yaodong Cui
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yi-Ping Cui.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Cui, YP., Zhou, Y. & Cui, Y. Triple-solution approach for the strip packing problem with two-staged patterns. J Comb Optim 34, 588–604 (2017). https://doi.org/10.1007/s10878-016-0088-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-016-0088-7

Keywords

Search

Navigation