Abstract
We consider the priori expected shortest path problem from a single origin to a single destination for each departure time in stochastic and time-dependent networks. Such problem requires more than standard shortest path techniques. First, we transform this problem into the problem of systemic reliability, and identify a weaker consistent reliability condition that insures the validity of generalized dynamic-programming method based on reliability priority. Furthermore, we propose a new dominance discriminance, which makes the parameter in traditional discriminance drop from two dimensions to one dimension and reduces the possibility of not doing dominance compare among paths. Finally, we present the expected life shortest path algorithm.
This work was supported in part by Grand 99025 of Ministry of Education and Grand 9810200104 of Liaoning Science Foundation, China.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
J.A. Bottom, Anticipatory Consistent Route Guidance, Ph.D.thesis, Massachusetts Institute of Technology, Step, 2000.
Song Gao; Chabini, I. Optimal routing policy problems in stochastic time-dependent networks part I: framework and taxonomy. Intelligent Transportation Systems, 2002. Proceedings. The IEEE 5th International Conference on, 2002.Page(s): 549–554.
Christos Alexopoulos, “State Space Partitioning Methods for Stochastic Shortest Path Problems,” Networks, vol. 30, no. 1, 1997, pp. 9–21.
Tan Guozhen, Gao Wen. Shortest path algorithm in time-dependent networks. Chinese J.Computers, 2002, 25(2) 165–172 (in Chinese).
R.W. Hall, “The fastest path through a network with random time-dependent travel times”, Transportation Science, vol.20, no.3, pp.91–101, 1986.
Michael P. Wellman, Matthew Ford, and Kenneth Larson, “Path Planning under Time-Dependent Uncertainty, ” Proc. Eleventh Conf. On Uncertainty in Artificial Intelligence, Aug. 1995, pp. 532–539.
Justin Boyan and Michael Mitzenmacher.Improved Results for Route Planning in Stochastic Transportation Network. SODA. 2001.
D. Stoyan. Comparison Methods for Queues and Other Stochastic Models. John Wiley and Sons, New York, 1983.
S. Ross. Stochastic Process. John Wiley and Sons, New York, 1983.
TAN Guo-zhen and XIA Xiang-fu. Algorithms for routing in stochastic and time-dependent networks based on reliability theory. Research report of Dept. of Computer Science and Engineering, Dalian University of Technology. No 200201.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tan, Gz., Xia, Xf., Gao, W. (2003). Reliability Theory Model and Expected Life Shortest Path in Stochastic and Time-Dependent Networks. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J.J., Zomaya, A.Y. (eds) Computational Science — ICCS 2003. ICCS 2003. Lecture Notes in Computer Science, vol 2660. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44864-0_85
Download citation
DOI: https://doi.org/10.1007/3-540-44864-0_85
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40197-1
Online ISBN: 978-3-540-44864-8
eBook Packages: Springer Book Archive