Abstract
In this paper we present a hybrid metaheuristic approach called PVS (Progress and Verify Strategy) for the two-dimensional strip packing problem (2SPP). PVS relies on two procedures: a local search algorithm that delivers satisfying placements of the items on the horizontal axis, and an exact procedure that searches for the positions of the items on the vertical axis. This last one explores all the possibilities, starting with the most promising ones, and can be stopped at any moment. PVS follows a specific anytime strategy which continuously improves the current solution until it is provably optimal or a given time limit is reached. Experimental results show that the method is competitive on moderate-sized instances compared to the best known approaches.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data Availability
Instances are available at http://www.dil.univ-mrs.fr/~gcolas/packing/random-instances.tgz
Code Availability
Software available at http://www.dil.univ-mrs.fr/~gcolas/packing/pvs
Notes
Instances are available at http://www.dil.univ-mrs.fr/~gcolas/packing/random-instances.tgz.
References
Alvarez-Valdes, R., Parreño, F., & Tamarit, J. (2008). Reactive grasp for the strip-packing problem. Computers and Operations Research, 35(4), 1065–1083. https://doi.org/10.1016/j.cor.2006.07.004.
Baker, B., Coffman, E., & Rivest, R. (1980). Orthogonal packing in two dimensions. SIAM Journal of Computing, 9(4), 846–855.
Beasley, J. E. (1985). Algorithms for unconstrained two-dimensional guillotine cutting. The Journal of the Operational Research Society, 36(4), 297–306.
Belov, G., Scheithauer, G., & Mukhacheva, E. A. (2008). One-dimensional heuristics adapted for twodimensional rectangular strip packing. Journal of the Operational Research Society, 59, 823–832.
Bengtsson, B. (1982). Packing rectangular pieces—a heuristic approach. The Computer Journal, 25(3), 353–357.
Berkey, J. O., & Wang, P. Y. (1987). Two-dimensional finite bin-packing algorithms. Journal of the Operational Research Society, 38(5), 423–429. https://doi.org/10.1057/jors.1987.70
Bodlaender, H. L., & Jansen, K. (1995). Restrictions of graph partition problems. part i. Theoretical Computer Science, 148(1), 93–109. https://doi.org/10.1016/0304-3975(95)00057-4
Boschetti, M. A., & Montaletti, L. (2010). An exact algorithm for the two-dimensional strip-packing problem. Operational Research, 58, 1774–1791.
Burke, E. K., Kendall, G., & Whitwell, G. (2004). A new placement heuristic for the orthogonal stock-cutting problem. Operational Research, 52(4), 655–671. https://doi.org/10.1287/opre.1040.0109
Chazelle, B. (1983). The bottom-left bin-packing heuristic: An efficient implementation. IEEE Transactions on Computers, 32(8), 697–707.
Christofides, N., & Whitlock, C. (1977). An algorithm for two-dimensional cutting problems. Operations Research, 25(1), 30–44. https://doi.org/10.1287/opre.25.1.30
Clautiaux, F., Carlier, J., & Moukrim, A. (2007). A new exact method for the two-dimensional orthogonal packing problem. European Journal of Operational Research, 183(3), 1196–1211.
Côtè, J. F., Dell‘Amico, M., & Iori, M. (2014). Combinatorial benders‘ cuts for the strip packing problem. Operations Research, 62(3), 643–661.
Even, G., Halldórsson, M. M., Kaplan, L., & Ron, D. (2009). Scheduling with conflicts: Online and offline algorithms. Journal of Scheduling, 12(2), 199–224. https://doi.org/10.1007/s10951-008-0089-1
Fekete, S. P., & Schepers, J. (2004). A combinatorial characterization of higher-dimensional orthogonal packing. Mathematics of Operations Research, 29(2), 353–368.
Garey, M. R., & Johnson, D. S. (1979). In W. H. Freeman & Co., (Eds.), Computers and Intractability. New York, NY, USA: A Guide to the Theory of NP-Completeness.
Grandcolas, S., & Pinto, C. (2015). A new search procedure for the two-dimensional orthogonal packing problem. Jounal of Mathematical Modelling Algorithms in OR, 14(3), 343–361. https://doi.org/10.1007/s10852-015-9278-z
Iori, M., Martello, S., & Monaci, M. (2003). Optimization and industry: New Frontiers, chap. Metaheuristic algorithms for the strip packing problem (pp. 159–179). US, Boston, MA: Springer. https://doi.org/10.1007/978-1-4613-0233-9_7
Korf, R., Moffitt, M., & Pollack, M. (2010). Optimal rectangle packing. Annals of Operations Research, 179, 261–295. https://doi.org/10.1007/s10479-008-0463-6
Lesh, N., Marks, J., McMahon, A., & Mitzenmacher, M. (2005). New heuristic and interactive approaches to 2d rectangular strip packing. Journal of Experimental Algorithmics. https://doi.org/10.1145/1064546.1083322
Leung, S. C. H., Zhang, D., & Sim, K. M. (2011). A two-stage intelligent search algorithm for the two-dimensional strip packing problem. European Journal of Operational Research, 215(1), 57–69. https://doi.org/10.1016/j.ejor.2011.06.002
Lodi, A., Martello, S., & Monaci, M. (2002). Two-dimensional packing problems: A survey. European Journal of Operational Research, 141(2), 241–252.
Martello, S., Monaci, M., & Vigo, D. (2003). An exact approach to the strip-packing problem. Journal on Computing, 15(3), 310–319.
Martello, S., Vigo, D. (1998) Exact solution of the two-dimensional finite bin packing problem. Management Science 44(3), 388–399 . http://www.jstor.org/stable/2634676
Neveu, B., Trombettoni, G., Araya, I., & Riff, M. (2008). A strip packing solving method using an incremental move based on maximal holes. International Journal on Artificial Intelligence Tools, 17(5), 881–901. https://doi.org/10.1142/S0218213008004205
Wei, L., Hu, Q., Leung, S. C., & Zhang, N. (2017). An improved skyline based heuristic for the 2d strip packing problem and its efficient implementation. Computers and Operations Research, 80, 113–127. https://doi.org/10.1016/j.cor.2016.11.024.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Grandcolas, S., Pain-Barre, C. A hybrid metaheuristic for the two-dimensional strip packing problem. Ann Oper Res 309, 79–102 (2022). https://doi.org/10.1007/s10479-021-04226-6
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-021-04226-6