A Constraint for Bin Packing

We introduce a constraint for one-dimensional bin packing. This constraint uses propagation rules incorporating knapsack-based reasoning, as well as a lower bound on the number of bins needed. We show that this constraint can significantly reduce search on bin packing problems. We also demonstrate that when coupled with a standard bin packing search strategy, our constraint can be a competitive alternative to established operations research bin packing algorithms.

[1]  Armin Scholl,et al.  Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem , 1997, Comput. Oper. Res..

[2]  Emanuel Falkenauer,et al.  A hybrid grouping genetic algorithm for bin packing , 1996, J. Heuristics.

[3]  David S. Johnson,et al.  Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..

[4]  Ian P. Gent.  Heuristic Solution of Open Bin Packing Problems , 1998, J. Heuristics.

[5]  José M. Valério de Carvalho,et al.  Exact solution of bin-packing problems using column generation and branch-and-bound , 1999, Ann. Oper. Res..

[6]  Edward G. Coffman,et al.  Approximation algorithms for bin packing: a survey , 1996 .

[7]  Paolo Toth,et al.  Lower bounds and reduction procedures for the bin packing problem , 1990, Discret. Appl. Math..

[8]  Richard E. Korf,et al.  A new algorithm for optimal bin packing , 2002, AAAI/IAAI.

[9]  Hans Kellerer,et al.  Knapsack problems , 2004 .

[10]  D. K. Friesen,et al.  Variable Sized Bin Packing , 1986, SIAM J. Comput..

[11]  Michael A. Trick.  A Dynamic Programming Approach for Consistency and Propagation for Knapsack Constraints , 2003, Ann. Oper. Res..

[12]  Jean-Charles Régin,et al.  A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.

[13]  Toby Walsh,et al.  From Approximate to Optimal Solutions: Constructing Pruning and Propagation Rules , 1997, IJCAI.

[14]  Richard E. Korf.  An Improved Algorithm for Optimal Bin Packing , 2003, IJCAI.

[15]  Meinolf Sellmann.  Approximated Consistency for Knapsack Constraints , 2003, CP.