Abstract
In this paper, we introduce an additional constraint to the one-dimensional variable sized bin packing problem. Practically, some of items have to be packed separately in different bins due to their specific requirement. Therefore, these items are labelled as different types. The bins can be used to pack either any type of items if they are empty originally or the same type of items as what they already have. We model the problem as a type-constrained and variable sized bin packing problem (TVSBPP), and solve it via a branch and bound method. An efficient backtracking procedure is proposed to improve the efficiency of the algorithm.
Similar content being viewed by others
References
Alves, C., & Valerio de Carvalho, J. M. (2006). Accelerating column generation for variable sized bin-packing problems. European Journal of Operational Research, 183, 1333–1352.
Beasley, E. (1990). OR-library: distributing test problems by electronic mail. Journal of the Operational Research Society, 41, 1069–1072.
Chu, C., & La, R. (2001). Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms. SIAM Journal on Computing, 30(6), 2069–2083.
Falkenauer, E. (1996). A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics, 2, 5–30.
Friesen, D. K., & Langston, M. A. (1986). Variable Sized Bin Packing. SIAM Journal on Computing, 15, 222–230.
Martello, S., & Toth, P. (1990). Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Mathematics, 28, 59–70.
Martello, S., & Vigo, D. (1998). Exact solution of the two-dimensional finite bin packing problem. Management Science, 44, 388–399.
Monaci, M. (2002). Algorithms for packing and scheduling problems. PhD Thesis, Universita‘ di Bologna.
Murgolo, F. D. (1987). An efficient approximation scheme for variable-sized bin packing. SIAM Journal on Computing, 16, 149–161.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhou, C., Wu, C. & Feng, Y. An exact algorithm for the type-constrained and variable sized bin packing problem. Ann Oper Res 172, 193–202 (2009). https://doi.org/10.1007/s10479-009-0557-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-009-0557-9