Abstract
The three-dimensional multiple-bin-size bin packing problem (MBSBPP) is the problem of packing a set of boxes into a set of bins when several types of bins of different sizes and costs are available and the objective is to minimize the total cost of the bins used for packing the boxes. We present a study of lower bounds for this packing problem. We have developed new bounds based on integer programming formulations of some relaxations of the original problem. These formulations are enhanced with logical considerations. The proposed bounds are compared with other existing bounds in an extensive computational study, including two- and three-dimensional instances with up to 100 boxes, some of them taken from the literature and others adapted from the classical Bin Packing Problem. The proposed bounds improve the results of previous bounds by more than 10%, though at a higher computational cost.
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 (2012) A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems. Comput Oper Res. doi:10.1016/j.cor.2012.03.016
Alves C, Valerio de Carvalho JM (2008) A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem. Comput Oper Res 35:1315–1328
Beasley JE (1990) OR-library: distributing test problems by electronic mail. J Oper Res Soc 41:1069–1072
Berkey JO, Wang PY (1987) Two dimensional finite bin packing algorithms. J Oper Res Soc 38:423–429
Boschetti M, Mingozzi A (2003) Two-dimensional finite bin packing problems. Part I: New lower and upper bounds, 4OR 1:27–42
Brunetta L, Gregoire P (2005) A general purpose algorithm for three-dimensional packing. INFORMS J Comput 17(3):328–338
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(8):2223–2250
Chen CS, Lee SM, Shen QS (1995) Analytical model for the container loading problem. Eur J Oper Res 80(1):68–76
Cintra GF, Miyazawa FK, Wakabayashi Y, Xavier EC (2008) Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. Eur J Oper Res 191:61–85
Correia I, Gouveia L, Saldanha-da-Gama F (2008) Solving the variable size bin packing problem with discretized formulations. Comput Oper Res 35(6):2103–2113
Crainic TG, Perboli G, Rei W, Tadei R (2011) Efficient lower bounds and heuristics for the variable cost and size bin packing problem. Comput Oper Res. doi:10.1016/j.cor.2011.01.001
Epstein L, Van Stee R (2004) On variable-sized multidimensional packing. Lect Notes Artif Intell Lect Notes Bioinform 3221:287–298
Epstein L, Levin A (2008) An APTAS for generalized cost variable sized bin packing. SIAM J Comput 38(1):411–428
Ertek G, Kilic K (2006) Decision support for packing in warehouses. Lect Notes Comput Sci 4263:115–124
Fekete SP, Schepers J (2001) New classes of fast lower bounds for bin packing problems. Math Program Ser A 91:1131
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, van der Veen J (2007) An exact algorithm for higher-dimensional orthogonal packing. Oper Res 55:569–587
Friesen DK, Langston MA (1986) Variable sized bin packing. SIAM J Comput 15:222–230
Furini F, Malaguti E, Medina R, Persiani A, Toth P (2012) A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size. Eur J Oper Res 218:251–260
Gilmore PC, Gomory RE (1961) A linear programming approach to the cutting stock problem. Oper Res 9:849–859
Gilmore PC, Gomory RE (1963) A linear programming approach to the cutting stock problem—part II. Oper Res 13:94–119
Hopper E, Turton CH (2002) An empirical study of meta-Heuristics applied to 2D rectangular bin packing. Studia Informatica 2(1):77–92
Martello S, Monaci M, Vigo D (2003) An exact approach to the strip packing problem. INFORMS J Comput 15(3):310–319
Martello S, Pisinger D, Vigo D (2000) The three-dimensional bin packing problem. Oper Res 40:256–267
Martello S, Vigo D (1998) Exact solution of the two-dimensional finite bin packing problem. Manag Sci 44(1):388–399
Monaci M (2002) Algorithms for packing and scheduling problems. PhD Thesis, University of Bologna
Ortmann FG, Ntene N, van Vuuren JH (2010) New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems. Eur J Oper Res 203(2):306–335
Pisinger D, Sigurd M (2005) The two-dimensional bin packing problem with variable bin sizes and costs. Discrete Optim 2(2):154–167
Seiden SS, van Stee R (2003) New bounds for multidimensional packing. Algorithmica 36(3):261–293
Wäscher G, Haussner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183(3):1109–1130
Wu Y, Li W, Goh M, de Souza R (2010) Three-dimensional bin packing problem with variable bin height. Eur J Oper Res 202(2):347–355
Acknowledgments
This study has been partially supported by the Spanish Ministry of Science and Technology, DPI2008-02700 and DPI2011-24977, cofinanced by FEDER funds, by Generalitat Valenciana, PROMETEO/2013/049, and by Project PII2I09-0073-4576, Consejeria de Educacion y Ciencia, Junta de Comunidades de Castilla-La Mancha. We would also like to thank the anonymous referees for their helpful comments and suggestions.
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. Lower bounds for three-dimensional multiple-bin-size bin packing problems. OR Spectrum 37, 49–74 (2015). https://doi.org/10.1007/s00291-013-0347-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00291-013-0347-2