An One-To-One K-Shortest Path Algorithm Considering Vine Travel Pattern |
Lee, Mee-Young
(위스콘신대학교 토목환경공학부)
Yu, Ki-Yun (서울대학교 지구환경시스템공학부) Kim, Jeong-Hyun (한양대학교 토목환경공학부) Shin, Seong-Il (서울시정개발연구원 도시교통연구부) |
1 | 노정현. 남궁성(1995), 도시가로망에 적합한 최단경로탐색 기법의 개발, 대한국토계획학회지, 제30권, 제5호 |
2 | Azevedo J. A., Costa M. E. O. S., Madeira J.J.E.R.S., and Martins E.Q.V.(1993) An Algorithm from the Ranking of Shortest Paths, European Journal of Operational Research, Vol.69, pp.97-106 DOI ScienceOn |
3 | Kirby R. F. and Potts R. B.(1969) The Minimum Route Problem for Networks with Turn Penalties and Prohibitions. Transportation Research 3, pp.397 -408 DOI ScienceOn |
4 | Pollack M,(1961) The Kth Best Route Through A Network, Operations Research, Vol.9, pp.578-580 DOI ScienceOn |
5 | Shier R. D. (1979) On Algorithms from Finding the k Shortest Paths in a Network, Networks, Vol.9, pp.195-214 DOI ScienceOn |
6 | Van Vliet D.(1978) Improved Shortest Path Algorithms from Transport Networks, Transportation Research, Vol.12, pp.7-20 DOI ScienceOn |
7 | 김익기(1998). ATIS를 위한 수정형 덩굴망 최단경로 탐색 알고리즘의 개발, 대한교통학회지, 제16권 제2호, 대한교통학회, pp.157-167 과학기술학회마을 |
8 | Moore E. F. (1957) The Shortest Path through A Maze. Proc. Int. Conf. on the Theory of Switching. Harvard Univ., Cambridge, MA. |
9 | Dijkstra E. W.(1959) A Note of Two Problems in Connected with Graphs. Numerical Mathematics. I, pp.269-271 |
10 | Ziliaskopoulos A. K. and Mahmassani H. S.(1996) A Note on Least Time Path Computation Considering Delays and Prohibitions for Intersection Movements. Transportation Research 30B, pp.359-367 |
11 | Rilett L. R. and Park D.(1996) Identifying Unique Routes in Transportation Networks, Presented at the 3rd Annual World Congress on Intelligent Transportation Systems, Orlando, Florida, October |
12 | Thomas R.(1991) Traffic Assignment Techniques, Avebury Technical |
13 | 최기주(1995) U-Turn을 포함한 가로망 표현 및 최단경로의 구현, 대한교통학회지, 제13권 제3호, 대한교통학회. pp.35-52 과학기술학회마을 |
14 | Dreyfus S. E.(1969) An Appraisal of Some Shortest-Path Algorithms, Operational Research, Vol.17, No.3, pp.395-412 DOI ScienceOn |
15 | Carraway R. L., Morin T. L., and Moskowitz H.(1990) Generalized Dynamic Programming for Multicriteria Optimization, European Journal of Operational Research, Vol.44, pp.95-104 DOI ScienceOn |
16 | Bellman R.(1957) Dynamic Programming, Princeton University Press, Princeton, New Jersey |
17 | Bellman R. and Kalaba R. (1968) On Kth Best Policies. J. SIAM 8, pp.582-588 |
18 | Hoffman W. and Pavley R.(1959) A Method for the Solution of the Nth Best Problem, Journal of ACM, Vol.6, No.4, pp.506-514 DOI |
19 | Martins E. Q. V. (1984) An Algorithm for Ranking Paths that May Contain Cycles, European Journal of Operational Research, Vol.18, pp.123-130 DOI ScienceOn |
20 | Clarke S., Krikorian A., and Rausan J.(1963) Computing the N Best Loopless Paths in A Network, Journal of SIAM, Vol.11, No.4, pp.1096-1102 |
21 | Yen J. Y.(1971) Finding the K shortest Loopless Paths in a Network, Management Science, Vol.17, pp.711-715 |