Model of Traffic Flow Capacity Constraint through Nodes for Dynamic Network Loading with Queue Spillback
Abstract
In dynamic network traffic loading models with queues spilling back in the links, if one or more links departing a node have demand exceeding capacity, a node model is required to unambiguously constrain the flows exiting the links approaching that node. Basic principles of traffic flow and causality impose requirements on macroscopic node models that have only been recently articulated. Only one existing model fully conforms, but it has a weakness that is identified and discussed. This paper develops a new conforming model from a particular behavior of traffic: vehicles wait their turns to proceed and consume additional approach capacity due to waiting. The model's derivation from behavior distinguishes this model from previous ones that allocate capacity by proportionality rules. A simple, efficient, and convergent solution algorithm for the new model is provided.
Get full access to this article
View all access and purchase options for this article.
References
1. Daganzo C. F. The Cell Transmission Model, Part II: Network Traffic. Transportation Research Part B, Vol. 29, 1995, pp. 79–93.
2. Lebacque J. P., and Khoshyaran M. M. First-Order Macroscopic Traffic Flow Models: Intersection Modeling, Network Modeling. Proc. 16th International Symposium on Transportation and Traffic Theory, 2005, pp. 365–386.
3. Flötteröd G., and Rohde J. Modeling Complex Intersections with the Cell-Transmission Model. Report TRANSP-OR 090719. Ecole Polytechnique Fédéral de Lausanne, France, 2009.
4. Lee S. A Cell Transmission Based Assignment-Simulation Model for Integrated Freeway/Surface Street Systems, M.S. thesis. Ohio State University, Columbus, 1996.
5. Chen L., Jin W. L., Hu J., and Zhang Y. An Urban Intersection Model Based on Multi-Commodity Kinematic Wave Theories. Proc. IEEE ITS Conference, Beijing, China, 2008.
6. Special Report 209: Highway Capacity Manual, 3rd ed. (1997 update). TRB, National Research Council, Washington, D.C., 1998.
7. Castiglione J., Grady B., Bowman J., Bradley M., and Lawe S. Building an Integrated Activity-Based and Dynamic Network Assignment Model. Presented at 3rd Transportation Research Board Conference on Innovations in Travel Modeling, Tempe, Ariz., 2010.
8. Tampère C. M. J., Corthout R., Cattrysse D., and Immers L. H. A Generic Class of First Order Node Models for Dynamic Macroscopic Simulation of Traffic Flows. Pending in Transportation Research Part B, Vol. 45, 2010, pp. 289–309.
9. Newell G. F. A Simplified Theory of Kinematic Waves in Highway Traffic, Part I: General Theory; Part II: Queuing at Freeway Bottlenecks; Part III: Multidestination Flows. Transportation Research Part B, Vol. 27, 1993, pp. 281–313.
10. Jin W. L., and Zhang H. M. On the Distribution Schemes for Determining Flows Through a Merge. Transportation Research Part B, Vol. 37, 2003, pp. 521–540.
11. Bliemer M. C. J. Dynamic Queuing and Spillback in Analytical Multiclass Dynamic Network Loading Model. In Transportation Research Record: Journal of the Transportation Research Board, No. 2029, Transportation Research Board of the National Academies, Washington, D.C., 2007, pp. 14–21.
12. Ni D. Extension and Generalization of Newell's Simplified Theory of Kinematic Waves, PhD dissertation. Georgia Institute of Technology, Atlanta, 2004.
13. Cassidy M. J., and Ahn S. Driver Turn-Taking Behavior in Congested Freeway Merges. In Transportation Research Record: Journal of the Transportation Research Board, No. 1934, Transportation Research Board of the National Academies, Washington, D.C., 2005, pp. 140–147.
14. Gentile G., Meschini L., and Papola N. Spillback Congestion in Dynamic Traffic Assignment: A Macroscopic Flow Model with Time-Varying Bottlenecks, Transportation Research Part B, Vol. 41, 2007, pp. 1114–1138.
15. Durlin T., and Henn V. Dynamic Network Loading Model with Explicit Traffic Wave Tracking. In Transportation Research Record: Journal of the Transportation Research Board, No. 2085, Transportation Research Board of the National Academies, Washington, D.C., 2008, pp. 1–11.
16. Durlin T. Vers une Affectation Dynamique Opérationnelle, Etude Théorique sur la Mise en Œuvre Opérationnelle de l'Affectation Dynamique. PhD dissertation. Institut National des Sciences Appliquées de Lyon, France, 2008.
17. Troutbeck R. Capacity of Limited-Priority Merge. In Transportation Research Record: Journal of the Transportation Research Board, No. 1678, TRB, National Research Council, Washington, D.C., 1999, pp. 269–276.
18. Daamen W., Loot M., and Hoogendoorn S. P. Empirical Analysis of Merging Behavior at Freeway On-Ramp. In Transportation Research Record: Journal of the Transportation Research Board, No. 2188, Transportation Research Board of the National Academies, Washington, D.C., 2010, pp. 108–118.
19. Press W., Teukolsky S., Vetterling W., and Flannery B. Numerical Recipes, The Art of Scientific Computing, 3rd ed. Cambridge University Press, Cambridge, United Kingdom, 2007.
Cite article
Cite article
Cite article
OR
Download to reference manager
If you have citation software installed, you can download article citation data to the citation manager of your choice
Information, rights and permissions
Information
Published In
Article first published online: January 1, 2011
Issue published: January 2011
Authors
Metrics and citations
Metrics
Journals metrics
This article was published in Transportation Research Record: Journal of the Transportation Research Board.
VIEW ALL JOURNAL METRICSArticle usage*
Total views and downloads: 41
*Article usage tracking started in December 2016
Altmetric
See the impact this article is making through the number of times it’s been read, and the Altmetric Score.
Learn more about the Altmetric Scores
Articles citing this one
Receive email alerts when this article is cited
Web of Science: 0
Crossref: 20
- The continuous signalized (COS) node model for dynamic traffic assignm...
- The Continuous Signalized (Cos) Node Model for Dynamic Traffic Assignm...
- The Continuous Signalized (Cos) Node Model for Dynamic Traffic Assignm...
- Variable speed limits in the link transmission model using an informat...
- Static traffic assignment with residual queues and spillback
- Continuous-time general link transmission model with simplified fannin...
- Static traffic assignment with residual queues and spillback
- Dynamic traffic assignment: A review of the methodological advances fo...
- On node models for high-dimensional road networks
- Genetics of traffic assignment models for strategic transport planning
- RECENT ADVANCES IN KINEMATIC WAVE THEORY OF TRAFFIC FLOWS: VARIATIONAL...
- An efficient and exact event-based algorithm for solving simplified fi...
- An efficient iterative link transmission model
- Node modeling for congested urban road networks
- A dynamic system characterization of road network node models**This wo...
- A family of macroscopic node models
- Quasi-dynamic traffic assignment with residual point queues incorporat...
- Discussion about traffic junction modelling: Conservation laws VS Hami...
- Equilibrium in Capacitated Network Models with Queueing Delays, Queue-...
- Non-unique flows in macroscopic first-order intersection models
Figures and tables
Figures & Media
Tables
View Options
Get access
Access options
If you have access to journal content via a personal subscription, university, library, employer or society, select from the options below:
loading institutional access options
Alternatively, view purchase options below:
Purchase 24 hour online access to view and download content.
Access journal content via a DeepDyve subscription or find out more about this option.
