Estimating traffic volumes for signalized intersections using connected vehicle data

Recently connected vehicle (CV) technology has received significant attention thanks to active pilot deployments supported by the US Department of Transportation (USDOT). At signalized intersections, CVs may serve as mobile sensors, providing opportunities of reducing dependencies on conventional vehicle detectors for signal operation. However, most of the existing studies mainly focus on scenarios that penetration rates of CVs reach certain level, e.g., 25%, which may not be feasible in the near future. How to utilize data from a small number of CVs to improve traffic signal operation remains an open question. In this work, we develop an approach to estimate traffic volume, a key input to many signal optimization algorithms, using GPS trajectory data from CV or navigation devices under low market penetration rates. To estimate traffic volumes, we model vehicle arrivals at signalized intersections as a time-dependent Poisson process, which can account for signal coordination. The estimation problem is formulated as a maximum likelihood problem given multiple observed trajectories from CVs approaching to the intersection. An expectation maximization (EM) procedure is derived to solve the estimation problem. Two case studies were conducted to validate our estimation algorithm. One uses the CV data from the Safety Pilot Model Deployment (SPMD) project, in which around 2800 CVs were deployed in the City of Ann Arbor, MI. The other uses vehicle trajectory data from users of a commercial navigation service in China. Mean absolute percentage error (MAPE) of the estimation is found to be 9–12%, based on benchmark data manually collected and data from loop detectors. Considering the existing scale of CV deployments, the proposed approach could be of significant help to traffic management agencies for evaluating and operating traffic signals, paving the way of using CVs for detector-free signal operation in the future.     

Estimating traffic volumes on intercity road locations using roadway attributes,socioeconomic features and other work-related activity characteristics

Traffic volume data are key inputs to many applications in highway design and planning. But these data are collected in only a limited number of road locations due to the cost involved. This paper presents an approach for estimating daily and hourly traffic volumes on intercity road locations combining clustering and regression modelling techniques. With the aim of applying the procedure to any road location, it proposes the use of roadway attributes and socioeconomic characteristics of nearby cities as explanatory variables, together with a set of previously discovered patterns with the hourly traffic percent distribution. Test results show that the proposed approach significantly produces accurate estimates of daily volumes for most locations. The accuracy at hourly level is a bit more reduced but, for periods when traffic is significant, more than half of the estimates are within 20% of absolute percentage error. Moreover, the main peak period is approximately identified for most cases. These findings together with its great applicability make this approach attractive for planners when no traffic data are available and an estimate is helpful.     

An integrated multi‐objective model to determine the optimal rescue path and traffic controlled arcs for disaster relief operations under uncertainty environments

This study proposes an integrated multi‐objective model to determine the optimal rescue path and traffic controlled arcs for disaster relief operations under uncertainty environments. The model consists of three sub‐models: rescue shortest path model, post‐disaster traffic assignment model, and traffic controlled arcs selection model to minimize four objectives: travel time of rescue path, total detour travel time, number of unconnected trips of non‐victims, and number of police officers required. Since these sub‐models are inter‐related with each other, they are solved simultaneously. This study employs genetic algorithms incorporated with traffic assignment and K‐shortest path methods to determine optimal rescue path and controlled arcs. To cope with uncertain information associated with the damaged network, fuzzy system reliability theory (weakest t‐norm method) is used to measure the access reliability of rescue path. To investigate the validity and applicability of the proposed model, studies on an exemplified case and a field case of Chi‐Chi earthquake in Taiwan are conducted. The performances of three rescue strategies: without traffic control, selective traffic control (i.e. the proposed model) and absolute traffic control are compared. The results show that the proposed model can maintain the efficiency of rescue activity with minimal impact to ordinary trips and number of police officers required.     

Estimating historical hourly traffic volumes via machine learning and vehicle probe data: A Maryland case study

