A recursive, cell processing model for predicting freeway travel times

Travel time information influences driver behaviour and can contribute to reducing congestion and improving network efficiency. Consequently many road authorities disseminate travel time information on road side signs, web sites and radio traffic broadcasts. Operational systems commonly rely on speed data obtained from inductive loop detectors and estimate travel times using simple algorithms that are known to provide poor predictions particularly on either side of the peak period. This paper presents a new macroscopic model for predicting freeway travel times which overcomes the limitations of operational ‘instantaneous’ speed models by drawing on queuing theory to model the processing of vehicles in sections or cells of the freeway. The model draws on real-time speed, flow and occupancy data and is formulated to accommodate varying geometric conditions, the relative distribution of vehicles along the freeway, variations in speed limits, the impact of ramp flows and fixed or transient bottlenecks. Field validation of the new algorithm was undertaken using data from two operational freeways in Melbourne, Australia. Consistent with the results of simulation testing, the validation confirmed that the recursive model provided a substantial improvement in travel time predictions when compared to the model currently used to provide real-time travel time information to motorists in Melbourne.     

Review of optimal sensor location models for travel time estimation

The problem of optimally locating fixed sensors on a traffic network infrastructure has been object of growing interest in the past few years. Sensor location decisions models differ from each other according to the type of sensors that are to be located and the objective that one would like to optimize. This paper surveys the existing contributions in the literature related to the problem of locating fixed sensors on the network to estimate travel times. The review consists of two parts: the first part reviews the methodological approaches for the optimal location of counting sensors on a freeway for travel time estimation; the second part focuses on the results related to the optimal location of Automatic Vehicle Identification (AVI) readers on the links of a network to get travel time information.     

Consistent formulation of network equilibrium with stochastic flows

Traffic flows in real-life transportation systems vary on a daily basis. According to traffic flow theory, such variability should induce a similar variability in travel times, but this “internal consistency” is generally not captured by existing network equilibrium models. We present an internally-consistent network equilibrium approach, which considers two potential sources of flow variability: (i) daily variation in route choice and (ii) daily variation in origin–destination demand. We particularly aspire to a flexible formulation that permits alternative statistical assumptions, which allows the best fit to be made to observed variability data in particular applications. Joint probability distributions of route—and therefore link—flows are derived under several assumptions concerning stochastic driver behavior. A stochastic network equilibrium model with stochastic demands and route choices is formulated as a fixed point problem. We explore limiting cases which allow an equivalent convex optimization problem to be defined, and finally apply this method to a real-life network of Kanazawa City, Japan.     

Multi-objective bilevel construction material transportation scheduling in large-scale construction projects under a fuzzy random environment

Abstract

This paper investigates a transportation scheduling problem in large-scale construction projects under a fuzzy random environment. The problem is formulated as a fuzzy, random multi-objective bilevel optimization model where the construction company decides the transportation quantities from every source to every destination according to the criterion of minimizing total transportation cost and transportation time on the upper level, while the transportation agencies choose their transportation routes such that the total travel cost is minimized on the lower level. Specifically, we model both travel time and travel cost as triangular fuzzy random variables. Then the multi-objective bilevel adaptive particle swarm optimization algorithm is proposed to solve the model. Finally, a case study of transportation scheduling for the Shuibuya Hydropower Project in China is used as a real world example to demonstrate the practicality and efficiency of the optimization model and algorithm.     

A mixed-integer linear program for optimizing sensor locations along freeway corridors

How to optimally allocate limited freeway sensor resources is of great interest to transportation engineers. In this paper, we focus on the optimal allocation of point sensors, such as loop detectors, to minimize performance measurement errors. Although it has been shown that the minimization problem can be intuitively formulated as a nonlinear program, the formulation is so complex that only heuristic approaches can be used to solve the problem. In this paper, we transform the nonlinear program into an equivalent mixed-integer linear model. The linearized model is shown to have a graphical interpretation and can be solved using resource constrained shortest path algorithms. A customized Branch-and-Bound technique is then proposed to solve the resource constrained shortest path problem. Numerical experiments along an urban freeway corridor demonstrate that this sensor location model is successful in allocating loop detectors to improve the accuracy of travel time estimation.     

An optimization method for sustainable traffic control in urban areas

