This content is not included in
your SAE MOBILUS subscription, or you are not logged in.
A Dynamical System Model for Traffic Assignment in Networks
Annotation ability available
Sector:
Language:
English
Abstract
We consider a traffic network subject to known time-varying demands between its origins and destinations. We model the network as a discrete-time dynamical system driven by these demands. The state of the system at each time epoch is defined in a way that avoids complete microscopic detail by grouping vehicles into platoons irrespective of origin node and time of entry to network. Moreover, the formulation contains no path enumeration. The control variables correspond to the assignment or routing of the platoons on downstream links at the nodes of the network. Impedance functions combined with link outflow functions are used to model link travel times in the state transition function. This modeling approach allows for the study of the problem of dynamic traffic assignment in networks in the framework of the optimal control of dynamical systems. This work has applications to route guidance issues that arise in an Intelligent Vehicle-Highway Systems (IVHS) environment.
Recommended Content
Authors
- Stéphane Lafortune - Department of Electrical Engineering and Computer Science, University of Michigan Ann Arbor, MI
- Raja Sengupta - Department of Electrical Engineering and Computer Science, University of Michigan Ann Arbor, MI
- David E. Kaufman - Department of Industrial and Operations Engrg., University of Michigan Ann Arbor, MI
- Robert L. Smith - Department of Industrial and Operations Engrg., University of Michigan Ann Arbor, MI
Citation
Lafortune, S., Sengupta, R., Kaufman, D., and Smith, R., "A Dynamical System Model for Traffic Assignment in Networks," SAE Technical Paper 912817, 1991, https://doi.org/10.4271/912817.Also In
References
- Carey M. Optimal time-varying flows on congested networks Operations Research 35 1 58 69 1987
- Friesz T. L. Luque J. Tobin R. L. Wie B. Dynamic network traffic assignment considered as a continuous-time optimal control problem Operations Research 37 6 893 901 1989
- Janson B. N. A convergent algorithm for dynamic traffic assignment 70th Transportation Research Board Meeting January 1991
- Kaufman D. E. Lee J. Smith R. L. Anticipatory traffic modeling and route guidance in Intelligent Vehicle-Highway Systems Technical Report 90-2 IVHS Program University of Michigan February 1990
- Kaufman D. E. Smith R. L. Minimum travel time paths in dynamic networks with application to Intelligent Vehicle-Highway Systems Technical Report 90-11 IVHS Program University of Michigan November 1990
- Lafortune S. Sengupta R. Kaufman D. Smith R. L. A dynamical system model for traffic assignment in networks Technical Report 91-01 IVHS Program University of Michigan June 1991
- Merchant D. K. Nemhauser G. L. A model and an algorithm for the dynamic traffic assignment problem Transportation Science 12 3 183 199 1978
- Papageorgiou M. Banos J. C. M. Messmer A. Optimal control of multidestination traffic networks Proc. 29th IEEE Conf. on Decision and Control 1355 1361 Honolulu, HI December 1990
- Saxton L. Special issue on Intelligent-Vehicle Highway Systems IEEE Trans. Vehicular Technology 40 1 1 158 February 1991
- Van Aerde M. Yagar S. Dynamic integrated freeway/traffic signals networks: A routing-based modelling approach Transportation Research: A 22A 6 445 453 1988
- Wunderlich K. Time-variant travel cost calculation under anticipatory routing Technical Report 90-5 IVHS Program University of Michigan August 1990