| Texto completo | |
| Autor(es): |
Sato, Andre Kubagawa
[1]
;
Martins, Thiago Castro
[1]
;
Gomes, Antonio Miguel
[2]
;
Guerra Tsuzuki, Marcos Sales
[1]
Número total de Autores: 4
|
| Afiliação do(s) autor(es): | [1] Univ Sao Paulo, Escola Politecn, Dept Mech & Mech Syst Engn, Computat Geometry Lab, Ave Prof Mello Moraes, BR-2231 Sao Paulo - Brazil
[2] Univ Porto, INESC TEC, Porto - Portugal
Número total de Afiliações: 2
|
| Tipo de documento: | Artigo Científico |
| Fonte: | European Journal of Operational Research; v. 279, n. 2, p. 657-671, DEC 1 2019. |
| Citações Web of Science: | 1 |
| Resumo | |
Among the most complex problems in the field of 2-dimensional cutting \& packing are irregular packing problems, in which items may have a more complex geometry. These problems are prominent in several areas, including, but not limited to, the textile, shipbuilding and leather industries. They consist in placing a set of items, whose geometry is often represented by simple polygons, into one or more containers such that there is no overlap between items and the utility rate of the container is maximized. In this work, the irregular strip packing problem, an irregular packing variant with a variable length container, is investigated. The placement space is reduced by adopting a rectangular grid and a full search is performed using preprocessed raster penetration maps to efficiently determine the new position of an item. Tests were performed using simple dotted board model cases and irregular strip packing benchmark instances. The comparison of our results with the state of the art solutions showed that the proposed algorithm is very competitive, achieving better or equal compaction in 9 out of 15 instances and improving the average density in 13 instances. Besides the contribution of the new best results, the proposed approach showed the advantage of adopting discrete placement, which can be potentially applied to other irregular packing problems. (C) 2019 Elsevier B.V. All rights reserved. (AU) | |
| Processo FAPESP: | 10/18658-4 - Aplicação do Recozimento Simulado para a Reconstrução de Imagens por Tomografia por Impedância Elétrica |
| Beneficiário: | Renato Seiji Tavares |
| Modalidade de apoio: | Bolsas no Brasil - Doutorado |
| Processo FAPESP: | 10/18913-4 - Estudo sobre translações aplicadas a polígonos de obstrução para que operações booleanas não regularizadas criem regiões de obstrução degeneradas |
| Beneficiário: | Marcos de Sales Guerra Tsuzuki |
| Modalidade de apoio: | Auxílio à Pesquisa - Regular |
| Processo FAPESP: | 13/26532-9 - Desenvolvimento de algoritmo massivamente paralelo com GPGPU para criar a região obstrutiva montanhosa discreta |
| Beneficiário: | Marcos de Sales Guerra Tsuzuki |
| Modalidade de apoio: | Auxílio à Pesquisa - Regular |
| Processo FAPESP: | 08/11132-7 - Desenvolvimento de algoritmo para executar operações booleanas não regularizadas em regiões poligonais para aplicação na determinação de regiões de obstrução |
| Beneficiário: | Marcos de Sales Guerra Tsuzuki |
| Modalidade de apoio: | Auxílio à Pesquisa - Regular |