This paper focuses on the problem of estimating historical traffic volumes between sparsely-located traffic sensors, which transportation agencies need to accurately compute statewide performance measures. To this end, the paper examines applications of vehicle probe data, automatic traffic recorder counts, and neural network models to estimate hourly volumes in the Maryland highway network, and proposes a novel approach that combines neural networks with an existing profiling method. On average, the proposed approach yields 24% more accurate estimates than volume profiles, which are currently used by transportation agencies across the US to compute statewide performance measures. The paper also quantifies the value of using vehicle probe data in estimating hourly traffic volumes, which provides important managerial insights to transportation agencies interested in acquiring this type of data. For example, results show that volumes can be estimated with a mean absolute percent error of about 21% at locations where average number of observed probes is between 30 and 47 vehicles/h, which provides a useful guideline for assessing the value of probe vehicle data from different vendors.     

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.     

Surrogate‐based optimization of cordon toll levels in congested traffic networks

The benefit, in terms of social surplus, from introducing congestion charging schemes in urban networks is depending on the design of the charging scheme. The literature on optimal design of congestion pricing schemes is to a large extent based on static traffic assignment, which is known for its deficiency in correctly predict travel times in networks with severe congestion. Dynamic traffic assignment can better predict travel times in a road network, but are more computational expensive. Thus, previously developed methods for the static case cannot be applied straightforward. Surrogate‐based optimization is commonly used for optimization problems with expensive‐to‐evaluate objective functions. In this paper, we evaluate the performance of a surrogate‐based optimization method, when the number of pricing schemes, which we can afford to evaluate (because of the computational time), are limited to between 20 and 40. A static traffic assignment model of Stockholm is used for evaluating a large number of different configurations of the surrogate‐based optimization method. Final evaluation is performed with the dynamic traffic assignment tool VisumDUE, coupled with the demand model Regent, for a Stockholm network including 1240 demand zones and 17 000 links. Our results show that the surrogate‐based optimization method can indeed be used for designing a congestion charging scheme, which return a high social surplus. Copyright © 2016 John Wiley & Sons, Ltd.     

Investigating micro-simulation error in activity-based travel demand forecasting: a case study of the FEATHERS framework

Activity-based models of travel demand have received considerable attention in transportation planning and forecasting in recent years. However, in most cases they use a micro-simulation approach, thereby inevitably including a stochastic error that is caused by the statistical distributions of random components. As a consequence, running a transport micro-simulation model several times with the same input will generate different outputs, which baffles practitioners in applying such a model and in interpreting the results. A common approach is therefore to run the model multiple times and to use the average value of the results. The question then becomes: what is the minimum number of model runs required to reach a stable result? In this paper, systematic experiments are carried out using Forecasting Evolutionary Activity-Travel of Households and their Environmental RepercussionS (FEATHERS), an activity-based micro-simulation modelling framework currently implemented for the Flanders region of Belgium. Six levels of geographic detail are taken into account. Three travel indices – average daily activities per person, average daily trips per person and average daily distance travelled per person, as well as their corresponding segmentations – are calculated by running the model 100 times. The results show that the more disaggregated the level, the larger the number of model runs is needed to ensure confidence. Furthermore, based on the time-dependent origin-destination table derived from the model output, traffic assignment is performed by loading it onto the Flemish road network, and the total vehicle kilometres travelled in the whole Flanders are subsequently computed. The stable results at the Flanders level provides model users with confidence that application of FEATHERS at an aggregated level requires only limited model runs.     

A reliability‐based network design problem

