An analysis of the Spanish high capacity road network criticality

The analysis of complex networks has been carried out in different fields using an ample variety of method and concepts. Recently, in the general literature of regional economics, the concepts of resilience, connectivity, vulnerability and criticality have been gaining their momentum. The aim of this paper is to provide an analytical framework, using well-known accessibility indicators, in order to calculate the critical links or road sections of the Spanish high-capacity road network. Our analysis will be based on approximately four hundred sections that will be classified in five different groups according to their criticality degree in the whole network. Our analysis will be complemented with the comparison of the results obtained in five different scenarios, namely the average criticality using the effects on the whole country, Madrid, Barcelona, Valencia and Pontevedra. Furthermore, the paper will also analyze what kind of intrinsic characteristics of the sections favor or not the links’ criticality using a method based on a classification and regression tree. This analysis is crucial to understand other important concepts that are recently being studied in network and spatial economics, like, for example, resilience and vulnerability. It is concluded that the number of relations or routes, being a trunk or not, the road density and the time to Madrid capital play an important role in the criticality of the roads section in the high capacity road network.     

Predicting travel time reliability using mobile phone GPS data

Estimates of road speeds have become commonplace and central to route planning, but few systems in production provide information about the reliability of the prediction. Probabilistic forecasts of travel time capture reliability and can be used for risk-averse routing, for reporting travel time reliability to a user, or as a component of fleet vehicle decision-support systems. Many of these uses (such as those for mapping services like Bing or Google Maps) require predictions for routes in the road network, at arbitrary times; the highest-volume source of data for this purpose is GPS data from mobile phones. We introduce a method (TRIP) to predict the probability distribution of travel time on an arbitrary route in a road network at an arbitrary time, using GPS data from mobile phones or other probe vehicles. TRIP captures weekly cycles in congestion levels, gives informed predictions for parts of the road network with little data, and is computationally efficient, even for very large road networks and datasets. We apply TRIP to predict travel time on the road network of the Seattle metropolitan region, based on large volumes of GPS data from Windows phones. TRIP provides improved interval predictions (forecast ranges for travel time) relative to Microsoft’s engine for travel time prediction as used in Bing Maps. It also provides deterministic predictions that are as accurate as Bing Maps predictions, despite using fewer explanatory variables, and differing from the observed travel times by only 10.1% on average over 35,190 test trips. To our knowledge TRIP is the first method to provide accurate predictions of travel time reliability for complete, large-scale road networks.     

Vulnerability analysis for large-scale and congested road networks with demand uncertainty

To assess the vulnerability of congested road networks, the commonly used full network scan approach is to evaluate all possible scenarios of link closure using a form of traffic assignment. This approach can be computationally burdensome and may not be viable for identifying the most critical links in large-scale networks. In this study, an “impact area” vulnerability analysis approach is proposed to evaluate the consequences of a link closure within its impact area instead of the whole network. The proposed approach can significantly reduce the search space for determining the most critical links in large-scale networks. In addition, a new vulnerability index is introduced to examine properly the consequences of a link closure. The effects of demand uncertainty and heterogeneous travellers’ risk-taking behaviour are explicitly considered. Numerical results for two different road networks show that in practice the proposed approach is more efficient than traditional full scan approach for identifying the same set of critical links. Numerical results also demonstrate that both stochastic demand and travellers’ risk-taking behaviour have significant impacts on network vulnerability analysis, especially under high network congestion and large demand variations. Ignoring their impacts can underestimate the consequences of link closures and misidentify the most critical links.     

Indicators of reliability and vulnerability: Similarities and differences in ranking links of a complex road system

