EMPIRICAL STUDY ON ONE-DIMENSIONAL CUTTING STOCK PROBLEM SOLUTIONS USING ONLY CUTTING PATTERNS WITH A LIMITED NUMBER OF DISTINCT ITEM TYPES
Open Access
- 1 January 2026
- journal article
- research article
- Published by FapUNIFESP (SciELO) in Pesquisa Operacional
- Vol. 46, e303022
Abstract
In this study we focus on the approximate solution of the one-dimensional Cutting Stock Problem (CSP) by leveraging insights from studies on the Cutting Stock Problem with a Limited Number of Open Stacks (CS-LOSP). The CS-LOSP, a variant of the classical CSP, imposes a limit on the number of open stacks during production, reflecting constraints observed in many industrial environments. Em-pirical findings from CS-LOSP studies have shown that high-quality CSP solutions can be achieved with low values of C (the permitted number of open stacks). Inspired by these observations, we investigate a matheuristic pattern screening strategy that discards all cutting patterns generating more than C distinct item types to solve the CSP. The work is empirical in nature, supported by extensive computational tests designed to verify whether the promising results observed in CS-LOSP can be replicated in the classical one-dimensional CSP. Our experiments identify the conditions under which the matheuristic produces optimal or near-optimal solutions, particularly under medium to high demand levels, while its effectiveness tends to decrease in low-demand scenarios. Beyond demonstrating significant reductions in the size of the feasible pattern set to be considered when solving the CSP, our results underline the practical relevance of our approach. This is especially pertinent for sequential optimization systems in industrial applications.Keywords
Funding Information
- Fundação de Amparo à Pesquisa do Estado de São Paulo (2022/05803-3)
- Fundação de Amparo à Pesquisa do Estado de São Paulo (2025/03514-2)
- Fundação de Amparo à Pesquisa do Estado de São Paulo (304144/2019-3)
- Fundação de Amparo à Pesquisa do Estado de São Paulo (405702/2021-3)
- Fundação de Amparo à Pesquisa do Estado de São Paulo (302124/2025-0)
- Conselho Nacional de Desenvolvimento Científico e Tecnológico (2022/05803-3)
- Conselho Nacional de Desenvolvimento Científico e Tecnológico (2025/03514-2)
- Conselho Nacional de Desenvolvimento Científico e Tecnológico (304144/2019-3)
- Conselho Nacional de Desenvolvimento Científico e Tecnológico (405702/2021-3)
- Conselho Nacional de Desenvolvimento Científico e Tecnológico (302124/2025-0)
This publication has 44 references indexed in Scilit:
- Exact approaches for the pattern minimization problemComputers & Industrial Engineering, 2026
- Mathematical models for the one-dimensional cutting stock problem with setups and open stacksJournal of Combinatorial Optimization, 2025
- Exact solution of network flow models with strong relaxationsMathematical Programming, 2022
- Modified Greedy Heuristic for the one-dimensional cutting stock problemJournal of Combinatorial Optimization, 2021
- A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous ordersTOP, 2019
- Random search in the one-dimensional cutting stock problemEuropean Journal of Operational Research, 1996
- Improved heuristics for sequencing cutting patternsEuropean Journal of Operational Research, 1995
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problemEuropean Journal of Operational Research, 1995
- Heuristics for sequencing cutting patternsEuropean Journal of Operational Research, 1991
- Near-optimal solutions to one-dimensional cutting stock problemsComputers & Operations Research, 1986