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...

Celý popis

Uloženo v:
Podrobná bibliografie
Hlavní autoři: Anselmo R. Pitombeira-Neto, Arthur H.F. Murta
Médium: Artigo
Jazyk:Inglês
Vydáno: Elsevier 2022-01-01
Edice:EURO Journal on Computational Optimization
Témata:
Cutting stock problem
Reinforcement learning
Approximate dynamic programming
On-line přístup:http://www.sciencedirect.com/science/article/pii/S219244062200003X
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!

Podobné jednotky