%0 Journal Article
%@holdercode {isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S}
%@nexthigherunit 8JMKD3MGPCW/3ESGTTP
%@archivingpolicy denypublisher denyfinaldraft36
%@resumeid 8JMKD3MGP5W/3C9JHCP
%@usergroup administrator
%@usergroup simone
%3 A hybrid heuristic to reduce the number of different.pdf
%@dissemination WEBSCI; PORTALCAPES.
%2 sid.inpe.br/mtc-m16@80/2006/06.22.13.48.28
%4 sid.inpe.br/mtc-m16@80/2006/06.22.13.48
%X 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.
%8 Sept.
%N 9
%T A hybrid heuristic to reduce the number of different patterns in cutting stock problems
%K pattern reduction, cutting stock, heuristics, TRIM-LOSS.
%@secondarytype PRE PI
%@group LAC-INPE-MCT-BR
%@group LAC-INPE-MCT-BR
%@copyholder SID/SCD
%@secondarykey INPE-13804--PRE/8990
%@issn 0305-0548
%@affiliation Instituto Nacional de Pesquisas Espaciais, Laboratório Associado de Computação e Matemática Aplicada (INPE.LAC),
%@affiliation Instituto Nacional de Pesquisas Espaciais, Laboratório Associado de Computação e Matemática Aplicada (INPE.LAC),
%B Computers and Operations Research
%P 2744-2756
%@documentstage simone
%D 2006
%V 33
%A Yanasse, Horácio Hideki,
%A Limeira, M. S.,
%@area COMP