A Hybrid Improvement Heuristic for the Bin Packing Problem

We propose in this work a hybrid improvement procedure for thebin packing problem, based on the progressive increase of the number of binsused by a possibly feasible solution. This heuristic has several features: theincorporation of lower bounding; the generation of initial solutions by referenceto the dual min-max problem; the use of load redistribution based ondominance, dierencing, and unbalancing; and the inclusion of an improvementprocess utilizing tabu search. Encouraging...