Abstract
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.
This research is supported by NSF of China under Grants 70525004, 10371094 and 70471035.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Corley, H.W., Sha, D.Y.: Most vital links and nodes in weighted networks. Operation Research Letters 1, 157–161 (1982)
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)
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)
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)
Nardelli, E., Proietti, G., Widmyer, P.: Finding the most vital node of a shortest path. Theoretical Computer Science 296, 167–177 (2003)
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)
Bhosle, A.M.: Improved algorithms for replacement paths problems in restricted graphs. Operations Research Letters 33, 459–466 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xu, Y., Yan, H. (2006). Real Time Critical Edge of the Shortest Path in Transportation Networks. In: Cai, JY., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2006. Lecture Notes in Computer Science, vol 3959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11750321_19
Download citation
DOI: https://doi.org/10.1007/11750321_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34021-8
Online ISBN: 978-3-540-34022-5
eBook Packages: Computer ScienceComputer Science (R0)