Applying triple-block patterns in solving the two-dimensional bin packing problem

References

• Alvelos, F., Chan, T. M., Vilaca, P., Gomes, T., Silva, E., & Valerio de Carvalh, J. M. (2009). Sequence based heuristics for two-dimensional bin packing problems. Engineering Optimization, 41(8), 773–791.
   Web of Science ®Google Scholar
• Beasley, J. E. (2004). A population heuristic for constrained two-dimensional non-guillotine cutting. European Journal of Operational Research, 156(3), 601–627.
   Web of Science ®Google Scholar
• Berkey, J. O., & Wang, P. Y. (1987). Two-dimensional finite bin-packing algorithms. Journal of the Operational Research Society, 38(5), 423–429.
   Web of Science ®Google Scholar
• Boschetti, M. A., & Mingozzi, A. (2003). The two-dimensional finite bin-packing problem. Part II: New lower and upper bounds. Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 1(2), 135–147.
   Google Scholar
• Carlier, J., Clautiaux, F., & Moukrim, A. (2007). New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation. Computers & Operations Research, 34(8), 2223–2250.
   Web of Science ®Google Scholar
• Chan, T. M., Alvelos, F., Silva, E., & Valério de Carvalho, J. M. (2011). Heuristics with stochastic neighborhood structures for two-dimen- sional bin packing and cutting stock problems. Asia-Pacific Journal of Operational Research, 28(2), 255–278.
   Web of Science ®Google Scholar
• Chan, T. M., Alvelos, F., Silva, E., & Valério de Carvalho, J. M. (2013). Solving two-dimensional bin packing problems with two-stage guillotine cutting by combined local search heuristics. Pacific Journal of Optimization, 9(3), 391–412.
   Web of Science ®Google Scholar
• Charalambous, C., & Fleszer, K. (2011). A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts. Computers & Operations Research, 38(10), 14431451.
   Web of Science ®Google Scholar
• Clautiaux, F., Jouglet, A., & Hayek, E. J. (2007). A new lower bound for the non-oriented two-dimensional bin-packing problem. Operations Research Letters, 35(3), 365–373.
   Web of Science ®Google Scholar
• Cui, Y. (2007). Simple block patterns for the two-dimensional cutting problem. Mathematical and Computer Modelling, 45(7–8), 943–953.
   Web of Science ®Google Scholar
• Cui, Y.-P., Cui, Y., & Tang, T. (2015). Sequential heuristic for the two-dimensional bin-packing problem. European Journal of Operational Research, 240(1), 43–53.
   Web of Science ®Google Scholar
• Cui, Y., Song, X., Chen, Y., & Cui, Y.-P. (2017). New model and heuristic solution approach for one-dimensional cutting stock problem with usable leftovers. Journal of the Operational Research Society, 68(3), 269–280.
   Web of Science ®Google Scholar
• Cui, Y., Yang, L., & Chen, Q. (2013). Heuristic for the rectangular strip packing problem with rotation of items. Computers & Operations Research, 40(4), 1094–1099.
   Web of Science ®Google Scholar
• Dell’Amico, M., Martello, S., & Vigo, D. (2002). A lower bound for the non-oriented two-dimensional bin packing problem. Discrete Applied Mathematics, 118(1–2), 13–24.
   Web of Science ®Google Scholar
• Fleszar, K. (2013). Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts. Computer & Operations Research, 40(1), 463–474.
   Web of Science ®Google Scholar
• Harwig, J. M., Barnes, J. W., & James, T. (2006). An adaptive tabu search approach for 2-dimensional orthogonal packing problems. Military Operations Research, 11(2), 5–26.
   Web of Science ®Google Scholar
• Hayek, J. E., Moukrim, A., & Negre, S. (2008). New resolution algorithm and pretreatments for the two-dimensional bin-packing problem. Computers & Operations Research, 35(10), 3184–3201.
   Web of Science ®Google Scholar
• Hong, S., Zhang, D., Lau, H. C., Zeng, X., & Si, Y.-W. (2014). A hybrid heuristic algorithm for the 2D variable-sized bin packing problem. European Journal of Operational Research, 238(1), 95–103.
   Web of Science ®Google Scholar
• Lodi, A., Martello, S., & Vigo, D. (1999). Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS Journal on Computing, 11(4), 345–357.
   Web of Science ®Google Scholar
• Lodi, A., Martello, S., & Vigo, D. (2002). Recent advances on two- dimensional bin packing problems. Discrete Applied Mathematics, 123(1–3), 379–396.
   Web of Science ®Google Scholar
• Lodi, A., Martello, S., & Vigo, D. (2004). Models and bounds for two-dimensional level packing problems. Journal of Combinatorial Optimization, 8(3), 363–379.
   Web of Science ®Google Scholar
• Mack, D., & Bortfeldt, A. (2012). A heuristic for solving large bin packing problems in two and three dimensions. Central European Journal of Operational Research, 20(2), 337–354.
   Web of Science ®Google Scholar
• Martello, S., & Vigo, D. (1998). Exact solution of the two-dimensional finite bin packing problem. Management Science, 44(3), 388–399.
   Web of Science ®Google Scholar
• Monaci, M., & Toth, P. (2006). A set-covering-based heuristic approach for bin-packing problems. INFORMS Journal on Computing, 18(1), 71–85.
   Web of Science ®Google Scholar
• Parreno, F., Alvarez-Valdes, R., Oliveira, J., & Tamarit, J. (2010). A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing. Annals of Operations Research, 179(1), 203–220.
   Web of Science ®Google Scholar
• Pisinger, D., & Sigurd, M. (2007). Using decomposition techniques and constraint programming for solving the two-dimensional bin packing problem. INFORMS Journal on Computing, 19(1), 36–51.
   Web of Science ®Google Scholar
• Polyakovsky, S., & M’Hallah, R. (2009). An agent-based approach to the two-dimensional guillotine bin packing problem. European Journal of Operational Research, 192(3), 767–781.
   Web of Science ®Google Scholar
• Puchinger, J., & Raidl, G. R. (2007). Models and algorithms for three- stage two-dimensional bin packing. European Journal of Operational Research, 183(3), 1304–1327.
   Web of Science ®Google Scholar
• Stoyan, Y., Pankratov, A., & Romanova, T. (2016). Cutting and packing problems for irregular objects with continuous rotations: Mathematical modelling and non-linear optimization. Journal of the Operational Research Society, 67(5), 786–800.
   Web of Science ®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. European Journal of Operational Research, 224(1), 110–121.
   Web of Science ®Google Scholar