Browse > Article
http://dx.doi.org/10.12815/kits.2018.17.5.39

Vine Based Dial Algorithm  

Lee, Mee Young (Korea Research Institute for Human Settlements)
Kim, Jong Hyung (Incheon Development Institute)
Jung, Dongjae (Department of Environmental Planning, Seoul National University)
Shin, Seongil (The Seoul Institute)
Publication Information
The Journal of The Korea Institute of Intelligent Transport Systems / v.17, no.5, 2018 , pp. 39-47 More about this Journal
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.
Keywords
Dial Algorithm; Vine; Turn Penalty; Cyclic Path; Unrealistic Flow;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
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.   DOI
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.   DOI
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.   DOI
8 Leurent F. (1997), "Curbing the Computational Difficulty of Logit Equilibrium Assignment Model," Transportation Research, 31B, pp.401-412.
9 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.   DOI
10 Van Vliet D. (1981), "Selected Node Pair Analysis in Dial's Algorithm for Transportation Networks," Transportation Research, 15B, pp.65-68.
11 Wong S. C. (1999), "On the Convergence of Bell's Logit Assignment Formulation," Transportation Research, 33B, pp.609-616.
12 Yen J. Y. (1971), "Finding the K Shortest Loopless Paths in A Network," Management Science, vol. 17, pp.711-715.
13 Lee M. (2004), Transportation Network Models and Algorithms Considering Directional Delay and Prohibitions for Intersection Movement, Ph.D. Thesis, University of Wisconsin at Madison.