期刊文献+

应急服务设施轴辐网络布局的λ-鲁棒优化 被引量:9

λ-Robust Optimization of Emergent Service Facilities Huband-Spoke Network Response for Large-Scale Emergency
原文传递
导出
摘要 以不确定环境下的应急服务设施选址-分配问题为研究对象,依据应对重大突发事件应急服务设施选址布局的特点,构建了应急服务设施单分配集覆盖轴辐网络模型,在此基础上,综合考虑各类不确定性因素,提出了应急服务设施轴辐网络布局的双重λ-鲁棒优化模型,即鲁棒解的函数目标值和最远两点的出行时间与各种情景下的最优值之间的偏差分别控制在1λ和2λ之内,使得具有较好条件的候选设施点更易选为枢纽点,同时使最远两点的最大出行时间尽量最小。针对模型特点,设计了改进的遗传算法和鲁棒解求解方法,通过算例数据验证了模型和算法的有效性。 Emergent service facilities location-allocation problem with uncertainty is mainly focused in this paper.Single allocation set covering location model is constructed at first according to the characteristics of large-scale emergencies.Considering the uncertainty of location-allocation problem,double λ-robust optimization of emergent service facilities location-allocation model is proposed based on the model constructed above.The deviations between the function value and the farthest points of travel time in robust solution and these values in optimal solution under various scenarios can not be bigger than λ1 andλ2.So that the candidate selected facilities with good conditions are easier to be selected for hub point,as well as minimize the largest travel time.An improved genetic algorithm and robust solution solving method are studied in this paper and the effectiveness and validity of the model and algorithm is proved by an experiment in the last of this paper.
出处 《工业工程与管理》 北大核心 2010年第6期45-50,57,共7页 Industrial Engineering and Management
基金 国家"985"二期"城市建设与防灾"子项目(985-Ⅱ-CJF-10)
关键词 设施布局 轴辐网络 不确定性 鲁棒优化 facility location hub & spoke networks uncertainty robust optimization
  • 相关文献

参考文献17

  • 1Mulvey J M,Vanderbei R J.Robust Optimization of Largescale Systems[J].Operations Research,1995,43(2):264-281. 被引量:1
  • 2Averbakh I.Minmax regret solutions for minimax optimization problems with uncertainty[J].Operations Research Letters,2003,27(2):57-65. 被引量:1
  • 3Berman O,Wang J,Drezner Z,et al.The minimax and maximin location problems on a network with uniform distributed weights[J].IIE Transactions,2003,35(11):1017-1025. 被引量:1
  • 4Burkard R E,Dollani H.A note on the robust 1-center problem on trees[J].Annals of Operations Research,2002,110(4):69-82. 被引量:1
  • 5Chen B,Lin C S.Minmax-regret robust 1-median location on a tree[J].Networks,1998,31(2):93-103. 被引量:1
  • 6Daskin 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. 被引量:1
  • 7Averbakh I,Berman O.Minimax regret p-center location on a network with demand uncertainty[J].Location Science,1997,5(4):247-254. 被引量:1
  • 8Daniel S,Vladimir M The p-median problem in a changing network:The case of Barcelona[J].Location Science,1998,(6):83-394. 被引量:1
  • 9Guti'erreg G J,Kouvelis P,Kurawarwala A.A robustness approach to uncapacitated network design problems[J].European Journal of Operational Research,1996,94:362-376. 被引量:1
  • 10Averbakh I,Barman O.Algorithrms for the robust 1-center problem on a tree[J].European Journal of OperationalReseareh,2000,123(2):292-302. 被引量:1

二级参考文献25

共引文献34

同被引文献91

引证文献9

二级引证文献41

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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