A Self Organizing Bin Packing Heuristic

@inproceedings{Csirik1999ASO,
  title={A Self Organizing Bin Packing Heuristic},
  author={J{\'a}nos Csirik and David S. Johnson and Claire Mathieu and Peter W. Shor and Roger Weber},
  booktitle={ALENEX},
  year={1999}
}
This paper reports on experiments with a new on-line heuristic for one-dimensional bin packing whose average-case behavior is surprisingly robust. We restrict attention to the class of "discrete" distributions, i.e., ones in which the set of possible item sizes is finite (as is commonly the case in practical applications), and in which all sizes and probabilities are rational. It is known from [7] that for any such distribution the optimal expected waste grows either as Θ(n), Θ(√n), or O(1… CONTINUE READING

Citations

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

A deterministic harvest scheduler using perfect bin-packing theorem

  • European Journal of Forest Research
  • 2010
VIEW 4 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

A Lifelong Learning Hyper-heuristic Method for Bin Packing

  • Evolutionary Computation
  • 2015
VIEW 1 EXCERPT
CITES METHODS

References

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

Markov chains, computer proofs, and best t bin packing

E. G. Co man, Jr., D. S. Johnson, P. W. Shor, R. R. Weber
  • In Proceedings of the 25th ACM Sym posium on the Theory of Computing,
  • 1993
VIEW 1 EXCERPT

Probabilistic Analysis of Packing and Parti tioning Algorithms

E. G. Co man, Jr., G. S. Lueker
  • 1991
VIEW 1 EXCERPT

The Art of Computer Programming, Volume 2: Seminumerical Al gorithms

D. E. Knuth
  • 2nd Edition, Addison-Wesley, Reading, MA,
  • 1981