Using a random road graph model to understand road networks robustness to link failures
Philippe Y.R. Sohouenou, Panayotis Christidis, Aris Christodoulou, Luís Neves, Davide Lo Presti
Abstract
Disruptions to the transport system have a greater impact on society and the economy now than ever before due to the increased interconnectivity and interdependency of the economic sectors. The ability of transport systems to maintain functionality despite various disturbances (i.e. robustness) is hence of tremendous importance and has been the focus of research seeking to support transport planning, design and management. These approaches and findings may nevertheless be only valid for the specific networks studied. The present study attempts to find universal insights into road networks robustness by exploring the correlation between different network attributes and network robustness to single, multiple, random and targeted link failures. For this purpose, the common properties of road graphs were identified through a literature review. On this basis, the GREREC model was developed to randomly generate a variety of abstract networks presenting the topological and operational characteristics of real-road networks, on which a robustness analysis was performed. This analysis quantifies the difference between the link criticality rankings when only single-link failures are considered as opposed to when multiple-link failures are considered and the difference between the impact of targeted and random attacks. The influence of the network attributes on the network robustness and on these two differences is shown and discussed. Finally, this analysis is also performed on a set of real road networks to validate the results obtained with the artificial networks.