A Hybrid Improvement Heuristic for the Bin Packing Problem

bins without violating thecapacity constraints. The bin packing problem is NP-hard, see [5].We propose an improvement procedure for the bin packing problem, based on progressively increas-ing the number of bins used by a possibly feasible solution. The basic structure of this procedure is thefollowing:

[1]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

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

[3]  Richard M. Karp,et al.  The Differencing Method of Set Partitioning , 1983 .

[4]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

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

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

[7]  Michel Gendreau,et al.  A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective , 1994, Comput. Oper. Res..

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

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

[10]  Thomas A. Feo,et al.  Randomized methods for the number partitioning problem , 1996, Comput. Oper. Res..

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

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

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

[14]  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..

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

[16]  Krzysztof Fleszar,et al.  New heuristics for one-dimensional bin-packing , 2002, Comput. Oper. Res..

[17]  Manuel Laguna,et al.  Tabu Search , 1997 .