A reinforcement learning approach to the stochastic cutting stock problem

We propose a formulation of the stochastic cutting stock problem as a discounted infinite-horizon Markov decision process. At each decision epoch, given current inventory of items, an agent chooses in which patterns to cut objects in stock in anticipation of the unknown demand. An optimal solution c...

Full description

Saved in:
Bibliographic Details
Main Authors: Anselmo R. Pitombeira-Neto, Arthur H.F. Murta
Format: Artigo
Language:Inglês
Published: Elsevier 2022-01-01
Series:EURO Journal on Computational Optimization
Subjects:
Cutting stock problem
Reinforcement learning
Approximate dynamic programming
Online Access:http://www.sciencedirect.com/science/article/pii/S219244062200003X
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items