Static Traffic Assignment on Ensembles of Synthetic Road Networks

Alonso Espinosa Mireles de Villafranca (), Richard D. Connors () and R. Eddie Wilson ()
Additional contact information
Alonso Espinosa Mireles de Villafranca: University of Bristol
Richard D. Connors: University of Leeds
R. Eddie Wilson: University of Bristol

A chapter in Traffic and Granular Flow '17, 2019, pp 29-36 from Springer

Abstract: 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.

Date: 2019
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-030-11440-4_4

Ordering information: This item can be ordered from
http://www.springer.com/9783030114404

DOI: 10.1007/978-3-030-11440-4_4

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().