Glossary · approach
Bin Packing
The problem of placing objects of various sizes into fixed-capacity bins so as to minimize the number of bins used.
Bin Packing ProblemBPP
Bin packing is a classical OR problem: given a set of items (varying size, weight, volume), place them into fixed-capacity bins so that the total number of bins is minimized (the standard objective). The 1-dimensional variant (1D-BPP) — by weight or length only — has been studied extensively since Johnson (1974). The 2-dimensional (2D-BPP) variant arises in cutting and label placement. The 3-dimensional (3D-BPP) variant arises in pallet, container, and truck loading. Because it is NP-hard, practical solutions rely on heuristics (first-fit decreasing, best-fit, wall-building) and meta-heuristics (GRASP, tabu search, simulated annealing). The extension with practical side constraints is called the Container Loading Problem (CLP).
Örnek
An e-commerce warehouse needs to load 500 differently sized parcels into 40' containers. A 3D-BPP solver reduces container count by 15-25% vs. manual.