Skip to main content
SpringerLink
Log in

An exact algorithm for the type-constrained and variable sized bin packing problem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

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.

    Article  Google Scholar 

  • Beasley, E. (1990). OR-library: distributing test problems by electronic mail. Journal of the Operational Research Society, 41, 1069–1072.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Falkenauer, E. (1996). A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics, 2, 5–30.

    Article  Google Scholar 

  • Friesen, D. K., & Langston, M. A. (1986). Variable Sized Bin Packing. SIAM Journal on Computing, 15, 222–230.

    Article  Google Scholar 

  • Martello, S., & Toth, P. (1990). Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Mathematics, 28, 59–70.

    Article  Google Scholar 

  • Martello, S., & Vigo, D. (1998). Exact solution of the two-dimensional finite bin packing problem. Management Science, 44, 388–399.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Antai College of Economics and Management, Jiao Tong University, Shanghai, 200052, China

    Chunyang Zhou, Chongfeng Wu & Yun Feng

Authors
  1. Chunyang Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chongfeng Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yun Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chunyang Zhou.

Rights and permissions

Reprints 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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-009-0557-9

Keywords

Search

Navigation