Movatterモバイル変換

[0]ホーム
URL:

Skip to main content

Advertisement

Springer Nature Link
Log in

A hybrid algorithm based on variable neighbourhood for the strip packing problem

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

Abstract

This paper addresses the strip packing problem, which has a wide range of real-world applications. Our proposed algorithm is a hybrid metaheuristic that combines an improved heuristic algorithm with a variable neighbourhood search. Different neighbourhoods are constructed based on the concept of block patterns. The proposed algorithm has three interesting features. First, a least-waste strategy is used to improve the constructive heuristics. Second, a better sorting sequence is selected to generate an initial solution. Finally, different neighbourhoods are constructed based on block patterns. The computational results from a diverse set of problem instances show that the proposed algorithm performs better than algorithms reported in the literature for most of the problem sets compared.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

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

    Article MATH  Google Scholar 

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

    Article MathSciNet MATH  Google Scholar 

  • Belov G, Scheithauer G, Mukhacheva EA (2008) One-dimensional heuristics adapted for two-dimensional rectangular strip packing. J Oper Res Soc 59:823–832

    Article MATH  Google Scholar 

  • Beltran JD, Calderon JE, Cabrera RJ, Moreno Perez JA, Moreno-Vega JM (2004) GRASP/VNS hybrid for the strip packing problem. In: Proceedings of the first international workshop on hybrid metaheuristics (HM 2004), Valencia, Spain, pp. 22–23

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

    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 

  • Bortfeldt A, Gehring H (2006) New large benchmark instances for the two-dimensional strip packing problem with rectangular pieces. In: Proceedings of the 39th annual hawaii international conference on system sciences (HICSS’06) vol 2, p. 30b

  • 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 

  • Burke EK, Kendall G, Whitwell G (2009) A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock cutting problem. INFORMS J Comput 21(3):505–516

    Article MATH  Google Scholar 

  • Burke EK, Hyde MR, Kendall G, Woodward JR (2010) A genetic programming hyper-heuristic approach for evolving 2-D strip packing heuristics. IEEE Trans Evol Comput 14(6):942–958

    Article  Google Scholar 

  • Chen B, Wang Y, Yang S (2015) A hybrid demon algorithm for the two- dimensional orthogonal strip packing problem. Math Prob Eng. Article ID 541931. doi:10.1155/2015/541931

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

    Article MATH  Google Scholar 

  • Cui YD, Yang YL, Cheng 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 

  • Derrac J, García S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3–18

    Article  Google Scholar 

  • Dowsland KA, Herbert EA, Kendall G, Burke EK (2006) Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems. Eur J Oper Res 168:390–402

    Article MathSciNet MATH  Google Scholar 

  • Gonçalves JF, Resende MGC (2011) A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem. J Comb Optim 22(2):180–201

    Article MathSciNet  Google Scholar 

  • Haouari M, Serairi M (2009) Heuristics for the variable sized bin-packing problem. Comput Oper Res 36(10):2877–2884

    Article MathSciNet 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 

  • He K, Ji P, Li C (2015) Dynamic reduction heuristics for the rectangle packing area minimization problem. Eur J Oper Res 241:674–685

    Article MathSciNet  Google Scholar 

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

    Article 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 

  • Jefferson LM, da S, Eduardo CX, Flávio KM (2014) Two-dimensional strip packing with unloading constraints. Discret Appl Math 164(2):512–521

    MathSciNet MATH  Google Scholar 

  • Leung SCH, Zhang D, 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 

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

    Article MathSciNet  Google Scholar 

  • Lodi A, Martello S, Monaci M (2002) Two-dimensional packing problems: a survey. Eur J Oper Res 141(2):241–252

    Article MathSciNet MATH  Google Scholar 

  • Martello S, Monaci M, Vigo D (2003) An exact approach to the strip packing problem. INFORMS J Comput 15(3):310–319

    Article MathSciNet MATH  Google Scholar 

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

    Article MATH  Google Scholar 

  • Mitsutoshi K, Takashi I, Koji N, Mutsunori Y, Hiroshi N (2009) Exact algorithms for the two-dimensional strip packing problem with and without rotations. Eur J Oper Res 198:73–83

    Article MathSciNet MATH  Google Scholar 

  • Mladenović N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097–1100

    Article MathSciNet MATH  Google Scholar 

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

  • Riff MC, Bonnaire X, Neveu B (2009) A revision of recent approaches for two-dimensional strip-packing problems. Eng Appl Artif Intell 22(4–5):823–827

    Article  Google Scholar 

  • 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, Portugal, pp. 417–421

  • Wang Y, Chen L (2015) Two-dimensional residual-space-maximized packing. Expert Syst Appl 42:3297–3305

    Article  Google Scholar 

  • Wascher G, Hausner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183(3):1109–1130

    Article MATH  Google Scholar 

  • Wei L, Oon WC, Zhu W, Lim A (2011) A skyline heuristic for the 2D rectangular packing and strip packing problems. Eur J Oper Res 215(2):337–346

    MathSciNet MATH  Google Scholar 

  • Wei L, Tian T, Zhu W, Lim A (2014) A block-based layer building approach for the 2D guillotine strip packing problem. Eur J Oper Res 239(1):58–69

    Article MathSciNet MATH  Google Scholar 

  • Yang S, Han S, Ye W (2013) A simple randomized algorithm for two-dimensional strip packing. Comput Oper Res 40(1):1–8

    Article  Google Scholar 

  • Zhang D, Wei L, Leung SCH, Chen Q (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

Defu Zhang would like to thank his supervisor Prof. Wenqi Huang who taught him a great deal about research. This work was in memory of Prof. Wenqi Huang and was partially supported by the National Nature Science Foundation of China (Grant no. 61272003), Research Committee of University of Macau (MYRG041(Y1-L1)- FST13-SYW) and a grant from City University of Hong Kong (Project No. 7004149). The authors would like to thank the reviewers for their valuable comments that help improve this paper.

Author information

Authors and Affiliations

  1. Department of Computer Science, Xiamen University, Xiamen, China

    Defu Zhang, Yuxin Che & Furong Ye

  2. Department of Computer and Information Science, University of Macau, Macau, China

    Yain-Whar Si

  3. Faculty of Engineering, The University of Hong Kong, Hong Kong, China

    Stephen C. H. Leung

Authors
  1. Defu Zhang

    You can also search for this author inPubMed Google Scholar

  2. Yuxin Che

    You can also search for this author inPubMed Google Scholar

  3. Furong Ye

    You can also search for this author inPubMed Google Scholar

  4. Yain-Whar Si

    You can also search for this author inPubMed Google Scholar

  5. Stephen C. H. Leung

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence toDefu Zhang.

Rights and permissions

About this article

Access this article

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Advertisement

[8]ページ先頭
©2009-2025 Movatter.jp