Exploring the evolution of London's street network in the information space: a dual approach

Dual graph characteristics of water distribution networks-how optimal are design solutions?

Urban water infrastructures are an essential part of urban areas. For their construction and maintenance, major investments are required to ensure an efficient and reliable function. Vital parts of the urban water infrastructures are water distribution networks (WDNs), which transport water from the production (sources) to the spatially distributed consumers (sinks). To minimize the costs and at the same time maximize the resilience of such a system, multi-objective optimization procedures (e.g., meta-heuristic searches) are performed. Assessing the hydraulic behavior of WDNs in such an optimization procedure is no trivial task and is computationally demanding. Further, deciding how close to optimal design solutions the current solutions are, is difficult to assess and often results in an unnecessary extent of experiment. To tackle these challenges, an answer to the questions is sought: when is an optimization stage achieved from which no further improvements can be expected, and how can that be assessed? It was found that graph characteristics based on complex network theory (number of dual graph elements) converge towards a certain threshold with increasing number of generations. Furthermore, a novel method based on network topology and the demand distribution in WDNs, specifically based on changes in 'demand edge betweenness centrality', for identifying that threshold is developed and successfully tested. With the proposed novel approach, it is feasible, prior to the optimization, to determine characteristics that optimal design solutions should fulfill, and thereafter, test them during the optimization process. Therewith, numerous simulation runs of meta-heuristic search engines can be avoided.

Road networks structure analysis: A preliminary network science-based approach

Road network studies attracted unprecedented and overwhelming interest in recent years due to the clear relationship between human existence and city evolution. Current studies cover many aspects of a road network, for example, road feature extraction from video/image data, road map generalisation, traffic simulation, optimisation of optimal route finding problems, and traffic state prediction. However, analysing road networks as a complex graph is a field to explore. This study presents comparative studies on the Porto, in Portugal, road network sections, mainly of Matosinhos, Paranhos, and Maia municipalities, regarding degree distributions, clustering coefficients, centrality measures, connected components, k-nearest neighbours, and shortest paths. Further insights into the networks took into account the community structures, page rank, and small-world analysis. The results show that the information exchange efficiency of Matosinhos is 0.8, which is 10 and 12.8% more significant than that of the Maia and Paranhos networks, respectively. Other findings stated are: (1) the studied road networks are very accessible and densely linked; (2) they are small-world in nature, with an average length of the shortest pathways between any two roads of 29.17 units, which as found in the scenario of the Maia road network; and (3) the most critical intersections of the studied network are 'Avenida da Boavista, 4100-119 Porto (latitude: 41.157944, longitude: - 8.629105)', and 'Autoestrada do Norte, Porto (latitude: 41.1687869, longitude: - 8.6400656)', based on the analysis of centrality measures.

Towards the automated large-scale reconstruction of past road networks from historical maps

Transportation infrastructure, such as road or railroad networks, represent a fundamental component of our civilization. For sustainable planning and informed decision making, a thorough understanding of the long-term evolution of transportation infrastructure such as road networks is crucial. However, spatially explicit, multi-temporal road network data covering large spatial extents are scarce and rarely available prior to the 2000s. Herein, we propose a framework that employs increasingly available scanned and georeferenced historical map series to reconstruct past road networks, by integrating abundant, contemporary road network data and color information extracted from historical maps. Specifically, our method uses contemporary road segments as analytical units and extracts historical roads by inferring their existence in historical map series based on image processing and clustering techniques. We tested our method on over 300,000 road segments representing more than 50,000 km of the road network in the United States, extending across three study areas that cover 42 historical topographic map sheets dated between 1890 and 1950. We evaluated our approach by comparison to other historical datasets and against manually created reference data, achieving F-1 scores of up to 0.95, and showed that the extracted road network statistics are highly plausible over time, i.e., following general growth patterns. We demonstrated that contemporary geospatial data integrated with information extracted from historical map series open up new avenues for the quantitative analysis of long-term urbanization processes and landscape changes far beyond the era of operational remote sensing and digital cartography.