The optimization of traffic signalization in urban areas is formulated as a problem of finding the cycle length, the green times and the offset of traffic signals that minimize an objective function of performance indices. Typical approaches to this optimization problem include the maximization of traffic throughput or the minimization of vehicles’ delays, number of stops, fuel consumption, etc. Dynamic Traffic Assignment (DTA) models are widely used for online and offline applications for efficient deployment of traffic control strategies and the evaluation of traffic management schemes and policies. We propose an optimization method for combining dynamic traffic assignment and network control by minimizing the risk of potential loss induced to travelers by exceeding their budgeted travel time as a result of deployed traffic signal settings, using the Conditional Value-at-Risk model. The proposed methodology can be easily implemented by researchers or practitioners to evaluate their alternative strategies and aid them to choose the alternative with less potential risk. The traffic signal optimization procedure is implemented in TRANSYT-7F and the dynamic propagation and route choice of vehicles is simulated with a mesoscopic dynamic traffic assignment tool (DTALite) with fixed temporal demand and network characteristics. The proposed approach is applied to a reference test network used by many researchers for verification purposes. Numerical experiments provide evidence of the advantages of this optimization method with respect to conventional optimization techniques. The overall benefit to the performance of the network is evaluated with a Conditional Value-at-Risk Analysis where the optimal solution is the one presenting the least risk for ‘guaranteed’ total travel times.     

A genetic algorithm-based method for improving quality of travel time prediction intervals

The transportation literature is rich in the application of neural networks for travel time prediction. The uncertainty prevailing in operation of transportation systems, however, highly degrades prediction performance of neural networks. Prediction intervals for neural network outcomes can properly represent the uncertainty associated with the predictions. This paper studies an application of the delta technique for the construction of prediction intervals for bus and freeway travel times. The quality of these intervals strongly depends on the neural network structure and a training hyperparameter. A genetic algorithm–based method is developed that automates the neural network model selection and adjustment of the hyperparameter. Model selection and parameter adjustment is carried out through minimization of a prediction interval-based cost function, which depends on the width and coverage probability of constructed prediction intervals. Experiments conducted using the bus and freeway travel time datasets demonstrate the suitability of the proposed method for improving the quality of constructed prediction intervals in terms of their length and coverage probability.     

Cooperative traffic control of a mixed network with two urban regions and a freeway

Currently most optimization methods for urban transport networks (i) are suited for networks with simplified dynamics that are far from real-sized networks or (ii) apply decentralized control, which is not appropriate for heterogeneously loaded networks or (iii) investigate good-quality solutions through micro-simulation models and scenario analysis, which make the problem intractable in real time. In principle, traffic management decisions for different sub-systems of a transport network (urban, freeway) are controlled by operational rules that are network specific and independent from one traffic authority to another. In this paper, the macroscopic traffic modeling and control of a large-scale mixed transportation network consisting of a freeway and an urban network is tackled. The urban network is partitioned into two regions, each one with a well-defined Macroscopic Fundamental Diagram (MFD), i.e. a unimodal and low-scatter relationship between region density and outflow. The freeway is regarded as one alternative commuting route which has one on-ramp and one off-ramp within each urban region. The urban and freeway flow dynamics are formulated with the tool of MFD and asymmetric cell transmission model, respectively. Perimeter controllers on the border of the urban regions operating to manipulate the perimeter interflow between the two regions, and controllers at the on-ramps for ramp metering are considered to control the flow distribution in the mixed network. The optimal traffic control problem is solved by a Model Predictive Control (MPC) approach in order to minimize total delay in the entire network. Several control policies with different levels of urban-freeway control coordination are introduced and tested to scrutinize the characteristics of the proposed controllers. Numerical results demonstrate how different levels of coordination improve the performance once compared with independent control for freeway and urban network. The approach presented in this paper can be extended to implement efficient real-world control strategies for large-scale mixed traffic networks.     

Evaluation of a cellular phone-based system for measurements of traffic speeds and travel times: A case study from Israel

The purpose of this paper is to examine the performance of a new operational system for measuring traffic speeds and travel times which is based on information from a cellular phone service provider. Cellular measurements are compared with those obtained by dual magnetic loop detectors. The comparison uses data for a busy 14 km freeway with 10 interchanges, in both directions, during January–March of 2005. The dataset contains 1 284 587 valid loop detector speed measurements and 440 331 valid measurements from the cellular system, each measurement referring to a 5 min interval. During one week in this period, 25 floating car measurements were conducted as additional comparison observations. The analyses include visual, graphical, and statistical techniques; focusing in particular on comparisons of speed patterns in the time–space domain. The main finding is that there is a good match between the two measurement methods, indicating that the cellular phone-based system can be useful for various practical applications such as advanced traveler information systems and evaluating system performance for modeling and planning.     

