메뉴 건너뛰기




Volumn 5, Issue 4, 2005, Pages 101-105

Turn-based algorithm for Logit traffic assignment

Author keywords

Dial algorithm; Logit traffic assignment algorithm; Road traffic planning; Turn delay

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; FLOW PATTERNS; PROBABILITY; TOPOLOGY;

EID: 33644957136     PISSN: 16711637     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (9)

References (10)
  • 1
    • 0015078345 scopus 로고
    • A probabilistic multipath traffic assignment algorithm which obviates path enumeration [J]
    • Dial R B. A probabilistic multipath traffic assignment algorithm which obviates path enumeration [J]. Transportation Research, 1971, 5(2) : 83-111.
    • (1971) Transportation Research , vol.5 , Issue.2 , pp. 83-111
    • Dial, R.B.1
  • 2
    • 13644278465 scopus 로고    scopus 로고
    • Stochastic user equilibrium assignment model based on travel trait[J]
    • in Chinese
    • 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)
    • (2004) China Journal of Highway and Transport , vol.17 , Issue.4 , pp. 93-95
    • Liu, H.-X.1    Pu, Y.2
  • 3
    • 0029515752 scopus 로고
    • Alternative to Dial's Logit assignment algorithm [J]
    • Bell M G H. Alternative to Dial's Logit assignment algorithm [J]. Transportation Research, 1995, 29B(4) : 287-295.
    • (1995) Transportation Research , vol.29 B , Issue.4 , pp. 287-295
    • Bell, M.G.H.1
  • 4
    • 0030302511 scopus 로고    scopus 로고
    • Cyclic flows. Marcov process and stochastic traffic assignment[J]
    • Akamatsu T. Cyclic flows. Marcov process and stochastic traffic assignment[J]. Transportation Research, 1996, 30B(5) : 369-386.
    • (1996) Transportation Research , vol.30 B , Issue.5 , pp. 369-386
    • Akamatsu, T.1
  • 5
    • 0030304231 scopus 로고    scopus 로고
    • An algorithm for the stochastic user equilibrium problem [J]
    • Damberg O, Lundgren J T, Patriksson M. An algorithm for the stochastic user equilibrium problem [J]. Transportation Research, 1996, 30B(2) : 115-131.
    • (1996) Transportation Research , vol.30 B , Issue.2 , pp. 115-131
    • Damberg, O.1    Lundgren, J.T.2    Patriksson, M.3
  • 6
    • 0029514355 scopus 로고
    • An equilibrium route choice model with explicit treatment of the effect of intersections[J]
    • Meneguzzer C. An equilibrium route choice model with explicit treatment of the effect of intersections[J]. Transportation Research, 1995, 29B(5) : 329-356.
    • (1995) Transportation Research , vol.29 B , Issue.5 , pp. 329-356
    • Meneguzzer, C.1
  • 7
  • 8
    • 2542519181 scopus 로고    scopus 로고
    • Shortest path problem with turn penalties and prohibitions and its solutions[J]
    • in Chinese
    • Ren Gang,Wang Wei, Deng Wei. Shortest path problem with turn penalties and prohibitions and its solutions[J]. Journal of Southeast University, 2004, 34(1) : 104-108. (in Chinese)
    • (2004) Journal of Southeast University , vol.34 , Issue.1 , pp. 104-108
    • Ren, G.1    Wang, W.2    Deng, W.3
  • 9
    • 0001587416 scopus 로고
    • The minimum route problem for networks with turn penalties and prohibitions[J]
    • Kirby R F, Potts R B. The minimum route problem for networks with turn penalties and prohibitions[J]. Transportation Research, 1969, 3(4) : 397-408.
    • (1969) Transportation Research , vol.3 , Issue.4 , pp. 397-408
    • Kirby, R.F.1    Potts, R.B.2
  • 10
    • 0030302513 scopus 로고    scopus 로고
    • A note on least time path computation considering delays and prohibitions for intersection movements[J]
    • 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.
    • (1996) Transportation Research , vol.30 B , Issue.5 , pp. 359-367
    • Ziliaskopoulos, A.K.1    Mahmassani, H.S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.