This paper presents a reliability‐based network design problem. A network reliability concept is embedded into the continuous network design problem in which travelers' route choice behavior follows the stochastic user equilibrium assumption. A new capacity‐reliability index is introduced to measure the probability that all of the network links are operated below their capacities when serving different traffic patterns deviating from the average condition. The reliability‐based network design problem is formulated as a bi‐level program in which the lower level sub‐program is the probit‐based stochastic user equilibrium problem and the upper level sub‐program is the maximization of the new capacity reliability index. The lower level sub‐program is solved by a variant of the method of successive averages using the exponential average to represent the learning process of network users on a daily basis that results in the daily variation of traffic‐flow pattern, and Monte Carlo stochastic loading. The upper level sub‐program is tackled by means of genetic algorithms. A numerical example is used to demonstrate the concept of the proposed framework.     

Evacuation Modelling in the United States: Does the Demand Model Choice Matter?

Abstract

This paper reviews the literature on the evacuation demand problem, with an emphasis on the impact of various modelling approaches on network‐wide evacuation performance measures. First, a number of important factors that affect evacuee behaviour are summarized. Evacuation software packages and tools are also investigated in terms of the demand generation model they use. The most widely used models are then selected for performing sensitivity analysis. Next, a cell‐transmission‐based system optimal dynamic traffic assignment (SO‐DTA) model is employed to assess the effects of the demand model choice on the clearance time and average travel time. It is concluded that evacuation demand models should be selected with care, and policy makers should make sure the selected demand curve can replicate real‐life conditions with relatively high fidelity for the study region to be able to develop reliable and realistic evacuation plans.     

Characterization and comparison of traffic flow on reversible roadways

Reversible traffic operations have become an increasingly popular strategy for mitigating traffic congestion associated with the directionally unbalanced traffic flows that are a routine part of peak commute periods, planned special events, and emergency evacuations. It is interesting that despite its widespread and long‐term use, relatively little is known about the operational characteristics of this form of operation. For example, the capacity of a reversed lane has been estimated by some to be equal to that of a normal lane while others have theorized it to be half of this value. Without accurate estimates of reversible lane performance it is not possible to confidently gauge the benefits of reversible roadways or model them using traffic simulation. This paper presents the results of a study to measure and evaluate the speed and flow characteristics of reverse‐flow traffic streams by comparing them under various operating conditions and locations. It was found that, contrary to some opinions, the flow characteristics of reverse‐flowing lanes were generally similar to normally flowing lanes under a variety of traffic volume, time‐of‐day, location, and type‐of‐use conditions. The study also revealed that drivers will readily use reversible lanes without diminished operating speeds, particularly as volumes increase. Copyright © 2010 John Wiley & Sons, Ltd.     

The optimization of lane assignment and signal timing at the tandem intersection with pre‐signal

This paper presents an integrated model for optimizing lane assignment and signal timing at tandem intersection, which is introduced recently. The pre‐signal is utilized in the tandem intersection to reorganize the traffic flow; hence, the vehicles, regardless of whether left‐turns or through vehicles, can be discharged in all the lanes. However, the previous work does not consider the extra traffic disruption and the associated delay caused by the additional pre‐signal. In the paper, the extra delay aroused by the coordination is incorporated in a lane assignment and signal timing optimization model, and the problem is converted into a mixed‐integer non‐linear programming. A feasible directions method is hence introduced to solve the mixed‐integer non‐linear programming. The result of the optimization shows that the performance of the tandem intersection is improved and the average delay is minimized. The comparison between the tandem and the conventional configuration is presented, and the results verify that the former shows better performance than the latter. In addition, the optimal sequence corresponding to the turning proportion and the optimal lane assignment at the upstream approach of the pre‐signal are presented. Furthermore, if the number of lanes is equal in all arms, the paper proves that the average delay will be reduced if lane assignment is proportional to the turning proportion and the vehicles with low proportion are discharged in advance. Copyright © 2013 John Wiley & Sons, Ltd.     

An econometric analysis of motorway renewal costs in Germany

