1 |
E.W. DIJKSTRA, "A Note on Two Problems in Connexion with Graphs", Numerische Mathematik1, pp.269-271, 1959.
DOI
ScienceOn
|
2 |
Orda, A. and Rom, R. , "Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length", journal of the ACM 37, pp.607-625, 1990.
DOI
|
3 |
Kaufman, E. , Lee, J. and Smith, R. L. , "Fastest paths in time-dependent networks for intelligent vehicle highway systems application", IVHS journal 1(1), pp.1-11, 1993.
|
4 |
Ziliaskopoulos, A.K. and Mahassani, H.S. ,"Time-dependent, shortest-path algorithms for real-time intelligent vehicle system applications", Transportation Research Record 1408, TRB, National Research Council, Washington DC, pp.94-100, 1993.
|
5 |
Chabini, I. ,"A new algorithm for shortest-path in discrete dynamic networks", Proceeding of the 8th International Federation of Automatic Control Symposium on transportation Systems, Vol. 2, eds M. Papageorgiu and A. Pouliezos, pp.551-556, 1997.
|
6 |
Hall, R. ,"The fastest path through a network with random time-dependent travel time", Transportation Science 20(3), pp182-188, 1986.
DOI
ScienceOn
|
7 |
Ryu, Yeong-Geun, "A Study on the Forecasting of Bus Travel Demand and the Method of Determining Optimal Bus Network", Ph. D. Thesis, Yeong Nam University, pp.131-140, 1996.
|
8 |
Lipimg Fu and L. R. Rilett, "Expected shortest paths in dynamic and stochastic traffic networks", Transportation Research Part B, vol 32, no 7, pp.499-516, 1998.
DOI
ScienceOn
|
9 |
Taehyeong Kim, Taehyeong Kim, Bum-Jin Park, Hyoungsoo Kim, "Development of One-to-One Shortest Path Algorithm Based on Link Flow Speeds on Urban Networks ", The Journal of The Korea Institute of Intelligent Transport Systems , vol 11, no 5, pp.38-45, 2012.
과학기술학회마을
DOI
ScienceOn
|