Abstract
We study the emergence of congestion patterns in urban networks by modeling vehicular interaction by means of a simple traffic rule and by using a set of measures inspired by the standard Betweenness Centrality (BC). We consider a topologically heterogeneous group of cities and simulate the network loading during the morning peak-hour by increasing the number of circulating vehicles. At departure, vehicles are aware of the network state and choose paths with optimal traversal time. Each added path modifies the vehicular density and travel times for the following vehicles. Starting from an empty network and adding traffic until transportation collapses, provides a framework to study network’s transition to congestion and how connectivity is progressively disrupted as the fraction of impossible paths becomes abruptly dominant. We use standard BC to probe into the instantaneous out-of-equilibrium network state for a range of traffic levels and show how this measure may be improved to build a better proxy for cumulative road usage during peak-hours. We define a novel dynamical measure to estimate cumulative road usage and the associated total time spent over the edges by the population of drivers. We also study how congestion starts with dysfunctional edges scattered over the network, then organizes itself into relatively small, but disruptive clusters.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Çolak, S., Lima, A., González, M.C.: Understanding congested travel in urban areas. Nat. Commun. 7(1), 10793 (2016)
Li, D., Fu, B., Wang, Y., Lu, G., Berezin, Y., Eugene Stanley, H., Havlin, S.: Percolation transition in dynamical traffic network with evolving critical bottlenecks. Proc. Natl. Acad. Sci. USA 112(3), 669–672 (2015)
Kirkley, A., Barbosa, H., Barthelemy, M., Ghoshal, G.: From the betweenness centrality in street networks to structural invariants in random planar graphs. Nat. Commun. 9(1), 2501 (2018) (Number: 1 Publisher: Nature Publishing Group)
Zeng, G., Li, D., Guo, S., Gao, L., Gao, Z., Eugene Stanley, H., Havlin, S.: Switch between critical percolation modes in city traffic dynamics. Proc. Natl. Acad. Sci. USA 116(1), 23–28 (2019)
Hamedmoghadam, H., Jalili, M., Vu, H.L., Stone, L.: Percolation of heterogeneous flows uncovers the bottlenecks of infrastructure networks. Nat. Commun. 12(1), 1254 (2021)
Bongiorno, C., Zhou, Y., Kryven, M., Theurel, D., Rizzo, A., Santi, P., Tenenbaum, J., Ratti, C.: Vector-based pedestrian navigation in cities. Nat. Comput. Sci. 1(10), 678–685 (2021) (Number: 10 Publisher: Nature Publishing Group)
Lee, M., Barbosa, H., Youn, H., Holme, P., Ghoshal, G.: Morphology of travel routes and the organization of cities. Nat. Commun. 8(1), 2229 (2017) (Number: 1 Publisher: Nature Publishing Group)
Diet, A., Barthelemy, M.: Towards a classification of planar maps. Phys. Rev. E 98(6), 062304 (2018) (Publisher: American Physical Society)
Helbing, D.: Traffic and related self-driven many-particle systems. Rev. Mod. Phys. 73(4), 1067–1141 (2001) (Publisher: American Physical Society)
Aldous, D., Ganesan, K.: True scale-invariant random spatial networks. Proc. Natl. Acad. Sci. 110(22), 8782–8785 (2013)
White, D.R., Borgatti, S.P.: Betweenness centrality measures for directed graphs. Soc. Netw. 16(4), 335–346 (1994)
Newman, M.E.J.: A measure of betweenness centrality based on random walks. Soc. Netw. 27(1), 39–54 (2005)
Cogoni, M., Busonera, G.: Stability of traffic breakup patterns in urban networks. Phys. Rev. E 104(1), L012301 (2021)
Taillanter. E., Barthelemy, M.: Empirical evidence for a jamming transition in urban traffic. arXiv:2109.00233 [cond-mat, physics:physics]. arXiv: 2109.00233 (2021)
Taras, A., Tortosa, L., Vicent, J.F.: A variant of the current flow betweenness centrality and its application in urban networks. Appl. Math. Comput. 347, 600–615 (2019)
Gao, S., Wang, Y., Gao, Y., Liu, Y.: Understanding urban traffic-flow characteristics: a rethinking of betweenness centrality. Environ. Plann. B. Plann. Des. 40(1), 135–153 (2013)
Kazerani, A., Winter, S.: Can betweenness centrality explain traffic flow. In: 12th AGILE International Conference on Geographic Information Science, pp. 1–9 (2009)
Rakha, H., Crowther, B.: Comparison of greenshields, pipes, and van aerde car-following and traffic stream models. Transp. Res. Rec. 1802(1), 248–262 (2002)
Jin, W.-L.: Introduction to Network Traffic Flow Theory: Principles Models, and Methods. Elsevier, Concepts (2021)
Olmos, L.E. Çolak, S., Shafiei, S., Saberi, M., González, M.C.: Macroscopic dynamics and the collapse of urban traffic. Proc. Nat. Acad. Sci. 115(50), 12654–12661 (2018) (Publisher: Proceedings of the National Academy of Sciences)
Riondato, M., Kornaropoulos, E.M.: Fast approximation of betweenness centrality through sampling. Data Min. Knowl. Discov. 30(2), 438–475 (2016)
Bavaud, F., Guex, G.: Interpolating Between Random Walks and Shortest Paths: A Path Functional Approach. arXiv:1207.1253 [physics]. arXiv: 1207.1253 (2012)
Acknowledgments
This work has received funding from Sardinian Regional Authorities under projects SVDC (art 9Â L.R. 20/2015) and TDM (POR FESR 2014-2020 Action 1.2.2). Map data copyrighted OpenStreetMap contributors: www.openstreetmap.org
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Cogoni, M., Busonera, G., Versaci, F. (2023). Estimating Peak-Hour Urban Traffic Congestion. In: Cherifi, H., Mantegna, R.N., Rocha, L.M., Cherifi, C., Miccichè, S. (eds) Complex Networks and Their Applications XI. COMPLEX NETWORKS 2016 2022. Studies in Computational Intelligence, vol 1077. Springer, Cham. https://doi.org/10.1007/978-3-031-21127-0_44
Download citation
DOI: https://doi.org/10.1007/978-3-031-21127-0_44
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-21126-3
Online ISBN: 978-3-031-21127-0
eBook Packages: EngineeringEngineering (R0)