메뉴 건너뛰기




Volumn 39, Issue 1, 2005, Pages 1-29

A within-day dynamic traffic assignment model for urban road networks

Author keywords

Dial's algorithm; Dynamic traffic assignment; Fixed point problem; Implicit path enumeration; Network loading map; Temporal profiles

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ROADS AND STREETS; URBAN PLANNING;

EID: 4344571728     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2004.02.002     Document Type: Article
Times cited : (48)

References (28)
  • 1
    • 0043002299 scopus 로고
    • A mathematical model for dynamic traffic assignment
    • C. F. Daganzo (Ed.), Amsterdam: Elsevier
    • Addison J.D. Heydecker B.G. A mathematical model for dynamic traffic assignment Daganzo C.F. Transportation and Traffic Theory 1993 171-184 Elsevier Amsterdam
    • (1993) Transportation and Traffic Theory , pp. 171-184
    • Addison, J.D.1    Heydecker, B.G.2
  • 3
    • 4344670430 scopus 로고    scopus 로고
    • Dynamic traffic assignment in congested networks
    • L. Bianco, & P. Toth (Eds.), Heidelberg: Springer-Verlag
    • Bellei G. Bielli M. Dynamic traffic assignment in congested networks Bianco L. Toth P. Advanced Methods in Transportation Analysis 1996 263-298 Springer-Verlag Heidelberg
    • (1996) Advanced Methods in Transportation Analysis , pp. 263-298
    • Bellei, G.1    Bielli, M.2
  • 4
    • 0036832864 scopus 로고    scopus 로고
    • Network pricing optimization in multi-user and multimodal context with elastic demand
    • Bellei G. Gentile G. Papola N. Network pricing optimization in multi-user and multimodal context with elastic demand Transportation Research B 36/9 2002 779-798
    • (2002) Transportation Research B , vol.36 , Issue.9 , pp. 779-798
    • Bellei, G.1    Gentile, G.2    Papola, N.3
  • 5
    • 33748114045 scopus 로고    scopus 로고
    • Accelerated averaging methods for fixed-point problems in transportation analysis and planning
    • Azores, Portugal
    • Bottom, J., Chabini, I., 2001. Accelerated averaging methods for fixed-point problems in transportation analysis and planning, In: Preprints of Tristan IV, Azores, Portugal, 69-79
    • (2001) Preprints of Tristan IV , pp. 69-79
    • Bottom, J.1    Chabini, I.2
  • 6
    • 0031139471 scopus 로고    scopus 로고
    • A general fixed-point approach to multimode multi-user equilibrium assignment with elastic demand
    • Cantarella G.E. A general fixed-point approach to multimode multi-user equilibrium assignment with elastic demand Transportation Science 31 1997 107-128
    • (1997) Transportation Science , vol.31 , pp. 107-128
    • Cantarella, G.E.1
  • 7
    • 0034022322 scopus 로고    scopus 로고
    • An approach to modelling time-varying flows on congested networks
    • Carey M. Subrahmanian E. An approach to modelling time-varying flows on congested networks Transportation Research B 34 2000 157-183
    • (2000) Transportation Research B , vol.34 , pp. 157-183
    • Carey, M.1    Subrahmanian, E.2
  • 8
    • 0000196179 scopus 로고
    • A day-to-day and within-day dynamic stochastic assignment model
    • Cascetta E. Cantarella G.E. A day-to-day and within-day dynamic stochastic assignment model Transportation Research A 25 1991 277-291
    • (1991) Transportation Research A , vol.25 , pp. 277-291
    • Cascetta, E.1    Cantarella, G.E.2
  • 10
    • 0028481056 scopus 로고
    • The cell transmission model: A dynamic representation of highway traffic consistent with hydrodynamic theory
    • Daganzo C.F. The cell transmission model: a dynamic representation of highway traffic consistent with hydrodynamic theory Transportation Research B 28 1994 269-287
    • (1994) Transportation Research B , vol.28 , pp. 269-287
    • Daganzo, C.F.1
  • 11
    • 0028803659 scopus 로고
    • The cell transmission model Part II: Network traffic
    • Daganzo C.F. The cell transmission model Part II: Network traffic Transportation Research B 29 1995 79-93
    • (1995) Transportation Research B , vol.29 , pp. 79-93
    • Daganzo, C.F.1
  • 13
    • 0015078345 scopus 로고
    • A probabilistic multipath traffic assignment algorithm which obviates path enumeration
    • Dial R.B. A probabilistic multipath traffic assignment algorithm which obviates path enumeration Transportation Research 5 1971 83-111
    • (1971) Transportation Research , vol.5 , pp. 83-111
    • Dial, R.B.1
  • 14
    • 0027149988 scopus 로고
    • A variation inequality formulation of the dynamic network user equilibrium problem
    • Friesz T.L. Bernstein D. Smith T.E. Tobin R.L. Wie B.W. A variation inequality formulation of the dynamic network user equilibrium problem Operation Research 41 1993 179-191
    • (1993) Operation Research , vol.41 , pp. 179-191
    • Friesz, T.L.1    Bernstein, D.2    Smith, T.E.3    Tobin, R.L.4    Wie, B.W.5
  • 15
    • 0030085605 scopus 로고    scopus 로고
    • Dynamic systems, variational inequalities and control theoretic models for predicting time-varying urban network flows
    • Friesz T.L. Bernstein D. Stough R. Dynamic systems, variational inequalities and control theoretic models for predicting time-varying urban network flows Transportation Science 30 1996 14-31
    • (1996) Transportation Science , vol.30 , pp. 14-31
    • Friesz, T.L.1    Bernstein, D.2    Stough, R.3
  • 16
    • 0024888068 scopus 로고
    • Dynamic assignment in three-dimensional time space
    • Hamerslag R. Dynamic assignment in three-dimensional time space Transportation Research Records 1220 1988 28-32
    • (1988) Transportation Research Records , vol.1220 , pp. 28-32
    • Hamerslag, R.1
  • 17
    • 0000006909 scopus 로고
    • An evaluation tool for advanced traffic information and management systems in urban networks
    • Jayakrishnan R. Mahmassani H.S. Hu T.Y. An evaluation tool for advanced traffic information and management systems in urban networks Transportation Research C 3 1994 129-147
    • (1994) Transportation Research C , vol.3 , pp. 129-147
    • Jayakrishnan, R.1    Mahmassani, H.S.2    Hu, T.Y.3
  • 18
    • 0026858047 scopus 로고
    • A dynamic traffic assignment model and solution algorithm
    • Kaitouni O.D. Benchekroun A.H. A dynamic traffic assignment model and solution algorithm Transportation Science 26 1992 119-128
    • (1992) Transportation Science , vol.26 , pp. 119-128
    • Kaitouni, O.D.1    Benchekroun, A.H.2
  • 20
    • 0000859605 scopus 로고
    • Dynamic modeling, assignment and route guidance in traffic networks
    • Papageorgiu M. Dynamic modeling, assignment and route guidance in traffic networks Transportation Research B 24 1990 471-495
    • (1990) Transportation Research B , vol.24 , pp. 471-495
    • Papageorgiu, M.1
  • 21
    • 0027226451 scopus 로고
    • A new class of instantaneous dynamic user-optimal traffic assignment models
    • Ran B. Boyce D.E. LeBlanc L.J. A new class of instantaneous dynamic user-optimal traffic assignment models Operation Research 41 1993 192-202
    • (1993) Operation Research , vol.41 , pp. 192-202
    • Ran, B.1    Boyce, D.E.2    LeBlanc, L.J.3
  • 22
    • 0020140779 scopus 로고
    • An algorithm for the equilibrium assignment problem with random link times
    • Sheffi Y. Powell W. An algorithm for the equilibrium assignment problem with random link times Networks 12 1982 191-207
    • (1982) Networks , vol.12 , pp. 191-207
    • Sheffi, Y.1    Powell, W.2
  • 23
    • 0018656183 scopus 로고
    • The existence, uniqueness and stability of traffic equilibria
    • Smith M.J. The existence, uniqueness and stability of traffic equilibria Transportation Research B 13 1979 295-304
    • (1979) Transportation Research B , vol.13 , pp. 295-304
    • Smith, M.J.1
  • 24
    • 38249005221 scopus 로고
    • A new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity constrained road network
    • Smith M.J. A new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity constrained road network Transportation Research B 27 1993 49-63
    • (1993) Transportation Research B , vol.27 , pp. 49-63
    • Smith, M.J.1
  • 26
    • 0031284453 scopus 로고    scopus 로고
    • Distributed computation of dynamic traffic equilibria
    • Wisten M.B. Smith M.J. Distributed computation of dynamic traffic equilibria Transportation Research C 5 1997 77-93
    • (1997) Transportation Research C , vol.5 , pp. 77-93
    • Wisten, M.B.1    Smith, M.J.2
  • 27
    • 0031594067 scopus 로고    scopus 로고
    • The continuous dynamic network loading problem: A mathematical formulation and solution method
    • Wu J.H. Chan Y. Florian M. The continuous dynamic network loading problem: a mathematical formulation and solution method Transportation Research B 32 1998 173-187
    • (1998) Transportation Research B , vol.32 , pp. 173-187
    • Wu, J.H.1    Chan, Y.2    Florian, M.3


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