• JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
 
  Bookmark and Share
 
 
Master's Dissertation
DOI
10.11606/D.55.2018.tde-20082018-143855
Document
Author
Full name
Silvana Aparecida Borsetti Gregorio Vidotti
Institute/School/College
Knowledge Area
Date of Defense
Published
São Carlos, 1993
Supervisor
Committee
Arenales, Marcos Nereu (President)
Morabito Neto, Reinaldo
Tavares, Hermano de Medeiros Ferreira
Title in Portuguese
PROBLEMA DE CORTE BIDIMENSIONAL GUILHOTINADO NÂO-ESTAGIADO E IRRESTRITO
Keywords in Portuguese
Grafo-E/0U
Padrão de corte guilhotinado irrestrito e não-estagiado
Problema de corte bidimensional
Abstract in Portuguese
O objetivo geral deste estudo é o de trabalhar o problema de corte bidimensional guilhotinado irrestrito e no-estagiado. Para tanto, foram revistas regras e heurísticas a serem utilizadas e foi sugerida uma combinação da regra de simetria com a heurística de geraçgo dos pontos de cortes possíveis. Uma abordagem em grafo-E/OU, com a utilizaçgo de uma estratégia híbrida, que combina as técnicas "Hill-Climbing" e "Depth-First" para a busca em grafo, foi utilizada para a resolução do problema. Finalmente, foram comparados os resultados obtidos com resultados apresentados na literatura.
Title in English
The unconstrained non staged two-dimensional cutting stock problem 
Keywords in English
AND/OR-graph
Non-staged unconstrained guilhotined cutting pattern
Two-dimensional cutting problem
Abstract in English
The general purpose of this study is to deal with the non-staged unconstrained guilhotined cutting problem. For this, rules and heuristics in use are reviewed and a combination between simmetry rule and possible cutting points generation heuristics in suggested. An AND/OR-graph approach, with used a hibrid strategy that combines Hill-Climbing and Depth-First techniques, in order to serach the graph, was used to solve this problem. Finally, results from this study and results presented in the literature are compared.
 
WARNING - Viewing this document is conditioned on your acceptance of the following terms of use:
This document is only for private use for research and teaching activities. Reproduction for commercial use is forbidden. This rights cover the whole data about this document as well as its contents. Any uses or copies of this document in whole or in part must include the author's name.
Publishing Date
2018-08-20
 
WARNING: Learn what derived works are clicking here.
All rights of the thesis/dissertation are from the authors
CeTI-SC/STI
Digital Library of Theses and Dissertations of USP. Copyright © 2001-2021. All rights reserved.