One-dimensional bin packing is useful for applications that minimize use of space and/ or time. The goal is to pack objects into the minimum number of fixed-size bins.
I enjoyed how a cute little application by local talent gave a nice visual comparison of bin packing algorithms. Icon, developed at Arizona State University says this about bin packing:
It is a hard problem for which many different heuristic solutions have been proposed.
Icon is nothing special, I was told. But I liked it, and it is very colorful, and good for making comparisons!
The First Fit algorithm places a new object in the leftmost bin that still has room. First fit packing requires 48 bins.
The Worst Fit algorithm places a new object in the emptiest existing bin, and requires 56 bins.
Sorting the objects in descending order THEN packing the largest ones first gives the best results of all, with 45 bins.