An approach to modelling time-varying flows on congested networks

Transportation Research Part B: Methodological

Volumn 34, Issue 3, 2000, Pages 157-183

  Carey, Malachy ^a   Subrahmanian, Eswaran ^b  

^a UNIVERSITY OF ULSTER   (United Kingdom)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Congestion; Dynamic traffic assignment; FIFO; Networks; Time varying flows

Indexed keywords

HIGHWAY TRAFFIC CONTROL; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; QUEUEING THEORY; TRANSPORTATION ROUTES;

CONGESTED NETWORKS; INTERTEMPORAL NETWORK OPTIMIZATION;

MOTOR TRANSPORTATION;

MODELING; PLANNING METHOD; TRAFFIC CONGESTION; TRANSPORTATION PLANNING;

EID: 0034022322     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0191-2615(99)00019-3     Document Type: Article

References (19)

1. Bazaraa, M.S., Sherali H.D., Shetty C.M., 1993. Nonlinear Programming: Theory and Algorithms. Wiley, New York.
2. Carey, M., 1984. Exploring time varying flows on congested networks. Carnegie Mellon University, Pittsburgh, PA. Presented at the TIMS/ORSA Conference, Session TA18, San Francisco, CA, 14-16 May.
3. Carey M. Optimal time-varying flows on congested networks. Operations Research. 35(1):1987;56-69.
4. Carey M. Nonconvexity of the dynamic traffic assignment problem. Transp. Res. B. 26(2):1992;127-133.
5. Carey, M., 1997. A framework for dynamic traffic assignment: models and algorithms. Research Report, Faculty of Business and Management, Univ. of Ulster, N. Ireland, BT37 0QB.
6. Chen H.-K., Hsueh C.-F. A model and an algorithm for the dynamic user-optimal route choice problem. Transp. Res. B. 32(3):1998;219-234.
7. Fox, K. (Ed.), 1997. Review of micro-simulation models. http://www.its.leeds.ac.uk/ smartest/. Deliverable No. 3 of the SMARTEST (Simulation Modelling Applied to Road Transport European Scheme Tests) Project. Institute of Transport Studies, Leeds University, Leeds, England.
8. Friesz T.L., Luque J., Tobin R.L., Wie B.-W. Dynamic network traffic assignment considered as a continuous time optimal control problem. Operations Research. 37(6):1989;893-901.
9. Friesz T.L., Bernstein D., Smith T.E., Tobin R.L., Wie B.-W. A variational inequality formulation of the dynamic network user equilibrium problem. Operations Research. 41(1):1993;179-191.
10. Gartner, N., Messer, C.J., Rathi, A.K. (Eds.), 1997. Traffic flow theory: a state of the art report. http://stargate.ornl. gov/trb/tft.html. This is an update and expansion of Traffic Flow Theory, Special Report 165. Transportation Research Board, USA.
11. Janson B.N. Dynamic traffic assignment for urban road networks. Transp. Res. B. 25:1991;143-161.
12. Kennington, J.L., Whisman, A., 1990. Netside User's Guide. Technical Report 90-CSE-37, Department of Computer Science and Engineering, Southern Methodist University, Dallas, TX.
13. Lam W.H.K., Huang H.-J. Dynamic user optimal traffic assignment model for many to one travel demand. Transp. Res. B. 29(4):1995;243-259.
14. Mahmassani, H.S., Peeta, S., 1995. System optimal dynamic assignment for electronic route guidance in a congested traffic network, In: Gartner, N.H., Improta, G. (Eds.), Urban traffic networks: dynamic flow modelling and control. Springer, London, pp. 3-37.
15. Merchant D.K., Nemhauser G.L. A model and an algorithm for the dynamic traffic assignment problem. Transp. Science. 12(3):1978;183-199.
16. McBride R. Solving embedded generalized network problems. Eur. J. Oper. Res. 21:1985;82-92.
17. Ran, B., Boyce, D., 1994. Dynamic Urban Transportation Network Models - Theory and Implications for Intelligent Vehicle-Highway Systems, Lecture notes in Economics and Mathematical Systems 417. Springer, Heidelberg.
18. Ran, B., Boyce, D., 1996. Modelling Dynamic Transportation Networks. Springer, Heidelberg.
19. Wu J.H., Chen Y., Florian M. A continuous dynamic loading problem: a mathematical formulation and solution. Transp. Res. B. 32(3):1998;173-198.