Modeling the effects of traveler information on freeway origin–destination demand prediction

The primary focus of this research is to develop an approach to capture the effect of travel time information on travelers’ route switching behavior in real-time, based on on-line traffic surveillance data. It also presents a freeway Origin–Destination demand prediction algorithm using an adaptive Kalman Filtering technique, where the effect of travel time information on users’ route diversion behavior has been explicitly modeled using a dynamic, aggregate, route diversion model. The inherent dynamic nature of the traffic flow characteristics is captured using a Kalman Filter modeling framework. Changes in drivers’ perceptions, as well as other randomness in the route diversion behavior, have been modeled using an adaptive, aggregate, dynamic linear model where the model parameters are updated on-line using a Bayesian updating approach. The impact of route diversion on freeway Origin–Destination demands has been integrated in the estimation framework. The proposed methodology is evaluated using data obtained from a microscopic traffic simulator, INTEGRATION. Experimental results on a freeway corridor in northwest Indiana establish that significant improvement in Origin–Destination demand prediction can be achieved by explicitly accounting for route diversion behavior.     

A microscopic simulation model for merging control on a dedicated-lane automated highway system

The automated highway systems (AHS) are not designed as stand-alone transportation facilities. Drivers will by necessity drive from their origins to the AHS entrance, and from the AHS exit to their final destinations. Therefore, the AHS will affect other transportation facilities, and should be integrated with all other facilities in the transportation system. Interfaces create much of the congestion for today’s transportation systems. Likewise, AHS interfaces may cause a similar problem, due to either AHS interactions with conventional systems or internal limitations from AHS merging capabilities. If these problems exist, either the AHS or the conventional road network cannot function properly. Consequently, the system as a whole may break down and the AHS could potentially become a detriment to the overall transportation system.Clearly, not enough is known about the automated merging process to determine what conditions would lead to congestion at interface points. The current macroscopic analysis techniques assume parameters that are not applicable to an AHS, and no detailed AHS merging models have been developed and validated. This paper addresses the interface problem between an AHS, and conventional roadway. Specifically, it presents a microscopic simulation model for one scenario of the automated merging maneuver. The results of the model show that for low flows and conventional highway speeds, an one-lane AHS merging section with a dedicated automated entrance ramp has many similar characteristics as a two-lane conventional freeway with or without fixed-time ramp metering. However, when the conventional freeway starts to “break down” near its capacity, the AHS continues to perform with little delay. The model also validates that the minimum ramp length requirements are a function of the merging vehicle’s speed, the mainline vehicles’ speed, and the acceleration and deceleration rates of the merging vehicle.     

Transit network design based on travel time reliability

This paper presents a transit network optimization method, in which travel time reliability on road is considered. A robust optimization model, taking into account the stochastic travel time, is formulated to satisfy the demand of passengers and provide reliable transit service. The optimization model aims to maximize the efficiency of passenger trips in the optimized transit network. Tabu search algorithm is defined and implemented to solve the problem. Then, transit network optimization method proposed in this paper is tested with two numerical examples: a simple route and a medium-size network. The results show the proposed method can effectively improve the reliability of a transit network and reduce the travel time of passengers in general.     

Traffic assignment considering air quality

This paper presents a methodology of assigning traffic in a network with the consideration of air quality. Traffic assignment is formulated as an optimization problem considering travel cost and on-road emissions. It introduces a cell-based approach to model emission concentrations so that either the average or maximum emissions in a network can be considered in the optimization process. The emissions in a cell are modeled taking into consideration the influence of the emission sources from all cells in the network. A case study demonstrates that minimizing travel cost and reducing air pollutants may not be always achieved simultaneously. The traffic assignment procedure can effectively reduce emission concentrations at those locations with the worst air quality conditions, with only a marginal increase in travel time and average emission concentration in the network.     

Formulating and solving the network design problem by decomposition

The optimal transportation network design problem is formulated as a convex nonlinear programming problem and a solution method based on standard traffic assignment algorithms is presented. The technique can deal with network improvements which introduce new links, which increase the capacity of existing links, or which decrease the free-flow (uncongested) travel time on existing links (with or without simultaneously increasing link capacity). Preliminary computational experience with the method demonstrates that it is capable of solving very large problems with reasonable amounts of computer time.     

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.     

