An implementation of the 3D (actually 4D) bin packing/knapsack problem (aka creating parcels by putting items into boxes)

Fund package maintenance!

Installs: 1 766 622

Dependents: 17

Suggesters: 0

Security: 0

Stars: 590

Watchers: 38

Forks: 153

Open Issues: 29


Build Status Scrutinizer Code Quality Download count Current version Documentation

An implementation of the "4D" bin packing/knapsack problem i.e. given a list of items, how many boxes do you need to fit them all in taking into account physical dimensions and weights.

Especially useful for e.g. e-commerce contexts when you need to know box size/weight to calculate shipping costs, or even just want to know the right number of labels to print.

See documentation for more details.


BoxPacker is MIT-licensed.