Exposing the role of exposure: Public transport network risk analysis

Network risk assessment takes into consideration the probability that adverse events occur and the impacts of such disruptions on network functionality. In the context of transport networks, most studies have focused on vulnerability, the reduction in performance indicators given that a disruption occurs. This study presents and applies a method to explicitly account for exposure in identifying and evaluating link criticality in public transport networks. The proposed method is compared with conventional measures that lack exposure information. A criticality assessment is performed by accounting for the probability of a certain event occurring and the corresponding welfare loss. The methodology was applied for a multi-modal public transport network in the Netherlands where data concerning disruptions was available. The results expose the role of exposure in determining link criticality and overall network vulnerability. The findings demonstrate that disregarding exposure risks prioritizing links with high passenger volumes over links with a higher failure probability that are significantly more critical to network performance. The inclusion of exposure allows performing a risk analysis and has consequences on assessing mitigation measures and investment priorities.     

Identification and quantification of link vulnerability in multi-level public transport networks: a passenger perspective

Robust public transport networks are important, since disruptions decrease the public transport accessibility of areas. Despite this importance, the full passenger impacts of public transport network vulnerability have not yet been considered in science and practice. We have developed a methodology to identify the most vulnerable links in the total, multi-level public transport network and to quantify the societal costs of link vulnerability for these identified links. Contrary to traditional single-level network approaches, we consider the integrated, total multi-level PT network in the identification and quantification of link vulnerability, including PT services on other network levels which remain available once a disturbance occurs. We also incorporate both exposure to large, non-recurrent disturbances and the impacts of these disturbances explicitly when identifying and quantifying link vulnerability. This results in complete and realistic insights into the negative accessibility impacts of disturbances. Our methodology is applied to a case study in the Netherlands, using a dataset containing 2.5 years of disturbance information. Our results show that especially crowded links of the light rail/metro network are vulnerable, due to the combination of relatively high disruption exposure and relatively high passenger flows. The proposed methodology allows quantification of robustness benefits of measures, in addition to the costs of these measures. Showing the value of robustness, our work can support and rationalize the decision-making process of public transport operators and authorities regarding the implementation of robustness measures.     

A dynamic stochastic assignment model for the analysis of general networks

The paper adopts the framework employed by the existing dynamic assignment models, which analyse specific network forms, and develops a methodology for analysing general networks. Traffic conditions within a link are assumed to be homogeneous, and the time varying O-D travel times and traffic flow patterns are calculated using elementary relationships from traffic flow theory and link volume conservation equations. Each individual is assumed to select a departure time and a route by trading off the travel time and schedule delay associated with each alternative. A route is considered as reasonable if it includes only links which do not take the traveller back to the origin. The set of reasonable routes is not consistant but depends on the time that an individual decides to depart from his origin. Equilibrium distributions are derived from a Markovian model which describes the evolution of travel patterns from day to day. Numerical simulation experiments are conducted to analyse the impact of different work start time flexibilities on the time dependent travel patterns. The similarity between link flows and travel times obtained from static and dynamic stochastic assignment is investigated. It is shown that in congested networks the application of static assignment results in travel times which are lower than the ones predicted by dynamic assignment.     

Accessibility analysis of risk severity

This study measures severity of network disruptions in the Minneapolis–St. Paul region by comparing the cumulative opportunity accessibility before-and-after removing freeway segments. Accessibility to jobs and accessibility to resident workers are measured respectively in the morning and evening peak hours. It is shown that the links with more severe consequences of disruption tend to be near or at freeway interchanges. Betweenness helps explain risk severity.     

Real-time traffic estimation using data expansion

This paper presents a method for estimating missing real-time traffic volumes on a road network using both historical and real-time traffic data. The method was developed to address urban transportation networks where a non-negligible subset of the network links do not have real-time link volumes, and where that data is needed to populate other real-time traffic analytics. Computation is split between an offline calibration and a real-time estimation phase. The offline phase determines link-to-link splitting probabilities for traffic flow propagation that are subsequently used in real-time estimation. The real-time procedure uses current traffic data and is efficient enough to scale to full city-wide deployments. Simulation results on a medium-sized test network demonstrate the accuracy of the method and its robustness to missing data and variability in the data that is available. For traffic demands with a coefficient of variation as high as 40%, and a real-time feed in which as much as 60% of links lack data, we find the percentage root mean square error of link volume estimates ranges from 3.9% to 18.6%. We observe that the use of real-time data can reduce this error by as much as 20%.     

Braess' paradox in a generalised traffic network

