期刊文献+

相异路径选择问题的模型与仿真结果研究 被引量:1

Models and Algorithms for Dissimilar Path Routing Problem and Simulations
下载PDF
导出
摘要 相异路径选线问题考虑的是 ,给定一运输网络和源宿接点 ,找出源宿节点之间在空间上有差异的路径。多个相异路径对于军事后勤供应、有害物品运输等在异常情况 (如原来的最佳线路因气候等原因不可用 )下的决策 ,具有重要意义。本文着重对四种生成空间相异路径的算法进行了分析和评价 ,并构建了基于边的通道最短路的相异路径的算法。在此基础上 ,主要对 IRM,GSP和EGSP给出了仿真实验计算结果 ,通过对结果的分析 。 The dissimilar path routing problem is to find out spatial dissimilar paths between two specific source and destination nodes for a given transportation network. Many decisions, in military logistics, hazardous materials transportation, and so on, especially in abnormal weather conditions, can be modeled as this problem. On the basis of the analysis and evaluation of the IPM and GSP models and algorthms for the problem discussed in the paper, EGSP models and algorithms are introduced. According to the statistics of the simulation, several related factors that affect the efficiency of the algorithms are found out.
出处 《运筹与管理》 CSCD 2001年第4期27-34,共8页 Operations Research and Management Science
基金 国家自然科学基金资助项目 ( NO.7980 0 0 4 )
关键词 选线 相异路径 模型 仿真 routing dissimilar paths models simulation
  • 相关文献

参考文献10

  • 1Kuby M, X. Zhongyi, X. Xiaodong. A Minimax method for finding the k best differentiated paths[J]. Geographical Analysis. Vol. 29, No. 4, pp. 298-313.
  • 2Lombard K. , Church R L. The gateway shortest path problem : generating alternative routes for a corridor location problem[J]. Geographical Systems, Vol. 1 ,pp25-45.
  • 3Ahjia R K, et al. Network flows :theory, algorithms, and applications[M]. Rentive-Hall, Englewood Cliffs, NJ.
  • 4Yen J Y. Finding the k shortest loopless paths in a newwork[J]. Management Science. Vol. 17,No11,pp712-716.
  • 5Miaou S P, Chin S. M. Computing k-shortest path for nuclear spent fuel highway transportation[J]. European Journal of Operational Research. Vol. 53. pp64-80.
  • 6Shier D R. On algorithms for finding the k shortest paths in a network[J]. Networks. Vol. 17. pp341-352.
  • 7Kuby M. Programming models for facility dispersion:the p-dispersion and maxisum dispersion problems. Geographical Analysis. Vol. 19,No. 4, pp. 315-329.
  • 8Erkut E. The discrete p-dispersion problem[J]. European Journal of Operational Research. Vol. 46. pp. 48-60.
  • 9Ruphail N M et al. A DSS for dynamic pre-trip route planning[A]. Applications of Advanced Technologies in Transportation Engineering :Proc. of the 4th Intl. Conference[C]. pp. 325-329.
  • 10Akgun Vedat, Erkut Erhan. On finding disimilar paths[J]. European Journal of Operational Research, 121(2000)232-246.

同被引文献7

引证文献1

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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