A Geometric Classification of World Urban Road Networks

This article presents a method to uncover universal patterns and similarities in the urban road networks of the 80 most populated cities in the world. To that end, we used degree distribution, link length distribution, and intersection angle distribution as topological and geometric properties of road networks. Moreover, we used ISOMAP, a nonlinear dimension reduction technique, to better express variations across cities, and we used K-means to cluster cities. Overall, we uncovered one universal pattern between the number of nodes and links across all cities and identified five classes of cities. Gridiron Cities tend to have many 90° angles. Long Link Cities have a disproportionately high number of long links and include mostly Chinese cities that developed towards the end of the 20th century. Organic Cities tend to have short links and more non-90 and 180° angles; they also include relatively more historical cities. Hybrid Cities tend to have both short and long links; they include cities that evolved both historically and recently. Finally, Mixed Cities exhibit features from all other classes. These findings can help transport planners and policymakers identify peer cities that share similar characteristics and use their characteristics to craft tailored transport policies.

The Evolution and Growth Patterns of the Road Network in a Medium-Sized Developing City: A Historical Investigation of Changchun, China, from 1912 to 2017

Understanding the evolution and growth patterns of urban road networks helps to design an efficient and sustainable transport network. The paper proposed a general study framework and analytical workflow based on network theory that could be applied to almost any city to analyze the temporal evolution of road networks. The main tasks follow three steps: vector road network drawing, topology graph generation, and measure classification. Considering data availability and the limitations of existing studies, we took Changchun, China, a middle-sized developing city that is seldom reported in existing studies, as the study area. The research results of Changchun (1912–2017) show the road networks sprawled and densified over time, and the evolution patterns depend on the historical periods and urban planning modes. The evolution of network scales exhibits significant correlation; the population in the city is well correlated with the total road length and car ownership. Each network index also presents specific rules. All road networks are small-world networks, and the arterial roads have been consistent over time; however, the core area changes within the adjacent range but is generally far from the old city. More importantly, we found the correlation between structure and function of the urban road networks in terms of the temporal evolution. However, the temporal evolution pattern shows the correlation varies over time or planning modes, which had not been reported

Managing Emergency Situations in VANET Through Heterogeneous Technologies Cooperation

Nowadays, the research on vehicular computing enhanced a very huge amount of services and protocols, aimed to vehicles security and comfort. The investigation of the IEEE802.11p, Wireless Access in Vehicular Environments (WAVE) and Dedicated Short Range Communication (DSRC) standards gave to the scientific world the chance to integrate new services, protocols, algorithms and devices inside vehicles. This opportunity attracted the attention of private/public organizations, which spent lot of resources and money to promote vehicular technologies. In this paper, the attention is focused on the design of a new approach for vehicular environments able to gather information during mobile node trips, for advising dangerous or emergency situations by exploiting on-board sensors. It is assumed that each vehicle has an integrated on-board unit composed of several sensors and Global Position System (GPS) device, able to spread alerting messages around the network, regarding warning and dangerous situations/conditions. On-board units, based on the standard communication protocols, share the collected information with the surrounding road-side units, while the sensing platform is able to recognize the environment that vehicles are passing through (obstacles, accidents, emergencies, dangerous situations, etc.). Finally, through the use of the GPS receiver, the exact location of the caught event is determined and spread along the network. In this way, if an accident occurs, the arriving cars will, probably, avoid delay and danger situations.

Dynamics of functional failures and recovery in complex road networks

We propose a new framework for modeling the evolution of functional failures and recoveries in complex networks, with traffic congestion on road networks as the case study. Differently from conventional approaches, we transform the evolution of functional states into an equivalent dynamic structural process: dual-vertex splitting and coalescing embedded within the original network structure. The proposed model successfully explains traffic congestion and recovery patterns at the city scale based on high-resolution data from two megacities. Numerical analysis shows that certain network structural attributes can amplify or suppress cascading functional failures. Our approach represents a new general framework to model functional failures and recoveries in flow-based networks and allows understanding of the interplay between structure and function for flow-induced failure propagation and recovery.

