期刊文献+

需求不确定的服务设施网络设计模型鲁棒性研究 被引量:11

Robust Research on Service Facility Network Design Problem with Demand Uncertainty
下载PDF
导出
摘要 由于选址决策的长期性,参数面临随机波动,在选址问题中考虑不确定因素至关重要。在选址模型中提出一种新的鲁棒方法,采用有界对称的"盒子"作为不确定需求的集合,通过调节不确定预算,来权衡解的鲁棒性与系统成本之间的关系。利用该方法得到的鲁棒模型不仅能够转化成线性规划,并且可以计算出设施的最低服务水平。然后,设计禁忌搜索算法来求解该问题,数值算例的结果表明了算法的有效性。最后,分析了不同鲁棒水平下,服务设施网络不同的拓扑结构,并得到服务水平与成本之间的权衡关系。同时对需求扰动作了敏感性分析,结果表明随着服务水平的提高,成本对需求扰动越来越敏感。 Based on long-term facility location decisions and potential parameter variations, it is important to con- sider uncertainty in facility location modeling. Supposing the uncertain demands are within a bounded and sym- metric multi-dimensional box,we present a novel robust approach to the service facility network design problem. The trade-offs between the robustness of the solution and the cost can be done by adjusting the budget of uncer- tainty. The model can be transformed into a linear programming and the service level of the facility can also be computed. An algorithm based on Tabu Search is designed to solve the problem. Numerical examples validate the effectiveness of the algorithm. Finally, we use a numerical example to illustrate the different network topology under different robustness level, and the trade-offs between the service level and the cost is analyzed. In addi- tion, we make a sensitivity analysis of the deviation of the demand. The results show that with the improvement of the service level, the cost gets more and more sensitive to deviation.
作者 刘慧 杨超
出处 《运筹与管理》 CSSCI CSCD 北大核心 2016年第1期117-125,共9页 Operations Research and Management Science
基金 国家自然科学基金重大国际合作项目(71320107001) 教育部人文社会科学研究青年基金项目(15YJC630074)
关键词 运筹学 服务设施选址 鲁棒性 服务水平 operation research service facility location robustness service level
  • 相关文献

参考文献22

  • 1Averbakh I, Berman O. Minimax regret p-center location on a network with demand uncertainty [ J ]. Location Science, 1997, 5(4) : 247-254.
  • 2Awrbakh I, Berman O. Algorithms for the robust 1-center problem on a tree[ J]. European Journal of Operations Research, 2000, 123(2): 292-302.
  • 3Averbakh I, Berman O. Minimax regret median location on a network under uncertainty [ J]. INFORMS Journal Computing, 2000, 12(2): 104-110.
  • 4Snyder L V, Daskin M S. Stochastic p-robust location prob lems [ J ]. IIE Transaction, 2006, 38 ( 11 ) : 971-985.
  • 5胡丹丹,杨超.α-鲁棒随机截流选址问题的模型和算法[J].中国管理科学,2008,16(6):87-94. 被引量:10
  • 6田俊峰,杨梅,岳劲峰.具有遗憾值约束的鲁棒供应链网络设计模型研究[J].管理工程学报,2012,26(1):48-55. 被引量:27
  • 7Daskin M S, Hesse S M, ReVelle C S. A-reliable p-minimax regret: a new model for strategic facility location modeling[ J]. Location Science, 1997, 5 (4) : 227-246.
  • 8Chen G, Daskin M S, Shen M, Uryasev S. The a-reliable mean-excess regret model for stochastic facility location modeling[ J]. Naval Research Logistics, 2006, 53 (7) : 617-626.
  • 9Lin C K Y, Stochastic single-source capacitated facility location model with service level requirements[ J]. International Journal of Production Economics, 2009, 117 (2) : 439-451.
  • 10Baron O, Milner J, Naseraldin H. Facility location: a robust optimization approach[ J]. Production and Operations Management, 2011, 20 (5) : 772-785.

二级参考文献59

共引文献32

同被引文献86

引证文献11

二级引证文献89

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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