| 1. Identity statement | |
| Reference Type | Thesis or Dissertation (Thesis) |
| Site | mtc-m16.sid.inpe.br |
| Holder Code | isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S |
| Identifier | 6qtX3pFwXQZ3P8SECKy/AueNh |
| Repository | sid.inpe.br/jeferson/2003/12.17.16.01 (restricted access) |
| Last Update | 2005:01.27.02.00.00 (UTC) sergio |
| Metadata Repository | sid.inpe.br/jeferson/2003/12.17.16.01.35 |
| Metadata Last Update | 2020:07.08.13.43.57 (UTC) sergio |
| Secondary Key | INPE-11896-TDI/966 |
| Citation Key | Limeira:2003:ReNúPa |
| Title | Redução do número de padrões em problemas de corte de estoque  |
| Alternate Title | Pattern reduction in cutting stock problem |
| Course | CAP-SPG-INPE-MCT-BR |
| Year | 2003 |
| Secondary Date | 20031017 |
| Date | 2003-10-17 |
| Access Date | 2024, Apr. 20 |
| Thesis Type | Tese (Doutorado em Computação Aplicada) |
| Secondary Type | TDI |
| Number of Pages | 176 |
| Number of Files | 359 |
| Size | 13071 KiB |
| 2. Context | |
| Author | Limeira, Marcelo Saraiva |
| Group | CAP-SPG-INPE-MCT-BR |
| Committee | Becceneri, José Carlos (presidente) Yanasse, Horácio Hideki (orientador) Lorena, Luiz Antonio Nogueira Soma, Nei Yoshihiro Morabito Neto, Reinaldo |
| University | Instituto Nacional de Pesquisas Espaciais (INPE) |
| City | São José dos Campos |
| History (UTC) | 2005-01-27 17:06:53 :: jefferson -> jeferson :: 2005-01-27 17:20:22 :: jeferson -> jefferson :: 2005-06-13 16:16:10 :: jefferson -> administrator :: 2009-04-14 12:53:30 :: administrator -> jefferson :: 2009-04-28 19:32:51 :: jefferson -> administrator :: 2009-05-02 03:09:24 :: administrator -> marciana :: 2009-06-12 15:24:33 :: marciana -> administrator :: 2009-06-16 17:20:56 :: administrator -> marciana :: 2009-06-19 14:54:53 :: marciana -> administrator :: 2018-07-18 16:45:14 :: administrator -> sergio :: 2003 2020-07-08 13:43:57 :: sergio -> simone :: 2003 |
| 3. Content and structure | |
| Is the master or a copy? | is the master |
| Content Stage | completed |
| Transferable | 1 |
| Keywords | Corte otimização métodos heurísticos padrões computer science cutting optimization heuristic methods patterns |
| Abstract | Neste trabalho de tese focaliza-se o problema de redução do número mínimo de padrões distintos em problemas de corte de estoque. É feita uma revisão da literatura encontrada sobre este problema e novas heurísticas para este problema são propostas. A primeira heurística proposta compõe-se de três fases. Na primeira fase, padrões são gerados e selecionados se satisfizerem níveis de aspiração pré-estabelecidos. O problema é reduzido e resolvido na segunda fase. Na terceira fase, alguma técnica de redução de padrões é aplicada. Na segunda heurística proposta escalona-se as demandas dos itens por um fator constante e resolve-se o problema resultante. A terceira heurística proposta é uma variante da Heurística 1 com uma pequena mudança na fase 1. A quarta heurística proposta é uma variante do método de redução apresentado por Foerster e Wäscher (1999). Alguns limitantes inferiores para o número mínimo de padrões distintos em uma solução ótima para o problema de corte de estoque também foram propostos. As heurísticas 1, 2 e 3 foram implementadas e testes computacionais foram realizados. Os resultados obtidos dos testes computacionais indicam que as heurísticas implementadas têm bom desempenho em comparação com outras propostas anteriormente na literatura. ABSTRACT: In this thesis we focus on the problem of reducing the number of patterns in cutting stock problems. A review of the literature found on this subject is made and new heuristics for this problem are proposed. The first heuristic proposed is composed of three phases. In the first phase, patterns are generated and chosen if they satisfy some pre-established aspiration levels. The problem is reduced and solved in the second phase. In the third phase, some pattern reduction technique is applied. In the second heuristic proposed we scale the demands of the items by a constant factor and we solve the resulting problem. The third heuristic proposed is a variant of Heuristic 1 with a small modification in phase 1. The fourth heuristic proposed is a variant of the methods of reduction presented by Foerster and Wäscher (1999). Some lower bounds for the minimum possible number of different patterns in an optimal solution for the cutting stock problem were also introduced. Heuristics 1, 2 and 3 were implemented and computational tests were performed. The results obtained from the computational tests indicate that the proposed heuristics have good performance in comparison with previous procedures suggested in the literature. |
| Area | COMP |
| Arrangement | urlib.net > BDMCI > Fonds > Produção pgr ATUAIS > CAP > Redução do número... |
| doc Directory Content | access |
| source Directory Content | there are no files |
| agreement Directory Content | there are no files |
| 4. Conditions of access and use | |
| Language | pt |
| Target File | paginadeacesso.html |
| User Group | administrator simone |
| Visibility | shown |
| Copy Holder | SID/SCD |
| Read Permission | deny from all and allow from 150.163 |
| Update Permission | not transferred |
| 5. Allied materials | |
| Next Higher Units | 8JMKD3MGPCW/3F2PHGS |
| Dissemination | NTRSNASA; BNDEPOSITOLEGAL. |
| Host Collection | sid.inpe.br/banon/2003/08.15.17.40 |
| 6. Notes | |
| Empty Fields | academicdepartment 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 | |