Discretised link travel time models based on cumulative flows: Formulations and properties

In the research area of dynamic traffic assignment, link travel times can be derived from link cumulative inflow and outflow curves which are generated by dynamic network loading. In this paper, the profiles of cumulative flows are piecewise linearized. Both the step function (SF) and linear interpolation (LI) are used to approximate cumulative flows over time. New formulations of the SF-type and LI-type link travel time models are developed. We prove that these two types of link travel time models ensure first-in-first-out (FIFO) and continuity of travel times with respect to flows, and have other desirable properties. Since the LI-type link travel time model does not satisfy the causality property, a modified LI-type (MLI-type) link travel time model is proposed in this paper. We prove that the MLI-type link travel time model ensures causality, strong FIFO and travel time continuity, and that the MLI-type link travel time function is strictly monotone under the condition that the travel time of each vehicle on a link is greater than the free flow travel time on that link. Numerical examples are set up to illustrate the properties and accuracy of the three models.     

Stochastic cell transmission model (SCTM): A stochastic dynamic traffic model for traffic state surveillance and assignment

The paper proposes a first-order macroscopic stochastic dynamic traffic model, namely the stochastic cell transmission model (SCTM), to model traffic flow density on freeway segments with stochastic demand and supply. The SCTM consists of five operational modes corresponding to different congestion levels of the freeway segment. Each mode is formulated as a discrete time bilinear stochastic system. A set of probabilistic conditions is proposed to characterize the probability of occurrence of each mode. The overall effect of the five modes is estimated by the joint traffic density which is derived from the theory of finite mixture distribution. The SCTM captures not only the mean and standard deviation (SD) of density of the traffic flow, but also the propagation of SD over time and space. The SCTM is tested with a hypothetical freeway corridor simulation and an empirical study. The simulation results are compared against the means and SDs of traffic densities obtained from the Monte Carlo Simulation (MCS) of the modified cell transmission model (MCTM). An approximately two-miles freeway segment of Interstate 210 West (I-210W) in Los Ageles, Southern California, is chosen for the empirical study. Traffic data is obtained from the Performance Measurement System (PeMS). The stochastic parameters of the SCTM are calibrated against the flow-density empirical data of I-210W. Both the SCTM and the MCS of the MCTM are tested. A discussion of the computational efficiency and the accuracy issues of the two methods is provided based on the empirical results. Both the numerical simulation results and the empirical results confirm that the SCTM is capable of accurately estimating the means and SDs of the freeway densities as compared to the MCS.     

Genetic algorithm-based simulation optimization of the ALINEA ramp metering system: a case study in Atlanta

ABSTRACT

This paper presents a case study of the optimal ALINEA ramp metering system model of a corridor of the metro Atlanta freeway. Based on real-world traffic data, this study estimates the origin-destination matrix for the corridor. Using a stochastic simulation-based optimization framework that combines a micro-simulation model and a genetic algorithm-based optimization module, we determine the optimal parameter values of a combined ALINEA ramp metering system with a queue flush system that minimizes total vehicle travel time. We found that the performance of ramp metering with optimized parameters, which is very sensitive possibly because bottlenecks are correlated, outperforms the no control model with its optimized parameters in terms of reducing total travel time.     

Direct formulation and algorithms for the probit-based stochastic user equilibrium traffic assignment problem

This paper proposes simple and direct formulation and algorithms for the probit-based stochastic user equilibrium traffic assignment problem. It is only necessary to account for random variables independent of link flows by performing a simple transformation of the perceived link travel time with a normal distribution. At every iteration of a Monte-Carlo simulation procedure, the values of the random variables are sampled based on their probability distributions, and then a regular deterministic user equilibrium assignment is carried out to produce link flows. The link flows produced at each iteration of the Monte-Carlo simulation are averaged to yield the final flow pattern. Two test networks demonstrate that the proposed algorithms and the traditional algorithm (the Method of Successive Averages) produce similar results and that the proposed algorithms can be extended to the computation of the case in which the random error term depends on measured travel time.     

Reliable route guidance: A case study from Chicago

Reliable route guidance can be obtained by solving the reliable a priori shortest path problem, which finds paths that maximize the probability of arriving on time. The goal of this paper is to demonstrate the benefits and applicability of such route guidance using a case study. An adaptive discretization scheme is first proposed to improve the efficiency in computing convolution, a time-consuming step used in the reliable routing algorithm to obtain path travel time distributions. Methods to construct link travel time distributions from real data in the case study are then discussed. Particularly, the travel time distributions on arterial streets are estimated from linear regression models calibrated from expressway data. Numerical experiments demonstrate that optimal paths are substantially affected by the reliability requirement in rush hours, and that reliable route guidance could generate up to 5-15% of travel time savings. The study also verifies that existing algorithms can solve large-scale problems within a reasonable amount of time.     

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.     

