P. Terán Viadero, M. A. Carravilla, J. F. Oliveira, F. J. Martín Campo, A. Alonso Ayuso

This work addresses the Two-Dimensional Variable-Sized Cutting Stock Problem (2DVSCSP), motivated by a real industrial application in honeycomb cardboard production. In this setting, stock dimensions are not predefined and must be determined jointly with cutting patterns to minimise material usage under exact two-stage guillotine constraints. This introduces strong interdependencies between decisions, increasing problem complexity.

We propose a genetic modelling framework solved using a Biased Random Key Genetic Algorithm. Solutions are represented through a problem-specific chromosome encoding and a decoder that simultaneously defines stock sizes and cutting patterns, ensuring feasibility by construction. Computational results show that the approach provides high-quality solutions and adapts well to different settings.

Keywords: Cutting Stock Problem, Variable-Sized Stock, Biased Random Key Genetic Algorithm

Scheduled

Heuristics and Metaheuristics
September 2, 2026  12:40 PM
Aula 21


Other papers in the same session

SMARTIMING: generación automática de horarios educativos

I. Méndez Fernández, A. García Hernández-Díaz, R. Gordaliza Ruiz, S. Pérez Peló, J. Sánchez-Oro Calvo

An enhanced GRASP algotithm for the unrelated parallel machines problem with additional resources

M. Villaizán Vallelado, J. C. Yepes Borrero, M. López-García, J. Alcaraz


Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.