메뉴 건너뛰기




Volumn 33, Issue 8, 1999, Pages 609-616

On the convergence of Bell's logit assignment formulation

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; DECISION THEORY; EIGENVALUES AND EIGENFUNCTIONS; MATRIX ALGEBRA; TRANSPORTATION ROUTES;

EID: 0032695172     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0191-2615(99)00015-6     Document Type: Article
Times cited : (17)

References (12)
  • 1
    • 0030302511 scopus 로고    scopus 로고
    • Cyclic flows, Markov process and stochastic traffic assignment
    • Akamatsu T. Cyclic flows, Markov process and stochastic traffic assignment. Transportation Research B. 30:1996;369-386.
    • (1996) Transportation Research B , vol.30 , pp. 369-386
    • Akamatsu, T.1
  • 2
    • 0029515752 scopus 로고
    • Alternatives to Dial's logit assignment algorithm
    • Bell M.G.H. Alternatives to Dial's logit assignment algorithm. Transportation Research B. 29:1995;287-295.
    • (1995) Transportation Research B , vol.29 , pp. 287-295
    • Bell, M.G.H.1
  • 4
    • 0344968601 scopus 로고
    • Exact local solution of the continuous network design problem via stochastic user equilibrium assignment
    • Davis G.A. Exact local solution of the continuous network design problem via stochastic user equilibrium assignment. Transportation Research B. 27:1993;61-75.
    • (1993) Transportation Research B , vol.27 , pp. 61-75
    • Davis, G.A.1
  • 5
    • 0015078345 scopus 로고
    • A probabilistic multipath traffic assignment model with obviates the need for path enumeration
    • Dial R.B. A probabilistic multipath traffic assignment model with obviates the need for path enumeration. Transportation Research. 5:1971;83-111.
    • (1971) Transportation Research , vol.5 , pp. 83-111
    • Dial, R.B.1
  • 8
    • 0032131985 scopus 로고    scopus 로고
    • A study on logit assignment which excludes all cyclic flows
    • Huang H.J., Bell M.G.H. A study on logit assignment which excludes all cyclic flows. Transportation Research B. 32:1998;401-412.
    • (1998) Transportation Research B , vol.32 , pp. 401-412
    • Huang, H.J.1    Bell, M.G.H.2
  • 9
    • 0020091589 scopus 로고
    • The convergence of equilibrium algorithms with predetermined step sizes
    • Powell W.B., Sheffi Y. The convergence of equilibrium algorithms with predetermined step sizes. Transportation Science. 16:1982;45-55.
    • (1982) Transportation Science , vol.16 , pp. 45-55
    • Powell, W.B.1    Sheffi, Y.2
  • 11
    • 0344789474 scopus 로고
    • Selected node-pair analysis in Dial's assignment algorithm
    • Van Vliet D. Selected node-pair analysis in Dial's assignment algorithm. Transportation Research. 12:1981;7-20.
    • (1981) Transportation Research , vol.12 , pp. 7-20
    • Van Vliet, D.1


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