Integer solutions for the one-dimensional cutting stock problem with usable leftovers

• Grant number: 23/10381-3
• Support Opportunities: Scholarships in Brazil - Scientific Initiation
• Start date: November 01, 2023
• End date: October 31, 2025
• Field of knowledge: Engineering - Production Engineering - Operational Research
• Principal Investigator: Adriana Cristina Cherri
• Grantee: Thiago Bigotte Gullo
• Host Institution: Faculdade de Ciências (FC). Universidade Estadual Paulista (UNESP). Campus de Bauru. Bauru , SP, Brazil
• Associated research grant: 22/05803-3 - Cutting, packing, lot-sizing, scheduling, routing and location problems and their integration in industrial and logistics settings, AP.TEM

Abstract

Cutting and packing problems are combinatorial optimization problems that are difficult to solve and arise in many industrial processes. In general, solving these problems presents a considerable academic challenge and a significant economic and environmental impact, as it contributes to reducing the usage and waste of raw materials. In the cutting stock problem (CSP), objects in stock are cut to produce ordered items and an objective function is optimized. A problem similar to the CSP considers the utilization of leftovers generated during the cutting process. These leftovers are planned and used in future cutting processes. In this undergraduate research project, a mathematical model proposed in the literature for solving the cutting problem with leftovers will be studied. This model provides only continuous optimal solutions to the problem, and thus, a kernel search matheuristic will be used to obtain integer solutions. Also, a residual heuristic will be developed to obtain integer solutions. Implementations will be developed, and computational tests will be conducted using randomly generated instances and instances from the literature to assess the performance of the developed procedure. Comparisons and analyses of the solutions will also be performed.