A reinforcement learning approach to the stochastic cutting stock problem

DOI10.1016/j.ejco.2022.100027zbMath1530.90110arXiv2109.09592OpenAlexW3201272472MaRDI QIDQ6114929

Arthur H. F. Murta, Anselmo R. Pitombeira-Neto

Publication date: 12 July 2023

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.09592

zbMATH Keywords

reinforcement learningcutting stock problemapproximate dynamic programming

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Related Items (1)

Cutting and packing problems under uncertainty: literature review and classification framework

Cites Work

• Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem
• On the cutting stock problem under stochastic demand
• Classification and literature review of integrated lot-sizing and cutting stock problems
• The combined cutting stock and lot-sizing problem in industrial processes
• One-dimensional cutting stock optimization in consecutive time periods
• The stochastic trim-loss problem
• The one-dimensional cutting stock problem with due dates
• An approximate dynamic programming approach for sequential pig marketing decisions at herd level
• A combined cutting-stock and lot-sizing problem
• Approximate dynamic programming for planning a ride-hailing system using autonomous fleets of electric vehicles
• A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders
• A tutorial on the cross-entropy method
• An improved typology of cutting and packing problems
• A Dynamic Stochastic Stock-Cutting Problem
• Approximate Dynamic Programming
• A Linear Programming Approach to the Cutting-Stock Problem
• A Stochastic Cutting Stock Procedure: Cutting Rolls of Insulating Tape
• 10.1162/1532443041827907
• A Tutorial on Linear Function Approximators for Dynamic Programming and Reinforcement Learning
• A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A reinforcement learning approach to the stochastic cutting stock problem