采购
波动性(金融)
数学优化
运筹学
计算机科学
概率逻辑
竞争分析
集合(抽象数据类型)
经济
计量经济学
数学
上下界
人工智能
数学分析
管理
程序设计语言
作者
Xiaoyue Zhang,Wenqiang Dai,Xiaoqiang Cai
标识
DOI:10.1080/00207543.2023.2223701
摘要
This paper studies the multiple period inventory replenishment problem for a capacitated warehouse when procurement prices and market demands are both uncertain, with the goal to minimise the procuring and holding costs. We analyse this problem under the framework of competitive analysis, where neither probabilistic distributions nor sets are available to characterise the unknown price and demand parameters. An efficient online real-time replenishment algorithm is developed, which is free of any distribution assumption, and the decisions are made based entirely on past and present information. We derive an instance-independent competitive ratio of the algorithm, which provides a worst-case theoretical performance guarantee, and shows that the proposed algorithm performs well for situations with high volatility uncertainty over time and is naturally risk-averse. Finally, a set of numerical experiments further verifies the effectiveness of the algorithm.
科研通智能强力驱动
Strongly Powered by AbleSci AI