arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.09592math.OCcs.LG
收藏

随机下料问题的强化学习方法

A Reinforcement Learning Approach to the Stochastic Cutting Stock Problem

Federal University of Ceará(塞阿拉联邦大学)

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

摘要:

我们提出了一个公式的随机下料问题作为一个折扣的无限时域马尔可夫决策过程。在每个决策时期,给定当前的物品库存,代理选择在哪些模式中削减库存中的对象,以预测未知的需求。最优解对应于将每个状态与决策相关联并使预期总成本最小化的策略。由于精确算法与状态空间维度呈指数关系,我们开发了一种基于强化学习的启发式求解方法。我们提出了一个近似的策略迭代算法,在该算法中,我们应用一个线性模型来近似策略的动作价值函数。策略评估是通过求解预测贝尔曼方程从一个样本的状态转换,决策和成本通过模拟获得。由于大的决策空间,通过交叉熵方法进行策略改进。通过实际数据进行了计算实验,说明了算法的应用。启发式政策得到多项式和傅立叶基函数相比,近视和随机的政策。结果表明,获得能够充分控制库存的政策的可能性,平均成本高达80%,低于通过短视的政策获得的成本。

英文摘要:

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 corresponds to a policy that associates each state with a decision and minimizes the expected total cost. Since exact algorithms scale exponentially with the state-space dimension, we develop a heuristic solution approach based on reinforcement learning. We propose an approximate policy iteration algorithm in which we apply a linear model to approximate the action-value function of a policy. Policy evaluation is performed by solving the projected Bellman equation from a sample of state transitions, decisions and costs obtained by simulation. Due to the large decision space, policy improvement is performed via the cross-entropy method. Computational experiments are carried out with the use of realistic data to illustrate the application of the algorithm. Heuristic policies obtained with polynomial and Fourier basis functions are compared with myopic and random policies. Results indicate the possibility of obtaining policies capable of adequately controlling inventories with an average cost up to 80% lower than the cost obtained by a myopic policy.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