Generic patterns in the evolution of urban water networks: Evidence from a large Asian city

We examine high-resolution urban infrastructure data using every pipe for the water distribution network (WDN) and sanitary sewer network (SSN) in a large Asian city (≈4 million residents) to explore the structure as well as the spatial and temporal evolution of these infrastructure networks. Network data were spatially disaggregated into multiple subnets to examine intracity topological differences for functional zones of the WDN and SSN, and time-stamped SSN data were examined to understand network evolution over several decades as the city expanded. Graphs were generated using a dual-mapping technique (Hierarchical Intersection Continuity Negotiation), which emphasizes the functional attributes of these networks. Network graphs for WDNs and SSNs are characterized by several network topological metrics, and a double Pareto (power-law) model approximates the node-degree distributions of both water infrastructure networks (WDN and SSN), across spatial and hierarchical scales relevant to urban settings, and throughout their temporal evolution over several decades. These results indicate that generic mechanisms govern the networks' evolution, similar to those of scale-free networks found in nature. Deviations from the general topological patterns are indicative of (1) incomplete establishment of network hierarchies and functional network evolution, (2) capacity for growth (expansion) or densification (e.g., in-fill), and (3) likely network vulnerabilities. We discuss the implications of our findings for the (re-)design of urban infrastructure networks to enhance their resilience to external and internal threats.

Modeling complexity in engineered infrastructure system: Water distribution network as an example

The complex topology and adaptive behavior of infrastructure systems are driven by both self-organization of the demand and rigid engineering solutions. Therefore, engineering complex systems requires a method balancing holism and reductionism. To model the growth of water distribution networks, a complex network model was developed following the combination of local optimization rules and engineering considerations. The demand node generation is dynamic and follows the scaling law of urban growth. The proposed model can generate a water distribution network (WDN) similar to reported real-world WDNs on some structural properties. Comparison with different modeling approaches indicates that a realistic demand node distribution and co-evolvement of demand node and network are important for the simulation of real complex networks. The simulation results indicate that the efficiency of water distribution networks is exponentially affected by the urban growth pattern. On the contrary, the improvement of efficiency by engineering optimization is limited and relatively insignificant. The redundancy and robustness, on another aspect, can be significantly improved through engineering methods.

Resilience of Self-Organised and Top-Down Planned Cities--A Case Study on London and Beijing Street Networks

The success or failure of the street network depends on its reliability. In this article, using resilience analysis, the author studies how the shape and appearance of street networks in self-organised and top-down planned cities influences urban transport. Considering London and Beijing as proxies for self-organised and top-down planned cities, the structural properties of London and Beijing networks first are investigated based on their primal and dual representations of planar graphs. The robustness of street networks then is evaluated in primal space and dual space by deactivating road links under random and intentional attack scenarios. The results show that the reliability of London street network differs from that of Beijing, which seems to rely more on its architecture and connectivity. It is found that top-down planned Beijing with its higher average degree in the dual space and assortativity in the primal space is more robust than self-organised London using the measures of maximum and second largest cluster size and network efficiency. The article offers an insight, from a network perspective, into the reliability of street patterns in self-organised and top-down planned city systems.

Multifractal to monofractal evolution of the London street network

We perform a multifractal analysis of the evolution of London's street network from 1786 to 2010. First, we show that a single fractal dimension, commonly associated with the morphological description of cities, does not suffice to capture the dynamics of the system. Instead, for a proper characterization of such a dynamics, the multifractal spectrum needs to be considered. Our analysis reveals that London evolves from an inhomogeneous fractal structure, which can be described in terms of a multifractal, to a homogeneous one, which converges to monofractality. We argue that London's multifractal to monofractal evolution might be a special outcome of the constraint imposed on its growth by a green belt. Through a series of simulations, we show that multifractal objects, constructed through diffusion limited aggregation, evolve toward monofractality if their growth is constrained by a nonpermeable boundary.