简体   繁体   English

用于大量箱的2D箱包装的求解器(java | Gurobi)

[英]A Solver for 2D bin packing for Large number of Bins (java | Gurobi)

I am looking for a Solver to solve a 2D bin packing problem. 我正在寻找求解器来解决2D装箱问题。 I saw several post, suggesting "Binary Tree Algorithm", but I have around 200,000 of bins, So I am not sure if the algorithm is Scalable or not. 我看到了几篇文章,建议使用“二叉树算法”,但是我有大约200,000个垃圾箱,因此我不确定该算法是否可伸缩。

I was thinking about Gurobi. 我在考虑古罗比。 But I dont know how to model the problem in Gurobi. 但我不知道如何在古罗比(Gurobi)中为问题建模。 Is any one aware of any available model that I can use? 有人知道我可以使用的任何可用模型吗? Or Is there any java code available, that can give me an "close to exact" solution, considering the fact that it is NP hard? 还是考虑到NP难,有没有Java代码可以给我“接近精确”的解决方案?

Thanks 谢谢

/Mina /米娜

You could check out the JBoss solution: http://www.optaplanner.org/ 您可以查看JBoss解决方案: http : //www.optaplanner.org/

Looks like this guy has given it a try: https://github.com/MichaelGoff/bin-packing 看起来这个家伙尝试了一下: https : //github.com/MichaelGoff/bin-packing

声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.

 
粤ICP备18138465号  © 2020-2024 STACKOOM.COM