A Microscopic Simulation Model for Incident Modeling in Urban Networks

Abstract

This paper reviews the main modules of an integrated system for incident management in real-time, -sim. A core to such a system is a microscopic simulator with extended abilities to model the temporal and spatial evolution of specified non-recurrent traffic conditions. The paper reviews the mathematical formulation of the car-following and lane-changing modules. The model is validated using a simulation-based approach. Concluding comments on the general validation process of the model are provided. The paper finally presents a sample of the accident patterns replicated by the model together with their implications for real world validation.     

Short‐term traffic flow prediction with linear conditional Gaussian Bayesian network

Traffic flow prediction is an essential part of intelligent transportation systems (ITS). Most of the previous traffic flow prediction work treated traffic flow as a time series process only, ignoring the spatial relationship from the upstream flows or the correlation with other traffic attributes like speed and density. In this paper, we utilize a linear conditional Gaussian (LCG) Bayesian network (BN) model to consider both spatial and temporal dimensions of traffic as well as speed information for short‐term traffic flow prediction. The LCG BN allows both continuous and discrete variables, which enables the consideration of categorical variables in traffic flow prediction. A microscopic traffic simulation dataset is used to test the performance of the proposed model compared to other popular approaches under different predicting time intervals. In addition, the authors investigate the importance of spatial data and speed data in flow prediction by comparing models with different levels of information. The results indicate that the prediction accuracy will increase significantly when both spatial data and speed data are included. Copyright © 2016 John Wiley & Sons, Ltd.     

A copula-based approach to accommodate the dependence among microscopic traffic variables

Developing microscopic traffic simulation models requires the knowledge of probability distributions of microscopic traffic variables. Although previous studies have proposed extensive mathematical distributions for describing traffic variables (e.g., speed, headway, vehicle length, etc.), these studies usually consider microscopic traffic observations to be independent variables and distributions for these variables are investigated separately. As a result, some traditional approaches consider microscopic traffic variables as independent inputs to the traffic simulation process and these methods may ignore the possible dependence among different traffic variables.The objectives of this paper are to investigate the dependence structure among microscopic traffic variables and to examine the applicability of the copula approach to the joint modeling of these variables. Copulas are functions that relate multivariate distribution functions of random variables to their one-dimensional marginal distribution functions. The concept of copulas has been well recognized in the statistics field and recently has been introduced in transportation studies. The proposed copula approach is applied to the 24-h traffic data collected on IH-35 in Austin, Texas. The preliminary data analysis indicates that there exists dependence among microscopic traffic variables. Moreover, the modeling and simulation results suggest that copula models can adequately accommodate and accurately reproduce the dependence structure revealed by the traffic observations. Overall, the findings in this paper provide a framework for generating multiple microscopic traffic variables simultaneously by considering their dependence.     

W-SPSA in practice: Approximation of weight matrices and calibration of traffic simulation models

The development and calibration of complex traffic models demands parsimonious techniques, because such models often involve hundreds of thousands of unknown parameters. The Weighted Simultaneous Perturbation Stochastic Approximation (W-SPSA) algorithm has been proven more efficient than its predecessor SPSA (Spall, 1998), particularly in situations where the correlation structure of the variables is not homogeneous. This is crucial in traffic simulation models where effectively some variables (e.g. readings from certain sensors) are strongly correlated, both in time and space, with some other variables (e.g. certain OD flows). In situations with reasonably sized traffic networks, the difference is relevant considering computational constraints. However, W-SPSA relies on determining a proper weight matrix (W) that represents those correlations, and such a process has been so far an open problem, and only heuristic approaches to obtain it have been considered.This paper presents W-SPSA in a formally comprehensive way, where effectively SPSA becomes an instance of W-SPSA, and explores alternative approaches for determining the matrix W. We demonstrate that, relying on a few simplifications that marginally affect the final solution, we can obtain W matrices that considerably outperform SPSA. We analyse the performance of our proposed algorithm in two applications in motorway networks in Singapore and Portugal, using a dynamic traffic assignment model and a microscopic traffic simulator, respectively.     

Recognition and tracking of spatial–temporal congested traffic patterns on freeways

