Bin Packing Calculator

The bin packing problem is a classic optimization problem in computer science and operations research. It involves packing a set of items of different sizes into a minimum number of bins, each with a fixed capacity. The goal is to find an efficient packing arrangement that minimizes the number of bins used while ensuring that the total size of the items in each bin does not exceed its capacity. It is considered a challenging problem with practical applications in logistics, resource allocation, and scheduling.

There are many heuristics that follow the same simple scheme:

  1. Take the next item from the collection.
  2. If it is possible, put it into one of the currently open bins.
  3. Open a new bin otherwise.

The Next-Fit algorithm keeps only one bin open and the First-Fit algorithm keeps all bins open and considers them in the order in which they were opened.

1 X
20%
1 X
80%
1 X
40%
1 X
30%
1 X
70%
1 X
90%
1 X
60%