메뉴 건너뛰기




Volumn 41, Issue 10, 2007, Pages 1094-1113

A route-based solution algorithm for dynamic user equilibrium assignments

Author keywords

Deterministic queuing model; Discrete time; Dynamic user equilibrium assignment; Flow propagation; Solution algorithm

Indexed keywords

DYNAMIC MODELS; QUADRATIC PROGRAMMING; QUEUEING THEORY; TIME VARYING SYSTEMS;

EID: 34848827186     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2007.05.001     Document Type: Article
Times cited : (22)

References (36)
  • 1
    • 0002928398 scopus 로고    scopus 로고
    • A continuous time link model for dynamic network loading based on travel time functions
    • Lesort J.-B. (Ed), Pergamon, Oxford
    • Astarita V. A continuous time link model for dynamic network loading based on travel time functions. In: Lesort J.-B. (Ed). Transportation and Traffic Theory (1996), Pergamon, Oxford 79-102
    • (1996) Transportation and Traffic Theory , pp. 79-102
    • Astarita, V.1
  • 3
    • 0032036222 scopus 로고    scopus 로고
    • A model and an algorithm for the dynamic user-optimal route choice problem
    • Chen S., and Hsueh C. A model and an algorithm for the dynamic user-optimal route choice problem. Transportation Research 32B 3 (1998) 219-234
    • (1998) Transportation Research , vol.32 B , Issue.3 , pp. 219-234
    • Chen, S.1    Hsueh, C.2
  • 4
    • 0020125717 scopus 로고
    • Relaxation algorithms for the general asymmetric traffic equilibrium problem
    • Dafermos S.C. Relaxation algorithms for the general asymmetric traffic equilibrium problem. Transportation Science 16 2 (1982) 231-240
    • (1982) Transportation Science , vol.16 , Issue.2 , pp. 231-240
    • Dafermos, S.C.1
  • 6
    • 0015078345 scopus 로고
    • A probabilistic multipath traffic assignment model which obviates path enumeration
    • Dial R.B. A probabilistic multipath traffic assignment model which obviates path enumeration. Transportation Research 5 2 (1971) 83-111
    • (1971) Transportation Research , vol.5 , Issue.2 , pp. 83-111
    • Dial, R.B.1
  • 8
    • 0024772092 scopus 로고
    • Dynamic network traffic assignment considered as a continuous time optimal control problem
    • Friesz T.L., Luque J., Tobin R.L., and Wie B. Dynamic network traffic assignment considered as a continuous time optimal control problem. Operation Research 37 6 (1989) 893-901
    • (1989) Operation Research , vol.37 , Issue.6 , pp. 893-901
    • Friesz, T.L.1    Luque, J.2    Tobin, R.L.3    Wie, B.4
  • 9
    • 0027149988 scopus 로고
    • A variational inequality formulation of the dynamic networks user equilibrium problem
    • Friesz T.L., Bernstein D., Smith T.E., Tobin R.L., and Wie B. A variational inequality formulation of the dynamic networks user equilibrium problem. Operation Research 41 1 (1993) 179-191
    • (1993) Operation Research , vol.41 , Issue.1 , pp. 179-191
    • Friesz, T.L.1    Bernstein, D.2    Smith, T.E.3    Tobin, R.L.4    Wie, B.5
  • 10
    • 85029838863 scopus 로고    scopus 로고
    • Han, S., 2000. Dynamic traffic assignment techniques for general road networks. Ph.D. Thesis, University of London, UK.
  • 11
    • 0037353515 scopus 로고    scopus 로고
    • Dynamic traffic modelling and dynamic stochastic user equilibrium assignment for general road networks
    • Han S. Dynamic traffic modelling and dynamic stochastic user equilibrium assignment for general road networks. Transportation Research 37B (2003) 225-249
    • (2003) Transportation Research , vol.37 B , pp. 225-249
    • Han, S.1
  • 12
    • 24344488973 scopus 로고    scopus 로고
    • Consistent objectives and solution of dynamic user equilibrium models
    • Han S., and Heydecker B.G. Consistent objectives and solution of dynamic user equilibrium models. Transportation Research 40B (2006) 16-34
    • (2006) Transportation Research , vol.40 B , pp. 16-34
    • Han, S.1    Heydecker, B.G.2
  • 13
    • 0020116651 scopus 로고
    • The gap function of a convex program
    • Hearn D.W. The gap function of a convex program. Operation Research Letter 1 (1982) 67-71
    • (1982) Operation Research Letter , vol.1 , pp. 67-71
    • Hearn, D.W.1
  • 14
    • 0002131828 scopus 로고    scopus 로고
    • An exact expression of dynamic traffic equilibrium
    • Lesort J.-B. (Ed), Pergamon, Oxford
    • Heydecker B.G., and Addison J.D. An exact expression of dynamic traffic equilibrium. In: Lesort J.-B. (Ed). Transportation and Traffic Theory (1996), Pergamon, Oxford 359-383
    • (1996) Transportation and Traffic Theory , pp. 359-383
    • Heydecker, B.G.1    Addison, J.D.2
  • 16
    • 85029832410 scopus 로고    scopus 로고
    • Heydecker, B.G. Verlander, N., 1999. Calculation of dynamic traffic equilibrium assignments. In: Proceedings of the European Transport Conferences, Seminar F, pp. 79-91.
  • 17
    • 0026072854 scopus 로고
    • Dynamic traffic assignment for urban road networks
    • Janson B.N. Dynamic traffic assignment for urban road networks. Transportation Research 25B 2/3 (1991) 43-61
    • (1991) Transportation Research , vol.25 B , Issue.2-3 , pp. 43-61
    • Janson, B.N.1
  • 18
    • 0028784213 scopus 로고
    • A dynamic traffic assignment model with traffic-flow relationships
    • Jayakrishnan R., Tsai W.K., and Chen A. A dynamic traffic assignment model with traffic-flow relationships. Transportation Research 3C 1 (1995) 51-72
    • (1995) Transportation Research , vol.3 C , Issue.1 , pp. 51-72
    • Jayakrishnan, R.1    Tsai, W.K.2    Chen, A.3
  • 19
    • 0041760963 scopus 로고    scopus 로고
    • Decomposition of the reactive dynamic assignment with queues for a many-to-many origin-destination pattern
    • Kuwahara M., and Akamatsu T. Decomposition of the reactive dynamic assignment with queues for a many-to-many origin-destination pattern. Transportation Research 31B 1 (1997) 1-10
    • (1997) Transportation Research , vol.31 B , Issue.1 , pp. 1-10
    • Kuwahara, M.1    Akamatsu, T.2
  • 20
    • 0029481047 scopus 로고
    • Dynamic user optimal traffic assignment model for many to one travel demand
    • Lam W.H., and Huang H.J. Dynamic user optimal traffic assignment model for many to one travel demand. Transportation Research 29B 4 (1995) 243-259
    • (1995) Transportation Research , vol.29 B , Issue.4 , pp. 243-259
    • Lam, W.H.1    Huang, H.J.2
  • 21
    • 0026822031 scopus 로고
    • Simplicial decomposition with disaggregated representation for the traffic assignment problem
    • Larsson T., and Patriksson M. Simplicial decomposition with disaggregated representation for the traffic assignment problem. Transportation Science 26 1 (1992) 4-17
    • (1992) Transportation Science , vol.26 , Issue.1 , pp. 4-17
    • Larsson, T.1    Patriksson, M.2
  • 22
    • 85029862161 scopus 로고    scopus 로고
    • Lee, S., 1995. Mathematical programming algorithms for equilibrium road traffic assignment. Ph.D. Thesis, University of London, UK.
  • 23
    • 0015630518 scopus 로고
    • A column generation algorithm for optimal traffic assignment
    • Leventhal T., Nemhauser G., and Trotter L. A column generation algorithm for optimal traffic assignment. Transportation Science 7 2 (1973) 168-176
    • (1973) Transportation Science , vol.7 , Issue.2 , pp. 168-176
    • Leventhal, T.1    Nemhauser, G.2    Trotter, L.3
  • 24
    • 0034006048 scopus 로고    scopus 로고
    • Are the objective and solutions of dynamic user-equilibrium models always consistent?
    • Lin W.H., and Lo H.K. Are the objective and solutions of dynamic user-equilibrium models always consistent?. Transportation Research 34A (2000) 137-144
    • (2000) Transportation Research , vol.34 A , pp. 137-144
    • Lin, W.H.1    Lo, H.K.2
  • 25
    • 0018002683 scopus 로고
    • A model and an algorithm for the dynamic traffic assignment problem
    • Merchant D.K., and Nemhauser G.L. A model and an algorithm for the dynamic traffic assignment problem. Transportation Science 12 3 (1978) 183-199
    • (1978) Transportation Science , vol.12 , Issue.3 , pp. 183-199
    • Merchant, D.K.1    Nemhauser, G.L.2
  • 26
    • 0000859605 scopus 로고
    • Dynamic modelling, assignment, and route guidance in traffic networks
    • Papageorgiou M. Dynamic modelling, assignment, and route guidance in traffic networks. Transportation Research 24B 6 (1990) 471-495
    • (1990) Transportation Research , vol.24 B , Issue.6 , pp. 471-495
    • Papageorgiou, M.1
  • 27
    • 85029857724 scopus 로고    scopus 로고
    • Patriksson, M., 1994. The Traffic Assignment Problem-Models and Methods. VSP, Utrecht, The Netherlands.
  • 29
    • 85029856383 scopus 로고    scopus 로고
    • Schittenhelm, H., 1990. On the integration of an effective assignment algorithm with path and path-flow management in a combined trip distribution and traffic assignment algorithm. In: PTRC European Transport and Planning, 18th Summer Annual Meeting, Transportation Planning Methods, Seminar H, University of Sussex, England, September, pp. 203-214.
  • 31
    • 0018656183 scopus 로고
    • The existence, uniqueness and stability of traffic equilibria
    • Smith M.J. The existence, uniqueness and stability of traffic equilibria. Transportation Research 13B 4 (1979) 295-304
    • (1979) Transportation Research , vol.13 B , Issue.4 , pp. 295-304
    • Smith, M.J.1
  • 32
    • 38249005221 scopus 로고
    • A new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity-constrained road networks
    • Smith M.J. A new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity-constrained road networks. Transportation Research 27B 1 (1993) 49-63
    • (1993) Transportation Research , vol.27 B , Issue.1 , pp. 49-63
    • Smith, M.J.1
  • 35
    • 0347108912 scopus 로고
    • Dynamic user optimal traffic assignment on congested multi destination networks
    • Wie B., Friesz T.L., and Tobin R.L. Dynamic user optimal traffic assignment on congested multi destination networks. Transportation Research 24B 6 (1990) 431-442
    • (1990) Transportation Research , vol.24 B , Issue.6 , pp. 431-442
    • Wie, B.1    Friesz, T.L.2    Tobin, R.L.3
  • 36
    • 0001429413 scopus 로고
    • The augmented Lagrangian method for solving dynamic network traffic assignment models in discrete time
    • Wie B., Tobin R.L., and Friesz T.L. The augmented Lagrangian method for solving dynamic network traffic assignment models in discrete time. Transportation Science 28 3 (1994) 204-220
    • (1994) Transportation Science , vol.28 , Issue.3 , pp. 204-220
    • Wie, B.1    Tobin, R.L.2    Friesz, T.L.3


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