The two models FOTO (Forecasting of Traffic Objects) and ASDA (Automatische Staudynamikanalyse: Automatic Tracking of Moving Traffic Jams) for the automatic recognition and tracking of congested spatial–temporal traffic flow patterns on freeways are presented. The models are based on a spatial–temporal traffic phase classification made in the three-phase traffic theory by Kerner. In this traffic theory, in congested traffic two different phases are distinguished: “wide moving jam” and “synchronized flow”. The model FOTO is devoted to the identification of traffic phases and to the tracking of synchronized flow. The model ASDA is devoted to the tracking of the propagation of moving jams. The general approach and the different extensions of the models FOTO and ASDA are explained in detail. It is stressed that the models FOTO and ASDA perform without any validation of model parameters in different environmental and traffic conditions. Results of the online application of the models FOTO and ASDA at the TCC (Traffic Control Center) of Hessen near Frankfurt (Germany) are presented and evaluated.     

A microscopic analysis of speed deviation impacts on lane-changing behavior

Driving behavior models that capture drivers’ tactical maneuvering decisions in different traffic conditions are essential to microscopic traffic simulation systems. This paper focuses on a parameter that has a great impact on road users’ aggressive overtaking maneuvers and directly affects lane-changing models (an integral part of microscopic traffic simulation models), namely, speed deviation. The objective of this research is to investigate the impacts of speed deviation in terms of performance measures (delay time, network mean speed, and travel time duration) and the number of lane-change maneuvers using the Aimsun traffic simulator. Following calibration of the model for a section of urban highway in Tehran, this paper explores the sensitivity of lane-changing maneuvers during different speed deviations by conducting two types of test. Simulation results show that, by decreasing speed deviation, the number of lane changes reduces remarkably and so network safety increases, thus reducing travel time due to an increase in network mean speed.     

Evaluation of ramp control algorithms using microscopic traffic simulation

Ramp metering has emerged as an effective freeway control measure to ensure efficient freeway operations. A number of algorithms have been developed in recent years to ensure an effective use of ramp metering. As the performance of ramp metering depends on various factors (e.g. traffic volume, downstream traffic conditions, queue override policy etc), these algorithms should be evaluated under a wide range of traffic conditions to check their applicability and performance and to ensure their successful implementation. In view of the expenses of and confounding effects in field testing, simulation plays an important role in the evaluation of such algorithms. This paper presents an evaluation study of two ramp metering algorithms: ALINEA and FLOW. ALINEA is a local control algorithm and FLOW is an area wide coordinated algorithm. The purpose of the study is to use microscopic simulation to evaluate systematically how the level of traffic demand, queue spillback handling policy and downstream bottleneck conditions affect the performance of the algorithms. It is believed that these variables have complex interactions with ramp metering. MITSIM microscopic traffic simulator is used to perform the empirical study. The study consists of two stages. In the first stage, key input parameters for the algorithms were identified and calibrated. The calibrated parameters were then used for the second stage, where the performance of the algorithms were compared with respect to three traffic variables mentioned above using an orthogonal fraction of experiments. Regression analysis was used to identify the impacts of some of the interactions among experimental factors on the algorithms' performance, which is not otherwise possible with a tabular analysis. These results provide insights which may be helpful for design and calibration of more efficient ramp control algorithms.     

Network traffic control based on a mesoscopic dynamic flow model

The paper focuses on Network Traffic Control based on aggregate traffic flow variables, aiming at signal settings which are consistent with within-day traffic flow dynamics. The proposed optimisation strategy is based on two successive steps: the first step refers to each single junction optimisation (green timings), the second to network coordination (offsets). Both of the optimisation problems are solved through meta-heuristic algorithms: the optimisation of green timings is carried out through a multi-criteria Genetic Algorithm whereas offset optimisation is achieved with the mono-criterion Hill Climbing algorithm. To guarantee proper queuing and spillback simulation, an advanced mesoscopic traffic flow model is embedded within the network optimisation method. The adopted mesoscopic traffic flow model also includes link horizontal queue modelling. The results attained through the proposed optimisation framework are compared with those obtained through benchmark tools.     

The estimation of a time-dependent OD trip table with vehicle trajectory samples

