期刊文献+

交通运输网络最短路径关键边问题研究 被引量:28

Study on Vital Edges of Shortest Paths in Traffic and Transportation Network
在线阅读 下载PDF
导出
摘要 因自然灾害、运输组织等原因,造成道路与铁路运输网络线路中断、车站枢纽车流堵塞的现象普遍存在。本文就运输网络模型及最短路径关键边问题进行了分析研究,并给出了求解运输路径关键边的算法,对预防灾害、优化运输组织、降低因关键边(线路)中断而造成的损失、提高运输效率提供了科学的量化依据。 It often exists that roads or railway lines are broken,stations or hubs are blocked because of natural calamity or improper transportation organization.In the paper,the transportation network model and vital edges are studied.An algorithm of calculating vital edges is given.It provides scientific basis for raising transportation efficiency and reducing the loss caused by vital lines broken.
机构地区 西南交通大学
出处 《中国管理科学》 CSSCI 2004年第4期69-73,共5页 Chinese Journal of Management Science
基金 国家自然科学基金资助项目(70071028)
关键词 交通运输网络 生成树 关键边 运输路径 traffic and transportation network spanning tree vital edge transportation path
  • 相关文献

参考文献8

  • 1B.V.Cherkassky,Andrew V.Goldbergy,Tomasz Radzik.Shortest paths algorithms:Theory and experimental evaluation[J].Mathematical programming,1996,73:129-174.
  • 2H.W.Corley,D.Y.Sha.Most vital links and nodes in weighted networks[J].Oper Res Letters,1982,(1):157-160.
  • 3M.O.Ball,B.L.Golden,R.v.Vohra.Finding the most vital arcs inanetwork[J].Oper.Res.Lett.1988,(8):73-76.
  • 4E.Nardlli,G.Proietti,P.Widmayer.Finding the detour-critical edge of a shortest path between nodes[J].Infor Proc Letters,1998,67(1):51-54.
  • 5E.Nardelli,G.Proietti,P.Widmyer.A faster computation of the most vital edge of a shortest path between two nodes.Inform.Process.Lett.2001,79(2):81-85.
  • 6E.Nardelli,G.Projetti,P.Widmayer.Finding the most vital node of a shortest path[J].Theoretical computer science 2003,296:167-177.
  • 7陈光亭.无向网络中最短路的最关键边问题[J].杭州电子工业学院学报,2002,22(1):48-50. 被引量:2
  • 8李引珍.路网上货运路径的计算[J].铁道学报,1997,19(3):14-18. 被引量:3

二级参考文献9

  • 1团体著者,铁路货物运价规则,1996年
  • 2滕传琳,管理运筹学,1986年
  • 3H W Corley,D Y Sha.Most vital links and nodes in weighted networks[J].Oper Res Letters,1982,(1): 157-160.
  • 4M O Ball,B L Golden,R V Vohra.Finding the most vital arcs in a network[J].Oper Res Letters,1989,(8): 873-76.
  • 5K Malik,A K Mittal,S K Gupta.The k most vital arcs in the shortest path problem[J].Oper Res Letters,1989,(8):223-227.
  • 6E Nardelli,G Proietti,P Widmayer.Finding the detour-critical edge of a shortest path between two nodes[J].Info Proc Letters,1998,67(1)51-54.
  • 7R E Tarjan,Efficiency of a good but not linear set union algorithm[J].Journal of the ACM,1975,(22):215-225.
  • 8E Nardelli,G Proietti,P Widmayer.Finding the most vital node of a shortest path[C].Lecture Notes in Computer Science 2108,Aug.2001,278-287.
  • 9M L Fredman,R E Tarjan.Fibonacci heaps and their uses in improved network optimization algorithms[J].Journal of the ACM,1987,34(3):596-615.

共引文献3

同被引文献224

引证文献28

二级引证文献128

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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