3 dimensional bin packing algorithms

Posted by BuschnicK on Stack Overflow See other posts from Stack Overflow or by BuschnicK
Published on 2010-02-03T13:18:28Z Indexed on 2010/04/19 15:13 UTC
Read the original article Hit count: 495

I'm faced with a 3 dimensional bin packing problem and am currently conducting some preliminary research as to which algorithms/heuristics are currently yielding the best results. Since the problem is NP hard I do not expect to find the optimal solution in every case, but I was wondering:

1) what are the best exact solvers? Branch and Bound? What problem instance sizes can I expect to solve with reasonable computing resources?
2) what are the best heuristic solvers?
3) What off-the-shelf solutions exist to conduct some experiments with?

© Stack Overflow or respective owner

Related posts about language-agnostic

Related posts about algorithm