Abstract

In this paper we discuss a dynamic origin–destination (OD) estimation problem that has been used for identifying time-dependent travel demand on a road network. Even though a dynamic OD table is an indispensable data input for executing a dynamic traffic assignment, it is difficult to construct using the conventional OD construction method such as the four-step model. For this reason, a direct estimation method based on field traffic data such as link traffic counts has been used. However, the method does not account for a logical relationship between a travel demand pattern and socioeconomic attributes. In addition, the OD estimation method cannot guarantee the reliability of estimated results since the OD estimation problem has a property named the ‘underdetermined problem.’ In order to overcome such a problem, the method developed in this paper makes use of vehicle trajectory samples with link traffic counts. The new method is applied to numerical examples and shows promising capability for identifying a temporal and spatial travel demand pattern.     

Adding temporal information to direct-demand models: Hourly estimation of bicycle and pedestrian traffic in Blacksburg,VA

Cycling and walking are environmentally-friendly transport modes, providing alternatives to automobility. However, exposure to hazards (e.g., crashes) may influence the choice to walk or cycle for risk-averse populations, minimizing non-motorized travel as an alternative to driving. Most models to estimate non-motorized traffic volumes (and subsequently hazard exposure) are based on specific time periods (e.g., peak-hour) or long-term averages (e.g., Annual Average Daily Traffic), which do not allow for estimating hazard exposure by time of day. We calculated Annual Average Hourly Traffic estimates of bicycles and pedestrians from a comprehensive traffic monitoring campaign in a small university town (Blacksburg, VA) to develop hourly direct-demand models that account for both spatial (e.g., land use, transportation) and temporal (i.e., time of day) factors. We developed two types of models: (1) hour-specific models (i.e., one model for each hour of the day) and (2) a single spatiotemporal model that directly incorporates temporal variables. Our model results were reasonable (adj-R² for the hour-specific [spatiotemporal] bicycle model: ∼0.47 [0.49]; pedestrian model: ∼0.69 [0.72]). We found correlation among non-motorized traffic, land use (e.g., population density), and transportation (e.g., on-street facility) variables. Temporal variables had a similar magnitude of correlation as the spatial variables. We produced spatial estimates that vary by time of day to illustrate spatiotemporal traffic patterns for the entire network. Our temporally-resolved models could be used to assess exposure to hazards (e.g. air pollution, crashes) or locate safety-related infrastructure (e.g., striping, lights) based on targeted time periods (e.g., peak-hour, nighttime) that temporally averaged estimates cannot.     

Development and implementation of the areawide Dynamic ROad traffic NoisE (DRONE) simulator

This paper discusses the areawide Dynamic ROad traffic NoisE (DRONE) simulator, and its implementation as a tool for noise abatement policy evaluation. DRONE involves integrating a road traffic noise estimation model with a traffic simulator to estimate road traffic noise in urban networks. An integrated traffic simulation-noise estimation model provides an interface for direct input of traffic flow properties from simulation model to noise estimation model that in turn estimates the noise on a spatial and temporal scale. The output from DRONE is linked with a geographical information system for visual representation of noise levels in the form of noise contour maps.     

Urban traffic flow prediction: a spatio‐temporal variable selection‐based approach

Short‐term traffic flow prediction in urban area remains a difficult yet important problem in intelligent transportation systems. Current spatio‐temporal‐based urban traffic flow prediction techniques trend aims to discover the relationship between adjacent upstream and downstream road segments using specific models, while in this paper, we advocate to exploit the spatial and temporal information from all available road segments in a partial road network. However, the available traffic states can be high dimensional for high‐density road networks. Therefore, we propose a spatio‐temporal variable selection‐based support vector regression (VS‐SVR) model fed with the high‐dimensional traffic data collected from all available road segments. Our prediction model can be presented as a two‐stage framework. In the first stage, we employ the multivariate adaptive regression splines model to select a set of predictors most related to the target one from the high‐dimensional spatio‐temporal variables, and different weights are assigned to the selected predictors. In the second stage, the kernel learning method, support vector regression, is trained on the weighted variables. The experimental results on the real‐world traffic volume collected from a sub‐area of Shanghai, China, demonstrate that the proposed spatio‐temporal VS‐SVR model outperforms the state‐of‐the‐art. Copyright © 2015 John Wiley & Sons, Ltd.     

