.NET 打包控件？
我的任务是为从我们的在线商店购买的零件开发包装算法。 是否有一个开源或待售的小部件或控件，可以接收产品列表（具有尺寸/重量）和可能的包装盒列表（具有最大尺寸和重量）并返回最佳可能的排列？ 我很难相信在我之前的数百万开发人员还没有想出一些东西，但如果没有，那就去实验室完成一些工作。
I'm taskd with developing a packing algorithm for parts bought from our online store. Is there a widget or control that is open-source or for sale that takes in a list of products (with dimensions / weight) and a list of possible packing boxes (with max dimensions and weight) and returns the best possible arrangement? I find it hard to believe that the million of developers before me haven't come up with something, but if not, it's off to the lab to get some work done.
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（2）
在我看来，您正在寻找装箱问题的实现。 这是一个 NP 难问题，所以你找不到任何快速且正确的算法。 我进行了快速搜索，找不到任何使用启发式方法的组件，但找到了大量描述启发式方法以获得答案近似值的论文。 祝你好运！
It seems to me that you're looking for an implementation of the Bin Packing Problem. It's an NP Hard problem, so you'll not find any fast-and-correct algorithm. I did a quick search and couldn't find any components that even use a heuristic for this, but found plenty of papers describing heuristics for getting approximations of the answer. Good luck!
我似乎记得这通常用作 NP-Hard 问题的示例。 因此，我不知道有任何算法，更不用说它的任何实现总是会给出最佳答案（通过从最大的开始，您将得到一个合理的但不是最佳的答案）物品，然后将其放入第一个适合的盒子中，重复直到物品用完为止）。
I seem to remember that this is commonly used as an example of a NP-Hard problem. As such, I'm not aware of any algorithm , let alone any implementation of it that will always give the best answer (You'll get a reasonable, but not best, answer by starting with the largest item, and putting it in the first box it'll fit, repeating until you run out of items).