数学优化
约束(计算机辅助设计)
计算机科学
集合(抽象数据类型)
服务水平
整数规划
线性规划
供应链
服务(商务)
网络规划与设计
运筹学
数学
经济
几何学
统计
经济
程序设计语言
法学
计算机网络
政治学
作者
Yongzhen Li,Jia Shu,Miao Song,Jiawei Zhang,Huan Zheng
出处
期刊:Informs Journal on Computing
日期:2017-04-05
卷期号:29 (2): 287-300
被引量:16
标识
DOI:10.1287/ijoc.2016.0730
摘要
In this paper, we study a multisourcing supply network design problem, in which each retailer faces uncertain demand and can source products from more than one distribution center (DC). The decisions to be simultaneously optimized include DC locations and inventory levels, which set of DCs serves each retailer, and the amount of shipments from DCs to retailers. We propose a nonlinear mixed integer programming model with a joint chance constraint describing a certain service level. Two approaches—set-wise approximation and linear decision rule-based approximation—are constructed to robustly approximate the service level chance constraint with incomplete demand information. Both approaches yield sparse multisourcing distribution networks that effectively match uncertain demand using on-hand inventory, and hence successfully reach a high service level. We show through extensive numerical experiments that our approaches outperform other commonly adopted approximations of the chance constraint.
科研通智能强力驱动
Strongly Powered by AbleSci AI