剪裁管时如何计算最小浪费 [英] How calculate minimal waste when tailoring tubes

问题描述

我有一个数学问题需要解决:

I have a rather mathematical problem I need to solve:

任务是用最少的废料从固定长度的管子中切割出预定数量的管子.

The task is to cut a predefined number of tubes out of fixed length tubes with a minimum amount of waste material.

假设我想从标准长度为 6m 的管中切出 10 根 1m 管和 20 根 2.5m 管.

So let's say I want to cut 10 1m tubes and 20 2,5m tubes out of tubes with a standardized length of 6m.

我不确定此类问题的算法会是什么样的?

I'm not sure what an algorithm for this kind of problem would look like?

我想创建一个不同尺寸管的变体列表，将它们装入标准尺寸的管中，然后然后选择浪费最少的变体.

I was thinking to create a list of variations of the different sized tubes, fit them into the standard sized tubes and then choose the variation with the minimal waste.

首先，我不确定是否有其他更好的方法来解决这个问题.

First I'm not sure if there are not other and better ways to attack the problem.

其次，我没有找到解决方案，我将如何创建这样的变体列表.

Second I did not find a solution HOW I would create such a variations list.

非常感谢任何帮助，谢谢！

Any help is greatly appreciated, thanks!

推荐答案

我相信你在描述 cutting库存问题.可以在此处找到一些其他信息.

I believe you are describing the cutting stock problem. Some additional information can be found here.

这篇关于剪裁管时如何计算最小浪费的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！