Please use this identifier to cite or link to this item:
Title in Portuguese: Um algoritmo genético aplicado ao problema de empacotamento de bins tridimensionais
Author: Silva, José Lassance de Castro
Soma, Nei Yoshihiro
Keywords: Combinatorial optimization problem
Issue Date: 2002
Publisher: Encontro Nacional de Engenharia de Produção
Citation: SILVA, J. L. C. ; SOMA, N. Y. Um algoritmo genético aplicado ao problema de empacotamento de bins tridimensionais. In: ENCONTRO NACIONAL DE ENGENHARIA DE PRODUÇÃO, 22., 2002, Curitiba-PR. Anais... Curitiba-PR: ABEPRO, 2002.
Abstract: The objective of the present work is to present one technique to solver combinatorial optimization problems, that involves permutation, in an acceptable computational time based on genetic algorithm. This technique partitions the set of viable solutions in small regions, distinct between itself, in order to diversify the local search. We apply the technique to the Three-Dimensional Bin Packing Problem. The problem is NP-hard in the strong sense and extremely difficult to be solved in the practice. Extensive computational experiments are reported for instances with up to 90 items, and the results are compared with those obtained from the literature.
metadata.dc.type: Artigo de Evento
Appears in Collections:GESLOG - Trabalhos apresentados em eventos

Files in This Item:
File Description SizeFormat 
2002_eve_jlcsilva.pdf290,16 kBAdobe PDFView/Open

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