Comparison of Methods for Path Flow Reassignment for Dynamic User Equilibrium

Networks and Spatial Economics

Volumn 12, Issue 3, 2012, Pages 337-376

  Carey, Malachy ^a   Ge, Y E ^b  

^a UNIVERSITY OF LEEDS   (United Kingdom)

^b DALIAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Dynamic traffic assignment; Dynamic user equilibrium; Path inflow reassignment; Route choice; Traffic

Indexed keywords

COMPARISON OF METHODS; DYNAMIC NETWORK LOADING; DYNAMIC TRAFFIC ASSIGNMENT(DTA); DYNAMIC TRAFFIC ASSIGNMENTS; DYNAMIC USER EQUILIBRIUM; PATH INFLOW REASSIGNMENT; ROUTE CHOICE; SPEED OF CONVERGENCE;

LOADING; TELECOMMUNICATION TRAFFIC; TRAFFIC CONGESTION; TRAVEL TIME;

ALGORITHMS;

EID: 84865799959     PISSN: 1566113X     EISSN: 15729427     Source Type: Journal    
DOI: 10.1007/s11067-011-9159-6     Document Type: Article

References (34)

1. Bar-Gera H, Boyce D (2006) Solving a non-convex combined travel forecasting model by the method of successive averages with constant step sizes. Transp Res B 40(5): 351-367.
2. Daganzo CF (1994) The cell-transmission model: a simple dynamic representation of highway traffic. Transp Res B 28(4): 269-287.
3. Daganzo CF (1995a) The cell transmission model part II: network traffic. Transp Res B 29: 79-93.
4. Daganzo CF (1995b) A finite difference approximation of the kinematic wave model of traffic flow. Transp Res B 29(4): 261-276.
5. Florian M, Mahut M, Tremblay N (2006) A simulation-based dynamic traffic assignment model: DYNAMEQ. First International Symposium on DTA (DTA2006). University of Leeds, 21-23 June 2006.
6. Friesz TL, Bernstein D (2000) Analytical dynamic traffic assignment models. In Hensher DA, Button KJ (eds) Handbook of transport modelling, Pergamon, pp 181-195.
7. Friesz TL, Mookherjee R (2006) Solving the dynamic network user equilibrium problem with state-dependent time shifts. Transp Res B 40: 207-229.
8. Friesz TL, Bernstein D, Smith TE, Tobin RL, Wie BW (1993) A variational inequality formulation of the dynamic network user equilibrium problem. Oper Res 41: 179-191.
9. Fukushima M (1989) Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problem, Technical Report 89007, Department of Applied Mathematics and Physics, Kyoto University.
10. Han DR, Lo HK (2002) New alternating direction method for a class of nonlinear variational inequality problems. J Optim Theory Appl 112(3): 549-560.
11. Huang H-J, Lam WHK (2002) Modeling and solving the dynamic user equilibrium route and departure time choice problem in a network with queues. Transp Res Part B, 253-273.
12. Kaufman DE, Smith RL, Wunderlich KE (1998) User-equilibrium properties of fixed points in dynamic traffic assignment. Transp Res Part C 6(1-2): 1-16.
13. Kennington JL, Helgason RV (1980) Algorithms for Network Programming. New York: Wiley.
14. Lighthill MJ, Whitham GB (1955) On kinematic waves. I: Flood movement in long rivers; II: A theory of traffic flow on long crowded roads. Proceedings of Royal Society London Series A, London, U. K. 229: 281-345.
15. Lo H, Szeto WY (2002) A cell-based variational inequality of the dynamic user optimal assignment problem. Transp Res B 36: 421-443.
16. Nie X (2003) The study of dynamic user-equilibrium traffic assignment. PhD Thesis, University of California, Davis.
17. Peeta S, Ziliaskopoulos AK (2001) Foundations of dynamic traffic assignment: the past, the present and the future. Netw Spat Econ 1: 233-265.
18. Powell WB, Sheffi Y (1982) The convergence of equilibrium algorithms with predetermined step sizes. Transp Sci 16: 45-55.
19. Ran B, Lee DH, Shin MS (2002) New algorithm for a multiclass dynamic traffic assignment model. J Transp Eng 128: 323-335.
20. Richards PI (1956) Shock waves on the highway. Oper Res 4: 42-51.
21. Robbins H, Monro S (1951) A stochastic approximation method. Ann Math Stat 22: 400-407.
22. Rubio-Ardanaz JM, Wu JH, Florian M (2003) Two improved numerical algorithms for the continuous dynamic network loading problem. Transp Res B 37: 171-190.
23. Sheffi Y (1985) Urban transportation networks: equilibrium analysis with mathematical programming methods. Prentice-Hall.
24. Smith MJ, Wisten MB (1995) A continuous day-to-day traffic assignment model and the existence of a continuous dynamic user equilibrium. Ann Oper Res 60(1): 59-79.
25. Szeto WY, Lo HK (2004) A cell-based simultaneous route and departure time choice model with elastic demand. Transp Res B 38: 593-612.
26. Szeto WY, Lo H (2007) Non-equilibrium dynamic traffic assignment. 17th International Symposium on Transportation and Traffic Theory (ISTTT), London 22-25 July 2007.
27. Tong CO, Wong SC (2000) A predictive dynamic traffic assignment model in congested capacity-constrained road networks. Transp Res B 34: 625-644.
28. Varia HR, Dhingra SL (2004) Dynamic user equilibrium traffic assignment on congested multidestination network. J Transp Eng 130(2): 211-221.
29. Wu JH, Florian M, Rubio-Ardanaz RM (1998a) A projection algorithm for the dynamic network equilibrium problem, The Proceedings of 1998 International Conference on Traffic and Transportation Studies, Beijing, (Published by American Society of Civil Engineers), pp. 379-390.
30. Wu JH, Chen Y, Florian M (1998b) The continuous dynamic network loading problem: a mathematical formulation and solution method. Transp Res B 32: 173-187.
31. Xu YW, Wu JH, Florian M (1998) An efficient algorithm for the continuous network loading problem: A DYNALOAD Implementation. Transportation Networks: Recent Methodological Advances, Elsevier Science LTD, pp. 51-66.
32. Xu YW, Wu JH, Florian M, Marcotte P, Zhu DL (1999) Advances in the continuous dynamic network loading problem. Transp Sci 33(4): 341-353.
33. Zhang D, Nagurney A, Wu JH (2001) On the equivalence between stationary link flow patterns and traffic network equilibria. Transp Res B 35: 731-748.
34. Zhu D, Marcotte P (2000) On the existence of solutions to the dynamic user equilibrium problem. Transp Sci 34(4): 402-414.