Pattern minimisation in cutting stock problems
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Operations Research
Strips minimization in two-dimensional cutting stock of circular items
Computers and Operations Research
A CAM system for one-dimensional stock cutting
Advances in Engineering Software
Shadow price based genetic algorithms for the cutting stock problem
International Journal of Artificial Intelligence and Soft Computing
Solution approaches for the cutting stock problem with setup cost
Computers and Operations Research
INTELCSP: computational intelligence applied to cutting stock problems
International Journal of Computational Intelligence Studies
| Hi-index | 0.00 |
We propose a hybrid procedure to obtain a reduced number of different patterns in cutting stock problems. Initially, we generate patterns with limited waste that fulfill the demands of at least two items when the patterns are repeatedly cut as much as possible but without overproducing any of the items. The problem is reduced and the residual problem is solved. Then, pattern reduction techniques (local search) are applied starting with the generated solution. The scheme is straightforward and can be used in cutting stock problems of any dimension. Variations of the procedure are also indicated. Computational tests performed indicated that the proposed scheme provides alternative solutions to the pattern reduction problem which are not dominated by other solutions obtained using procedures previously suggested in the literature.