{"title":"基于特征的需求删减库存控制","authors":"Jingying Ding, W. T. Huh, Ying Rong","doi":"10.1287/msom.2021.0135","DOIUrl":null,"url":null,"abstract":"Problem definition: We study stochastic periodic-review inventory systems with lost sales, where the decision maker has no access to the true demand distribution a priori and can only observe historical sales data (referred to as censored demand) and feature information about the demand. In an inventory system, excess demand is unobservable because of inventory constraints, and sales data alone cannot fully recover the true demand. Meanwhile, feature information about the demand is abundant to assist inventory decisions. We incorporate features for inventory systems with censored demand. Methodology/results: We propose two feature-based inventory algorithms called the feature-based adaptive inventory algorithm and the dynamic shrinkage algorithm. Both algorithms are based on the stochastic gradient descent method. We measure the performance of the proposed algorithms through the average expected regret in finite periods: that is, the difference between the cost of our algorithms and that of a clairvoyant optimal policy with access to information, which is acting optimally. We show that the average expected cost incurred under both algorithms converges to the clairvoyant optimal cost at the rate of [Formula: see text] for the perishable inventory case and [Formula: see text] for the nonperishable inventory case. The feature-based adaptive inventory algorithm results in high volatility in the stochastic gradients, which hampers the initial performance of regret. The dynamic shrinkage algorithm uses a shrinkage parameter to adjust the gradients, which significantly improves the initial performance. Managerial implications: This paper considers feature information. The idea of dynamic shrinkage for the stochastic gradient descent method builds on a fundamental insight known as the bias-variance trade-off. Our research shows the importance of incorporating the bias-variance in a dynamic environment for inventory systems with feature information. Funding: W. T. Huh acknowledges support from the NSERC Discovery Grants [Grant RGPIN 2020-04213] and the Canada Research Chair Program. The work of Y. Rong was supported by the National Natural Science Foundation of China [Grants 72025201, 72331006, and 72221001]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2021.0135 .","PeriodicalId":119284,"journal":{"name":"Manufacturing & Service Operations Management","volume":"12 8","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Feature-Based Inventory Control with Censored Demand\",\"authors\":\"Jingying Ding, W. T. Huh, Ying Rong\",\"doi\":\"10.1287/msom.2021.0135\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Problem definition: We study stochastic periodic-review inventory systems with lost sales, where the decision maker has no access to the true demand distribution a priori and can only observe historical sales data (referred to as censored demand) and feature information about the demand. In an inventory system, excess demand is unobservable because of inventory constraints, and sales data alone cannot fully recover the true demand. Meanwhile, feature information about the demand is abundant to assist inventory decisions. We incorporate features for inventory systems with censored demand. Methodology/results: We propose two feature-based inventory algorithms called the feature-based adaptive inventory algorithm and the dynamic shrinkage algorithm. Both algorithms are based on the stochastic gradient descent method. We measure the performance of the proposed algorithms through the average expected regret in finite periods: that is, the difference between the cost of our algorithms and that of a clairvoyant optimal policy with access to information, which is acting optimally. We show that the average expected cost incurred under both algorithms converges to the clairvoyant optimal cost at the rate of [Formula: see text] for the perishable inventory case and [Formula: see text] for the nonperishable inventory case. The feature-based adaptive inventory algorithm results in high volatility in the stochastic gradients, which hampers the initial performance of regret. The dynamic shrinkage algorithm uses a shrinkage parameter to adjust the gradients, which significantly improves the initial performance. Managerial implications: This paper considers feature information. The idea of dynamic shrinkage for the stochastic gradient descent method builds on a fundamental insight known as the bias-variance trade-off. Our research shows the importance of incorporating the bias-variance in a dynamic environment for inventory systems with feature information. Funding: W. T. Huh acknowledges support from the NSERC Discovery Grants [Grant RGPIN 2020-04213] and the Canada Research Chair Program. The work of Y. Rong was supported by the National Natural Science Foundation of China [Grants 72025201, 72331006, and 72221001]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2021.0135 .\",\"PeriodicalId\":119284,\"journal\":{\"name\":\"Manufacturing & Service Operations Management\",\"volume\":\"12 8\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-02-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Manufacturing & Service Operations Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1287/msom.2021.0135\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Manufacturing & Service Operations Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/msom.2021.0135","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
摘要
问题定义:我们研究的是具有销售损失的随机定期回顾库存系统,在这种系统中,决策者无法事先获得真实的需求分布,只能观察历史销售数据(称为删减需求)和需求特征信息。在库存系统中,由于库存限制,超额需求是不可观测的,仅凭销售数据无法完全恢复真实需求。同时,关于需求的特征信息非常丰富,可以帮助库存决策。我们为有删减需求的库存系统加入了特征信息。方法/结果:我们提出了两种基于特征的库存算法,分别称为基于特征的自适应库存算法和动态收缩算法。这两种算法都基于随机梯度下降法。我们通过有限期间内的平均预期遗憾来衡量所提算法的性能:即我们算法的成本与获取信息的 "千里眼 "最优策略的成本之间的差额。我们的研究表明,在两种算法下产生的平均预期成本,在易腐烂库存情况下以[公式:见正文]的速度收敛到千里眼最优成本,在非易腐烂库存情况下以[公式:见正文]的速度收敛到千里眼最优成本。基于特征的自适应库存算法会导致随机梯度的高波动性,从而影响后悔的初始性能。动态收缩算法使用收缩参数来调整梯度,从而显著改善了初始性能。管理意义:本文考虑了特征信息。随机梯度下降法的动态收缩思想建立在一个称为偏差-方差权衡的基本见解之上。我们的研究表明,将偏差-方差纳入动态环境对具有特征信息的库存系统非常重要。资助:W. T. Huh 感谢国家科学和技术研究中心(NSERC)发现基金[Grant RGPIN 2020-04213] 和加拿大研究教席计划(Canada Research Chair Program)的支持。Y. Rong 的工作得到了国家自然科学基金[Grants 72025201, 72331006, and 72221001]的支持。补充材料:在线附录见 https://doi.org/10.1287/msom.2021.0135 。
Feature-Based Inventory Control with Censored Demand
Problem definition: We study stochastic periodic-review inventory systems with lost sales, where the decision maker has no access to the true demand distribution a priori and can only observe historical sales data (referred to as censored demand) and feature information about the demand. In an inventory system, excess demand is unobservable because of inventory constraints, and sales data alone cannot fully recover the true demand. Meanwhile, feature information about the demand is abundant to assist inventory decisions. We incorporate features for inventory systems with censored demand. Methodology/results: We propose two feature-based inventory algorithms called the feature-based adaptive inventory algorithm and the dynamic shrinkage algorithm. Both algorithms are based on the stochastic gradient descent method. We measure the performance of the proposed algorithms through the average expected regret in finite periods: that is, the difference between the cost of our algorithms and that of a clairvoyant optimal policy with access to information, which is acting optimally. We show that the average expected cost incurred under both algorithms converges to the clairvoyant optimal cost at the rate of [Formula: see text] for the perishable inventory case and [Formula: see text] for the nonperishable inventory case. The feature-based adaptive inventory algorithm results in high volatility in the stochastic gradients, which hampers the initial performance of regret. The dynamic shrinkage algorithm uses a shrinkage parameter to adjust the gradients, which significantly improves the initial performance. Managerial implications: This paper considers feature information. The idea of dynamic shrinkage for the stochastic gradient descent method builds on a fundamental insight known as the bias-variance trade-off. Our research shows the importance of incorporating the bias-variance in a dynamic environment for inventory systems with feature information. Funding: W. T. Huh acknowledges support from the NSERC Discovery Grants [Grant RGPIN 2020-04213] and the Canada Research Chair Program. The work of Y. Rong was supported by the National Natural Science Foundation of China [Grants 72025201, 72331006, and 72221001]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2021.0135 .