The analysis of motorway renewal costs presented in this paper was driven by two research questions: First, to analyse the economic process of motorway renewal work and to identify whether there exist economies of scale; and second to identify the influence of traffic volume on renewal costs and to derive an estimate of marginal infrastructure costs as part of optimal road user charges. The analysis is based on cross-sectional data for motorway renewal costs and traffic volume in Germany during the period 1980–1999. Two translog models were estimated, each of them including the factor input prices for labour, material and capital, and a set of regional dummy variables as well as dummy variables for the type of material used for renewal. The first model includes in addition to these variables the sqm of renewed road as explanatory variable. The second model was constructed to analyse the relationship between traffic volume and renewal costs and contains the average annual daily traffic volume of trucks and passenger cars as independent variables. Two main results were derived from the models: First, motorway renewal work is characterised by substantial economies of scale. Second, the relationship between renewal costs and traffic volume is expressed by a cost elasticity, i.e., the ratio between marginal and average costs, which ranges from 0.05 up to 1.17 with a digressive increase of marginal costs.     

Genetics of traffic assignment models for strategic transport planning

This paper presents a review and classification of traffic assignment models for strategic transport planning purposes by using concepts analogous to genetics in biology. Traffic assignment models share the same theoretical framework (DNA), but differ in capability (genes). We argue that all traffic assignment models can be described by three genes. The first gene determines the spatial capability (unrestricted, capacity restrained, capacity constrained, and capacity and storage constrained) described by four spatial assumptions (shape of the fundamental diagram, capacity constraints, storage constraints, and turn flow restrictions). The second gene determines the temporal capability (static, semi-dynamic, and dynamic) described by three temporal assumptions (wave speeds, vehicle propagation speeds, and residual traffic transfer). The third gene determines the behavioural capability (all-or-nothing, one shot, and equilibrium) described by two behavioural assumptions (decision-making and travel time consideration). This classification provides a deeper understanding of the often implicit assumptions made in traffic assignment models described in the literature. It further allows for comparing different models in terms of functionality, and paves the way for developing novel traffic assignment models.     

A network‐based dynamic air traffic flow model for short‐term en route traffic prediction

This paper presents a dynamic network‐based approach for short‐term air traffic flow prediction in en route airspace. A dynamic network characterizing both the topological structure of airspace and the dynamics of air traffic flow is developed, based on which the continuity equation in fluid mechanics is adopted to describe the continuous behaviour of the en route traffic. Building on the network‐based continuity equation, the space division concept in cell transmission model is introduced to discretize the proposed model both in space and time. The model parameters are sequentially updated based on the statistical properties of the recent radar data and the new predicting results. The proposed method is applied to a real data set from Shanghai Area Control Center for the short‐term air traffic flow prediction both at flight path and en route sector level. The analysis of the case study shows that the developed method can characterize well the dynamics of the en route traffic flow, thereby providing satisfactory prediction results with appropriate uncertainty limits. The mean relative prediction errors are less than 0.10 and 0.14, and the absolute errors fall in the range of 0 to 1 and 0 to 3 in more than 95% time intervals respectively, for the flight path and en route sector level. Copyright © 2017 John Wiley & Sons, Ltd.     

A computational model for the probit‐based dynamic stochastic user optimal traffic assignment problem

This paper focuses on computational model development for the probit‐based dynamic stochastic user optimal (P‐DSUO) traffic assignment problem. We first examine a general fixed‐point formulation for the P‐DSUO traffic assignment problem, and subsequently propose a computational model that can find an approximated solution of the interest problem. The computational model includes four components: a strategy to determine a set of the prevailing routes between each origin–destination pair, a method to estimate the covariance of perceived travel time for any two prevailing routes, a cell transmission model‐based traffic performance model to calculate the actual route travel time used by the probit‐based dynamic stochastic network loading procedure, and an iterative solution algorithm solving the customized fixed‐point model. The Ishikawa algorithm is proposed to solve the computational model. A comparison study is carried out to investigate the efficiency and accuracy of the proposed algorithm with the method of successive averages. Two numerical examples are used to assess the computational model and the algorithm proposed. Results show that Ishikawa algorithm has better accuracy for smaller network despite requiring longer computational time. Nevertheless, it could not converge for larger network. Copyright © 2010 John Wiley & Sons, Ltd.     

