Bin-Completion Algorithms for Multicontainer Packing and Covering Problems

Bin-completion, a bin-oriented branch-and-bound approach, was recently shown to be promising for the bin packing problem. We propose several improvements to bin-completion that significantly improves search efficiency. We also show the generality of bin-completion for packing and covering problems involving multiple containers, and present bin-completion algorithms for the multiple knapsack, bin covering, and min-cost covering (liquid loading) problems that significantly outperform the previous state of the art. However, we show that for the bin packing problem, bin-completion is not competitive with the state of the art solver.

[1]  David Pisinger.  An exact algorithm for large multiple knapsack problems , 1999, Eur. J. Oper. Res..

[2]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[3]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

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

[5]  Joseph Y.-T. Leung,et al.  On a Dual Version of the One-Dimensional Bin Packing Problem , 1984, J. Algorithms.

[6]  Michela Milano,et al.  Global Cut Framework for Removing Symmetries , 2001, CP.

[7]  Meinolf Sellmann,et al.  Symmetry Breaking , 2001, CP.

[8]  Gleb Belov,et al.  A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting , 2006, Eur. J. Oper. Res..

[9]  Gerhard Wäscher,et al.  Heuristics for the integer one-dimensional cutting stock problem: A computational study , 1996 .

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

[11]  Bart Selman,et al.  Boosting Combinatorial Search Through Randomization , 1998, AAAI/IAAI.

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

[13]  José M. Valério de Carvalho,et al.  LP models for bin packing and cutting stock problems , 2002, Eur. J. Oper. Res..

[14]  Gilbert Laporte,et al.  An exact algorithm for the dual bin packing problem , 1995, Oper. Res. Lett..

[15]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[16]  R. Lathe.  Phd by thesis , 1988, Nature.

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

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .