The Journal of The Korea Institute of Intelligent Transport Systems (한국ITS학회 논문지)

The Korea Institute of Intelligent Transport Systems (한국ITS학회)
권호 표지
DOI QR코드

DOI QR Code

Vine Based Dial Algorithm

덩굴망기반 Dial 알고리즘 연구

  • 이미영 (국토연구원 국토계획.지역연구본부) ;
  • 김종형 (인천발전연구원 교통물류연구실) ;
  • 정동재 (서울대학교 환경대학원 환경계획학과) ;
  • 신성일 (서울연구원 교통시스템연구실)
  • Received : 2018.01.24
  • Accepted : 2018.09.12
  • Published : 2018.10.31
Download PDF
⟨ Previous Next ⟩

Abstract

The Dial Algorithm, based on single link based calculation, is unable to reflect cyclic paths arising in actual urban transportation networks. At the same time, redefining the paths more efficiently can, by strict standards, lead to irrational results stemming from reduction in the size of the network to be analyzed. To solve these two problems of the Dial algorithm, the research herein proposes a vine network method applied to a link based Dial Algorithm, in which the original three step alogrithm is modified into a vine network-based three step process. Also, an analysis of two case study networks show feasible replication of the predicted cyclic path, unrealistic flow, and unsteady transit, as well as alleviation of the problem of irrational path allocation.

Dial 알고리즘의 단일 링크 기반의 연산은 도시교통망에서 나타나는 순환통행에 대한 고려가 근본적으로 불가능하다. 또한, 효율적 경로의 정의는 엄격한 기준으로 분석 네트워크를 축소함으로써 비합리적 결과를 도출할 수도 있다. Dial 알고리즘의 두 가지 문제를 해결하기 위해서 이 연구는 두 개의 링크를 동시에 고려하는 효율적 방향 개념을 도입하고 덩굴망기반의 Dial 알고리즘을 제안한다. 또한 두 가지 예제 네트워크에 대한 사례분석을 통해서 덩굴망기반 Dial 알고리즘이 순환통행, 순환 및 비순환 혼재 통행을 구현할 수 있으며 비합리적 경로배정 문제를 완화하는 것을 보인다.

Keywords

References

  1. Akamatsu T. (1996), "Cyclic Flows, Markov Process and Stochastic Traffic Assignment," Transportation Research, 30B, pp.369-386.
  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. https://doi.org/10.1016/0377-2217(93)90095-5
  3. Bell M. G. H. (1995), "Alternatives To Dial's Logit Assignment Algorithm," Transportation Research, 29B, pp.287-295.
  4. Cascetta E., Agostino N., Francesco R. and Antonino V. (1996), "A Modified Logit Route Choice Model Overcoming Path Overlapping Problems, Specification and Some Calibration Result for Interurban Networks," Transportation and Traffic Theory, Pergamon, pp.697-711.
  5. Dial R. B. (1971), "A Probabilistic Multipath Traffic Assignment Algorithm which Obviates Path Enumeration," Transportation Research, 5, pp.83-111. https://doi.org/10.1016/0041-1647(71)90012-8
  6. Huang H.-J. and Bell M. G. H. (1998), "A Study on Logit Assignment which Excludes All Cyclic Flows," Transportation Research, 32B, pp.401-412.
  7. Jung D. and Chang J. S. (2014), "Evaluation of the Performance of Transit Assignment Algorithms for Urban Rail Networks," Journal of the Korean Society for Railway, vol. 17 no. 6, pp.433-442. https://doi.org/10.7782/JKSR.2014.17.6.433
  8. Lee M. (2004), Transportation Network Models and Algorithms Considering Directional Delay and Prohibitions for Intersection Movement, Ph.D. Thesis, University of Wisconsin at Madison.
  9. Leurent F. (1997), "Curbing the Computational Difficulty of Logit Equilibrium Assignment Model," Transportation Research, 31B, pp.401-412.
  10. Si B.-F., Zhong M., Zhang H.-Z. and Jin W.-L. (2010), "An Improved Dial's Algorithm for Logit-Based Traffic Assignment within A Directed Acyclic Network," Transportation Planning and Technology, vol. 33, no. 2, pp.123-137. https://doi.org/10.1080/03081061003643705
  11. Van Vliet D. (1981), "Selected Node Pair Analysis in Dial's Algorithm for Transportation Networks," Transportation Research, 15B, pp.65-68.
  12. Wong S. C. (1999), "On the Convergence of Bell's Logit Assignment Formulation," Transportation Research, 33B, pp.609-616.
  13. Yen J. Y. (1971), "Finding the K Shortest Loopless Paths in A Network," Management Science, vol. 17, pp.711-715.