Generating optimal cutting patterns for rectangular blanks of a single size

Generating optimal cutting patterns for rectangular blanks of a single size

0.00 Avg rating0 Votes
Article ID: iaor20031920
Country: United Kingdom
Volume: 53
Issue: 12
Start Page Number: 1338
End Page Number: 1346
Publication Date: Dec 2002
Journal: Journal of the Operational Research Society
Authors: ,
Keywords: trim loss
Abstract:

This paper deals with the problem of minimizing trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cuts. First we prove that we can obtain the unconstrained optimal layout by searching among normal multi-section layouts. Next we present an unconstrained algorithm to search for it. The unconstrained algorithm uses a branch-and-bound method with a tight upper bound. Later we discuss the algorithm for the constrained problem where the blank demand must be met exactly. Finally, the unconstrained algorithm is extended to cope with the blade length constraint. Experimental computations show that the algorithms are extremely efficient.

Reviews

Required fields are marked *. Your email address will not be published.