Given n items of different weights and bins each of capacity c, assign each item to a bin such that number of total used bins is minimized. It may be assumed that all items have weights smaller than bin capacity.

Example:

Input: wieght[] = {4, 8, 1, 4, 2, 1} Bin Capacity c = 10 Output: 2 We need minimum 2 bins to accommodate all items First bin contains {4, 4, 2} and second bin {8, 2} Input: wieght[] = {9, 8, 2, 2, 5, 4} Bin Capacity c = 10 Output: 4 We need minimum 4 bins to accommodate all items. Input: wieght[] = {2, 5, 4, 7, 1, 3, 8}; Bin Capacity c = 10 Output: 3

**Lower Bound**

We can always find a lower bound on minimum number of bins required. The lower bound can be given as :

Min no. of bins >= Ceil ((Total Weight) / (Bin Capacity))

In the above examples, lower bound for first example is “ceil(4 + 8 + 1 + 4 + 2 + 1)/10” = 2 and lower bound in second example is “ceil(9 + 8 + 2 + 2 + 5 + 4)/10” = 3.

This problem is a NP Hard problem and finding an exact minimum number of bins takes exponential time. Following are approximate algorithms for this problem.

**Applications**

- Loading of containers like trucks.
- Placing data on multiple disks.
- Job scheduling.
- Packing advertisements in fixed length radio/TV station breaks.
- Storing a large collection of music onto tapes/CD’s, etc.

**Online Algorithms**

These algorithms are for Bin Packing problems where items arrive one at a time (in unknown order), each must be put in a bin, before considering the next item.

**1. Next Fit:**

When processing next item, check if it fits in the same bin as the last item. Use a new bin only if it does not.

Below is C++ implementation for this algorithm.

`// C++ program to find number of bins required using ` `// next fit algorithm. ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Returns number of bins required using next fit ` `// online algorithm ` `int` `nextFit(` `int` `weight[], ` `int` `n, ` `int` `c) ` `{ ` ` ` `// Initialize result (Count of bins) and remaining ` ` ` `// capacity in current bin. ` ` ` `int` `res = 0, bin_rem = c; ` ` ` ` ` `// Place items one by one ` ` ` `for` `(` `int` `i=0; i<n; i++) ` ` ` `{ ` ` ` `// If this item can't fit in current bin ` ` ` `if` `(weight[i] > bin_rem) ` ` ` `{ ` ` ` `res++; ` `// Use a new bin ` ` ` `bin_rem = c - weight[i]; ` ` ` `} ` ` ` `else` ` ` `bin_rem -= weight[i]; ` ` ` `} ` ` ` `return` `res; ` `} ` ` ` `// Driver program ` `int` `main() ` `{ ` ` ` `int` `weight[] = {2, 5, 4, 7, 1, 3, 8}; ` ` ` `int` `c = 10; ` ` ` `int` `n = ` `sizeof` `(weight) / ` `sizeof` `(weight[0]); ` ` ` `cout << ` `"Number of bins required in Next Fit : "` ` ` `<< nextFit(weight, n, c); ` ` ` `return` `0; ` `}` |

*chevron_right*

*filter_none*

Output:

Number of bins required in Next Fit : 4

Next Fit is a simple algorithm. It requires only O(n) time and O(1) extra space to process n items.

Next Fit is 2 approximate, i.e., the number of bins used by this algorithm is bounded by twice of optimal. Consider any two adjacent bins. The sum of items in these two bins must be > c; otherwise, NextFit would have put all the items of second bin into the first. The same holds for all other bins. Thus, at most half the space is wasted, and so Next Fit uses at most 2M bins if M is optimal.

**2. First Fit:**

When processing the next item, see if it fits in the same bin as the last item. Start a new bin only if it does not.

