Yaodong Cui, Tianlong Gu, and Wei Hu
Cutting, packing, cutting stock problem, two-dimensional cutting
Two recursive algorithms for the unconstrained guillotine-cutting problem of equal rectangles are presented. The first does not consider the blade length constraint. The second considers the case where the plate length is longer than the blade length of the guillotine machine. It uses the first algorithm to generate optimal patterns on segments, which are not longer than the blade length, and calls a recursive function to determine the optimal layout of the segments on the plate. Two objectives are considered lexically. The main objective is to maximize the number of pieces included, and the secondary objective is to minimize the number of cuts required to divide the plate into strips. The computational results indicate that the algorithms are time efficient and can simplify the cutting process obviously.
Important Links:
Go Back