Braess' paradox illustrates situations when adding a new link to a transport network might lead to an equilibrium state in which travel times of users will increase. The classical network configuration introduced by Braess in 1968 to demonstrate the paradox is of fundamental significance because Valiant and Roughgarden showed in 2006 that ‘the “global” behaviour of an equilibrium flow in a large random network is similar to that in Braess' original four‐node example’. Braess' paradox has been studied mainly in the context of the classical problem introduced by Braess and his colleagues, assuming a certain type of symmetry in networks. Specifically, two pairs of links in those networks are assumed to have the same volume‐delay functions. The occurrence of Braess' paradox for this specific case of network symmetry was investigated by Pas and Principio in 1997. Such a symmetry is not common in real‐life networks because the parameters of volume‐delay functions are associated with roads physical and functional characteristics, which typically differ from one link to another. This research provides an extension of previous studies on Braess' paradox by considering arbitrary volume‐delay functions, that is, symmetry properties are not assumed for any of the network's links and the occurrence of Braess' paradox is studied for a general configuration. Copyright © 2014 John Wiley & Sons, Ltd.     

The marginal cost taxation of a transportation network

The paper shows that if the cost and demand functions satisfy certain weak smoothness conditions then the marginal cost taxation of a transportation network is optimal in the usual local sense. Interactions between the cost of travel along a link and flow along other links and between the demand for travel along a route and flow along other routes are permitted.     

Train design and routing optimization for evaluating criticality of freight railroad infrastructures

Freight transportation by railroads is an integral part of the U.S. economy. Identifying critical rail infrastructures can help stakeholders prioritize protection initiatives or add necessary redundancy to maximize rail network resiliency. The criticality of an infrastructure element, link or yard, is based on the increased cost (delay) incurred when that element is disrupted. An event of disruption can cause heavy congestion so that the capacity at links and yards should be considered when freight is re-routed. This paper proposes an optimization model for making-up and routing of trains in a disruptive situation to minimize the system-wide total cost, including classification time at yards and travel time along links. Train design optimization seeks to determine the optimal number of trains, their routes, and associated blocks, subject to various capacity and operational constraints at rail links and yards. An iterative heuristic algorithm is proposed to attack the computational burden for real-world networks. The solution algorithm considers the impact of volume on travel time in a congested or near-congested network. The proposed heuristics provide quality solutions with high speed, demonstrated by numerical experiments for small instances. A case study is conducted for the network of a major U.S. Class-I railroad based on publicly available data. The paper provides maps showing the criticality of infrastructure in the study area from the viewpoint of strategic planning.     

Decomposing travel times measured by probe-based traffic monitoring systems to individual road segments

In probe-based traffic monitoring systems, traffic conditions can be inferred based on the position data of a set of periodically polled probe vehicles. In such systems, the two consecutive polled positions do not necessarily correspond to the end points of individual links. Obtaining estimates of travel time at the individual link level requires the total traversal time (which is equal to the polling interval duration) be decomposed. This paper presents an algorithm for solving the problem of decomposing the traversal time to times taken to traverse individual road segments on the route. The proposed algorithm assumes minimal information about the network, namely network topography (i.e. links and nodes) and the free flow speed of each link. Unlike existing deterministic methods, the proposed solution algorithm defines a likelihood function that is maximized to solve for the most likely travel time for each road segment on the traversed route. The proposed scheme is evaluated using simulated data and compared to a benchmark deterministic method. The evaluation results suggest that the proposed method outperforms the bench mark method and on average improves the accuracy of the estimated link travel times by up to 90%.     

Inferring origin–destination trip matrices from aggregate volumes on groups of links: a case study using volumes inferred from mobile phone data

The origin–destination matrix is an important source of information describing transport demand in a region. Most commonly used methods for matrix estimation use link volumes collected on a subset of links in order to update an existing matrix. Traditional volume data collection methods have significant shortcomings because of the high costs involved and the fact that detectors only provide status information at specified locations in the network. Better matrix estimates can be obtained when information is available about the overall distribution of traffic through time and space. Other existing technologies are not used in matrix estimation methods because they collect volume data aggregated on groups of links, rather than on single links. That is the case of mobile systems. Mobile phones sometimes cannot provide location accuracy for estimating flows on single links but do so on groups of links; in contrast, data can be acquired over a wider coverage without additional costs. This paper presents a methodology adapted to the concept of volume aggregated on groups of links in order to use any available volume data source in traditional matrix estimation methodologies. To calculate volume data, we have used a model that has had promising results in transforming phone call data into traffic movement data. The proposed methodology using vehicle volumes obtained by such a model is applied over a large real network as a case study. The experimental results reveal the efficiency and consistency of the solution proposed, making the alternative attractive for practical applications. Copyright © 2011 John Wiley & Sons, Ltd.     

Disruption risk management in railroad networks: An optimization-based methodology and a case study