`// C++ program to find number of bins required using ` `// First Fit algorithm. ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Returns number of bins required using first fit ` `// online algorithm ` `int` `firstFit(` `int` `weight[], ` `int` `n, ` `int` `c) ` `{ ` ` ` `// Initialize result (Count of bins) ` ` ` `int` `res = 0; ` ` ` ` ` `// Create an array to store remaining space in bins ` ` ` `// there can be at most n bins ` ` ` `int` `bin_rem[n]; ` ` ` ` ` `// Place items one by one ` ` ` `for` `(` `int` `i=0; i<n; i++) ` ` ` `{ ` ` ` `// Find the first bin that can accommodate ` ` ` `// weight[i] ` ` ` `int` `j; ` ` ` `for` `(j=0; j<res; j++) ` ` ` `{ ` ` ` `if` `(bin_rem[j] >= weight[i]) ` ` ` `{ ` ` ` `bin_rem[j] = bin_rem[j] - weight[i]; ` ` ` `break` `; ` ` ` `} ` ` ` `} ` ` ` ` ` `// If no bin could accommodate weight[i] ` ` ` `if` `(j==res) ` ` ` `{ ` ` ` `bin_rem[res] = c - weight[i]; ` ` ` `res++; ` ` ` `} ` ` ` `} ` ` ` `return` `res; ` `} ` ` ` `// Driver program ` `int` `main() ` `{ ` ` ` `int` `weight[] = {2, 5, 4, 7, 1, 3, 8}; ` ` ` `int` `c = 10; ` ` ` `int` `n = ` `sizeof` `(weight) / ` `sizeof` `(weight[0]); ` ` ` `cout << ` `"Number of bins required in First Fit : "` ` ` `<< firstFit(weight, n, c); ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

Output:

Number of bins required in First Fit : 4

The above implementation of First Fit requires O(n^{2}) time, but First Fit can be implemented in O(n Log n) time using Self-Balancing Binary Search Trees.

If M is the optimal number of bins, then First Fit never uses more than 1.7M bins. So First Fit is better than Next Fit in terms of upper bound on number of bins.

**3. Best Fit:**

The idea is to places the next item in the *tightest* spot. That is, put it in the bin so that smallest empty space is left.

`// C++ program to find number of bins required using ` `// Best fit algorithm. ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Returns number of bins required using best fit ` `// online algorithm ` `int` `bestFit(` `int` `weight[], ` `int` `n, ` `int` `c) ` `{ ` ` ` `// Initialize result (Count of bins) ` ` ` `int` `res = 0; ` ` ` ` ` `// Create an array to store remaining space in bins ` ` ` `// there can be at most n bins ` ` ` `int` `bin_rem[n]; ` ` ` ` ` `// Place items one by one ` ` ` `for` `(` `int` `i=0; i<n; i++) ` ` ` `{ ` ` ` `// Find the best bin that ca\n accomodate ` ` ` `// weight[i] ` ` ` `int` `j; ` ` ` ` ` `// Initialize minimum space left and index ` ` ` `// of best bin ` ` ` `int` `min = c+1, bi = 0; ` ` ` ` ` `for` `(j=0; j<res; j++) ` ` ` `{ ` ` ` `if` `(bin_rem[j] >= weight[i] && ` ` ` `bin_rem[j] - weight[i] < min) ` ` ` `{ ` ` ` `bi = j; ` ` ` `min = bin_rem[j] - weight[i]; ` ` ` `} ` ` ` `} ` ` ` ` ` `// If no bin could accommodate weight[i], ` ` ` `// create a new bin ` ` ` `if` `(min==c+1) ` ` ` `{ ` ` ` `bin_rem[res] = c - weight[i]; ` ` ` `res++; ` ` ` `} ` ` ` `else` `// Assign the item to best bin ` ` ` `bin_rem[bi] -= weight[i]; ` ` ` `} ` ` ` `return` `res; ` `} ` ` ` `// Driver program ` `int` `main() ` `{ ` ` ` `int` `weight[] = {2, 5, 4, 7, 1, 3, 8}; ` ` ` `int` `c = 10; ` ` ` `int` `n = ` `sizeof` `(weight) / ` `sizeof` `(weight[0]); ` ` ` `cout << ` `"Number of bins required in Best Fit : "` ` ` `<< bestFit(weight, n, c); ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

Output:

Number of bins required in Best Fit : 4

Best Fit can also be implemented in O(n Log n) time using Self-Balancing Binary Search Trees.

If M is the optimal number of bins, then Best Fit never uses more than 1.7M bins. So Best Fit is same as First Fit and better than Next Fit in terms of upper bound on number of bins.

**Offline Algorithms**

In the offline version, we have all items upfront. Unfortunately offline version is also NP Complete, but we have a better approximate algorithm for it. First Fit Decreasing uses at most (4M + 1)/3 bins if the optimal is M.

**4. First Fit Decreasing:**

A trouble with online algorithms is that packing large items is difficult, especially if they occur late in the sequence. We can circumvent this by *sorting* the input sequence, and placing the large items first. With sorting, we get First Fit Decreasing and Best Fit Decreasing, as offline analogs of online First Fit and Best Fit.

`// C++ program to find number of bins required using ` `// First Fit Decreasing algorithm. ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `/* Copy firstFit() from above */` ` ` `// Returns number of bins required using first fit ` `// decreasing offline algorithm ` `int` `firstFitDec(` `int` `weight[], ` `int` `n, ` `int` `c) ` `{ ` ` ` `// First sort all weights in decreasing order ` ` ` `sort(weight, weight+n, std::greater<` `int` `>()); ` ` ` ` ` `// Now call first fit for sorted items ` ` ` `return` `firstFit(weight, n, c); ` `} ` ` ` `// Driver program ` `int` `main() ` `{ ` ` ` `int` `weight[] = {2, 5, 4, 7, 1, 3, 8}; ` ` ` `int` `c = 10; ` ` ` `int` `n = ` `sizeof` `(weight) / ` `sizeof` `(weight[0]); ` ` ` `cout << ` `"Number of bins required in First Fit "` ` ` `<< ` `"Decreasing : "` `<< firstFitDec(weight, n, c); ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

Output:

Number of bins required in First Fit Decreasing : 3

First Fit decreasing produces the best result for the sample input because items are sorted first.

First Fit Decreasing can also be implemented in O(n Log n) time using Self-Balancing Binary Search Trees.

**Source:**

https://www.cs.ucsb.edu/~suri/cs130b/BinPacking.txt

This article is contributed by **Dheeraj Gupta**. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above

## Recommended Posts:

- Minimize Cost with Replacement with other allowed
- Minimize the maximum difference between the heights
- Minimize the sum of product of two arrays with permutations allowed
- Minimize the difference between minimum and maximum elements
- Minimize Cash Flow among a given set of friends who have borrowed money from each other
- Minimize the difference between the maximum and minimum values of the modified array
- Job Sequencing Problem | Set 2 (Using Disjoint Set)
- Fractional Knapsack Problem
- Water drop problem
- Shortest Superstring Problem
- Water Connection Problem
- Max Flow Problem Introduction
- Fitting Shelves Problem
- Job Sequencing Problem | Set 1 (Greedy Algorithm)
- Job Sequencing Problem - Loss Minimization