An exact algorithm for generating homogenous T-shape cutting patterns

作者：Cui; Yaodong

来源：Computers & Operations Research, 2007, 34(4): 1107-1120.

DOI：10.1016/j.cor.2005.05.025

• cutting
• packing
• cutting stock
• constrained two-dimensional cutting

Both the material usage and the complexity of the cutting process should be considered in generating cutting patterns. This paper presents an exact algorithm for constrained two-dimensional guillotine-cutting problems of rectangles. It uses homogenous T-shape patterns to simplify the cutting process. Only homogenous strips are allowed, each of which contains rectangular blanks of the same size and direction. The sheet is divided into two segments. Each segment consists of strips of the same length and direction. The strip directions of the two segments are perpendicular to each other. The algorithm is based on branch and bound procedure combined with dynamic programming techniques. It is a bottom-up tree-search approach that searches the solution tree from the branches to the root. Tighter bounds are established to shorten the searching space. The computational results indicate that the algorithm is efficient both in computation time and in material usage.

• 出版日期2007-4
• 单位广西师范大学