Generating optimal two-section cutting patterns for rectangular blanks

Authors:
Yaodong Cui;Dongli He;Xiaoxia Song
Affiliations:
Department of Computer Science, Guangxi Normal University, Guilin, Guangxi 541004, China;Department of Computer Science, Guangxi Normal University, Guilin, Guangxi 541004, China;Department of Computer Science, Guangxi Normal University, Guilin, Guangxi 541004, China
Venue:
Computers and Operations Research
Year:
2006

Citing 2
Cited 3

Exact Algorithms for Large-Scale Unconstrained Two and Three Staged Cutting Problems

Computational Optimization and Applications
Recursive computational procedure for two-dimensional stock cutting

IBM Journal of Research and Development

Simple block patterns for the two-dimensional cutting problem

Mathematical and Computer Modelling: An International Journal
A recursive branch-and-bound algorithm for constrained homogenous T-shape cutting patterns

Mathematical and Computer Modelling: An International Journal
A New Graph-Theoretical Model for the Guillotine-Cutting Problem

INFORMS Journal on Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents an algorithm for generating unconstrained guillotine-cutting patterns for rectangular blanks. A pattern includes at most two sections, each of which consists of strips of the same length and direction. The sizes and strip directions of the sections must be determined optimally to maximize the value of the blanks cut. The algorithm uses an implicit enumeration method to consider all possible section sizes, from which the optimal sizes are selected. It may solve all the benchmark problems listed in the OR-Library to optimality. The computational results indicate that the algorithm is efficient both in computation time and in material utilization. Finally, solutions to some problems are given.