Abstract
We consider two-dimensional bin packing and strip packing problems where the items have to be packed by levels. We introduce new mathematical models involving a polynomial number of variables and constraints, and show that their LP relaxations dominate the standard area relaxations. We then propose new (combinatorial) bounds that can be computed in O(nlog n) time. We show that they dominate the other bounds, and establish their absolute worst-case behavior. The quality of models and bounds is evaluated through extensive computational experiments.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
B.S. Baker and J.S. Schwarz, “Shelf algorithms for two-dimensional packing problems,” SIAM Journal on Computing, vol. 12, pp. 508–525, 1983.
J.E. Beasley, “An exact two-dimensional non-guillotine cutting tree search procedure,” Operations Research, vol. 33, pp. 49–64, 1985.
J.O. Berkey and P.Y.Wang, “Two dimensional finite bin packing algorithms,” Journal of the Operational Research Society, vol. 38, pp. 423–429, 1987.
C.S. Chen, S.M. Lee, and Q.S. Shen, “An analytical model for the container loading problem,” European Journal of Operational Research, vol. 80, pp. 68–76, 1995.
F.K.R. Chung, M.R. Garey, and D.S. Johnson, “On packing two-dimensional bins,” SIAM Journal of Algebraic and Discrete Methods, vol. 3, pp. 66–76, 1982.
E.G. Coffman, Jr., M.R. Garey, D.S. Johnson, and R.E. Tarjan, “Performance bounds for level-oriented twodimensional packing algorithms,” SIAM Journal on Computing, vol. 9, pp. 801–826, 1980.
K. Daniels, V.J. Milenkovic, and Z. Li, “Multiple containement methods,” Technical Report 12-94, Center for Research in Computing Technology, Division of Applied Sciences, Harvard University, 1994.
J.M.V. de Carvalho and A.J.G. Rodrigues, “A computer based interactive approach to a two-stage cutting stock problem,” INFOR, vol. 32, pp. 243–252, 1994.
J.M.V. de Carvalho and A.J.G. Rodrigues, “A LP-based approach to a two-stage cutting stock problem,” European Journal of Operational Research, vol. 84, pp. 580–589, 1995.
H. Dyckhoff, G. Scheithauer, and J. Terno, “Cutting and Packing (C&P),” in Annotated Bibliographies in Combinatorial Optimization, M. Dell'Amico, F. Maffioli, and S. Martello (Eds.), John Wiley & Sons: Chichester, 1997, pp. 393–413.
J.B. Frenk and G.G. Galambos, “Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem,” Computing, vol. 39, pp. 201–217, 1987.
P.C. Gilmore and R.E. Gomory, “Multistage cutting problems of two and more dimensions,” Operations Research, vol. 13, pp. 94–119, 1965.
E. Hadjiconstantinou and N. Christofides, “An exact algorithm for the orthogonal, 2-D cutting problems using guillotine cuts,” European Journal of Operational Research, vol. 83, pp. 21–38, 1995.
M. Hifi, “Contribution á la résolution de quelques problèmes difficiles de l'optimization combinatoire,” Habilitation thesis, PRiSM, Universitè de Versailles St-Quentin en Yvelines, 1999.
A. Lodi, S. Martello, and D. Vigo, “Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems,” INFORMS Journal on Computing, vol. 11, pp. 345–357, 1999.
A. Lodi, S. Martello, and D. Vigo, “Recent advances on two-dimensional bin packing problems,” Discrete Applied Mathematics, vol. 123, pp. 379–396, 2002.
S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations, John Wiley & Sons: Chichester, 1990a.
S. Martello and P. Toth, “Lower bounds and reduction procedures for the bin packing problem,” Discrete Applied Mathematics, vol. 28, pp. 59–70, 1990b.
S. Martello and D.Vigo, “Exact solution of the two-dimensional finite bin packing problem,” Management Science, vol. 44, pp. 388–399, 1998.
H. Onodera, Y.Taniguchi, and K.Tamaru, “Branch-and-bound placement for building block layout,” in Proceedings of the 28th ACM/IEEE Design Automation Conference, 1991, pp.433–439.
F. Vanderbeck, “Anested decomposition approach to a 3-stage 2-dimensional cutting stock problem,” Management Science, vol. 47, pp. 864–879, 2001.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lodi, A., Martello, S. & Vigo, D. Models and Bounds for Two-Dimensional Level Packing Problems. Journal of Combinatorial Optimization 8, 363–379 (2004). https://doi.org/10.1023/B:JOCO.0000038915.62826.79
Issue Date:
DOI: https://doi.org/10.1023/B:JOCO.0000038915.62826.79