Some features of non-linear travel time models for dynamic traffic assignment

Abstract

This paper investigates some features of non-linear travel time models for dynamic traffic assignment (DTA) that adopt traffic on the link as the sole determinant for the calculation of travel time and have explicit relationships between travel time and traffic on the link. Analytical proofs and numerical examples are provided to show first-in-first-out (FIFO) violation and the behaviour of decreasing outflow with increasing traffic in non-linear travel time models. It is analytically shown that any non-linear travel time model could violate FIFO in some circumstances, especially when inflow drops sharply, and some convex non-linear travel time models could show behaviour with outflow decreasing as traffic increases. It is also shown that the linear travel time model does not show these behaviours. A non-linear travel time model in general form was used for analytical proofs and several existing non-linear travel time models were adopted for numerical examples. Considering the features addressed in this study, non-linear travel time models seem to have limitations for use in DTA in practical terms and care should be taken when they are used for modelling time-varying transportation networks.     

The Share-a-Ride problem with stochastic travel times and stochastic delivery locations

We consider two stochastic variants of the Share-a-Ride problem: one with stochastic travel times and one with stochastic delivery locations. Both variants are formulated as a two-stage stochastic programming model with recourse. The objective is to maximize the expected profit of serving a set of passengers and parcels using a set of homogeneous vehicles. Our solution methodology integrates an adaptive large neighborhood search heuristic and three sampling strategies for the scenario generation (fixed sample size sampling, sample average approximation, and sequential sampling procedure). A computational study is carried out to compare the proposed approaches. The results show that the convergence rate depends on the source of stochasticity in the problem: stochastic delivery locations converge faster than stochastic travel times according to the numerical test. The sample average approximation and the sequential sampling procedure show a similar performance. The performance of the fixed sample size sampling is better compared to the other two approaches. The results suggest that the stochastic information is valuable in real-life and can dramatically improve the performance of a taxi sharing system, compared to deterministic solutions.     

A stochastic multimodal reliable network design problem under adverse weather conditions

This paper formulates a network design problem (NDP) for finding the optimal public transport service frequencies and link capacity expansions in a multimodal network with consideration of impacts from adverse weather conditions. The proposed NDP aims to minimize the sum of expected total travel time, operational cost of transit services, and construction cost of link capacity expansions under an acceptable level of variance of total travel time. Auto, transit, bus, and walking modes are considered in the multimodal network model for finding the equilibrium flows and travel times. In the proposed network model, demands are assumed to follow Poisson distribution, and weather‐dependent link travel time functions are adopted. A probit‐based stochastic user equilibrium, which is based on the perceived expected travel disutility, is used to determine the multimodal route of the travelers. This model also considers the strategic behavior of the public transport travelers in choosing their routes, that is, common‐line network. Based on the stochastic multimodal model, the mean and variance of total travel time are analytical estimated for setting up the NDP. A sensitivity‐based solution algorithm is proposed for solving the NDP, and two numerical examples are adopted to demonstrate the characteristics of the proposed model. Copyright © 2014 John Wiley & Sons, Ltd.     

Comparative analysis of three user equilibrium models under stochastic demand

Recent empirical studies on the value of time and reliability reveal that travel time variability plays an important role on travelers' route choice decision process. It can be considered as a risk to travelers making a trip. Therefore, travelers are not only interested in saving their travel time but also in reducing their risk. Typically, risk can be represented by two different aspects: acceptable risk and unacceptable risk. Acceptable risk refers to the reliability aspect of acceptable travel time, which is defined as the average travel time plus the acceptable additional time (or buffer time) needed to ensure more frequent on‐time arrivals, while unacceptable risk refers to the unreliability aspect of unacceptable late arrivals (though infrequent) that have a travel time excessively higher than the acceptable travel time. Most research in the network equilibrium based approach to modeling travel time variability ignores the unreliability aspect of unacceptable late arrivals. This paper examines the effects of both reliability and unreliability aspects in a network equilibrium framework. Specifically, the traditional user equilibrium model, the demand driven travel time reliability‐based user equilibrium model, and the α‐reliable mean‐excess travel time user equilibrium model are considered in the investigation under an uncertain environment due to stochastic travel demand. Numerical results are presented to examine how these models handle risk under travel time variability.     

