报童模式
计算机科学
数学优化
最优化问题
概率分布
扩展(谓词逻辑)
订单(交换)
波动性(金融)
需求预测
人工智能
运筹学
算法
数学
计量经济学
经济
供应链
统计
政治学
程序设计语言
法学
财务
作者
Afshin Oroojlooyjadid,Lawrence Snyder,Martin Takáč
标识
DOI:10.1080/24725854.2019.1632502
摘要
The newsvendor problem is one of the most basic and widely applied inventory models. There are numerous extensions of this problem. If the probability distribution of the demand is known, the problem can be solved analytically. However, approximating the probability distribution is not easy and is prone to error; therefore, the resulting solution to the newsvendor problem may be not optimal. To address this issue, we propose an algorithm based on deep learning that optimizes the order quantities for all products based on features of the demand data. Our algorithm integrates the forecasting and inventory-optimization steps, rather than solving them separately, as is typically done, and does not require knowledge of the probability distributions of the demand. Numerical experiments on real-world data suggest that our algorithm outperforms other approaches, including data-driven and machine learning approaches, especially for demands with high volatility. Finally, in order to show how this approach can be used for other inventory optimization problems, we provide an extension for (r,Q) policies.
科研通智能强力驱动
Strongly Powered by AbleSci AI