A computational improvement to Wang's two-dimensional cutting stock algorithm
Computers and Industrial Engineering
Best-first search methods for constrained two-dimensional cutting stock problems
Operations Research
Computers and Operations Research
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
Generating optimal T-shape cutting patterns for circular blanks
Computers and Operations Research
Heuristic and exact algorithms for generating homogenous constrained three-staged cutting patterns
Computers and Operations Research
Simple block patterns for the two-dimensional cutting problem
Mathematical and Computer Modelling: An International Journal
A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems
Operations Research Letters
An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
Computers and Operations Research
Exact algorithms for the two-dimensional guillotine knapsack
Computers and Operations Research
| Hi-index | 0.00 |
This paper presents a recursive algorithm for constrained two-dimensional guillotine cutting problems of rectangular items. The algorithm divides a stock plate into a sequence of small rectangular blocks. For the current block considered, it selects an item, puts it at the left-bottom corner of the block, and determines the direction of the dividing cut that divides the unoccupied region of the block into two smaller blocks for further consideration. The dividing cut is either along the upper edge or along the right edge of the selected item. The upper bound obtained from the unconstrained solution is used to shorten the searching space. The computational results on benchmark problems indicate that the algorithm can improve the solutions, and is faster than other algorithms.