Abstract
The two-dimensional level strip packing problem (2LSPP) consists in packing rectangular items of given size into a strip of given width divided into levels. Items packed into the same level cannot be put on top of one another and their overall width cannot exceed the width of the strip. The objective is to accommodate all the items while minimizing the overall height of the strip. The problem is \({{\mathcal{NP}}}\) -hard and arises from applications in logistics and transportation. We present a set covering formulation of the 2LSPP suitable for a column generation approach, where each column corresponds to a feasible combination of items inserted into the same level. For the exact optimization of the 2LSPP we present a branch-and-price algorithm, in which the pricing problem is a penalized knapsack problem. Computational results are reported for benchmark instances with some hundreds items.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Berkey JO and Wang PY (1987). Two-dimensional finite bin-packing algorithms. J Oper Res Soc 38: 423–429
Bettinelli A, Ceselli A (2007) Experimental evaluation of a branch-and-price algorithm for the bi-dimensional level strip packing problem. Technical report n. 103, Dipartimento di Tecnologie dell’Informazione, Università degli Studi di Milano
Ceselli A (2003). Two exact algorithms for the capacitated p-median problem. 4OR 1(4): 319–340
Ceselli A and Righini G (2006). An optimization algorithm for a penalized knapsack problem. Oper Res Lett 34(4): 394–404
Desaulniers G, Desrosiers J and Solomon MM (eds) (2005). Column Generation. Springer, Heidelberg
Dickhoff H, Scheithauer G and Terno J (1997). Cutting and packing. Wiley, New York, 393–413
Fekete SP, Schepers J (1997) On higher-dimensional packing iii: Exact algorithms. Technical Report 97–290
Fekete SP and Schepers J (2004). A combinatorial characterization of higher-dimensional orthogonal packing. Math Oper Res 29: 353–368
Fekete SP and Schepers J (2004). A general framework for bounds for higher-dimensional orthogonal packing problems. Math Methods Oper Res 60(2): 311–329
Garey MR and Johnson DS (1979). Computers and Intractability: a guide to the theory of NP-completeness. WH Freeman, New York
Kenyon C and Rémila E (2000). A near-optimal solution to a two-dimensional cutting stock problem. Math Oper Res 25: 645–656
Lodi A, Martello S and Monaci M (2002). Two-dimensional packing problems: a survey. Eur J Oper Res 141: 241–252
Lodi A, Martello S and Vigo D (2002). Recent advances on two-dimensional bin packing problems. Discrete Appl Math 123: 379–396
Lodi A, Martello S and Vigo D (2004). Models and bounds for two dimensional packing problems. J Comb Optim 8: 363–379
Martello S, Monaci M and Vigo D (2003). An exact approach to the strip-packing problem. INFORMS J Comput 15: 310–319
Martello S, Pisinger D and Toth P (1999). Dynamic programming and strong bounds for the 0–1 knapsack problem. Manage Sci 45(3): 414–424
Martello S and Toth P (1990). Knapsack problems: Algorithms and computer implementations. Wiley, New York
Martello S, Toth P (2007) Online version of the book “knapsack problems”: http://www.or.deis.unibo.it/knapsack.html. Last accessed 10/05/2007
Martin RK (1998). Large scale linear and integer optimization. Kluwer, Dordrecth
Pisinger D (1997). A minimal algorithm for the 0–1 knapsack problem. Oper Res 45: 758–767
Pisinger D (2007) Homepage: www.diku.dk/~pisinger/. Last accessed 10/05/2007
Wäscher G, Haussner H, Schumann H (2006) An improved typology of cutting and packing problems. Eur J Oper Res, forthcoming, 2006
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bettinelli, A., Ceselli, A. & Righini, G. A branch-and-price algorithm for the two-dimensional level strip packing problem. 4OR 6, 361–374 (2008). https://doi.org/10.1007/s10288-007-0051-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-007-0051-7