I have a company that sells all kind of products and we have many issues with boxes. We are going to buy wholesale volumes, so we need to get the sizes right.
We are trying to develop an algorythm for optimizing box sizes. I have the data of all my products (Height-Width-Lenght) but I want to find the optimal number of boxes, N and the size of each N boxes (measured as H-W-L).
The constrains:
Obviosly, every product should fit in a box, that is, the ProductHeight <= BoxHeight and the same for Width and Lenght.
Every box size should be used for at least Z% of the products. We want to assure that every box has a minimum amount needed, so we don't do 1,000 boxes that will be used only one time.
I'm not that good at math or optimization, so any help would be great. Thanks!