mozaw39 / bin-packing

An algorithm that helps solve bin-packing problem, using heuristic algorithms, this projects consists of two branches, one for two dimensions problem and the other one for 3D case

bin-packing

"In the bin packing problem, items of different volumes must be packed into a finite number of bins or containers each of a fixed given volume in a way that minimizes the number of bins used. In computational complexity theory, it is a combinatorial NP-hard problem. The decision problem is NP-complete." Wikipedia

The used Algorithm

"First-Fit is an AF-algorithm that processes the items in a given arbitrary order L. For each item in L, it attempts to place the item in the first bin that can accommodate the item. If no bin is found, it opens a new bin and puts the item within the new bin." Wikipedia
The approach used here is called First-Fit-Decreasing, that is we sort the items that we have in a decreasing order(comparing the length).

Class Diagram

Explication of classes in the real world