This article investigates two performance attributes of road networks, reliability and vulnerability, analyzing their similarities as well as the differences that justify distinct definitions, based on consolidation of recent studies. We also discuss the indicators found in the literature for these two performance attributes. Since various authors treat vulnerability as an aspect of reliability instead of a specific attribute, we carried out an application to a complex road network representative of the city of Rio de Janeiro to check the suitability of this approach. The results show that the vulnerability indicators are more strongly affected by the characteristics of alternative routes while the reliability metrics are more sensitive to the congestion level. The conclusion is that reliability and vulnerability should be treated distinctly for evaluating the performance of road network links.     

Distance and time in intermodal goods transport networks in Europe: A generic approach

This paper is about distance and time as factors of competitiveness of intermodal transport. It reviews the relevance of the factors, evaluates time models in practice, compares network distances and times in alternative bundling networks with geometrically varied layouts, and points out how these networks perform in terms of vehicle scale, frequency and door-to-door time. The analysis focuses on intermodal transport in Europe, especially intermodal rail transport, but is in search for generic conclusions. The paper does not incorporate the distance and time results in cost models, and draws conclusions for transport innovation, wherever this is possible without cost modelling. For instance, the feature vehicle scale, an important factor of transport costs, is analysed and discussed.Distance and time are important factors of competitiveness of intermodal transport. They generate (direct) vehicle costs and – via transport quality – indirect costs to the customers. Clearly direct costs/prices are the most important performance of the intermodal transport system. The relevance of quality performances is less clarified. Customers emphasise the importance of a good match between the transport and the logistic system. In this framework (time) reliability is valued high. Often transport time, arrival and departure times, and frequency have a lower priority. But such conclusions can hardy be generalised. The range of valuations reflects the heterogeneity of situations. Some lack of clarity is obviously due to overlapping definitions of different performance types.The following parts of the paper are about two central fields of network design, which have a large impact on transport costs and quality, namely the design of vehicle roundtrips (and acceleration of transport speed) and the choice of bundling type: do vehicles provide direct services or run in what we call complex bundling networks? An example is the hub-and-spoke network. The objective of complex bundling is to increase vehicle scale and/or transport frequency even if network volumes are restricted. Complex bundling requires intermediate nodes for the exchange of load units. Examples of complex bundling networks are the hub-and-spoke network or the line network.Roundtrip and bundling design are interrelated policy fields: an acceleration of the roundtrip speed, often desirable from the cost point of view, can often only be carried out customer friendly, if the transport frequency is increased. But often the flow size is not sufficient for a higher frequency. Then a change of bundling model can be an outcome.Complex bundling networks are known to have longer average distances and times, the latter also due to the presence of additional intermediate exchange nodes. However, this disadvantage is – inside the limits of maximal vehicle sizes – overruled by the advantage of a restricted number of network links. Therefore generally, complex bundling networks have shorter total vehicle distances and times. This expression of economies of scale implies lower vehicle costs per load unit.The last part of the paper presents door-to-door times of load units of complex bundling networks and compares them with unimodal road transport. The times of complex bundling networks are larger than that of networks with direct connections, but nevertheless competitive with unimodal road transport, except for short distances.     

Sensitivity analysis on stochastic equilibrium transportation networks using genetic algorithm

This study deals with the sensitivity analysis of an equilibrium transportation networks using genetic algorithm approach and uses the bi‐level iterative sensitivity algorithm. Therefore, integrated Genetic Algorithm‐TRANSYT and Path Flow Estimator (GATPFE) is developed for signalized road networks for various level of perceived travel time in order to test the sensitivity of perceived travel time error in an urban stochastic road networks. Level of information provided to drivers correspondingly affects the signal timing parameters and hence the Stochastic User Equilibrium (SUE) link flows. When the information on road system is increased, the road users try to avoid conflicting links. Therefore, the stochastic equilibrium assignment concept tends to be user equilibrium. The GATPFE is used to solve the bi‐level problem, where the Area Traffic Control (ATC) is the upper‐level and the SUE assignment is the lower‐level. The GATPFE is tested for six‐junction network taken from literature. The results show that the integrated GATPFE can be applied to carry out sensitivity analysis at the equilibrium network design problems for various level of information and it simultaneously optimize the signal timings (i.e. network common cycle time, signal stage and offsets between junctions).     