Mesoscopic simulation of a dynamic link loading process

Passing from path flows to link flows requires non-linear and complex flow propagation models known as network loading models. In specific technical literature, different approaches have been used to study Dynamic Network Loading models, depending on whether the link performances are expressed in an aggregate or disaggregate way, and how vehicles are traced. When vehicle movements are traced implicitly and link performances are expressed in an aggregate way, the approach is macroscopic. When vehicle movements are traced explicitly, two cases are possible, depending on whether link performances are expressed in a disaggregate or aggregate way. In the first case, the approach is microscopic, otherwise it is mesoscopic.In this paper, a mesoscopic Dynamic Network Loading model is considered, based on discrete packets and taking into account the vehicle acceleration and deceleration. A simulation was carried out, first using theoretical input data to simulate over-saturation condition, and then real data to validate the model. The results show that the model appears realistic in the representation of outflow dynamics and is quite easy to calculate. It is worth noting that network loading models are usually used downstream of the assignment models from which they take path flows to calculate link flows. In the above mentioned simulation, we assumed that a generic assignment model provides sinusoidal path flow.     

A comparative study of aggregate and disaggregate gravity models using Seoul metropolitan subway trip data

Abstract

Existing origin constrained and doubly constrained gravity models have not been compared, theoretically or empirically, in terms of their forecasting power. Due to the newly advanced technology of intelligent transport systems, the expanded data presently available have made various models more comparable in terms of forecasting power. This paper uses archived automatic passenger counting (APC) data for urban rail in the Seoul metropolitan area. The APC data contains information about each trip's origin, destination, ticket type, fare, and distance on a daily basis. The objective of this paper is to compare the goodness-of-fit of aggregate and disaggregate gravity modeling using these data. A Hyman aggregate gravity model is used as the aggregate model without the spatial effect. The disaggregate model adopts a multinomial logit as the destination choice model with the spatial effect. In general, while the formulation of aggregate and disaggregate gravity model models are similar, the calibration and parameter estimation methods of the two models are different. As a result, this empirical study demonstrates that the variation in goodness-of-fit and forecasting power largely depends on the estimation method and selected variables. The forecasting power of the disaggregate modeling approach outperforms that of the aggregate model. This paper further confirms that spatial arrangement plays important roles in gravity modeling.     

Micro-simulation of daily activity-travel patterns for travel demand forecasting

The development and initial validation results of a micro-simulator for the generation of daily activity-travel patterns are presented in this paper. The simulator assumes a sequential history and time-of-day dependent structure. Its components are developed based on a decomposition of a daily activity-travel pattern into components to which certain aspects of observed activity-travel behavior correspond, thus establishing a link between mathematical models and observational data. Each of the model components is relatively simple and is estimated using commonly adopted estimation methods and existing data sets. A computer code has been developed and daily travel patterns have been generated by Monte Carlo simulation. Study results show that individuals' daily travel patterns can be synthesized in a practical manner by micro-simulation. Results of validation analyses suggest that properly representing rigidities in daily schedules is important in simulating daily travel patterns. This revised version was published online in June 2006 with corrections to the Cover Date.     

Microscopic pedestrian simulation model combined with a tactical model for route choice behaviour

This study proposes a microscopic pedestrian simulation model for evaluating pedestrian flow. Recently, several pedestrian models have been proposed to evaluate pedestrian flow in crowded situations for the purpose of designing facilities. However, current pedestrian simulation models do not explain the negotiation process of collision avoidance between pedestrians, which can be important for representing pedestrian behaviour in congested situations. This study builds a microscopic model of pedestrian behaviour using a two-player game and assuming that pedestrians anticipate movements of other pedestrians so as to avoid colliding with them. A macroscopic tactical model is also proposed to determine a macroscopic path to a given destination. The results of the simulation model are compared with experimental data and observed data in a railway station. Several characteristics of pedestrian flows such as traffic volume and travel time in multidirectional flows, temporal–spatial collision avoidance behaviour and density distribution in the railway station are reproduced in the simulation.     

