Real Time Critical Edge of the Shortest Path in Transportation Networks

  • Yinfeng Xu
  • Huahai Yan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3959)


In transportation networks, a vehicle always travels longer than the shortest path due to sudden edge failure caused by unexpected events such as accident. In this situation, which edge failure results in the maximum of the travel distance between the source node and the destination node? If we know the edge, we can reduce the transportation cost and improve the networks structure. Regarding this problem, the most vital edge (MVE) problem considers in a global view and from the perspective of static decision-making based on complete information, while the longest detour (LD) problem solves in a local view and in terms of real time. This paper reconsiders this problem in a global view and in terms of real time. We propose the real time critical edge (RTCE) problem of the shortest path, and present an O(n 2) time algorithm by constructing the shortest path tree. Then, by giving a numerical example of urban transportation networks, we compare the results of MVE, LD and RTCE, and conclude that the RTCE problem has more practical significance.


Real Time Critical Edge The Shortest Path Algorithm Transportation Networks 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Corley, H.W., Sha, D.Y.: Most vital links and nodes in weighted networks. Operation Research Letters 1, 157–161 (1982)zbMATHCrossRefMathSciNetGoogle Scholar
  2. Malik, K., Mittal, A.K., Gupta, S.K.: The k most vital arcs in the shortest path problem. Operation Research Letters 8, 223–227 (1989)zbMATHCrossRefMathSciNetGoogle Scholar
  3. Nardelli, E., Proietti, G., Widmyer, P.: A faster computation of the most vital edge of a shortest path between two nodes. Information Processing Letters 79(2), 81–85 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  4. Nardelli, E., Proietti, G., Widmyer, P.: Finding the detour critical edge of a shortest path between nodes. Information Processing Letters 67(1), 51–54 (1998)CrossRefMathSciNetGoogle Scholar
  5. Nardelli, E., Proietti, G., Widmyer, P.: Finding the most vital node of a shortest path. Theoretical Computer Science 296, 167–177 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  6. Li, Y., Guo, Y.: Study on vital edges of shortest paths in traffic and transportation networks. Chinese Journal of Management Science 12(4), 69–73 (2004)Google Scholar
  7. Bhosle, A.M.: Improved algorithms for replacement paths problems in restricted graphs. Operations Research Letters 33, 459–466 (2005)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Yinfeng Xu
    • 1
    • 2
  • Huahai Yan
    • 1
  1. 1.School of ManagementXi’an Jiaotong UniversityXi’anP.R. China
  2. 2.The State Key Lab for Manufacturing Systems EngineeringXi’anP.R. China

Personalised recommendations