A new destructive bounding scheme for the bin packing problem

In this paper, we present a new lower bounding scheme for the one-dimensional bin packing problem based on a destructive approach and we prove its effectiveness to solve hard instances. Performance comparison to other available lower bounds shows the effectiveness of our proposed lower bounds.

[1]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[2]  Gilbert Laporte,et al.  Capacitated Vehicle Routing on Trees , 1991, Oper. Res..

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

[4]  Mohamed Haouari,et al.  Fast lifting procedures for the bin packing problem , 2005, Discret. Optim..

[5]  Samir Elhedhli,et al.  Ranking lower bounds for the bin-packing problem , 2005, Eur. J. Oper. Res..

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

[7]  Fred W. Glover,et al.  A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem , 2004, J. Heuristics.

[8]  Marco A. Boschetti,et al.  The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds , 2003, 4OR.

[9]  Gerhard Wäscher,et al.  An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..

[10]  Teodor Gabriel Crainic,et al.  New bin packing fast lower bounds , 2007, Comput. Oper. Res..

[11]  Jean-Marie Bourjolly,et al.  An analysis of lower bound procedures for the bin packing problem , 2005, Comput. Oper. Res..

[12]  Teodor Gabriel Crainic,et al.  Computing the asymptotic worst-case of bin packing lower bounds , 2007, Eur. J. Oper. Res..

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

[14]  Jacques Carlier,et al.  New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation , 2007, Comput. Oper. Res..

[15]  Sándor P. Fekete,et al.  New classes of fast lower bounds for bin packing problems , 2001, Math. Program..

[16]  Bintong Chen,et al.  An Improved Lower Bound for the Bin Packing Problem , 1996, Discret. Appl. Math..

[17]  Gerhard Wäscher,et al.  The bin-packing problem: A problem generator and some numerical experiments with FFD packing and MTP , 1997 .

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

[19]  Mauro Dell'Amico,et al.  Optimal Scheduling of Tasks on Identical Parallel Processors , 1995, INFORMS J. Comput..

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