--
You received this message because you are subscribed to the Google Groups "or-tools-discuss" group.
To unsubscribe from this group and stop receiving emails from it, send an email to or-tools-discuss+unsubscribe@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
Sorry no, this is a 3d bin packing, and it is much harder that multidimensional knapsack as you need to pack boxes, and not just sum dimensions.
This being said, because boxes need to rest on something, I believe it is closer to a succession of 2d bin packing. 1 per layer. Each box in one layer being the same height.
If this assumption is valid, then a sequence of 2 bin packing will do the trick.
In ortools/sat/python/cp_model.py, you have the 2d no overlap constraint that will express the 1 layer bin packing problem.
First build a potential assignment of boxes to layers, then solve each layer in sequence.
I hope this helps.
This is called a multidimensional knapsack. We have example code for that in OR-Tools here:examples/cpp/multidim_knapsack.ccJon
On Fri, Nov 10, 2017 at 9:10 PM, 김예지 <kimyj...@gmail.com> wrote:
Hello, I'm Korean university student.I have to put as many as possible boxes into a big truck.I found that bin packing problem is most similar to my problem, but it just calculate the value and weight.How can I calculate width, height, and depth to my bin packing problem?Please help me!!
--
You received this message because you are subscribed to the Google Groups "or-tools-discuss" group.
To unsubscribe from this group and stop receiving emails from it, send an email to or-tools-discu...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
--
You received this message because you are subscribed to the Google Groups "or-tools-discuss" group.
To unsubscribe from this group and stop receiving emails from it, send an email to or-tools-discu...@googlegroups.com.