Resumen de A residual recombination heuristic for one‑dimensional cutting stock problems
B. S. C. Campello, C. T. L. S. Ghidini, A. O. C Ayres, Welington de Oliveira
Cutting stock problems arise in manufacturing industries where large objects need to be cut into smaller pieces. The cutting process usually results in a waste of material; thus, mathematical optimization models are used to reduce losses and take economic gains. This paper introduces a new heuristic procedure, called the Residual Recombination Heuristic (RRH), to the one-dimensional cutting stock problem.
The well-known column generation technique typically produces relaxed solutions with non-integer entries, which, in this approach, we associate with a set of residual cutting patterns. The central aspect of this contribution involves recombining these residual cutting patterns in diferent ways; therefore, generating new integer feasible cutting patterns. Experimental studies and statistical analyses were conducted based on diferent instances from the literature. We analyze heuristic performance by measuring the waste of material, the number of instances solved to optimality, and by comparing it with other heuristics in the literature. The computational time suggests the suitability of the heuristic for solving real-world problems.
