A self organizing bin packing heuristic

Janos Csirik, David S. Johnson, Claire Kenyon, Peter W. Shor, Richard R. Weber

Research output: Conference contribution

15 Citations (Scopus)

Abstract

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√n), or O(1), Our new Sum of Squares algorithm (SS) appears to have roughly the same expected behavior in all three cases. This claim is experimentally evaluated using a newly-discovered, linear-programming-based algorithm that determines the optimal expected waste rate for any given discrete distribution in pseudopolynomial time (the best one can hope for given that the basic problem is NP-hard). Although SS appears to be essentially optimal when the expected optimal waste rate is sublinear, it is less impressive when the expected optimal waste rate is linear. The expected ratio of the number of bins used by SS to the optimal number appears to go to 1 asymptotically in the first case, whereas there are distributions for which it can be as high as 1.5 in the second. However, by modifying the algorithm slightly, using a single parameter that is tunable to the distribution in question (either by advanced knowledge or by on-line learning), we appear to be able to make the ratio go to 1 in all cases.

Original languageEnglish
Title of host publicationAlgorithm Engineering and Experimentation - International Workshop, ALENEX 1999, Selected Papers
EditorsCatherine C. McGeoch, Catherine C. McGeoch, Michael T. Goodrich, Catherine C. McGeoch, Michael T. Goodrich, Michael T. Goodrich
PublisherSpringer Verlag
Pages245-265
Number of pages21
ISBN (Print)3540662278, 3540662278, 3540662278, 9783540662273, 9783540662273, 9783540662273
Publication statusPublished - jan. 1 1999
EventInternational Workshop on Algorithm Engineering and Experimentation, ALENEX 1999 - Baltimore, United States
Duration: jan. 15 1999jan. 16 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1619
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherInternational Workshop on Algorithm Engineering and Experimentation, ALENEX 1999
CountryUnited States
CityBaltimore
Period1/15/991/16/99

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'A self organizing bin packing heuristic'. Together they form a unique fingerprint.

  • Cite this

    Csirik, J., Johnson, D. S., Kenyon, C., Shor, P. W., & Weber, R. R. (1999). A self organizing bin packing heuristic. In C. C. McGeoch, C. C. McGeoch, M. T. Goodrich, C. C. McGeoch, M. T. Goodrich, & M. T. Goodrich (Eds.), Algorithm Engineering and Experimentation - International Workshop, ALENEX 1999, Selected Papers (pp. 245-265). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1619). Springer Verlag.