Close

1. Identity statement
Reference TypeThesis or Dissertation (Thesis)
Sitemtc-m16.sid.inpe.br
Holder Codeisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
Identifier6qtX3pFwXQZ3P8SECKy/CD7mo
Repositorysid.inpe.br/jeferson/2004/07.02.13.58   (restricted access)
Last Update2005:01.20.02.00.00 (UTC) sergio
Metadata Repositorysid.inpe.br/jeferson/2004/07.02.13.58.52
Metadata Last Update2020:07.08.13.09.20 (UTC) sergio
Secondary KeyINPE-11826-TDI/964
Citation KeyPinto:2004:AlCoRe
TitleAlgumas contribuições à resolução do problema de corte integrado ao problema de sequenciamento dos padrões
Alternate TitleSome contributions to the solution of the cutting stock and pattern sequencing integrated problem
CourseCAP-SPG-INPE-MCT-BR
Year2004
Secondary Date20040621
Date2004-06-21
Access Date2024, Mar. 28
Thesis TypeTese (Doutorado em Computação Aplicada)
Secondary TypeTDI
Number of Pages194
Number of Files395
Size19583 KiB
2. Context
AuthorPinto, Maria José
GroupCAP-SPG-INPE-MCT-BR
CommitteeBecceneri, José Carlos (presidente)
Yanasse, Horácio Hideki (orientador)
Lorena, Luiz Antônio Nogueira
Soma, Nei Yoshihiro
Morabito Neto, Reinaldo
UniversityInstituto Nacional de Pesquisas Espaciais (INPE)
CitySão José dos Campos
History (UTC)2005-01-20 15:41:55 :: jefferson -> jeferson ::
2005-01-20 16:30:22 :: jeferson -> jefferson ::
2005-06-13 16:09:10 :: jefferson -> administrator ::
2009-04-14 12:53:31 :: administrator -> jefferson ::
2009-04-29 19:01:47 :: jefferson -> administrator ::
2009-05-02 03:09:26 :: administrator -> marciana ::
2009-06-12 15:31:01 :: marciana -> administrator ::
2009-06-16 17:20:57 :: administrator -> marciana ::
2009-06-19 15:09:24 :: marciana -> administrator ::
2019-09-09 12:55:50 :: administrator -> sergio :: 2004
2020-07-08 13:09:20 :: sergio -> simone :: 2004
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Keywordscorte
modelos matemáticos
método de relaxação (matemática)
pesquisa operacional
cutting
mathematical models
relaxation method (mathematics)
operation research
AbstractOs problemas de corte de estoque e de sequenciamento de padrões são oriundos de importantes aplicações práticas. A literatura existente geralmente os aborda de forma independente. Neste trabalho, apresentamos uma formulação matemática para o problema integrado e buscamos explorar a estrutura desta formulação para o desenvolvimento de um método de resolução eficiente. Devido à complexidade do modelo apresentado, propomos um esquema de decomposição para resolvê-lo que, para obter sucesso, necessita de uma resolução eficiente de ambos os problemas, o de corte e o de sequenciamento. Aperfeiçoamos e desenvolvemos métodos de resolução do problema de sequenciamento contribuindo com novas formulações para o MTSP e para o MOSP, que parecem promissoras para a resolução destes problemas em um menor tempo computacional. Apesar das melhoras nos tempos computacionais, os avanços conseguidos com as abordagens propostas não foram suficientes para que se possa utilizá-las rotineiramente para se resolver instâncias do problema integrado, de tamanhos encontrados na prática. Um procedimento heurístico para o problema integrado foi também desenvolvido para fornecer um limitante superior de boa qualidade para o problema. Com este trabalho, esperamos ter contribuído com o avanço no estado da arte com respeito à resolução de problemas de corte e seqüenciamento de forma integrada. ABSTRACT: The cutting stock problem and the pattern sequencing problem arise in important practical applications. In the existing literature these problems are generally treated independently. In this work, we developed a mathematical formulation for the integrated problem and we investigated the structure of this formulation in order to develop an efficient method for its solution. Due to the complexity of the integrated model, we propose a decomposition procedure to solve it. For the success of this procedure, both problems, the cutting stock problem and the pattern sequencing problems, have to be solved in an efficient way. We improved and developed methods to solve the pattern sequencing problem contributing with news formulations for the MTSP and the MOSP, that seem to be promising for solving these problems in a reduced computational time. Although the computational times were reduced with the proposed approaches, the advances obtained were not sufficient to be regularly used to solve instances of the problem with sizes found in practice. We also developed a heuristic to solve the integrated problem in order to provide a better upper bound to the problem. With this study, we expected to have contributed to the state of the art with respect to solving cutting and sequencing problems in an integrated way.
AreaCOMP
Arrangementurlib.net > BDMCI > Fonds > Produção pgr ATUAIS > CAP > Algumas contribuições à...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
Languagept
Target Filepublicacao.pdf
User Groupadministrator
jefferson
simone
Visibilityshown
Copy HolderSID/SCD
Read Permissiondeny from all and allow from 150.163
Update Permissionnot transferred
5. Allied materials
Next Higher Units8JMKD3MGPCW/3F2PHGS
DisseminationNTRSNASA; BNDEPOSITOLEGAL.
Host Collectionsid.inpe.br/banon/2003/08.15.17.40
6. Notes
Empty Fieldsacademicdepartment affiliation archivingpolicy archivist callnumber contenttype copyright creatorhistory descriptionlevel doi e-mailaddress electronicmailaddress format isbn issn label lineage mark mirrorrepository nextedition notes number orcid parameterlist parentrepositories previousedition previouslowerunit progress readergroup resumeid rightsholder schedulinginformation secondarymark session shorttitle sponsor subject tertiarymark tertiarytype url versiontype
7. Description control
e-Mail (login)simone
update 


Close