We propose an optimization-based methodology for recovery from random disruptions in service legs and train services in a railroad network. A network optimization model is solved for each service leg to evaluate a number of what-if scenarios. The solutions of these optimization problems are then used in a predictive model to identify the critical disruption factors and accordingly design a suitable mitigation strategy. A mitigation strategy, such as adding flexible or redundant capacity in the network, is an action that is deliberately taken by management in order to hedge against the cost and impact of disruption if it occurs. It is important that managers consider the trade-offs between the cost of mitigation strategy and the expected cost of disruption. The proposed methodology is applied to a case study built using the realistic infrastructure of a railroad network in the mid-west United States. The resulting analysis underscores the importance of accepting a slight increase in pre-disruption transportation costs, which in turn will enhance network resiliency by building dis-similar paths for train services, and by installing alternative links around critical service legs.     

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.     

Dynamic prediction of traffic volume through Kalman filtering theory

Two models employing Kalman filtering theory are proposed for predicting short-term traffic volume. Prediction parameters are improved using the most recent prediction error and better volume prediction on a link is achieved by taking into account data from a number of links. Based on data collected from a street network in Nagoya City, average prediction error is found to be less than 9% and maximum error less than 30%. The new models perform substantially (up to 80%) better than UTCS-2.     

Guaranteed prediction and estimation of the state of a road network

The paper presents an algorithm for the prediction and estimation of the state of a road network comprising freeways and arterials, described by a Cell Transmission Model (CTM). CTM divides the network into a collection of links. Each link is characterized by its fundamental diagram, which relates link speed to link density. The state of the network is the vector of link densities. The state is observed through measurements of speed and flow on some links. Demand is specified by the volume of vehicles entering the network at some links, and by split ratios according to which vehicles are routed through the network. There is model uncertainty: the parameters of the fundamental diagram are uncertain. There is uncertainty in the demand around the nominal forecast. Lastly, the measurements are uncertain. The uncertainty in each model parameter, demand, and measurement is specified by an interval. Given measurements over a time interval [0, t] and a horizon τ ? 0, the algorithm computes a set of states with the guarantee that the actual state at time (t + τ) will lie in this set, consistent with the given measurements. In standard terminology the algorithm is a state prediction or an estimate accordingly as τ > 0 or =0. The flow exiting a link may be controlled by an open- or closed-loop controller such as a signal or ramp meter. An open-loop controller does not change the algorithm, indeed it may make the system more predictable by tightening density bounds downstream of the controller. In the feedback case, the value of the control depends on the estimated state bounds, and the algorithm is extended to compute the range of possible closed-loop control values. The algorithm is used in a proposed design of a decision support system for the I-80 integrated corridor.     

Remoteness and accessibility in the vulnerability analysis of regional road networks

This paper considers the development of a method for network vulnerability analysis which considers the socio-economic impacts of network degradation and seeks to determine the most critical locations in the network. The method compares the levels of remoteness (or its inverse, accessibility) of localities within the study region, on the basis of the impacts of degradation of the road network on a recognised accessibility/remoteness index that can be applied to each and every location within the region. It thus extends the earlier work on accessibility-based vulnerability analysis which was limited to assessment of impacts on selected nodes in a network. The new method allows study of impacts on both specified locations (which do not have to be represented as network nodes) and the region as a whole. The accessibility/remoteness index is defined so that an accessibility surface can be calculated for the region, and the volume under this surface provides an overall measure of accessibility. Changes in the volume under different network states thus reflect the overall impacts. The method is applied to a rural region in south east Australia.     

Identification of vehicle sensor locations for link-based network traffic applications

Information on link flows in a vehicular traffic network is critical for developing long-term planning and/or short-term operational management strategies. In the literature, most studies to develop such strategies typically assume the availability of measured link traffic information on all network links, either through manual survey or advanced traffic sensor technologies. In practical applications, the assumption of installed sensors on all links is generally unrealistic due to budgetary constraints. It motivates the need to estimate flows on all links of a traffic network based on the measurement of link flows on a subset of links with suitably equipped sensors. This study, addressed from a budgetary planning perspective, seeks to identify the smallest subset of links in a network on which to locate sensors that enables the accurate estimation of traffic flows on all links of the network under steady-state conditions. Here, steady-state implies that the path flows are static. A “basis link” method is proposed to determine the locations of vehicle sensors, by using the link-path incidence matrix to express the network structure and then identifying its “basis” in a matrix algebra context. The theoretical background and mathematical properties of the proposed method are elaborated. The approach is useful for deploying long-term planning and link-based applications in traffic networks.     

Assessing potential likelihood and impacts of landslides on transportation network vulnerability

