Asymptotically Optimal Lagrangian Policies for Multi-Warehouse Multi-Store Systems with Lost Sales

Sentao Miao, Stefanus Jasin, X. Chao
{"title":"Asymptotically Optimal Lagrangian Policies for Multi-Warehouse Multi-Store Systems with Lost Sales","authors":"Sentao Miao, Stefanus Jasin, X. Chao","doi":"10.2139/ssrn.3552995","DOIUrl":null,"url":null,"abstract":"We consider a periodic-review inventory control problem for the One-Warehouse Multi-Store system with lost sales. We focus on a time horizon during which the system receives no external replenishment. Specifically, the central warehouse has a finite initial inventory at the beginning of the horizon, which is then periodically allocated to the stores in each period in order to minimize the total expected lost-sales costs, holding costs, and shipping costs. This is a hard problem and the structure of its optimal policy is extremely complex. We develop simple heuristics based on Lagrangian relaxation that are easy to compute and implement, and have provably near-optimal performances. In particular, for the problem instance where the length of the time horizon is at least comparable to the number of stores, we show that the losses of our heuristics are sublinear in both the length of the time horizon and the number of stores. This improves the performance of existing heuristics in the literature whose losses are only sublinear in the number of stores. Numerical study shows that the heuristic performs very well. We also extend our analysis and result to more general settings, the so-called Assemble-to-Stock system and Multi-Warehouse Multi-Store system.","PeriodicalId":346985,"journal":{"name":"PROD: Analytical (Service) (Topic)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"PROD: Analytical (Service) (Topic)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3552995","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

We consider a periodic-review inventory control problem for the One-Warehouse Multi-Store system with lost sales. We focus on a time horizon during which the system receives no external replenishment. Specifically, the central warehouse has a finite initial inventory at the beginning of the horizon, which is then periodically allocated to the stores in each period in order to minimize the total expected lost-sales costs, holding costs, and shipping costs. This is a hard problem and the structure of its optimal policy is extremely complex. We develop simple heuristics based on Lagrangian relaxation that are easy to compute and implement, and have provably near-optimal performances. In particular, for the problem instance where the length of the time horizon is at least comparable to the number of stores, we show that the losses of our heuristics are sublinear in both the length of the time horizon and the number of stores. This improves the performance of existing heuristics in the literature whose losses are only sublinear in the number of stores. Numerical study shows that the heuristic performs very well. We also extend our analysis and result to more general settings, the so-called Assemble-to-Stock system and Multi-Warehouse Multi-Store system.
具有销售损失的多仓库多存储系统的渐近最优拉格朗日策略
研究了具有销售损失的一仓多店系统的定期评审库存控制问题。我们关注的是系统不接受外部补充的时间范围。具体来说,中央仓库在视界的开始处具有有限的初始库存,然后在每个期间定期将其分配给商店,以便最大限度地减少总预期损失销售成本、持有成本和运输成本。这是一个难题,其最优策略的结构极其复杂。我们开发了基于拉格朗日松弛的简单启发式算法,它易于计算和实现,并且具有可证明的接近最优的性能。特别是,对于时间范围长度至少与商店数量相当的问题实例,我们表明启发式的损失在时间范围长度和商店数量上都是次线性的。这提高了文献中现有的启发式算法的性能,其损失仅在商店数量上是次线性的。数值研究表明,该启发式算法具有良好的性能。我们还将分析和结果扩展到更一般的设置,即所谓的装配到库存系统和多仓库多存储系统。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信