Close

1. Identity statement
Reference TypeJournal Article
Sitemtc-m16.sid.inpe.br
Holder Codeisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
Identifier6qtX3pFwXQZGivnJVY/LwT7S
Repositorysid.inpe.br/mtc-m16@80/2006/06.22.13.48   (restricted access)
Last Update2006:06.22.13.48.27 (UTC) administrator
Metadata Repositorysid.inpe.br/mtc-m16@80/2006/06.22.13.48.28
Metadata Last Update2018:06.05.01.16.51 (UTC) administrator
Secondary KeyINPE-13804--PRE/8990
ISSN0305-0548
Citation KeyYanasseLime:2006:HyHeRe
TitleA hybrid heuristic to reduce the number of different patterns in cutting stock problems
Year2006
MonthSept.
Access Date2024, Apr. 27
Secondary TypePRE PI
Number of Files1
Size210 KiB
2. Context
Author1 Yanasse, Horácio Hideki
2 Limeira, M. S.
Resume Identifier1 8JMKD3MGP5W/3C9JHCP
Group1 LAC-INPE-MCT-BR
2 LAC-INPE-MCT-BR
Affiliation1 Instituto Nacional de Pesquisas Espaciais, Laboratório Associado de Computação e Matemática Aplicada (INPE.LAC)
2 Instituto Nacional de Pesquisas Espaciais, Laboratório Associado de Computação e Matemática Aplicada (INPE.LAC)
JournalComputers and Operations Research
Volume33
Number9
Pages2744-2756
History (UTC)2006-06-22 13:48:28 :: simone -> administrator ::
2008-06-10 22:42:45 :: administrator -> simone ::
2011-05-20 05:41:46 :: simone -> administrator ::
2018-06-05 01:16:51 :: administrator -> marciana :: 2006
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Content TypeExternal Contribution
Keywordspattern reduction
cutting stock
heuristics
TRIM-LOSS
AbstractWe 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.
AreaCOMP
Arrangementurlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > A hybrid heuristic...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
Languageen
Target FileA hybrid heuristic to reduce the number of different.pdf
User Groupadministrator
simone
Visibilityshown
Copy HolderSID/SCD
Archiving Policydenypublisher denyfinaldraft36
Read Permissiondeny from all and allow from 150.163
Update Permissiontransferred to simone
5. Allied materials
Next Higher Units8JMKD3MGPCW/3ESGTTP
DisseminationWEBSCI; PORTALCAPES.
Host Collectionsid.inpe.br/banon/2003/08.15.17.40
6. Notes
Empty Fieldsalternatejournal archivist callnumber copyright creatorhistory descriptionlevel doi e-mailaddress electronicmailaddress format isbn label lineage mark mirrorrepository nextedition notes orcid parameterlist parentrepositories previousedition previouslowerunit progress project readergroup rightsholder schedulinginformation secondarydate secondarymark session shorttitle sponsor subject tertiarymark tertiarytype typeofwork url versiontype
7. Description control
e-Mail (login)marciana
update 


Close