A framework for robustness analysis of road networks for short term variations in supply

There is a growing awareness that road networks, are becoming more and more vulnerable to unforeseen disturbances like incidents and that measures need to be taken in order to make road networks more robust. In order to do this the following questions need to be addressed: How is robustness defined? Against which disturbances should the network be made robust? Which factors determine the robustness of a road network? What is the relationship between robustness, travel times and travel time reliability? Which indicators can be used to quantify robustness? How can these indicators be computed? This paper addresses these questions by developing a consistent framework for robustness in which a definition, terms related to robustness, indicators and an evaluation method are included. By doing this, policy makers and transportation analyst are offered a framework to discuss issues that are related to road network robustness and vulnerability which goes beyond the disconnected definitions, indicators and evaluation methods used so far in literature. Furthermore, the evaluation method that is presented for evaluating the robustness of the road network against short term variations in supply (like incidents) contributes to the problem of designing robust road networks because it has a relatively short computation time and it takes spillback effects and alternative routes into account.     

Large-scale road network vulnerability analysis: a sensitivity analysis based approach

Traditionally, an assessment of transport network vulnerability is a computationally intensive operation. This article proposes a sensitivity analysis-based approach to improve computational efficiency and allow for large-scale applications of road network vulnerability analysis. Various vulnerability measures can be used with the proposed method. For illustrative purposes, this article adopts the relative accessibility index (AI), which follows the Hansen integral index, as the network vulnerability measure for evaluating the socio-economic effects of link (or road segment) capacity degradation or closure. Critical links are ranked according to the differences in the AIs between normal and degraded networks. The proposed method only requires a single computation of the network equilibrium problem. The proposed technique significantly reduces computational burden and memory storage requirements compared with the traditional approach. The road networks of the Sioux Falls city and the Bangkok metropolitan area are used to demonstrate the applicability and efficiency of the proposed method. Network manager(s) or transport planner(s) can use this approach as a decision support tool for identifying critical links in road networks. By improving these critical links or constructing new bypass roads (or parallel paths) to increase capacity redundancy, the overall vulnerability of the networks can be reduced.     

Distributions of travel time variability on urban roads

Reliability is an important factor in route, mode and also departure time choice analysis and is a key performance indicator for transport systems. However, the current metrics used to measure travel time variability may be not sufficient to fully represent reliability. Better understanding of the distributions of travel times is needed for the development of improved metrics for reliability. A comprehensive data analysis involving the assessment of longitudinal travel time data for two urban arterial road corridors in Adelaide, Australia, demonstrates that the observed distributions are more complex than previously assumed. The data sets demonstrate strong positive skew, very long upper tails, and sometimes bimodality. This paper proposes the use of alternative statistical distributions for travel time variability, with the Burr Type XII distribution emerging as an appropriate model for both links and routes. This statistical distribution has some attractive properties that make it suitable for explicit definition of many travel time reliability metrics. Copyright © 2011 John Wiley & Sons, Ltd.     

Road network vulnerability analysis of area-covering disruptions: A grid-based approach with case study

We present an approach to systematically analysing the vulnerability of road networks under disruptions covering extended areas. Since various kinds of events including floods, heavy snowfall, storms and wildfires can cause such spatially spread degradations, the analysis method is an important complement to the existing studies of single link failures. The methodology involves covering the study area with grids of uniformly shaped and sized cells, where each cell represents the extent of an event disrupting any intersecting links. We apply the approach to the Swedish road network using travel demand and network data from the Swedish national transport modelling system Sampers. The study shows that the impacts of area-covering disruptions are largely determined by the level of internal, outbound and inbound travel demand of the affected area itself. This is unlike single link failures, where the link flow and the redundancy in the surrounding network determine the impacts. As a result, the vulnerability to spatially spread events shows a markedly different geographical distribution. These findings, which should be universal for most road networks of similar scale, are important in the planning process of resource allocation for mitigation and recovery.     

