Turn-based algorithm for Logit traffic assignment

REN Gang; WANG Wei

Volume 5 Issue 4

Turn off MathJax

Article Contents

Article Navigation > Journal of Traffic and Transportation Engineering > 2005 > 5(4): 101-105

Next Previous

REN Gang, WANG Wei. Turn-based algorithm for Logit traffic assignment[J]. Journal of Traffic and Transportation Engineering, 2005, 5(4): 101-105.

Citation:

REN Gang, WANG Wei. Turn-based algorithm for Logit traffic assignment[J]. Journal of Traffic and Transportation Engineering, 2005, 5(4): 101-105.

REN Gang, WANG Wei. Turn-based algorithm for Logit traffic assignment[J]. Journal of Traffic and Transportation Engineering, 2005, 5(4): 101-105.

Citation:

REN Gang, WANG Wei. Turn-based algorithm for Logit traffic assignment[J]. Journal of Traffic and Transportation Engineering, 2005, 5(4): 101-105.

PDF( 323 KB)

Turn-based algorithm for Logit traffic assignment

REN Gang,
WANG Wei

Key Laboratory of Traffic Planning and Management for Jiangsu Province, Southeast University, Nanjing 210096, China

More Information

Author Bio:
Ren Gang(1976-), male, PhD, lecturer, 86-25-83795649, rengang@seu.edu.cn
Received Date: 2005-07-21
Publish Date: 2005-12-25

Abstract

Abstract

To overcome the shortcomings in traditional network-expanding method for handling turn delays in traffic assignment, a turn-based algorithm for Logit traffic assignment was developed with a similar framework of Dial algorithm, which was based on the topological relationships between network element nodes, links and turns. According to the origin-to-link-type shortest path distances with turn delays, all links were processed, turn weights were computed forward, and link flows and turn flows were assigned backward by the algorithm. Computation result shows that the flow assignment of the algorithm is identical to Logit-based path flows and Dial's algorithm data, the algorithm directly computes link flow and turn flow patterns, which not only agrees with Logit route-choice probability, but also counts for the effect of turn delays on traffic assignment, and Dial algorithm is a special case of the algorithm when all turn delays vanish.
- road traffic planning,
- Logit traffic assignment algorithm,
- turn delay,
- Dial algorithm

FullText(HTML)

References(10)

References

[1]	Dial R B. A probabilistic multipath traffic assignment algorithm which obviates path enumeration[J]. Transportation Research, 1971, 5 (2): 83—111. doi: 10.1016/0041-1647(71)90012-8
[2]	Liu Hai-xu, Pu Yun. Stochastic user equilibrium assignment model based on travel trait[J]. China Journal of Highway and Transport, 2004, 17 (4): 93—95. (in Chinese) doi: 10.3321/j.issn:1001-7372.2004.04.020
[3]	Bell M G H. Alternative to Dial s Logit assignment algorithm[J]. Transportation Research, 1995, 29B (4): 287—295.
[4]	Akamatsu T. Cyclic flows. Marcov process and stochastic traffic assignment[J]. Transportation Research, 1996, 30B (5): 369—386.
[5]	Damberg O, Lundgren J T, Patriksson M. An algorithm for the stochastic user equilibrium problem[J]. Transportation Research, 1996, 30B (2): 115—131.
[6]	Meneguzzer C. An equilibriumroute choice model with explicit treat ment of the effect of intersections[J]. Transportation Research, 1995, 29B (5): 329—356.
[7]	Wang Feng-yuan, Pan Fu-quan, Zhang Li-xia, et al. Optimal path algorithm of road network with traffic restriction[J]. Journal of Traffic and Transportation Engineering, 2005, 5 (1): 92—95. (in Chinese) http://transport.chd.edu.cn/article/id/200501022
[8]	Ren Gang, Wang Wei, Deng Wei. Shortest path problem with turn penalties and prohibitions andits solutions[J]. Journal of Southeast University, 2004, 34 (1): 104—108. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-DNDX200401024.htm
[9]	Kirby R F, Potts R B. The mini mumroute problemfor networks with turn penalties and prohibitions[J]. Transportation Research, 1969, 3 (4): 397—408.
[10]	Ziliaskopoulos A K, Mahmassani H S. A note on least time path computation considering delays and prohibitions for intersection movements[J]. Transportation Research, 1996, 30B (5): 359—367.