language agnostic - 3 dimensional bin packing algorithms -


I am facing a 3-dimensional bin packing problem and is currently conducting some preliminary research according to which algorithms / Hurricistics are currently giving the best results since the problem is NP difficult, so I do not expect to find optimal solutions in every case, but I was thinking:

1) What are the most accurate solars? Branch and bondage? Can I expect to be resolved with proper computing resources in the form of proper examples?
2) What are the best estimates of solar? 3) Is there some off-shelf solutions with which some experiments can be done?

As far as the shelf solution is off, check out the truck to load it any May be able to configure the rectangular volume to load, but I have not tried it yet. The complexity involved in normal 3D bin-packing problems is that the object can be rotated in different positions, so that with any given length, width and height for any object, you can effectively represent each of the three variables You can create, but you only have one solution

In general, stand-alone MIP formulations (or branch and bound) do not work well for 2D or 3D problem but hindered programming is a perfect solution for 2D problem with some success. Given with giving. Check it out. Without looking at the paper, I like the decomposition approach to the problem, where you are trying to reduce the number of the same size box. I have not seen the problem of 3D problem as many results, but tell us if you have implemented any that is executable.

Good luck!


Comments

Popular posts from this blog

sql - dynamically varied number of conditions in the 'where' statement using LINQ -

asp.net mvc - Dynamically Generated Ajax.BeginForm -

Debug on symbian -