메뉴 건너뛰기




Volumn 10, Issue 4, 2010, Pages 473-485

Finding the ε-user Equilibrium Solution Using an Augmented Frank-Wolfe Algorithm

Author keywords

Frank Wolfe; User equilibrium

Indexed keywords

DIAL-IN; FRANK-WOLFE; FRANK-WOLFE ALGORITHMS; LINK-FLOW; LOW MEMORY; SIMPLE STRUCTURES; USER EQUILIBRIUM;

EID: 78449232125     PISSN: 1566113X     EISSN: 15729427     Source Type: Journal    
DOI: 10.1007/s11067-009-9106-y     Document Type: Article
Times cited : (4)

References (14)
  • 2
    • 1642480232 scopus 로고    scopus 로고
    • Convergence of traffic assignments: how much is enough?
    • Boyce D, Ralevic-Dekic B, Bar-Gera H (2004) Convergence of traffic assignments: how much is enough? J Transp Eng ASCE 130(1): 49-55.
    • (2004) J Transp Eng ASCE , vol.130 , Issue.1 , pp. 49-55
    • Boyce, D.1    Ralevic-Dekic, B.2    Bar-Gera, H.3
  • 3
    • 34250513249 scopus 로고
    • Uber ein paradoxen der verkehrsplanung
    • Braess D (1968) Uber ein paradoxen der verkehrsplanung. Unternehmensforschung 12: 258-268.
    • (1968) Unternehmensforschung , vol.12 , pp. 258-268
    • Braess, D.1
  • 6
    • 0036147860 scopus 로고    scopus 로고
    • Faster Frank-Wolfe traffic assignment with new flow update scheme
    • Chen A, Jayakrishnan R, Tsai, WK (2002) Faster Frank-Wolfe traffic assignment with new flow update scheme. J Transp Eng 128: 31-39.
    • (2002) J Transp Eng , vol.128 , pp. 31-39
    • Chen, A.1    Jayakrishnan, R.2    Tsai, W.K.3
  • 7
    • 33745865164 scopus 로고    scopus 로고
    • A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration
    • Dial RB (2006) A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration. Transp Res Part B 40: 917-936.
    • (2006) Transp Res Part B , vol.40 , pp. 917-936
    • Dial, R.B.1
  • 8
    • 0001971618 scopus 로고
    • An algorithm for quadratic programming
    • Frank M, Pinder KL (1956) An algorithm for quadratic programming. Nav Res Logist Q 3: 95-110.
    • (1956) Nav Res Logist Q , vol.3 , pp. 95-110
    • Frank, M.1    Pinder, K.L.2
  • 10
    • 0016565756 scopus 로고
    • An efficient approach to solving the road network traffic assignment problem
    • LeBlanc LJ, Morlok EK, Pierskalla WP (1975) An efficient approach to solving the road network traffic assignment problem. Transp Sci 9: 309-318.
    • (1975) Transp Sci , vol.9 , pp. 309-318
    • Leblanc, L.J.1    Morlok, E.K.2    Pierskalla, W.P.3
  • 11
    • 0016092442 scopus 로고
    • An algorithm for the traffic assignment problem
    • Mguyen S (1974) An algorithm for the traffic assignment problem. Transp Sci 8: 203-216.
    • (1974) Transp Sci , vol.8 , pp. 203-216
    • Mguyen, S.1
  • 13
    • 0031169919 scopus 로고    scopus 로고
    • Braess' paradox: some new insights
    • Pas EI, Principio SL (1997) Braess' paradox: some new insights. Transp Res Part B 31(3): 265-276.
    • (1997) Transp Res Part B , vol.31 , Issue.3 , pp. 265-276
    • Pas, E.I.1    Principio, S.L.2


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