A network wide simulation strategy of alternative fuel vehicles

This paper presents an integrated simulator “CUIntegration” to evaluate routing strategies based on energy and/or traffic measures of effectiveness for any Alternative Fuel Vehicles (AFVs). The CUIntegration can integrate vehicle models of conventional vehicles as well as AFVs developed with MATLAB-Simulink, and a roadway network model developed with traffic microscopic simulation software VISSIM. The architecture of this simulator is discussed in this paper along with a case study in which the simulator was utilized for evaluating a routing strategy for Plug-in Hybrid Electric Vehicles (PHEVs) and Electric Vehicles (EVs). The authors developed a route optimization algorithm to guide an AFV based on that AFV driver’s choice, which included; finding a route with minimum (1) travel time, (2) energy consumption or (3) a combination of both. The Application Programming Interface (API) was developed using Visual Basic to simulate the vehicle models/algorithms developed in MATLAB and direct vehicles in a roadway network model developed in VISSIM accordingly. The case study included a section of Interstate 83 in Baltimore, Maryland, which was modeled, calibrated and validated. The authors considered a worst-case scenario with an incident on the main route blocking all lanes for 30 min. The PHEVs and EVs were represented by integrating the MATLAB-Simulink vehicle models with the traffic simulator. The CUIntegration successfully combined vehicle models with a roadway traffic network model to support a routing strategy for PHEVs and EVs. Simulation experiments with CUIntegration revealed that routing of PHEVs resulted in cost savings of about 29% when optimized for the energy consumption, and for the same optimization objective, routing of EVs resulted in about 64% savings.     

Local online kernel ridge regression for forecasting of urban travel times

Accurate and reliable forecasting of traffic variables is one of the primary functions of Intelligent Transportation Systems. Reliable systems that are able to forecast traffic conditions accurately, multiple time steps into the future, are required for advanced traveller information systems. However, traffic forecasting is a difficult task because of the nonlinear and nonstationary properties of traffic series. Traditional linear models are incapable of modelling such properties, and typically perform poorly, particularly when conditions differ from the norm. Machine learning approaches such as artificial neural networks, nonparametric regression and kernel methods (KMs) have often been shown to outperform linear models in the literature. A bottleneck of the latter approach is that the information pertaining to all previous traffic states must be contained within the kernel, but the computational complexity of KMs usually scales cubically with the number of data points in the kernel. In this paper, a novel kernel-based machine learning (ML) algorithm is developed, namely the local online kernel ridge regression (LOKRR) model. Exploiting the observation that traffic data exhibits strong cyclic patterns characterised by rush hour traffic, LOKRR makes use of local kernels with varying parameters that are defined around each time point. This approach has 3 advantages over the standard single kernel approach: (1) It allows parameters to vary by time of day, capturing the time varying distribution of traffic data; (2) It allows smaller kernels to be defined that contain only the relevant traffic patterns, and; (3) It is online, allowing new traffic data to be incorporated as it arrives. The model is applied to the forecasting of travel times on London’s road network, and is found to outperform three benchmark models in forecasting up to 1 h ahead.     

Incorporating spatial interactions in zero-inflated negative binomial models for freight trip generation

This paper formulates a spatial autoregressive zero-inflated negative binomial model for freight trip productions and attractions. The model captures the following freight trip characteristics: count data type, positive trip rates, overdispersion, zero-inflation, and spatial autocorrelation. The spatial autoregressive structure is applied in the negative binomial part of the models to obtain unbiased estimates of the effects of different regressors. Further, we estimate parameters using the full information maximum likelihood estimator. We perform empirical analysis with an establishment based freight survey conducted in Chennai. Separate models are estimated for trips generated by motorised two-wheelers and three-wheelers, and pickups besides an aggregate model. Spatial variables such as road density and indicator of geolocation are insignificant in all the models. In contrast, the spatial autocorrelation is significant in all of the models except for the freight trips attracted and produced by pickups. From a policy standpoint, the elasticity results show the importance of considering spatial autocorrelation. We also highlight the bias due to aggregation of vehicle classes, based on the elasticities.