文件名称：Fast Neighborhood Search for the Nesting Problem
文件大小：2.96MB
文件格式：PDF
更新时间：2022-04-05 13:50:10
nestin
Benny Kjr Nielsen and Allan Odgaard fbenny, dug@diku.dk February 14, 2003 The main subject of this thesis is the so-called nesting problem, which (in short) is the problem of packing arbitrary two-dimensional shapes within the boundaries of some container. The objective can vary e.g. minimizing the size of a rectangular container or maximizing the number of shapes in the container, but the core problem is to pack the shapes tightly without any overlap.