期刊文献+

高速铁路长大桥梁救援定点的选址决策模型 被引量:4

Location decision-making model of rescue sites on high speed railway long bridges
在线阅读 下载PDF
导出
摘要 为提高高速铁路的防灾能力,确保救援定点布局经济合理,采用约束最优化法进行长大桥梁救援定点的选址决策.研究分析救援定点选址决策的3个约束条件:设置间距、风险等级和救援时程.以各地方救援部门至救援定点的时程总和最小为目标,建立长大桥梁救援定点的选址决策模型,并对模型进行实例验证.结果表明:当区间桥梁长度大于10 km时,应该沿线路方向每隔约6~10 km设置一处救援定点;应用贝叶斯网络理论评价救援定点备选位置的风险等级和采用Dijkstra算法求解地方救援部门至救援定点之间的最优时程是合理有效的.该模型计算过程简单,评价结果可靠,能够较好地解决长大桥梁救援定点的选址决策问题. To improve the disaster prevention capacity of high speed railway, and ensure the economy and rationality of rescue sites, the constrained optimal method was used to solve the location decision-making of rescue sites on long bridges. Three constraint conditions, including the rescue sites spacing, the risk grading and the rescue time, were researched and analyzed, Least rescue time that relief vehicles reach the rescue sites from the local rescue departments was taken as optimal object, the location decision-making model of rescue sites on long bridge was established, and an example was applied to should set at interval of 6 km to 10 km when the bridge is a feasible method to evaluate the risk grading validate the model. The results show that the rescue site length is longer than 10 km. The Bayesian network theory of the alternative rescue sites, and the Dijkstra algorithm is a good way to determine the optimal path between the local rescue departments and the rescue sites. The present model is simple and reliable, and it could solve the problem of locating rescue sites on long bridges well.
出处 《哈尔滨工业大学学报》 EI CAS CSCD 北大核心 2017年第3期150-154,共5页 Journal of Harbin Institute of Technology
基金 中国中铁股份有限公司科技开发计划项目(重点-70-2010-1)
关键词 高速铁路长大桥梁 救援定点 设置间距 约束最优化 选址决策 high speed railway long bridges rescue sites spacing constrained optimal method location decision-making
  • 相关文献

参考文献5

二级参考文献32

  • 1王立暖,马志富,杨贵生.铁路隧道防灾救援技术研究[J].铁道标准设计,2007,27(z1):50-55. 被引量:27
  • 2周经伦,吴唤群.受顶点数限制的最短路问题及其算法[J].系统工程,1996,14(5):37-44. 被引量:9
  • 3TB10621-2009,高速铁路设计规范(试行)[S].
  • 4SHIMBEL A. Structure in communication nets [ C ]//Proceedings of the Symposium on Information Networks. New York : Polytechnic Press of the Polytechnic Institute of Brooklyn, 1955 : 199 -203.
  • 5DIJKSTRA E W. A note on two problems in connexion with graphs [ J ]. Numerische Mathematik, 1959, 1(1) : 269 -271.
  • 6FREDMAN M L, TARJAN R E. Fibonacci heaps and their uses in improved network optimization problems [J]. Journal of the ACM, 1987, 34(3) : 596 -615.
  • 7NOSHITA K, MASUDA E, MACHIDA H. On the expected behaviors of the Dijkstra' s shortest paths algorithm for complete graph [ J ]. Information Processing Letters, 1978, 7(5): 237-243.
  • 8NOSHITA K. A theorem on the expected complexity of Dijkstra' s shortest paths algorithm[ J]. Journal of Algorithms, 1985, 6(3) : 400 -408.
  • 9PETTIE S, RAMACHANDRAN V. Computing shortest paths with comparisons and additions [ C ]//Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia : Society for Industrial and Applied Mathematics, 2002 : 267 - 276.
  • 10PETRIE S, RAMACHANDRAN V. A shortest path algorithm for real-weighted undirected graphs [ J ]. SIAM Journal on Computing, 2005, 34(6) : 1398 -1431.

共引文献44

同被引文献42

引证文献4

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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