期刊文献+

具有遗憾值约束的鲁棒供应链网络设计模型研究 被引量:27

Research on Supply Chain Network Design Model with Regret Value
在线阅读 下载PDF
导出
摘要 考虑不确定性环境,研究战略层次的供应链网络鲁棒设计问题,目标是设计参数发生摄动时,供应链性能能够保持稳健性。基于鲁棒解的定义,建立从上游供应商选择到下游设施选址-需求分配的供应链网络设计鲁棒优化模型;提出确定遗憾值限定系数上限和下限的方法,允许决策者调节鲁棒水平,选择多种供应链网络结构;通过模型分解与协调,设计了供应链节点配置的禁忌搜索算法。算例的计算结果表明了禁忌搜索算法具有良好的收敛特性,以及在处理大规模问题上的优越性;同时也反映了利用鲁棒优化模型进行供应链网络设计,可以有效规避投资风险。 Based on estimated potential customer demand, a company selects its suppliers from qualified candidates, determines locations, capacities in its manufacturing plants and distribution centers, and decides the transportations among them and to customers. A successful supply chain network design, which enables company to integrate its suppliers, plants, distribution centers, and the customer zones efficiently, provides sufficient flexibility in future operations in the dynamic markets, and keeps construction, purchasing, transportation, and operations costs at a reasonable low level, eventually reinforces a company's long term competitiveness.
出处 《管理工程学报》 CSSCI 北大核心 2012年第1期48-55,共8页 Journal of Industrial Engineering and Engineering Management
基金 教育部人文社会科学研究青年基金资助项目(07JC630039) 国家自然科学基金面上资助项目(71072171) 西南财经大学工商管理学院“211工程”三期建设项目 西南财经大学青年教师成长资助项目(211QN09006)
关键词 供应链网络设计 鲁棒优化 禁忌搜索 遗憾值 supply chain network design robust optimization tabu search regret value
  • 相关文献

参考文献29

  • 1Lawrence V.Snyder.Facility location under uncertainty:a review[J].IIE Transactions.2006,38:537-554.
  • 2MirHassani SA,Lucas C,Mitra G.,Messina E,Poojari CA.Computational solution of capacity planning models underuncertainty,Parallel Computing.2000,26:511-538.
  • 3Tsiakis P,Shah N,Pantelides,C.C.Design of multi-echelonsupply chain networks under demand uncertainty,Industrial andEngineering Chemistry Research 2001,40:3585-3604.
  • 4Alonso-Ayuso A,Escudero LF,Garin A,Ortuno MT,Perez G.Anapproach for strategic supply chain planning under uncertaintybased on stochastic 0-1 programming.Journal of GlobalOptimization,2003,26:97-124.
  • 5Santoso T,Ahmed S,Goetschalckx M,Shapiro A.A stochasticprogramming approach for supply chain network design underuncertainty.European Journal of Operational Research,2005,167:96-115.
  • 6Poojari CA,Lucas C,Mitra G.Robust solutions and risk measuresfor a supply chain planning problem under uncertainty.Journal ofthe Operational Research Society,2008,59(1):2-12.
  • 7Mausser HE,Laguna M.A new mixed integer formulation for themaximum regret problem.International Transactions in OperationalResearch,1998,5(5):389-403.
  • 8Mausser HE,Laguna M.Minimising the maximum relative regretfor linear programmes with interval objective function coefficients.Journal of the Operational Research Society,1999a,50(10):1063-1070.
  • 9Mausser HE,Laguna M.A heuristic to minimax absolute regret forlinear programs with interval objective function coefficients.European Journal of Operational Research,1999b,117:157-174.
  • 10Averbakh I,Berman O.Minmax regret median location on anetwork under uncertainty,INFORMS Journal on Computing.2000a,12(2):104-110.

二级参考文献177

共引文献166

同被引文献277

引证文献27

二级引证文献130

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部