A BIOBJECTIVE MATHEURISTIC FOR THE INTEGRATED SOLUTION OF THE IRREGULAR STRIP PACKING AND THE CUTTING PATH DETERMINATION PROBLEMS

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.contributorUniversidade Estadual Paulista (UNESP)-
Autor(es): dc.contributorUniversidade de São Paulo (USP)-
Autor(es): dc.contributorUniversity of Porto-
Autor(es): dc.creatorOliveira, Larissa Tebaldi-
Autor(es): dc.creatorCarravilla, Maria Antónia-
Autor(es): dc.creatorOliveira, José Fernando-
Autor(es): dc.creatorToledo, Franklina Maria Bragion-
Data de aceite: dc.date.accessioned2025-08-21T17:09:51Z-
Data de disponibilização: dc.date.available2025-08-21T17:09:51Z-
Data de envio: dc.date.issued2025-04-29-
Data de envio: dc.date.issued2022-12-31-
Fonte completa do material: dc.identifierhttp://dx.doi.org/10.1590/0101-7438.2023.043.00275212-
Fonte completa do material: dc.identifierhttps://hdl.handle.net/11449/301301-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/11449/301301-
Descrição: dc.descriptionIrregular 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.-
Descrição: dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)-
Descrição: dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)-
Descrição: dc.descriptionSchool of Sciences São Paulo State University (UNESP), Campus Bauru, Av. Eng. Luís Edmundo Carrijo Coube, 14-01, SP-
Descrição: dc.descriptionInstitute of Mathematical and Computer Sciences University of São Paulo (USP), Avenida Trabalhador São-carlense, SP-
Descrição: dc.descriptionINESC TEC Faculty of Engineering University of Porto, Rua Dr. Roberto Frias-
Descrição: dc.descriptionSchool of Sciences São Paulo State University (UNESP), Campus Bauru, Av. Eng. Luís Edmundo Carrijo Coube, 14-01, SP-
Descrição: dc.descriptionFAPESP: 2010/10133-0-
Descrição: dc.descriptionFAPESP: 2013/07375-0-
Descrição: dc.descriptionFAPESP: 2013/25743-6-
Descrição: dc.descriptionFAPESP: 2016/09476-6-
Descrição: dc.descriptionCNPq: 309161/2022-3-
Idioma: dc.languageen-
Relação: dc.relationPesquisa Operacional-
???dc.source???: dc.sourceScopus-
Palavras-chave: dc.subjectbiobjective matheuristic-
Palavras-chave: dc.subjectBRKGA-
Palavras-chave: dc.subjectcutting and packing problem-
Palavras-chave: dc.subjectcutting path determination problem-
Palavras-chave: dc.subjectnesting problem-
Título: dc.titleA BIOBJECTIVE MATHEURISTIC FOR THE INTEGRATED SOLUTION OF THE IRREGULAR STRIP PACKING AND THE CUTTING PATH DETERMINATION PROBLEMS-
Tipo de arquivo: dc.typelivro digital-
Aparece nas coleções:Repositório Institucional - Unesp

Não existem arquivos associados a este item.