Abstract
In this paper we consider a variation of the bin packing problem in which bins of different types have different costs and capacities. Furthermore, each bin has to be filled at least to a certain level, which depends on its type. We present a set partitioning formulation and an exact optimization algorithm which exploits column generation and specialized heuristics. We compare our algorithm with the general purpose solver ILOG CPLEX, running on two compact ILP formulations and we report on experimental results on instances we have generated from data-sets for the variable size bin packing problem.
Similar content being viewed by others
References
Achterberg, T. (2004). SCIP—a framework to integrate constraint and mixed integer programming (ZIB report 04-19). Berlin.
Alves, C., & Valerio de Carvalho, J. M. (2007). Accelerating column generation for variable sized bin-packing problems. European Journal of Operational Research, 183, 1333–1352.
Alves, C., & Valerio de Carvalho, J. M. (2008). A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem. Computers and Operations Research, 35, 1315–1328.
Belov, G., & Scheithauer, G. (2002). A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. European Journal of Operational Research, 141, 274–294.
Brønmo, G., Christiansen, M., & Nygreen, B. (2007a). Ship scheduling with flexible Cargo sizes. Journal of the Operational Research Society, 58, 1167–1177.
Brønmo, G., Nygreen, B., & Lysgaard, J. (2007b). Approximate column generation for some ship scheduling problems. In Proc. TRISTAN VI. Phuket Island, Thailand.
Cappanera, P., & Trubian, M. (2005). A local search based heuristic for the demand constrained multidimensional knapsack problem. INFORMS Journal on Computing, 17, 82–98.
Chu, C., & La, R. (2001). Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms. SIAM Journal on Computing, 30, 2069–2083.
Correia, I., Gouveia, L., & Saldanha da Gama, F. (2008). Solving the variable size bin packing problem with discretized formulations. Computers and Operations Research, 35, 2103–2113.
Friesen, D. K., & Langston, M. A. (1986). Variable sized bin packing. SIAM Journal on Computing, 15, 222–230.
Gouveia, L. (1995). A 2n constraint formulation for the capacitated minimal spanning tree problem. Operations Research, 43, 130–141.
Grønhaug, R., Christiansen, M., Desaulniers, G., & Desrosiers, J. (2007). Inventory routing problem for the LNG business. In Proc. TRISTAN VI. Phuket Island, Thailand.
Kang, J., & Park, S. (2003). Algorithms for the variable sized bin packing problem. European Journal of Operational Research, 147, 365–372.
Lodi, A., Martello, S., & Vigo, D. (2004). Models and bounds for two dimensional packing problems. Journal of Combinatorial Optimization, 8, 363–379.
Martello, S., & Toth, P. (1990). Knapsack problems: Algorithms and computer implementations. New York: Wiley (Available online).
Monaci, M. (2002). Algorithms for packing and scheduling problems. PhD thesis OR/02/4, DEIS, Università di Bologna.
Murgolo, F. D. (1988). An efficient approximation scheme for variable-sized bin packing. SIAM Journal on Computing, 21, 229–243.
Pisinger, D. (2000). A minimal algorithm for the bounded knapsack problem. INFORMS Journal on Computing, 34, 75–84.
Ryan, D. M., & Foster, B. A. (1981). An integer programming approach to scheduling. In A. Wren (Ed.), Computer scheduling of public transport urban passenger vehicle and crew scheduling. Amsterdam: North-Holland.
Valerio de Carvalho, J. M. (2005). Using extra dual cuts to accelerate column generation. INFORMS Journal on Computing, 17(2), 175–182.
Walkowiak, R. (2005). Shipment cost optimization. In European chapter on combinatorial optimization XVIII. Minsk.
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 variable size bin packing problem with minimum filling constraint. Ann Oper Res 179, 221–241 (2010). https://doi.org/10.1007/s10479-008-0452-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-008-0452-9