As one of the devastating natural disasters, landslide may induce significant losses of properties and lives area-wide, and generate dramatic damages to transportation network infrastructure. Accessing the impacts of landslide-induced disruptions to roadway infrastructure can be extremely difficult due to the complexity of involved impact factors and uncertainties of vulnerability related events. In this study, a data-driven approach is developed to assess landslide-induced transportation roadway network vulnerability and accessibility. The vulnerability analysis is conducted by integrating a series of static and dynamic factors to reflect the landslide likelihood and the consequences of network accessibility disruptions. The analytical hierarchy process (AHP) model was developed to assess and map the landslide likelihood. A generic vulnerability index (VI) was calculated for each roadway link in the network to identify critical links. Spatial distributions of landslide likelihood, consequences of network disruptions, and network vulnerability degrees were fused and analyzed. The roadway network on Oahu Island in Hawaii is utilized to demonstrate the effectiveness of the proposed approach with all the geo-coded information for its network vulnerability analysis induced by area-wide landslides. Specifically, the study area was classified into five categories of landslide likelihood: very high, high, moderate, low, and stable. About 34% of the study area was assigned as the high or very high categories. The results of network vulnerability analyses highlighted the importance of three highway segments tunnel through the Ko‘olau Range from leeward to windward, connecting Honolulu to the windward coast including the Pali highway segment, Likelike highway segment, and Interstate H-3 highway segment. The proposed network vulnerability analysis method provides a new perspective to examine the vulnerability and accessibility of the roadway network impacted by landslides.     

Paradoxes in networks with zero emission links: implications for telecommunications versus transportation

In this paper, we consider networks in which a link is characterized by zero emissions as is typical of networks in which certain links correspond to telecommunication links. We identify three new and distinct paradoxical phenomena that can occur in such networks, which demonstrate that so-called “improvements” to the network may result in increases in total emissions generated. In particular, we illustrate, through specific examples, the following: (1) the addition of a link with zero emissions may result in an increase in total emissions with no change in travel demand, (2) the total emissions on a network with a zero emission link may increase with a decrease in travel demand, and (3) the addition of a path connecting an origin/destination (O/D) pair and consisting solely of a zero emission link may result in an increase in total emissions. We then propose an emission pricing policy which guarantees that such paradoxes do not occur. The pricing policy is shown to be equivalent to a particular weighting mechanism associated with the criterion of emission generation provided that the users are now multicriteria decision-makers who seek to minimize both the cost of their route choices as well as the emissions that they generate.     

A graphical approach to identify sensor locations for link flow inference

Information of link flows in a traffic network becomes increasingly critical in contemporary transportation practice and researches. The network sensor installation is carried out to supply such information. In this paper, we present a graphical approach to determine the smallest subset of links in a traffic network for counting sensor installation, so as to infer the flows on all remaining links. The elegant assumption-free character of the problem introduced by Hu, Peeta and Chu is still kept in this approach. This study points out the topological tree feature of solutions that makes it possible for traffic management agencies to easily and flexibly select links for sensor installation in practice. Addressing from the same graphical perspective, we provide solutions to four other important problems about sensor locations. The preceding two problems are, in traffic networks that already have sensors installed on some links, to identify the subset of links on which link flows can be inferred from sensor measurements and to determine the smallest subset of links on which counting sensors also need to be installed so as to infer link flows on all remaining non-equipped links. The third is to identify the optimal locations for a given number of sensors so as to infer flows on as many links as possible by gradually enlarging the number of links included in circuits. The last one is to determine the smallest subset of links on which to install sensors, in such a way that it becomes possible at the same time to satisfy prior requirements and infer the flows on all remaining links, through building a minimum spanning tree. These methods can be applied to all kinds of long-term planning and link-based applications in traffic networks.     

Does a circular high-speed rail network promote efficiency and spatial equity in transport accessibility? Evidence from Hainan Island,China

This paper investigates the efficiency and spatial equity impacts of a unique island-looping high-speed rail (HSR) network in Hainan province, China. An integrated network and raster-based model is applied to accurately measure the accessibility indicators. We perform analysis at four different geographical planning levels – island, corridor, spillover, and county level. The HSR with a non-polarized topology can increase the accessibility of the entire island and corridor, but only leads to a slight increase in the spillover areas without HSR stations. HSR construction also leads to spatial cohesion for the entire island and corridor. Although the circular HSR network consists of several HSR stations distributed relatively equally, the results show that counties contribute differently to the cohesion of the entire island due to the varied initial level of accessibility values. Moreover, the county-level analysis reveals that the internal changes of each county are also different with balancing, polarization, and neutral effects appearing. Therefore, the internal equity of counties needs to be combined with their external contributions to global equity. Our framework permits policymakers to make customized HSR transport policies at different planning levels, particularly for an isolated area.