Walking infrastructure design assessment by continuous space dynamic assignment modeling

For the planning and design of walking infrastructure, characterized by the fact that the pedestrians can choose their paths freely in two‐dimensional space, applicability of traditional discrete network models is limited. This contribution puts forward an approach for user‐optimal dynamic assignment in continuous time and space for analyzing for instance walking infrastructure in a two‐dimensional space. Contrary to network‐based approaches, the theory allows the traffic units to choose from an infinite non‐countable set of paths through the considered space. The approach first determines the continuous paths using a path choice model. Then, origin‐destination flows are assigned and traffic conditions are calculated. The approach to determine a user‐optimal assignment is heuristic and consists of a sequence of all‐or‐nothing assignments. An application example is presented, showing dynamic user equilibrium traffic flows through a realistic transfer station. The example is aimed at illustrating the dynamic aspects of the modeling approach, such as anticipation on expected flow conditions, and predicted behavior upon catching or missing a connection.     

Comparative analysis of transit assignment: evidence from urban railway system in the Tokyo Metropolitan Area

This paper empirically compares the performance of six traffic assignment methods using the same empirical dataset of route choice. Multinomial logit (MNL), structured multinomial probit (SMNP), user equilibrium (UE), logit-based stochastic user equilibrium (SUE), probit-based SUE, and all-or-nothing (AON) assignment methods are applied to the comparative analysis. The investigated methods include those with three types of error components in their cost functions and two types of flow dependencies. Four methods of generating the route choice set are also compared for use as stochastic traffic assignment methods. The revealed preference data of urban rail route choice in the Tokyo Metropolitan Area are used for the case analysis. The empirical case analysis shows that probit-based SUE provides the best accuracy but requires the longest computation time. It also shows that the heuristics used to generate the choice set influence the method’s accuracy, while the incorporation of route commonality and in-vehicle congestion significantly improves its accuracy. Finally, the implications for practical rail planning are discussed on the basis of the analysis results.     

Integrated model for traffic flow forecasting under rainy conditions

Inclement weather, such as heavy rain, significantly affects road traffic flow operation, which may cause severe congestion in road networks in cities. This study investigates the effect of inclement weather, such as rain events, on traffic flow and proposes an integrated model for traffic flow parameter forecasting during such events. First, an analysis of historical observation data indicates that the forecasting error of traffic flow volume has a significant linear correlation with mean precipitation, and thus, forecasting accuracy can be considerably improved by applying this linear correlation to correct forecasting values. An integrated online precipitation‐correction model was proposed for traffic flow volume forecasting based on these findings. We preprocessed precipitation data transformation and used outlier detection techniques to improve the efficiency of the model. Finally, an integrated forecasting model was designed through data fusion methods based on the four basic forecasting models and the proposed online precipitation‐correction model. Results of the model validation with the field data set show that the designed model is better than the other models in terms of overall accuracy throughout the day and under precipitation. However, the designed model is not always ideal under heavy rain conditions. Copyright © 2016 John Wiley & Sons, Ltd.     

Improving the forecasting accuracy of air passenger and air cargo demand: the application of back-propagation neural networks

This study employs back-propagation neural networks (BPN) to improve the forecasting accuracy of air passenger and air cargo demand from Japan to Taiwan. The factors which influence air passenger and air cargo demand are identified, evaluated and analysed in detail. The results reveal that some factors influence both passenger and cargo demand, and the others only one of them. The forecasting accuracy of air passenger and air cargo demand has been improved efficiently by the proposed procedure to evaluate input variables. The established model improves dramatically the forecasting accuracy of air passenger demand with an extremely low mean absolute percentage error (MAPE) of 0.34% and 7.74% for air cargo demand.