덩굴망 통행패턴을 고려한 One-To-One 다경로알고리즘

An One-To-One K-Shortest Path Algorithm Considering Vine Travel Pattern

  • 이미영 (위스콘신대학교 토목환경공학부) ;
  • 유기윤 (서울대학교 지구환경시스템공학부) ;
  • 김정현 (한양대학교 토목환경공학부) ;
  • 신성일 (서울시정개발연구원 도시교통연구부)
  • 발행 : 2003.01.01

초록

회전제약(Turn Penalty and Prohibition)을 포함하는 방향성 그래프(Directed Graph)에서 두 지점(One-To-One)간 덩굴망(Vine)을 포함한 다수의 경로를 순차적으로 탐색하는 알고리즘(K-Shortest Path Algorithm)을 제안한다. 이를 위해 Yen이 제안한 다경로탐색알고리즘을 기반으로 교차로의 방향별 통행에서 발생되는 회전지체와 금지의 표현이 가능한 링크표지(Link-Labeled)탐색방식을 적용하는 기법을 개발한다. 사례연구를 통해 제안된 알고리즘은 교차로의 회전특성뿐만 아니라 U-Turn, P-Turn과 같은 덩굴망(Vine) 통행특성의 고려가 가능하며, 운전자의 인지비용(Perceived Cost)을 반영한 합리적인 대안경로(Reasonable Alternative Route)의 정보 제공 가능성을 입증했다.

Considering a path represented by a sequence of link numbers in a network, the vine is differentiated from the loop in a sense that any link number can be appeared in the path only once, while more than once in the loop. The vine provides a proper idea how to account for complicated travel patterns such as U-turn and P-turn witnessed nearby intersections in urban roads. This paper proposes a new algorithm in which the vine travel pattern can be considered for finding K number of sequential paths. The main idea of this paper is achieved by replacing the node label of the existing Yen's algorithm by the link label technique. The case studies show that the algorithm properly represent the vine travel patterns in searching K number of paths. A noticeable result is that the algorithm may be a promising alternative for ITS deployment by enabling to provide reasonable route information including perceived traveler costs.

키워드

참고문헌

  1. 김익기(1998). ATIS를 위한 수정형 덩굴망 최단경로 탐색 알고리즘의 개발, 대한교통학회지, 제16권 제2호, 대한교통학회, pp.157-167
  2. 노정현. 남궁성(1995), 도시가로망에 적합한 최단경로탐색 기법의 개발, 대한국토계획학회지, 제30권, 제5호
  3. 최기주(1995) U-Turn을 포함한 가로망 표현 및 최단경로의 구현, 대한교통학회지, 제13권 제3호, 대한교통학회. pp.35-52
  4. 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 https://doi.org/10.1016/0377-2217(93)90095-5
  5. Bellman R.(1957) Dynamic Programming, Princeton University Press, Princeton, New Jersey
  6. Bellman R. and Kalaba R. (1968) On Kth Best Policies. J. SIAM 8, pp.582-588
  7. 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 https://doi.org/10.1016/0377-2217(90)90318-6
  8. 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
  9. Dijkstra E. W.(1959) A Note of Two Problems in Connected with Graphs. Numerical Mathematics. I, pp.269-271
  10. Dreyfus S. E.(1969) An Appraisal of Some Shortest-Path Algorithms, Operational Research, Vol.17, No.3, pp.395-412 https://doi.org/10.1287/opre.17.3.395
  11. 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 https://doi.org/10.1145/320998.321004
  12. 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 https://doi.org/10.1016/S0041-1647(69)80022-5
  13. Martins E. Q. V. (1984) An Algorithm for Ranking Paths that May Contain Cycles, European Journal of Operational Research, Vol.18, pp.123-130 https://doi.org/10.1016/0377-2217(84)90269-8
  14. Moore E. F. (1957) The Shortest Path through A Maze. Proc. Int. Conf. on the Theory of Switching. Harvard Univ., Cambridge, MA.
  15. Pollack M,(1961) The Kth Best Route Through A Network, Operations Research, Vol.9, pp.578-580 https://doi.org/10.1287/opre.9.4.578
  16. 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
  17. Shier R. D. (1979) On Algorithms from Finding the k Shortest Paths in a Network, Networks, Vol.9, pp.195-214 https://doi.org/10.1002/net.3230090303
  18. Thomas R.(1991) Traffic Assignment Techniques, Avebury Technical
  19. Van Vliet D.(1978) Improved Shortest Path Algorithms from Transport Networks, Transportation Research, Vol.12, pp.7-20 https://doi.org/10.1016/0041-1647(78)90102-8
  20. Yen J. Y.(1971) Finding the K shortest Loopless Paths in a Network, Management Science, Vol.17, pp.711-715
  21. 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