Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/54314
Type: Artigo de periódico
Title: AN AND OR-GRAPH APPROACH FOR 2-DIMENSIONAL CUTTING PROBLEMS
Author: MORABITO, RN
ARENALES, MN
ARCARO, VF
Abstract: The problem of generating guillotine cutting patterns for a rectangular plate is studied and a type of structure is proposed for representing the solution of the problem, called and-or graph, which is commonly used in the Artificial Intelligence environment. To search the graph we combined two classical strategies: depth-first and hill-climbing. Further, some heuristics are considered and computational results are presented, relating their performance on examples from both literature as well as randomly generated.
Subject: CUTTING STOCK PROBLEM
AND OR-GRAPH SEARCH
Country: Holanda
Editor: Elsevier Science Bv
Rights: fechado
Identifier DOI: 10.1016/0377-2217(92)90212-R
Date Issue: 1992
Appears in Collections:Artigos e Materiais de Revistas Científicas - Unicamp

Files in This Item:
File Description SizeFormat 
WOSA1992JB87100010.pdf563.92 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.