Multi-scenario optimization approach for assessing the impacts of advanced traffic information under realistic stochastic capacity distributions

In this study, to incorporate realistic discrete stochastic capacity distribution over a large number of sampling days or scenarios (say 30–100 days), we propose a multi-scenario based optimization model with different types of traveler knowledge in an advanced traveler information provision environment. The proposed method categorizes commuters into two classes: (1) those with access to perfect traffic information every day, and (2) those with knowledge of the expected traffic conditions (and related reliability measure) across a large number of different sampling days. Using a gap function framework or describing the mixed user equilibrium under different information availability over a long-term steady state, a nonlinear programming model is formulated to describe the route choice behavior of the perfect information (PI) and expected travel time (ETT) user classes under stochastic day-dependent travel time. Driven by a computationally efficient algorithm suitable for large-scale networks, the model was implemented in a standard optimization solver and an open-source simulation package and further applied to medium-scale networks to examine the effectiveness of dynamic traveler information under realistic stochastic capacity conditions.     

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.     

A simulation‐based reliability assessment approach for congested transit network

This paper is an attempt to develop a generic simulation‐based approach to assess transit service reliability, taking into account interaction between network performance and passengers' route choice behaviour. Three types of reliability, say, system wide travel time reliability, schedule reliability and direct boarding waiting‐time reliability are defined from perspectives of the community or transit administration, the operator and passengers. A Monte Carlo simulation approach with a stochastic user equilibrium transit assignment model embedded is proposed to quantify these three reliability measures of transit service. A simple transit network with a bus rapid transit (BRT) corridor is analysed as a case study where the impacts of BRT components on transit service reliability are evaluated preliminarily.     

An integrated Bayesian approach for passenger flow assignment in metro networks

This paper proposes an integrated Bayesian statistical inference framework to characterize passenger flow assignment model in a complex metro network. In doing so, we combine network cost attribute estimation and passenger route choice modeling using Bayesian inference. We build the posterior density by taking the likelihood of observing passenger travel times provided by smart card data and our prior knowledge about the studied metro network. Given the high-dimensional nature of parameters in this framework, we apply the variable-at-a-time Metropolis sampling algorithm to estimate the mean and Bayesian confidence interval for each parameter in turn. As a numerical example, this integrated approach is applied on the metro network in Singapore. Our result shows that link travel time exhibits a considerable coefficient of variation about 0.17, suggesting that travel time reliability is of high importance to metro operation. The estimation of route choice parameters conforms with previous survey-based studies, showing that the disutility of transfer time is about twice of that of in-vehicle travel time in Singapore metro system.     

Investigating empirical implications of hysteresis in day-to-day travel time variability

Day-to-day travel time variability plays a significant role in travel time reliability. Nowadays, travelers not only seek to minimize their travel time on average, but also value its variation. The variation in the mean and the variance of travel time (across days, for the same departure time) has not been thoroughly investigated. A temporary decrease in capacity (e.g. congestion caused by an active bottleneck) leads to a quite significant difference in the variance of travel time for congestion onset and offset periods. This phenomenon results in hysteresis loops where the departure time periods in congestion offset exhibit a higher travel time variance than the ones in congestion onset with the same mean travel time. The aim of this paper is to identify empirical implications that yield to the hysteresis phenomenon in day-to-day travel times. First, empirical hysteresis loop observations are provided from two different freeway sites. Second, we investigate the potential link with the hysteresis observed in traffic networks on macroscopic fundamental diagram (MFD). Third, we build a piecewise linear function that models the evolution of travel time within the day. This allows us to decompose the problem into its components, e.g. start time of congestion, peak travel time, etc. These components, along with their probability distribution functions, are employed in a Monte Carlo simulation model to investigate their partial effects on the existence of hysteresis. Correlation among critical variables is the most influential factor in this phenomenon, which should be further investigated regarding traffic flow and traffic equilibrium principles.     

Traffic state estimation and uncertainty quantification based on heterogeneous data sources: A three detector approach

