报童模式
计算机科学
钥匙(锁)
运筹学
服务提供商
服务(商务)
供应链
库存管理
数据库事务
服务水平
配送中心
数据中心
动态规划
线性规划
资源配置
供应链管理
资源(消歧)
数学优化
整数规划
库存控制
分布(数学)
交易成本
动态定价
存货理论
流量网络
生产(经济)
还原(数学)
价值(数学)
特征(语言学)
作者
Chenxi Li,Aiqi Zhang,Sheng Liu,Wei Min Qi,Lun Ran,Peng Wu
标识
DOI:10.1177/10591478261483367
摘要
How should retailers and sellers distribute inventory across a large network of (potentially hundreds of) distribution centers? Motivated by the emerging challenges of inventory allocation facing volatile demand, we develop distributionally robust network inventory management policies with cross-fulfillment using a scenario-based approach that is adaptable to feature information and demand correlation. We analytically demonstrate the value of scenario modeling for a two-location newsvendor problem. The key technical development is a computationally efficient linear programming formulation for large networks, which we further incorporate into a dynamic inventory policy combined with look-ahead approximation. We validate the superior performance of the proposed policies using real-world transaction data from a leading logistics service provider and a major retailer in China. The developed policy outperforms existing data-driven approaches and can save up to 19% of operating costs over the current policy employed by the company.
科研通智能强力驱动
Strongly Powered by AbleSci AI