Skip to main content
SpringerLink
Log in

TSMSA: a 2DSPP algorithm with multi-strategy rectangle selection

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

The two-dimension strip packing problem (2DSPP) is an NP-hard combinatorial optimization problem, and it has a wide range of applications. The order in which the rectangles are placed in the strip is the key to solving the 2DSPP. In this paper, the corner increment multi-level scoring strategy and the two-step selection strategy are proposed to make the selection of rectangles more reasonable. The hierarchical construction strategy is used to improve the constructive heuristic algorithm to expand the search space of the rectangle selection. Based on this, this paper proposes a multi-strategy rectangle selection algorithm TSMSA for solving 2DSPP. Comparing experiments with 7 excellent algorithms for solving 2DSPP on 737 instances of the benchmark dataset shows that the instance number of the optimal solution obtained by TSMSA is 1.05~2.9 times that of the other 7 algorithms.

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

  1. 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 

  2. Dowsland KA, Dowsland WB (1992) Packing problems—ScienceDirect. Eur J Oper Res 56(1):2–14

    Article  MathSciNet  MATH  Google Scholar 

  3. Pisinger D (2002) Heuristics for the container loading problem. Eur J Oper Res 141(2):382–392

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Martello S, Monaci M et al (2003) An exact approach to the strip-packing problem. Inf J Comput 15(3):310–319

    Article  MathSciNet  MATH  Google Scholar 

  6. Hifi M, M’Hallah R (2005) An exact algorithm for constrained two-dimensional two-staged cutting problems. Oper Res 53(1):140–150

    Article  MathSciNet  MATH  Google Scholar 

  7. Cui Y, Yang Y, Xian C et al (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 

  8. Kenmochi M, Imamichi T, Nonobe K et al (2009) Exact algorithms for the two-dimensional strip packing problem with and without rotations. Eur J Oper Res 198(1):73–83

    Article  MathSciNet  MATH  Google Scholar 

  9. Baker BS, Coffman EG, Rivest RL (1980) Orthogonal packings in two dimensions. SIAM J Comput 9(4):846–855

    Article  MathSciNet  MATH  Google Scholar 

  10. Chazelle B (1983) The bottomn-left bin-packing heuristic: an efficient implementation. IEEE Trans Comput 100(8):697–707

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  12. 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 

  13. Aşık ÖB, Özcan E (2009) Bidirectional best-fit heuristic for orthogonal rectangular strip packing. Ann Oper Res 172(1):405–427

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  17. Verstichel J, Causmaecker PD, Berghe GV (2013) An improved best-fit heuristic for the orthogonal strip packing problem. Int Trans Oper Res 20(5):711–730

    Article  MathSciNet  MATH  Google Scholar 

  18. Bortfeldt A, Winter T (2006) A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces. Int Trans Oper Res 172(3):814–837

    MathSciNet  MATH  Google Scholar 

  19. Berthold K (1995) Guillotineable bin packing: a genetic approach. Eur J Oper Res 84(3):645–661

    Article  MATH  Google Scholar 

  20. Zhang D, ShengDa C, YanJuan L (2007) An improved heuristic recursive strategy based on genetic algorithm for the strip rectangular packing problem. Acta Automat Sinica 33(9):911–916

    Article  MATH  Google Scholar 

  21. Bennell JA, Lai SL, Potts CN (2013) A genetic algorithm for two-dimensional bin packing with due dates. Int J Prod Econ 145(2):547–560

    Article  Google Scholar 

  22. Dowsland KA (1993) Some experiments with simulated annealing techniques for packing problems. Eur J Oper Res 68(3):389–399

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  24. Hong S, Zhang D, Lau HC et al (2014) A hybrid heuristic algorithm for the 2D variable-sized bin packing problem. Eur J Oper Res 238(1):95–103

    Article  MathSciNet  MATH  Google Scholar 

  25. Leung S, 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 

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

    Article  MATH  Google Scholar 

  27. Chen B, Wang Y, Yang S (2015) A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem. Math Probl Eng 2015(2):1–14

    MathSciNet  MATH  Google Scholar 

  28. Wei L, Qin H, Cheang B et al (2016) An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem. Int Trans Oper Res 23(1–2):65–92

    Article  MathSciNet  MATH  Google Scholar 

  29. Wei L, Hu Q, Leung S et al (2016) An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation. Comput Oper Res 80:113–127

    Article  MathSciNet  MATH  Google Scholar 

  30. Chen Z, Chen J (2018) An effective corner increment-based algorithm for the two-dimensional strip packing problem. IEEE Access 6:72906–72924

    Article  Google Scholar 

  31. Chen M, Li K, Zhang D et al (2019) Hierarchical search-embedded hybrid heuristic algorithm for two-dimensional strip packing problem. IEEE Access 7:179086–179103

    Article  Google Scholar 

  32. Wang P, Rao Y, Luo Q (2020) An effective discrete Grey Wolf optimization algorithm for solving the packing problem. IEEE Access 8:115559–115571

    Article  Google Scholar 

  33. Rakotonirainy RG, Van Vuuren JH (2020) Improved metaheuristics for the two-dimensional strip packing problem. Appl Soft Comput 92:106268

    Article  Google Scholar 

  34. Oliveira JF, Neuenfeldt Júnior A, Silva E, Carravilla MA et al (2016) A survey on heuristics for the two-dimensional rectangular strip packing problem. Pesquisa Operacional 36(2):197–226

    Article  Google Scholar 

  35. Wei L, Oon WC, Zhu W et al (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 

  36. Chen M, Wu C, Tang X et al (2019) An efficient deterministic heuristic algorithm for the rectangular packing problem. Comput Ind Eng 137:106097

    Article  Google Scholar 

  37. Pinto E, Oliveira JF (2005) Algorithm based on graphs for the non-guillotinable two-dimensional packing problem[M]. In Proceedings 2nd ESICUP Meeting, Southampton, U.K

  38. Hopper E (2000) Two-dimensional packing utilising evolutionary algorithms and other meta-heuristic methods[D]. University of Wales, Cardiff, UK

    Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  42. Berkey JO, Wang PY (1987) Two-dimensional finite Bin-Packing algorithms. J Oper Res Soc 38(5):423–429

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  44. Mumford-Valenzuela CL, Vick J, Wang PY (2003) Heuristics for large strip packing problems with guillotine patterns: an empirical study. In: Du DZ, Pardalos PM (eds) Metaheuristics: computer decision-making. Applied Optimization, vol 86, Springer, Boston, pp 501–522. https://doi.org/10.1007/978-1-4757-4137-7_24.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer Science, Chongqing University, Chongqing, 400044, China

    Ping Guo & Minliang Jiang

  2. College Key Laboratory of Software Theory and Technology, Chongqing University, Chongqing, 400044, China

    Ping Guo

Authors
  1. Ping Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Minliang Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ping Guo.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendix

Appendix

In the appendix, we give the detailed data of the algorithm comparison experiment, in which the best value is shown in bold.

See Tables

Table 8 Avg_Gap (%) on dataset C
Full size table

8,

Table 9 Avg_Gap(%) on dataset N
Full size table

9,

Table 10 Avg_Gap(%) on dataset CX
Full size table

10,

Table 11 Avg_Gap(%) on dataset NT
Full size table

11,

Table 12 Avg_Gap(%) on dataset 2sp
Full size table

12,

Table 13 Avg_Gap(%) on dataset BWMV
Full size table

13,

Table 14 Avg_Gap(%) on dataset Nice
Full size table

14,

Table 15 Avg_Gap(%) on dataset Path
Full size table

15,

Table 16 Avg_Gap(%) on dataset ZDF
Full size table

16.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Guo, P., Jiang, M. TSMSA: a 2DSPP algorithm with multi-strategy rectangle selection. J Supercomput 78, 12242–12277 (2022). https://doi.org/10.1007/s11227-022-04350-5

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-022-04350-5

Keywords

Search

Navigation