公路网运行时间可靠度研究

路网可靠度研究是国内外交通运输领域的一个重要研究方向。文章结合国内外时间可靠度模型研究的现状,介绍了公路网运行时间可靠度的模型以及算法,并展望了时间可靠度理论的研究方向。     

Importance and exposure in road network vulnerability analysis

The reliability and vulnerability of critical infrastructures have attracted a lot of attention recently. In order to assess these issues quantitatively, operational measures are needed. Such measures can also be used as guidance to road administrations in their prioritisation of maintenance and repair of roads, as well as for avoiding causing unnecessary disturbances in the planning of roadwork. The concepts of link importance and site exposure are introduced. In this paper, several link importance indices and site exposure indices are derived, based on the increase in generalised travel cost when links are closed. These measures are divided into two groups: one reflecting an “equal opportunities perspective”, and the other a “social efficiency perspective”. The measures are calculated for the road network of northern Sweden. Results are collected in a GIS for visualisation, and are presented per link and municipality. In view of the recent great interest in complex networks, some topological measures of the road network are also presented.     

Efficient solution algorithm for finding spatially dependent reliable shortest path in road networks

Travel times are generally stochastic and spatially correlated in congested road networks. However, very few existing route guidance systems (RGS) can provide reliable guidance services to aid travellers planning their trips with taking account explicitly travel time reliability constraint. This study aims to develop such a RGS with particular consideration of travellers' concern on travel time reliability in congested road networks with uncertainty. In this study, the spatially dependent reliable shortest path problem (SD‐RSPP) is formulated as a multi‐criteria shortest path‐finding problem in road networks with correlated link travel times. Three effective dominance conditions are established for links with different levels of travel time correlations. An efficient algorithm is proposed to solve SD‐RSPP by adaptively using three established dominance conditions. The complexities of road networks in reality are also explicitly considered. To demonstrate the applicability of proposed algorithm, a comprehensive case study is carried out in Hong Kong. The results of case study show that the proposed solution algorithm is robust to take account of travellers' multiple routing criteria. Computational results demonstrate that the proposed solution algorithm can determine the reliable shortest path on real‐time basis for large‐scale road networks. Copyright © 2016 John Wiley & Sons, Ltd.     

Dense network traffic models,travel time reliability and traffic management. Ii: Application to network reliability

This paper is the second of a pair of papers discussing two main themes concerning dense network modelling. These themes are: (1) the changing nature of traffic management technology and the underlying objectives behind traffic management practice, and (2) the use of measures of network reliability in models, especially as an element of the evaluation of alternative network configurations. This paper develops and applies the second theme, the use of network reliability concepts in the evaluation of traffic networks, through consideration of variations in travel times, distinction between local street and arterial road networks, and the definition and application of a set of reliability indices that may be used to study different trip movements in a network. It indicates how these indices may be used in appraising different traffic management plans for a dense network of local streets and arterial roads, using a case study application.     

Value of travel time reliability: A review of current evidence

Travel time reliability is a fundamental factor in travel behavior. It represents the temporal uncertainty experienced by travelers in their movement between any two nodes in a network. The importance of the time reliability depends on the penalties incurred by the travelers. In road networks, travelers consider the existence of a trip travel time uncertainty in different choice situations (departure time, route, mode, and others). In this paper, a systematic review of the current state of research in travel time reliability, and more explicitly in the value of travel time reliability is presented. Moreover, a meta-analysis is performed in order to determine the reasons behind the discrepancy among the reliability estimates.     

Measuring marginal congestion costs of urban transportation: Do networks matter?

