Citation: | REN Gang, WANG Wei. Turn-based algorithm for Logit traffic assignment[J]. Journal of Traffic and Transportation Engineering, 2005, 5(4): 101-105. |
[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] |
刘海旭, 蒲云. 基于行程质量的随机用户平衡分配模型[J]. 中国公路学报, 2004, 17 (4): 93—95. doi: 10.3321/j.issn:1001-7372.2004.04.020
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] |
王丰元, 潘福全, 张丽霞, 等. 基于交通限制的路网最优路径算法[J]. 交通运输工程学报, 2005, 5 (1): 92—95. http://transport.chd.edu.cn/article/id/200501022
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] |
任刚, 王炜, 邓卫. 带转向延误和限制的最短路径问题及其求解方法[J]. 东南大学学报, 2004, 34 (1): 104—108. https://www.cnki.com.cn/Article/CJFDTOTAL-DNDX200401024.htm
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.
|