A multi‐class mean‐excess traffic equilibrium model with elastic demand

Recent empirical studies have revealed that travel time variability plays an important role in travelers' route choice decisions. To simultaneously account for both reliability and unreliability aspects of travel time variability, the concept of mean‐excess travel time (METT) was recently proposed as a new risk‐averse route choice criterion. In this paper, we extend the mean‐excess traffic equilibrium model to include heterogeneous risk‐aversion attitudes and elastic demand. Specifically, this model explicitly considers (1) multiple user classes with different risk‐aversions toward travel time variability when making route choice decisions under uncertainty and (2) the elasticity of travel demand as a function of METT when making travel choice decisions under uncertainty. This model is thus capable of modeling travelers' heterogeneous risk‐averse behaviors with both travel choice and route choice considerations. The proposed model is formulated as a variational inequality problem and solved via a route‐based algorithm using the modified alternating direction method. Numerical analyses are also provided to illustrate the features of the proposed model and the applicability of the solution algorithm. Copyright © 2012 John Wiley & Sons, Ltd.     

Estimation of the value of travel time and of travel time reliability for heterogeneous drivers in a road network

Transportation - Travel time reliability has been recognized as an important factor in cost–benefit analysis in a transportation network. To estimate the benefit and cost of travel time...     

Analysis of factors that influence the sensor location problem for freeway corridors

The use of traffic sensors to acquire real‐time traffic information for intelligent transportation systems is becoming increasingly common. It is a challenge to determine where these sensors should be located to maximize the benefit of their use. This paper aims to illuminate the interaction of the sensor location problem (SLP) and its influencing factors, and to reveal the influencing mechanisms between those factors and the optimal sensor numbers. Firstly, we sum up the factors that influence the SLP for freeway corridors in detail and present the mathematical formulation of each factor. Then, given the parameters, which are derived from those influencing factors, the maximum integration value model (MIVM) and simplified MIVM are proposed for addressing the SLP. Finally, a real world case study, in which the simplified MIVM is used, is presented to illustrate how these factors influence the optimal sensor numbers and the maximum integration value, and also leads to the typical influencing patterns of those factors for freeway corridors. The results of the case study also demonstrate the effectiveness of the model and problem solving scheme. What is more, the suggestions for using the findings hereof in practical applications are put forward. Copyright © 2013 John Wiley & Sons, Ltd.     

Impact analysis of cordon-based congestion pricing on mode-split for a bimodal transportation network

This paper investigates the impact of cordon-based congestion pricing scheme on the mode-split of a bimodal transportation network with auto and rail travel modes. For any given toll-charge pattern, its impact on the mode-split can be estimated by solving a combined mode-split and traffic-assignment problem. Using a binary logit model for the mode-split, the combined problem is converted into a traffic-assignment problem with elastic demand. Probit-based stochastic user equilibrium (SUE) principle is adopted for this traffic-assignment problem, and a continuously distributed value of time (VOT) is assumed to convert the toll charges and transit fares into time-units. This combined mode-split and traffic-assignment problem is then formulated as a fixed-point model, which can be solved by a convergent Cost Averaging method. The combined mode-split and traffic-assignment problem is then used to analyze a multimodal toll design problem for cordon-based congestion pricing scheme, with the aim of increasing the mode-share of public transport system to a targeted level. Taking the fixed-point model as a constraint, the multimodal toll design problem is thus formulated as a mathematical programming with equilibrium constraints (MPEC) model. A genetic algorithm (GA) is employed to solve this MPEC model, which is then numerical validated by a network example.     

The existence, uniqueness and computation of an arc-based dynamic network user equilibrium formulation

In this paper, a dynamic user equilibrium traffic assignment model with simultaneous departure time/route choices and elastic demands is formulated as an arc-based nonlinear complementarity problem on congested traffic networks. The four objectives of this paper are (1) to develop an arc-based formulation which obviates the use of path-specific variables, (2) to establish existence of a dynamic user equilibrium solution to the model using Brouwer's fixed-point theorem, (3) to show that the vectors of total arc inflows and associated minimum unit travel costs are unique by imposing strict monotonicity conditions on the arc travel cost and demand functions along with a smoothness condition on the equilibria, and (4) to develop a heuristic algorithm that requires neither a path enumeration nor a storage of path-specific flow and cost information. Computational results are presented for a simple test network with 4 arcs, 3 nodes, and 2 origin–destination pairs over the time interval of 120 periods.