# 3d bin packing algorithm [closed]

I am looking for a deterministic implementation for any 3d bin packing algorithm, i.e. for packing many small and different cuboids inside one or many bigger ones. The solution could vary from the optimal one.

It should be written in C, C++, Java, C#, IronPython, IronRuby or any other language an can bin to from .Net code.

I found this C algorithm http://www.diku.dk/hjemmesider/ansatte/pisinger/3dbpp.c , but it doesn’t rotate the cuboids to find the best fit. I am ok with not rotating them upside down, but horizontal rotation should be possible.

13.10.2009 22:20:33
You claim you are looking for an algorithm, but you then list programming languages. Are you looking for a generic algorithm or an implementation?
Do you want the optimal solution, or one that's pretty good? Are the cuboids all the same? When you say rotation, do you mean 90 degrees, or any angle?
Beta 13.10.2009 22:45:16
@Beta: If he is packing cuboids into a cuboid, surely anything other than integer multiples of 90 degrees will lead to a sub-optimal solution.
user181548 13.10.2009 23:14:52
@Asaph: Of couse,not! Just because I mentioned "algorithm" doesn't mean it's a homework.
Mouk 14.10.2009 05:17:15
@Kinopiko and Mouk, try putting 5 unit squares into a square of width 2.708, then tell me again about non-90-degree angles.
Beta 15.10.2009 20:16:40
3 ОТВЕТА
РЕШЕНИЕ

I have written an approximate algorithm for the case you describe i.e. 3D rectangular boxes, with orthogonal rotation, in C++. You can find the results and algorithm in the published paper: http://www.cs.ukzn.ac.za/publications/erick_dube_507-034.pdf

19.04.2010 14:55:29
Is the source or c++ app available online anywhere?
Cole W 7.07.2011 19:22:58
This is good for a simple solution but really doesn't work all that well. For anyone wanting a explanation and help writing one I suggest this book: Knapsack Problems, by Martello and Toth, ISBN: 0471924202
ars265 13.03.2012 16:26:43
I can't find results in the linked page? is this still the correct url?
Amr Elgarhy 25.01.2020 18:35:33

This problem is NP-hard. Your best bet is an approximation algorithm (until a genius person solves any NP problem, or a very lucky fellow stumbles across a solution.) I do not know of any well know approximation algorithms for this problem unfortunately.

16.10.2009 22:51:16
Solving an NP-complete problem in polynomial time will still not give you a polynomial-solution to NP-hard problems :)
BlueRaja - Danny Pflughoeft 3.02.2010 15:42:59
Well for small packages, the required time is not that high. So brute force is a fair alternative for quite a few online shopping shipments.
ThomasRS 12.04.2019 10:25:41
@ThomasRS if you are willing to go brute-force, you will most likely get the best bang for your buck by using a corresponding ILP to represent the problem and feeding it into something like gurobi.
ldog 17.04.2019 07:57:41
Thanks @idog, however I've already written a custom implementation which does a few application-specific optimizations like accounting for multiple boxes of the same size and such.
ThomasRS 19.04.2019 22:23:26

I converted wknechtel/3d-bin-pack C code to javascript. Can be easily port to C#.

https://github.com/keremdemirer/3dbinpackingjs

You can run example calculations from `index.html` file and review the generated report. `pack1.js` file contains the app and algorithm. I'm not sure how the algorithm works but the results are satisfying for packaging calculations.

29.02.2016 01:15:06