Adaptive Lagrangian Policies for a Multiwarehouse, Multistore Inventory System with Lost Sales

IF 2.2 3区 管理学 Q3 MANAGEMENT
Xiuli Chao, Stefanus Jasin, Sentao Miao
{"title":"Adaptive Lagrangian Policies for a Multiwarehouse, Multistore Inventory System with Lost Sales","authors":"Xiuli Chao, Stefanus Jasin, Sentao Miao","doi":"10.1287/opre.2022.0668","DOIUrl":null,"url":null,"abstract":"<p>We consider the inventory control problem of a multiwarehouse, multistore system over a time horizon when the warehouses receive no external replenishment. This problem is prevalent in retail settings, and it is referred to in the work of [Jackson PL (1988) Stock allocation in a two-echelon distribution system or “what to do until your ship comes in.” <i>Management Sci.</i> 34(7):880–895] as the problem of “what to do until your (external) shipment comes in.” The warehouses are stocked with initial inventories, and the stores are dynamically replenished from the warehouses in each period of the planning horizon. Excess demand in each period at a store is lost. The optimal policy for this problem is complex and state dependent, and because of the curse of dimensionality, computing the optimal policy using standard dynamic programming is numerically intractable. <i>Static</i> Lagrangian base-stock (LaBS) policies have been developed for this problem [Miao S, Jasin S, Chao X (2022) Asymptotically optimal Lagrangian policies for one-warehouse multi-store system with lost sales. <i>Oper. Res.</i> 70(1):141–159] and shown to be asymptotically optimal. In this paper, we develop <i>adaptive</i> policies that <i>dynamically</i> adjust the control parameters of a vanilla static LaBS policy using realized historical demands. We show, both theoretically and numerically, that adaptive policies significantly improve the performance of the LaBS policy, with the magnitude of improvement characterized by the number of policy adjustments. In particular, when the number of adjustments is a logarithm of the length of time horizon, the policy is rate optimal in the sense that the rate of the loss (in terms of the dependency on the length of the time horizon) matches that of the theoretical lower bound. Among other insights, our results also highlight the benefit of incorporating the “pooling effect” in designing a dynamic adjustment scheme.</p><p><b>Supplemental Material:</b> The online appendix is available at https://doi.org/10.1287/opre.2022.0668.</p>","PeriodicalId":54680,"journal":{"name":"Operations Research","volume":null,"pages":null},"PeriodicalIF":2.2000,"publicationDate":"2024-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1287/opre.2022.0668","RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 0

Abstract

We consider the inventory control problem of a multiwarehouse, multistore system over a time horizon when the warehouses receive no external replenishment. This problem is prevalent in retail settings, and it is referred to in the work of [Jackson PL (1988) Stock allocation in a two-echelon distribution system or “what to do until your ship comes in.” Management Sci. 34(7):880–895] as the problem of “what to do until your (external) shipment comes in.” The warehouses are stocked with initial inventories, and the stores are dynamically replenished from the warehouses in each period of the planning horizon. Excess demand in each period at a store is lost. The optimal policy for this problem is complex and state dependent, and because of the curse of dimensionality, computing the optimal policy using standard dynamic programming is numerically intractable. Static Lagrangian base-stock (LaBS) policies have been developed for this problem [Miao S, Jasin S, Chao X (2022) Asymptotically optimal Lagrangian policies for one-warehouse multi-store system with lost sales. Oper. Res. 70(1):141–159] and shown to be asymptotically optimal. In this paper, we develop adaptive policies that dynamically adjust the control parameters of a vanilla static LaBS policy using realized historical demands. We show, both theoretically and numerically, that adaptive policies significantly improve the performance of the LaBS policy, with the magnitude of improvement characterized by the number of policy adjustments. In particular, when the number of adjustments is a logarithm of the length of time horizon, the policy is rate optimal in the sense that the rate of the loss (in terms of the dependency on the length of the time horizon) matches that of the theoretical lower bound. Among other insights, our results also highlight the benefit of incorporating the “pooling effect” in designing a dynamic adjustment scheme.

Supplemental Material: The online appendix is available at https://doi.org/10.1287/opre.2022.0668.

具有销售损失的多仓库、多分店库存系统的自适应拉格朗日政策
我们考虑的是一个多仓库、多分店系统在仓库没有外部补货时的库存控制问题。这个问题在零售业中非常普遍,在[Jackson PL (1988) Stock allocation in a two-echelon distribution system or "what to do until your ship comes in."]的著作中被称为 "在你的船到港之前该怎么办 "的问题。管理科学》34(7):880-895] 中被称为 "在(外部)货物到达之前该怎么办 "的问题。仓库备有初始库存,在计划期的每个阶段都会从仓库动态地补充库存。商店在每个时期的超额需求都会损失。这个问题的最优策略既复杂又依赖于状态,而且由于维数诅咒,使用标准动态编程计算最优策略在数值上是难以实现的。针对这一问题,人们提出了静态拉格朗日基础库存(LaBS)策略[Miao S, Jasin S, Chao X (2022) Asymptotically optimal Lagrangian policies for one-warehouse multi-store system with lost sales.Oper.70(1):141-159],并证明是渐近最优的。在本文中,我们开发了自适应策略,利用已实现的历史需求动态调整虚静态 LaBS 策略的控制参数。我们从理论和数值上证明,自适应政策能显著改善 LaBS 政策的性能,改善的程度取决于政策调整的次数。特别是,当调整次数是时间跨度长度的对数时,该政策的损失率(与时间跨度长度的关系)与理论下限相匹配,因而是最优的。除其他见解外,我们的结果还强调了在设计动态调整方案时纳入 "集合效应 "的好处:在线附录见 https://doi.org/10.1287/opre.2022.0668。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Operations Research
Operations Research 管理科学-运筹学与管理科学
CiteScore
4.80
自引率
14.80%
发文量
237
审稿时长
15 months
期刊介绍: Operations Research publishes quality operations research and management science works of interest to the OR practitioner and researcher in three substantive categories: methods, data-based operational science, and the practice of OR. The journal seeks papers reporting underlying data-based principles of operational science, observations and modeling of operating systems, contributions to the methods and models of OR, case histories of applications, review articles, and discussions of the administrative environment, history, policy, practice, future, and arenas of application of operations research.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信