SIMPLEX ALGORITHM WITH COLUMN GENERATION FOR A CUTTING STOCK PROBLEM IN THE PAPER INDUSTRY

Vol 56, 2024 - 307830
Complete Articles (CA)
Favorite this paper
How to cite this paper?
Abstract

The cutting stock problem is a well-known combinatorial optimization problem that aims to find the best cutting piece combinations to avoid waste or gain profit while respecting constraints. This paper discusses a solution to this problem for the paper industry using the Simplex algorithm with Column Generation and the knapsack problem to discover the best cutting patterns. Experimental results show that our solution produced positive outcomes and could improve the process in paper industries.

Share your ideas or questions with the authors!

Did you know that the greatest stimulus in scientific and cultural development is curiosity? Leave your questions or suggestions to the author!

Sign in to interact

Have a question or suggestion? Share your feedback with the authors!

Programme
19:00 to 20:30 on 11/05/2024
Abade
Institutions
  • 1 Instituto de Tecnologia e Liderança
  • 2 Instituto de Tecnologia e Liderança / Universidade Federal de São Paulo
Track
  • 16. POI – OR in Industry
Keywords
Operational Research
Column Generation
Cutting Stock Problem