Analyzing the effect of the street network configuration on the efficiency of an urban transportation system

Abstract This paper proposes a new specialized centrality measure to quantify the importance and the contribution amount of each street in an urban transportation network. Contrary to the previous general centrality measures (e.g., degree, betweenness, and closeness), this measure considers three important vehicular traffic characteristics: street capacity restrictions, the dominant pattern of travel demands, and the traffic-flow equilibrium. Applying the developed centrality measure to simulated networks shows that traffic flows more efficiently in urban networks with “small-world” configurations, where a certain number of shortcut links and locally clustered streets are allowed. However, with regular grid networks, the application of the proposed measure shows little efficiency. This outcome suggests that the regular grid is not suitable as a base structure in urban planning.

[1]  V. Latora,et al.  Centrality in networks of urban streets. , 2006, Chaos.

[2]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

[3]  Stephen P. Borgatti,et al.  Centrality and network flow , 2005, Soc. Networks.

[4]  Matthias Feil,et al.  Choosing the daily schedule , 2010 .

[5]  Dimitry Volchenkov.  Analysis of urban complex networks , 2008 .

[6]  T. Koopmans,et al.  Studies in the Economics of Transportation. , 1956 .

[7]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[8]  P. Bonacich.  Factoring and weighting approaches to status scores and clique identification , 1972 .

[9]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[10]  Bin Jiang,et al.  Flow dimension and capacity for structuring urban street networks , 2006, physics/0609095.

[11]  Christophe Claramunt,et al.  Topological Analysis of Urban Street Networks , 2004 .

[12]  Bill Hillier,et al.  Network and Psychological Effects in Urban Movement , 2005, COSIT.

[13]  M. Zelen,et al.  Rethinking centrality: Methods and examples☆ , 1989 .

[14]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[15]  Bin Jiang,et al.  Street hierarchies: a minority of streets account for a majority of traffic flow , 2008, Int. J. Geogr. Inf. Sci..

[16]  Michael T. Gastner,et al.  The spatial structure of networks , 2006 .

[17]  L. Freeman,et al.  Centrality in valued graphs: A measure of betweenness based on network flow , 1991 .

[18]  P. Blanchard,et al.  Mathematical Analysis of Urban Spatial Networks , 2008 .

[19]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[20]  Peter C. Dawson,et al.  Analysing the effects of spatial configuration on human movement and social interaction in Canadian Arctic communities , 2003 .

[21]  Bin Jiang,et al.  A Structural Approach to the Model Generalization of an Urban Street Network* , 2004, GeoInformatica.

[22]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[23]  Bin Jiang,et al.  Characterizing the human mobility pattern in a large street network. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  Alan Penn,et al.  Natural Movement: Or, Configuration and Attraction in Urban Pedestrian Movement , 1993 .

[25]  Bin Jiang,et al.  Agent-based simulation of human movement shaped by the underlying street structure , 2009, Int. J. Geogr. Inf. Sci..

[26]  Goran Jovicic.  Activity based travel demand modelling , 2001 .

[27]  B. Jiang.  A topological pattern of urban street networks: Universality and peculiarity , 2007, physics/0703223.

[28]  Martin Tomko,et al.  Experiential hierarchies of streets , 2008, Comput. Environ. Urban Syst..

[29]  Bill Hillier,et al.  The social logic of space: Contents , 1984 .

[30]  Subhash Suri,et al.  Finding the k shortest simple paths , 2007, ALENEX.

[31]  J. Y. Yen.  Finding the K Shortest Loopless Paths in a Network , 1971 .