Bin Packing Problem
Bin Packing Problem is a problem to pack given items into as few boxes as possible. The size of the each items can be different and the size of all boxes are same constant. This problem is to consider the combination of items to pack minimum number of boxes.
For detail, refer to Wikipedia "Bin packing problem".
ApplicationBin Packing Problem can be applied to the following problems.
- If we make a various parts out of stick materials, we can get the combination of the parts to minimize the number of consumed materials.
- If we transport loads by trucks whose maximum load are limited, we can get the combination of loads to minimize times of round trip.