Problema de corte de estoque unidimensional com sobras aproveitáveis: solução via metaheurística GRASP

ABSTRACT

In this article we present a study of the one-dimensional Cutting Stock Problem with Usable Leftovers Stock (CSPUL). The Cutting Stock Problem (CSP) consists of cutting a set of objects, available in stock, to produce a set of items in specified quantities and sizes. CSPUL is a CSP in which not all leftovers from a cutting process are considered waste, that is, when a leftover is greater than a certain length, it returns to the stock to be used in the subsequent cutting processes. Therefore, the objective of the addressed problem is to optimize the cutting planes to be applied to standardized objects and non-standardized objects (leftovers from previous cuts); meet the known demand for smaller items, in order to minimize the waste of material, controlling the amount of generated leftovers. In order to solve this problem, two heuristics and three versions of the Greedy Randomized Adaptive Search Procedure metaheuristic (GRASP) were developed. Computational tests were performed for the procedures proposed in instances of the literature. The approaches proposed for the solution presented good solutions in relation to the number of surpluses generated.

Keywords:
one-dimensional cutting stock problem; usable leftovers; metaheuristics; GRASP