Expected Shortest Paths in Dynamic and Stochastic Traf c Networks
暂无分享,去创建一个
[1] Hani S. Mahmassani,et al. Time dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications , 1993 .
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] Robert L. Smith,et al. Fastest Paths in Time-dependent Networks for Intelligent Vehicle-Highway Systems Application , 1993, J. Intell. Transp. Syst..
[4] Ismail Chabini,et al. A New Algorithm for Shortest Paths in Discrete Dynamic Networks , 1997 .
[5] Sheldon M. Ross. Introduction to Probability Models. , 1995 .
[6] William L Eisele,et al. ITS DATA MANAGEMENT SYSTEM: YEAR ONE ACTIVITIES , 1997 .
[7] Richard Bellman,et al. ON A ROUTING PROBLEM , 1958 .
[8] Douglas R. Shier,et al. On algorithms for finding the k shortest paths in a network , 1979, Networks.
[9] Laurence Russel Rilett. MODELLING OF TRAVTEK'S DYNAMIC ROUTE GUIDANCE LOGIC USING THE INTEGRATION MODEL , 1992 .
[10] Stuart E. Dreyfus,et al. An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..
[11] Pitu B. Mirchandani,et al. Shortest distance and reliability of probabilistic networks , 1976, Comput. Oper. Res..
[12] Ariel Orda,et al. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990, JACM.
[13] Randolph W. Hall,et al. The Fastest Path through a Network with Random Time-Dependent Travel Times , 1986, Transp. Sci..
[14] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[15] Ronald Prescott Loui,et al. Optimal paths in graphs with stochastic or multidimensional weights , 1983, Commun. ACM.
[16] H. Frank,et al. Shortest Paths in Probabilistic Graphs , 1969, Oper. Res..
[17] Sumit Sarkar,et al. A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems , 1996, Transp. Sci..