摘要
研究随机需求的供应链分销网络设计问题。考虑供应商可以选择所服务的零售商,且供应商通过定价决策确定所服务的零售商。针对此问题,建立了一个非线性整数规划模型和一个等价的集合包裹模型,并利用列生成算法求解集合包裹模型,同时提出一种O(n3logn)时间的算法求解列生成算法中产生的子问题。数值计算表明,本文所提出的算法具有很好的最优性和可行性。
In this paper , we consider a supply chain distribution network design problem with stochastic demand . We assume that the company can choose whether to satisfy each potential retailer＇s demand , and determine which retailers to serve by the pricing decision .We formulate this problem as a nonlinear integer programming model , and a set-packing model , respectively .We solve the relaxation problem of the set-packing model via column gen-eration , and also introduce an algorithm to solve the sub-problem that arises from the column generation proce-dure in O（ n3 logn） time.Computational results show that the algorithm proposed in this paper is very efficient and effective.
出处
《运筹与管理》
CSSCI
CSCD
北大核心
2014年第6期102-107,共6页
Operations Research and Management Science
基金
国家自然科学基金资助项目(71071033)
关键词
供应链
分销网络
收益最大化
集合包裹模型
列生成
supply chain
distribution network
profit-maximizing
set-packing model
column generation
