Given a set of irregular shapes, the strip nesting problem is the problem of packing the shapes within a rectangular strip of material such that the strip length is minimized, or equivalently the utilization of material is maximized. If the packing found is to be repeated, e.g., on a roll of fabric or a coil of metal, then the separation between repeats is going to be a straight line. This constraint can be relaxed by only requiring that the packing produced can be repeated without overlap. Instead of minimizing strip length one minimizes the periodicity of these repeats.
We describe how to extend a previously published solution method (Egeblad, Nielsen & Odgaard 2006) for the nesting problem such that it can also handle the relaxation above. Furthermore, we examine the potential of the relaxed variant of the strip packing problem by making computational experiments on a set of benchmark instances from the garment industry. These experiments show that considerable improvements in utilization can be obtained.
我们描述了如何扩展先前发布的解决方法(Egeblad,Nielsen&Odgaard 2006),以解决嵌套问题,从而也可以解决上述松弛问题。此外,我们通过对服装行业的一组基准实例进行计算实验,来检验带状包装问题的松弛变型的潜力。这些实验表明,可以大大提高利用率。 P>
机译:Galerkin无网格方法的二次精确度有效嵌套子域梯度平滑积分算法
机译:一种类似牛顿-皮卡德的轻松方法,用于基于总变异的Huber变异图像恢复
机译:一种轻松的牛顿 - Picard喜欢基于总变化的图像恢复的Huber变体方法
机译:集成解决方案方法的搜索推断和放松框架
机译:基于三维问题的基本解数值方法:非齐次项和超奇异积分的有效处理
机译:通过溶液沉积方法制备高效TADF黄红色OLED:有源层形态的关键影响
机译:Galerkin无网格方法的有效嵌套子域梯度平滑积分算法