| Texto completo | |
| Autor(es): |
Larissa Tebaldi Oliveira
;
Maria Antónia Carravilla
[2]
;
José Fernando Oliveira
[3]
;
Franklina Maria Bragion Toledo
[4]
Número total de Autores: 4
|
| Tipo de documento: | Artigo Científico |
| Fonte: | Pesquisa Operacional; v. 43, 2023-11-10. |
| Resumo | |
ABSTRACT Irregular strip packing problems are present in a wide variety of industrial sectors, such as the garment, footwear, furniture and metal industry. The goal is to find a layout in which an object will be cut into small pieces with minimum raw-material waste. Once a layout is obtained, it is necessary to determine the path that the cutting tool has to follow to cut the pieces from the layout. In the latter, the goal is to minimize the cutting distance (or time). Although industries frequently use this solution sequence, the trade-off between the packing and the cutting path problems can significantly impact the production cost and productivity. A layout with minimum raw-material waste, obtained through the packing problem resolution, can imply a longer cutting path compared to another layout with more material waste but a shorter cutting path, obtained through an integrated strategy. Layouts with shorter cutting path are worthy of consideration because they may improve the cutting process productivity. In this paper, both problems are solved together using a biobjective matheuristic based on the Biased Random-Key Genetic Algorithm. Our approach uses this algorithm to select a subset of the no-fit polygons edges to feed the mathematical model, which will compute the layout waste and cutting path length. Solving both strip packing and cutting path problems simultaneously allows the decision-maker to analyze the compromise between the material waste and the cutting path distance. As expected, the computational results showed the trade-off’s relevance between these problems and presented a set of solutions for each instance solved. (AU) | |
| Processo FAPESP: | 16/09476-6 - Métodos de resolução para o problema integrado de empacotamento de peças irregulares e caminho mínimo de corte |
| Beneficiário: | Larissa Tebaldi de Oliveira |
| Modalidade de apoio: | Bolsas no Exterior - Estágio de Pesquisa - Doutorado |
| Processo FAPESP: | 13/07375-0 - CeMEAI - Centro de Ciências Matemáticas Aplicadas à Indústria |
| Beneficiário: | Francisco Louzada Neto |
| Modalidade de apoio: | Auxílio à Pesquisa - Centros de Pesquisa, Inovação e Difusão - CEPIDs |
| Processo FAPESP: | 13/25743-6 - Uma integração dos problemas de empacotamento de peças irregulares e do caminho mínimo de corte |
| Beneficiário: | Larissa Tebaldi de Oliveira |
| Modalidade de apoio: | Bolsas no Brasil - Doutorado |
| Processo FAPESP: | 10/10133-0 - Problemas de corte, empacotamento, dimensionamento de lotes e programação da produção, e suas integrações em contextos industriais e logísticos |
| Beneficiário: | Reinaldo Morabito Neto |
| Modalidade de apoio: | Auxílio à Pesquisa - Temático |