Exact Algorithms for Large-Scale Unconstrained Two and Three Staged Cutting Problems
Computational Optimization and Applications
A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
Computers and Operations Research
An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
Operations Research
Recursive computational procedure for two-dimensional stock cutting
IBM Journal of Research and Development
Generating optimal two-section cutting patterns for rectangular blanks
Computers and Operations Research
A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems
Operations Research Letters
A recursive algorithm for constrained two-dimensional cutting problems
Computational Optimization and Applications
Heuristic for the rectangular strip packing problem with rotation of items
Computers and Operations Research
| Hi-index | 0.98 |
This paper presents an algorithm for the unconstrained two-dimensional cutting problem of rectangular pieces. It proposes the simple block (SB) pattern consisting of simple blocks. The SB pattern is defined recursively. Each cut on the stock plate produces just one simple block. A horizontal cut produces a horizontal block with width equal to that of the leftmost piece in the block. A vertical cut produces a vertical block with length equal to that of the bottommost piece in the block. The algorithm generates the optimal SB pattern recursively, and selects optimally the first piece in each block. It uses upper bound to prune some unpromising branches during the searching process. The computational results indicate that the algorithm is highly efficient in improving material utilization, and the computation time is reasonable.