A Self Organizing Bin Packing Heuristic

  title={A Self Organizing Bin Packing Heuristic},
  author={J{\'a}nos A. Csirik and David S. Johnson and Claire Mathieu and Peter W. Shor and Richard R. Weber},
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… 

Better approximation algorithms for bin covering

This work designs algorithms that have bounded worst-case behavior for instances with discrete item sizes and expected behavior that is asymptotically optimal for all discrete “perfect-packing distributions” (ones for which optimal packings have sublinear expected waste).

An All-Around Near-Optimal Solution for the Classic Bin Packing Problem

The first algorithm with optimal average-case and close-to-best known worst-case performance for the classic on-line problem of bin packing is presented and extensive experimental evaluation of the studied bin packing algorithms shows that the proposed algorithms have comparable average- case performance with Best Fit and First Fit, and this holds also for sequences that follow distributions other than the uniform distribution.

Online Stochastic Bin Packing

Two distribution-agnostic bin packing heuristics are presented that achieve additive O(sqrt{n}) waste compared to OPT for all distributions and the Best Fit heuristic is briefly revisited.

Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings

The perfect packing theorem needed for the U{j,k} distributions is an intriguing result of independent combinatorial interest, and its proof is a cornerstone of the paper.

Better-Fit Heuristic for One-Dimensional Bin-Packing Problem

This paper reports a study on better-fit heuristic for classical bin-packing problem, proposed in [1]. Better-fit replaces an existing object from a bin with the next object in the list, if it can

Sum-of-squares heuristics for bin packing and memory allocation

These experiments suggest that in both real and synthetic traces, SS does not seem to have an asymptotic advantage over Best Fit, in contrast with the bin-packing problem, and applies SS to the online memory-allocation problem.

Interior-Point Based Online Stochastic Bin Packing

A family of algorithms is proposed which are the first truly distribution-­oblivious algorithms for stochastic bin packing, and achieve ​O(√T) additive suboptimality for all item size distributions.

A sublinear-time approximation scheme for bin packing

Average Case Analysis of Bounded Space Bin Packing Algorithms

The one-dimensional bin packing problem is considered and a Markov chains method is presented which is general enough to calculate results for any i.i.d. discrete item size distribution.

Lagrangian-based Online Stochastic Bin Packing

This work presents the first truly distribution-oblivious bin packing heuristic that achieves O(√n) regret compared to OPT for all distributions in the setting with permanent items, and proves guarantees of the heuristic against non i.i.d. input.



Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings

The perfect packing theorem needed for the U{j,k} distributions is an intriguing result of independent combinatorial interest, and its proof is a cornerstone of the paper.

The average-case analysis of some on-line algorithms for bin packing

In this paper we give tighter bounds than were previously known for the performance of the bin packing algorithms Best Fit and First Fit when the inputs are uniformly distributed on [0, 1]. We also


A necessary and sufficient condition for this goal to be realized is presented and an algorithm to achieve it is described, which is needed to manage the packing of readily available items into bins according to random processes.

Fundamental discrepancies between average-case analyses under discrete and continuous distributions: a bin packing case study

We consider the average case behavior of onedmensional bin paekmg algorithms in the case where bins have unit capacity and item sizes are chosen according to the ‘ ‘dficrete uniform” distribution U~;

Markov chains, computer proofs, and average-case analysis of best fit bin packing

A computer-aided approach to the analysis of higher-dimensional domains, using several open problems about the average-case behavior of the Best Fit bin packing algorithm as case studies and answering yes to the long-standing open question of whether there exist distributions of thii form for which Best Fit yields linearly-growing waste.

Biased random walks, Lyapunov functions, and stochastic analysis of best fit bin packing

We study the average case performance of the Best Fit algorithm for on-line bin packing under the distribution U{j, k}, in which the item sizes are uniformly distributed in the discrete range { l/lc,

Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms

The minimax grid matching problem is a fundamental combinatorial problem associated with the average case analysis of algorithms that is best known for its application to the maximum up-right matching problem.

The Art in Computer Programming

Here the authors haven’t even started the project yet, and already they’re forced to answer many questions: what will this thing be named, what directory will it be in, what type of module is it, how should it be compiled, and so on.

Probabilistic analysis of packing and partitioning algorithms

Bin Packing: Heuristics, Scheduling and Partitioning, and Packings in Two Dimensions.

On Line Bin Packing with Items of Random Size

It is proved the existence of an on line algorithm, dependent on µ, that packs X1, ', Xn in ncµ + On1/2log n3/4 bins.