Affordable Access

Publisher Website

Heuristic for constrained T-shape cutting patterns of rectangular pieces

Authors
Journal
Computers & Operations Research
0305-0548
Publisher
Elsevier
Volume
39
Issue
12
Identifiers
DOI: 10.1016/j.cor.2012.03.001
Keywords
  • Cutting Stock
  • Two-Dimensional Cutting
  • T-Shape Patterns
Disciplines
  • Computer Science

Abstract

Abstract T-shape patterns are often used in dividing stock plates into rectangular pieces, because they make good balance between plate cost and cutting complexity. A dividing cut separates the plate into two segments, each of which contains parallel strips, and the strip orientations of the two segments are perpendicular to each other. This paper presents a heuristic algorithm for constrained T-shape patterns, where the optimization objective is to maximize the pattern value, and the frequency of each piece type does not exceed the demand. The algorithm considers many dividing-cut positions, determines the pattern value associated to each position using a layout-generation procedure, and selects the one with the maximum pattern value as the solution. Pseudo upper bounds are used to skip some non-promising positions. The computational results show that the algorithm is fast and able to get solutions better than those of the optimal two-staged patterns in terms of material utilization.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

A recursive branch-and-bound algorithm for constra...

on Mathematical and Computer Mode... Jan 01, 2011

Heuristic for the rectangular two-dimensional sing...

on European Journal of Operationa... Dec 01, 2013

Heuristic and exact algorithms for generating homo...

on Computers & Operations Researc... Jan 01, 2008
More articles like this..