An efficient solution method for relaxed variants of the nesting problem

摘要: Given a set of irregular shapes, the strip nesting problem is packing shapes within rectangular material such that length minimized, or equivalently utilization maximized. If found to be repeated, e.g., on roll fabric coil metal, then separation between repeats going straight line. This constraint can relaxed by only requiring produced repeated without overlap. Instead minimizing one minimizes periodicity these repeats. We describe how extend previously published solution method (Egeblad, Nielsen & Odgaard 2006) for it also handle relaxation above. Furthermore, we examine potential variant making computational experiments benchmark instances from garment industry. These show considerable improvements in obtained.