Abstract
We propose a new branch and bound algorithm for the two dimensional strip packing problem, in which a given set of rectangular pieces have to be packed into a strip of given width and infinite length so as to minimize the required height of the packing. We develop lower bounds based on integer formulations of relaxations of the problem as well as new bounds based on geometric considerations, and reduce the tree search with some dominance criteria. An extensive computational study shows the relative efficiency of the bounds and the good performance of the exact algorithm.
This is a preview of subscription content, log in via an institution to check access.
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
Beasley JE (1985) Algorithms for unconstrained two-dimensional guillotine cutting. J Oper Res Soc 36: 297–306
Beasley JE (1985) An exact two-dimensional non-guillotine cutting tree search procedure. Oper Res 33: 49–64
Bengtsson BE (1982) Packing rectangular pieces—a heuristic approach. Comput J 25: 353–357
Berkey JO, Wang PY (1987) Two dimensional finite bin packing algorithms. J Oper Res Soc 38: 423–429
Boschetti MA, Mingozzi A (2003) The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case, 4OR, vol 1, pp 27–42
Boschetti MA, Mingozzi A, Hadjiconstantinou E (2002) New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem. IMA J Manag Math 13: 95–119
Carlier J, Clautiaux F, Moukrim A (2007) New reduction procedures and lower bounds for the two dimensional bin packing problem with fixed orientation. Comput Oper Res 34: 2223–2250
Christofides N, Whitlock C (1977) An algorithm for two-dimensional cutting problems. Oper Res 25: 30–44
Fekete SP, Schepers J (2004) A general framework for bounds for higher-dimensional orthogonal packing problems. Math Methods Oper Res 60: 311–329
Fekete SP, Schepers J, Veen JC (2007) An exact algorithm for higher-dimensional orthogonal packing. Oper Res 55: 569–590
Hopper E, Turton CH (2001) An empirical investigation of metaheuristic and heuristic algorithms for a 2D packing problem. Eur J Oper Res 128: 34–57
Johnson DS (1973) Near-optimal bin packing algorithms. Ph.D. Thesis, Massachussets Institute of Technology
Lesh NB, Marks J, McMahon A, Mitzenmacher M (2004) Exhaustive approaches to 2D rectangular perfect packings. Inf Process Lett 90: 7–14
Lodi A, Martello S, Monaci M (2003) Two-dimensional packing problems: a survey. Eur J Oper Res 141: 241–252
Lueker GS (1983) Bin packing with items uniformly distributed over intervals [a,b]. In: Proc. 24th IEEE annu. found. comp. sci. (FOCS 83), pp 289–297
Martello S, Vigo D (1998) Exact solution of the two-dimensional finite bin packing problem. Manag Sci 44: 388–399
Martello S, Pisinger D, Vigo D (2000) The three dimensional bin packing problem. Oper Res 48: 256–267
Martello S, Monaci M, Vigo D (2003) An exact approach to the strip packing problem. INFORMS J Comput 15(3): 310–319
Wäscher G, Haussner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183: 1109–1130
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Alvarez-Valdes, R., Parreño, F. & Tamarit, J.M. A branch and bound algorithm for the strip packing problem. OR Spectrum 31, 431–459 (2009). https://doi.org/10.1007/s00291-008-0128-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00291-008-0128-5