Abstract
We present a systematic approach for studying how performance of road networks is affected by changes in their geometry. We develop a new family of random planar graphs that models road networks and interpolates between a square grid and the β-skeleton of uniformly random points. The capacities of streets are set according to a rule that models a fixed provision of total resources. Ensembles of graphs are generated for different geometric parameter choices and the static traffic assignment problem is solved for a range of traffic demands. We find that variations in network efficiency, measured by the price of anarchy, are small both across demand values and geometric parameters. However, the best-performing networks are those which preserve some grid structure. We find that the price of anarchy does not correlate well with standard network statistics.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Beckmann, M.J., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)
Jaromczyk, J., Toussaint, G.: Relative neighborhood graphs and their relatives. Proc. IEEE 80(9), 1502–1517 (1992)
O’Hare, S.J., Connors, R.D., Watling, D.P.: Mechanisms that govern how the price of anarchy varies with travel demand. Transp. Res. B Methodol. 84, 55–80 (2016)
Osaragi, T., Hiraga, Y.: Street network created by proximity graphs: its topological structure and travel efficiency. In: 17th Conference of the Association of Geographic Information Laboratories for Europe on Geographic Information Science (AGILE2014), pp. 1–5. AGILE Digital Editions, Aalborg (2014)
Papadimitriou, C.: Algorithms, games, and the internet. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, STOC 01, pp. 749–753. ACM, New York (2001)
Patriksson, M.: The Traffic Assignment Problem: Models and Methods. Courier Dover Publications, Mineola (2015)
Roughgarden, T.: The price of anarchy is independent of the network topology. J. Comput. Syst. Sci. 67(2), 341–364 (2003)
Youn, H., Gastner, M.T., Jeong, H.: Price of anarchy in transportation networks: efficiency and optimality control. Phys. Rev. Lett. 101(12), 128701–128704 (2008)
Acknowledgement
The first author would like to acknowledge funding from the Mexican Council of Science and Technology (CONACYT).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Mireles de Villafranca, A.E., Connors, R.D., Wilson, R.E. (2019). Static Traffic Assignment on Ensembles of Synthetic Road Networks. In: Hamdar, S. (eds) Traffic and Granular Flow '17. TGF 2017. Springer, Cham. https://doi.org/10.1007/978-3-030-11440-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-11440-4_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-11439-8
Online ISBN: 978-3-030-11440-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)