Taylor Approximation of Inventory Policies for One-Warehouse, Multi-Retailer Systems with Demand Feature Information

Author:

Huang Jingkai1ORCID,Shang Kevin2ORCID,Yang Yi1ORCID,Zhou Weihua1ORCID,Li Yuan3

Affiliation:

1. School of Management, Zhejiang University, Hangzhou 310058, China;

2. Fuqua School of Business, Duke University, Durham, North Carolina 27708;

3. Dchain, Alibaba (China) Co., Ltd, Hangzhou 310023, China

Abstract

We consider a distribution system in which retailers replenish perishable goods from a warehouse, which, in turn, replenishes from an outside source. Demand at each retailer depends on exogenous features and a random shock, and unfulfilled demand is lost. The objective is to obtain a data-driven replenishment and allocation policy that minimizes the average inventory cost per time period. The extant data-driven methods either cannot guarantee a feasible solution for out-of-sample feature observations or generate one with excessive computational time. We propose a policy that resolves these issues in two steps. In the first step, we assume that the distributions of features and random shocks are known. We develop an effective heuristic policy by using Taylor expansion to approximate the retailer’s inventory cost. The resulting solution is closed-form, referred to as Taylor Approximation (TA) policy. We show that the TA policy is asymptotically optimal in the number of retailers. In the second step, we apply the linear quantile regression and kernel density estimation to the TA solution to obtain the data-driven policy called Data-Driven Taylor Approximation (DDTA) policy. We prove that the DDTA policy is consistent with the TA policy. A numerical study shows that the DDTA policy is very effective. Using a real data set provided by Fresh Hema, we show that the DDTA policy reduces the average cost by 11.0% compared with Hema’s policy. Finally, we show that the main results still hold in the cases of correlated demand features, positive lead times, and censored demand. This paper was accepted by J. George Shanthikumar, data science. Funding: Y. Yang acknowledges financial support from the NSFC [Grants 72125004, 71821002]. W. Zhou acknowledges financial support from the NSFC [Grants 72192823, 71821002]. Supplemental Material: The online appendix and data files are available at https://doi.org/10.1287/mnsc.2021.04241 .

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3