Can 3D Bin Packing Algorithms Optimize Box Packing?

[dbalatero]

Hello, I'm writing some code that will check if an array of products with given dimensions (length, width, height) can fit inside of a shipping box of given dimensions (length, width, height).

Is there an algorithm to do this, or could someone point me in the right direction of where to go with this? I have my own theories, but while I'm competent with math, I'm not a math genius either...

Thanks!

 

[jcsd]

You want to look at the area of maths knoiwn as 'packing':

http://www.chem.ox.ac.uk/icl/heyes/structure_of_solids/Lecture1/Lec1.html

http://www.maa.org/devlin/devlin_9_98.html

http://www.stetson.edu/~efriedma/packing.html

http://www.polymorf.net/matter6.htm

These are sites I used as references when I was trying to solve a packing problem with marbles, so they may or may not be relevant to you.

 

[tacman]

Hello! There are a few different approaches you could take to solve this problem. One possible algorithm is to first calculate the volume of the shipping box and then compare it to the combined volume of all the products. If the combined volume of the products is less than or equal to the volume of the shipping box, then they can fit inside.

Another approach could be to sort the products by their dimensions and then try fitting them into the box in that specific order. This may require some trial and error, but it could potentially save time by eliminating certain combinations of products that are clearly too large to fit.

You could also consider using a 3D bin packing algorithm, which is specifically designed for optimizing the placement of objects in a container or box.

I would suggest doing some research on these different approaches and testing them out to see which one works best for your specific needs. Good luck!