References
- Akamatsu T. (1996), "Cyclic Flows, Markov Process and Stochastic Traffic Assignment," Transportation Research, 30B, pp.369-386.
- 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
- Bell M. G. H. (1995), "Alternatives To Dial's Logit Assignment Algorithm," Transportation Research, 29B, pp.287-295.
- 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.
- 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
- 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.
- 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
- Lee M. (2004), Transportation Network Models and Algorithms Considering Directional Delay and Prohibitions for Intersection Movement, Ph.D. Thesis, University of Wisconsin at Madison.
- Leurent F. (1997), "Curbing the Computational Difficulty of Logit Equilibrium Assignment Model," Transportation Research, 31B, pp.401-412.
- 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
- Van Vliet D. (1981), "Selected Node Pair Analysis in Dial's Algorithm for Transportation Networks," Transportation Research, 15B, pp.65-68.
- Wong S. C. (1999), "On the Convergence of Bell's Logit Assignment Formulation," Transportation Research, 33B, pp.609-616.
- Yen J. Y. (1971), "Finding the K Shortest Loopless Paths in A Network," Management Science, vol. 17, pp.711-715.