A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem

@article{Alvim2004AHI,
  title={A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem},
  author={Adriana C. F. Alvim and Celso C. Ribeiro and Fred Glover and Dario J. Aloise},
  journal={J. Heuristics},
  year={2004},
  volume={10},
  pages={205-229}
}
We propose in this work a hybrid improvement procedure for the bin packing problem. This heuristic has several features: the use of lower bounding strategies; the generation of initial solutions by reference to the dual min-max problem; the use of load redistribution based on dominance, differencing, and unbalancing; and the inclusion of an improvement process utilizing tabu search. Encouraging results have been obtained for a very wide range of benchmark instances, illustrating the robustness… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 70 CITATIONS

FILTER CITATIONS BY YEAR

2003
2018

CITATION STATISTICS

  • 14 Highly Influenced Citations

  • Averaged 5 Citations per year over the last 3 years

References

Publications referenced by this paper.
SHOWING 1-10 OF 32 REFERENCES

Exact solution of bin-packing problems using column generation and branch-and-bound

  • J. M. Valério de Carvalho
  • Annals of Operations Research
  • 1999
Highly Influential
7 Excerpts

Fast

  • J. E. Schoenfield
  • exact solution of open bin packing problems…
  • 2002
1 Excerpt

Similar Papers

Loading similar papers…