This study focuses on how to use multiple data sources, including loop detector counts, AVI Bluetooth travel time readings and GPS location samples, to estimate macroscopic traffic states on a homogeneous freeway segment. With a generalized least square estimation framework, this research constructs a number of linear equations that map the traffic measurements as functions of cumulative vehicle counts on both ends of a traffic segment. We extend Newell’s method to solve a stochastic three-detector problem, where the mean and variance estimates of cell-based density and flow can be analytically derived through a multinomial probit model and an innovative use of Clark’s approximation method. An information measure is further introduced to quantify the value of heterogeneous traffic measurements for improving traffic state estimation on a freeway segment.     

A reliability-based assignment method for railway networks with heterogeneous passengers

Travel reliability can play an important role in shaping travelers’ route choice behavior. This paper develops a railway passenger assignment method to capture the reliability-based route choices, where the trains can have stochastic delays. The overall travel reliability has two components: the travel time reliability (of trains) and the associated transfer reliability (of connections). In this context, mean-and-variance-based effective travel cost is adopted to model passengers’ evaluation of different travel options in the railway network. Moreover, passengers are heterogeneous as they may evaluate the effective travel cost differently, and they may have different requirements for the successful transfer probability (if transfers are involved in the trip). The determination of travel time reliability (of trains) is based on the travel delay distribution, and the successful transfer probability is calculated based on the delay probabilities of two trains in the transfer process. An algorithm has been designed for solving the model, and numerical examples are presented to test and illustrate the model.     

Study on mean-standard deviation shortest path problem in stochastic and time-dependent networks: A stochastic dominance based approach

This paper studies a mean-standard deviation shortest path model, also called travel time budget (TTB) model. A route’s TTB is defined as this route’s mean travel time plus a travel time margin, which is the route travel time’s standard deviation multiplied with a factor. The TTB model violates the Bellman’s Principle of Optimality (BPO), making it difficult to solve it in any large stochastic and time-dependent network. Moreover, it is found that if path travel time distributions are skewed, the conventional TTB model cannot reflect travelers’ heterogeneous risk-taking behavior in route choice. This paper proposes to use the upper or lower semi-standard deviation to replace the standard deviation in the conventional TTB model (the new models are called derived TTB models), because these derived TTB models can well capture such heterogeneous risk-taking behavior when the path travel time distributions are skewed. More importantly, this paper shows that the optimal solutions of these two derived TTB models must be non-dominated paths under some specific stochastic dominance (SD) rules. These finding opens the door to solve these derived TTB models efficiently in large stochastic and time-dependent networks. Numerical examples are presented to illustrate these findings.     

Modeling travel time reliability of freeways using risk assessment techniques

Travel time reliability is considered to be one of the key indicators for the performance of transport systems and is measured in various ways. This paper synthesizes both reliability concepts: traffic breakdown, the indicator of the instability of travel times, is treated as the risk, whereas travel time variability, the indicator of the uncertainty of travel times, is considered as the consequence of this risk. An analytical formula, using risk assessment technique, explicitly expresses the cost of travel time unreliability as the sum of the products of the consequences (i.e. variability) and the corresponding probabilities of breakdown. It provides a novel measure of travel time reliability and is applicable in network performance evaluations. An empirical example based on a large dataset of freeway traffic flow data from loop detectors shows that the developed travel time reliability measure is both intuitively logical and consistent.     

Investigations of interactions between bus rapid transit and general traffic flows

Bus rapid transit (BRT) is a popular strategy to increase transit attraction because of its high‐capacity, comfortable service, and fast travel speed with the exclusive right‐of‐way. Various engineering designs of right‐of‐way and the violation enforcement influence interactions between BRT and general traffic flows. An empirical assessment framework is proposed to investigate traffic congestion and lane‐changing patterns at one typical bottleneck along a BRT corridor. The BRT bottleneck consists of bus lane, BRT station, video enforcement zone, and transit signal priority intersection. We analyze oblique cumulative vehicle counts and oblique cumulative lane‐changing maneuvers extracted from videos. The cumulative vehicle counts method widely applied in revealing queueing dynamics at freeway bottlenecks is extended to an urban BRT corridor. In the study site, we assume four lane‐changing patterns, three of which are verified by the empirical measurements. Investigations of interactions between buses and general traffic show that abnormal behaviors (such as lane violations and slow moving of the general traffic) induce 16% reduction in the saturation rate of general traffic and 17% increase in bus travel time. Further observations show that the BRT station and its induced increasing lane‐changing maneuvers increase the downstream queue discharge flows of general traffic. The empirical results also contribute to more efficient strategies of BRT planning and operations, such as alternative enforcement methods, various lane separation types, and optimized traffic operations. Copyright © 2014 John Wiley & Sons, Ltd.