The nesting and cutting path problems: integration and related problems

• Grant number: 23/13087-9
• Support Opportunities: Regular Research Grants
• Start date: March 01, 2024
• End date: February 28, 2026
• Field of knowledge: Engineering - Production Engineering - Operational Research
• Principal Investigator: Larissa Tebaldi de Oliveira
• Grantee: Larissa Tebaldi de Oliveira
• Host Institution: Faculdade de Ciências (FC). Universidade Estadual Paulista (UNESP). Campus de Bauru. Bauru , SP, Brazil
• Associated researchers: Fábio Luiz Usberti ; Franklina Maria Bragion de Toledo

Abstract

Determining an efficient layout is a combinatorial optimization problem known as the cutting and packing problem. Once a layout is defined, in some industries, the issue of which is the best way to cut it arises. This second problem is known as the cutting path determination problem and consists of finding the path that one or more cutting tools must follow in order to execute a given layout. The decisions taken into the packing step strongly influence the resolution of the cutting path problem. Here, we study ways to improve the strategies to solve the integrated packing and cutting path problem. Furthermore, we also study the dynamic cutting path problem. In this problem, the cutting tool cannot be turned off, which adds complexity to its movements, making it unable to move above the pieces that have not yet been cut from the layout. (AU)