In determining the marginal cost of congestion, economists have traditionally relied upon directly measuring traffic congestion on network links, disregarding any “network effects,” since the latter are difficult to estimate. While for simple networks the comparison of the network-based congestion costs with the link-based ones can be done within a theoretical framework, it is important to know whether such network effects in real large-scale networks are quantitatively significant.In this paper we use a strategic transportation planning model (START) to compare marginal congestion costs computed link-by-link with measures taking into account network effects. We find that while in aggregate network effects are not significant, congestion measured on a single link is a poor predictor of total congestion costs imposed by travel on that link. Also, we analyze the congestion proliferation effect on the network to see how congestion is distributed within an urban area.     

How tube strikes affect macroscopic and link travel times in London

Abstract

The purpose of this study was to investigate the impact of the five strikes on the London Underground (metro) rail system, which occurred in 2009 and 2010, on macroscopic and road link travel times. A consequence of these strikes was an increase in road traffic flows above usual levels. This provides an opportunity to observe the operation of the road network under unusually high flows. The first objective involves the examination of strike effects on inbound (IT) and outbound traffic (OT) within central, inner and outer London. Travel time data obtained from automatic number plate recognition cameras are used within the first part of the analysis. The second more detailed objective was to investigate in spatio-temporal effects on travel times on five road links. Correlation analyses and general linear models are developed using both traffic flow and travel time data. According to the results of the study, the morning IT had approximately twice as much delay as the OT. Central London experienced the highest delays, followed by inner and outer London. As would be expected, the unique full-day strike in 2009 yielded the worst impact on the network with the highest percentage increase in total travel time (60%) occurring during the morning peak in the IT in inner London. The results from the link-level analysis showed statistical significance amongst the examined links indicating heterogeneous effects from one link to another. It was also found that travel time changes may be more effectively captured through time-of-day terms compared to hourly traffic flows.     

Traffic congestion pricing methodologies and technologies

This paper reviews the methods and technologies for congestion pricing of roads. Congestion tolls can be implemented at scales ranging from individual lanes on single links to national road networks. Tolls can be differentiated by time of day, road type and vehicle characteristics, and even set in real time according to current traffic conditions. Conventional toll booths have largely given way to electronic toll collection technologies. The main technology categories are roadside-only systems employing digital photography, tag & beacon systems that use short-range microwave technology, and in-vehicle-only systems based on either satellite or cellular network communications. The best technology choice depends on the application. The rate at which congestion pricing is implemented, and its ultimate scope, will depend on what technology is used and on what other functions and services it can perform.     

Effect of providing traffic information estimated by a stochastic network equilibrium model with stochastic demand

To estimate travel times through road networks, in this study, we assume a stochastic demand and formulate a stochastic network equilibrium model whose travel times, flows, and demands are stochastic. This model enables us to examine network reliability under stochastic circumstances and to evaluate the effect of providing traffic information on travel times. For traffic information, we focus on travel time information and propose methods to evaluate the effect of providing that information. To examine the feasibility and validity of the proposed model and methods, we apply them to a simple network and the real road network of Kanazawa, Japan. The results indicate that providing ambulance drivers in Kanazawa with travel time information leads to an average reduction in travel time of approximately three minutes.     

An intermodal freight transport system for optimal supply chain logistics

Complexity in transport networks evokes the need for instant response to the changing dynamics and uncertainties in the upstream operations, where multiple modes of transport are often available, but rarely used in conjunction. This paper proposes a model for strategic transport planning involving a network wide intermodal transport system. The system determines the spatio-temporal states of road based freight networks (unimodal) and future traffic flow in definite time intervals. This information is processed to devise efficient scheduling plans by coordinating and connecting existing rail transport schedules to road based freight systems (intermodal). The traffic flow estimation is performed by kernel based support vector mechanisms while mixed integer programming (MIP) is used to optimize schedules for intermodal transport network by considering various costs and additional capacity constraints. The model has been successfully applied to an existing Fast Moving Consumer Goods (FMCG) distribution network in India with encouraging results.