Dense network traffic models,travel time reliability and traffic management. Ii: Application to network reliability

This paper is the second of a pair of papers discussing two main themes concerning dense network modelling. These themes are: (1) the changing nature of traffic management technology and the underlying objectives behind traffic management practice, and (2) the use of measures of network reliability in models, especially as an element of the evaluation of alternative network configurations. This paper develops and applies the second theme, the use of network reliability concepts in the evaluation of traffic networks, through consideration of variations in travel times, distinction between local street and arterial road networks, and the definition and application of a set of reliability indices that may be used to study different trip movements in a network. It indicates how these indices may be used in appraising different traffic management plans for a dense network of local streets and arterial roads, using a case study application.     

Recent developments in traffic flow modeling using macroscopic fundamental diagram

ABSTRACT

This paper presents an overview of the recent developments in traffic flow modelling and analysis using macroscopic fundamental diagram (MFD) as well as their applications. In recent literature, various aggregated traffic models have been proposed and studied to analyse traffic flow while enhancing network efficiency. Many of these studies have focused on models based on MFD that describes the relationship between aggregated flow and aggregated density of transport networks. The analysis of MFD has been carried out based on experimental data collected from sensors and GPS, as well as simulation models. Several factors are found to influence the existence and shape of MFD, including traffic demand, network and signal settings, and route choices. As MFD can well express the traffic dynamics of large urban transport networks, it has been extensively applied to traffic studies, including the development of network-wide control strategies, network partitioning, performance evaluation, and road pricing. This work also presents future extensions and research directions for MFD-based traffic modelling and applications.     

Network models in traffic management and control

Abstract

The context for network modelling in traffic management and control is described in terms of the current area‐wide nature of traffic management and the range of objectives to which it can contribute. Representation of a road system and traffic management measures in terms of nodes and links and parameters associated with them is described. It is shown that the pattern of traffic has to be represented not only in terms of flows on links of the network but also in terms of numbers of movements per unit time between points of entry to and points of exit from the area being modelled. In modelling so far, these numbers of movements are regarded as given, but the routes taken are estimated by traffic assignment. Models can so far be used for comparison of a range of given schemes and for optimization of traffic control within a scheme. Variation over time is a central feature of the modelling, and this requires the use of time‐dependent queueing theory, and the specification of numbers of movements for a succession of periods of between 10 and 30 minutes. Theoretical approaches to the resulting problems of modelling and optimization are discussed, and the ways in which these are supplemented by heuristic methods in currently available models is described. Some requirements‐for further research are outlined.     

Application of advanced sampling for efficient probabilistic traffic modelling

In probabilistic traffic models, consideration of stochasticity in the dynamics of traffic gives a closer representation of a traffic system in comparison to that of a deterministic approach. Monte Carlo simulation is a broadly accepted method to consider variations in traffic within modelling. In this contribution, the possibility of increasing the efficiency of probabilistic traffic flow models using Monte Carlo simulation is analysed using variance reduction techniques and sequencing, for varied capacity and traffic demand values. The techniques of Importance Sampling, Latin Hypercube Sampling and Quasi-Random Sequencing are compared in a dynamic macroscopic traffic model to demonstrate the effectiveness of these techniques for reduction of the computational load when considering multiple input variations. Demonstration of their efficiency in traffic modelling is expected to lead to a wider application of the methods in practice.     

A novel traffic signal control formulation

A novel traffic signal control formulation is developed through a mixed integer programming technique. The formulation considers dynamic traffic, uses dynamic traffic demand as input, and takes advantage of a convergent numerical approximation to the hydrodynamic model of traffic flow. As inherent from the underlying hydrodynamic model, this formulation covers the whole range of the fundamental relationships between speed, flow, and density. Kinematic waves of the stop-and-go traffic associated with traffic signals are also captured. Because of this property, one does not need to tune or switch the model for the different traffic conditions. It “automatically” adjusts to the different traffic conditions. We applied the model to three demand scenarios in a simple network. The results seemed promising. This model produced timing plans that are consistent with models that work for unsaturated conditions. In gridlock conditions, it produced a timing plan that was better than conventional queue management practices.     

Research review of air traffic management

As air transport demand keeps growing more quickly than system capacity, efficient and effective management of system capacity becomes essential to the operation of the future global air traffic system. Although research in the past two decades has made significant progress in relevant research fields, e.g. air traffic flow management and airport capacity modelling, research loopholes in air traffic management still exist and links between different research areas are required to enhance the system performance of air traffic management. Hence, the objective of this paper is to review systematically current research in the literature about the issue of air traffic management to prioritize productive research areas. Papers about air traffic management are discussed and categorized into two levels: system and airport. The system level of air transport research includes two main topics: air traffic flow management and airspace research. On the airport level, research topics are: airport capacity, airport facility utilization, aircraft operations in the airport terminal manoeuvring area as well as aircraft ground operations research. Potential research interests to focus on in the future are the integration between airspace capacity and airport capacity, the establishment of airport information systems to use airport capacity better, and the improvement in flight schedule planning to improve the reliability of schedule implementation.     

A path-based flow formulation for the traffic assignment problem

In order to improve cooperation between traffic management and travelers, traffic assignment is the key component to achieve the objectives of both traffic management and route choice decisions for travelers. Traffic assignment can be classified into two models based on the behavioral assumptions governing route choices: User Equilibrium (UE) and System Optimum (SO) traffic assignment. According to UE and SO traffic assignment, travelers usually compete to choose the least cost routes to minimize their own travel costs, while SO traffic assignment requires travelers to work cooperatively to minimize overall cost in the road network. Thus, the paradox of benefits between UE and SO indicates that both are not practical. Thus, a solution technique needs to be proposed to balance UE and SO models, which can compromise both sides and give more feasible traffic assignments. In this paper, Stackelberg game theory is introduced to the traffic assignment problem, which can achieve the trade-off process between traffic management and travelers. Since traditional traffic assignments have low convergence rates, the gradient projection algorithm is proposed to improve efficiency.     

Multi-criteria analysis of optimal signal plans using microscopic traffic models

Increasing concerns on environment and natural resources, coupled with increasing demand for transport, put lots of pressure for improved efficiency and performance on transport systems worldwide. New technology nowadays enables fast innovation in transport, but it is the policy for deployment and operation with a systems perspective that often determines success. Smart traffic management has played important roles for continuous development of traffic systems especially in urban areas. There is, however, still lack of effort in current traffic management and planning practice prioritizing policy goals in environment and energy. This paper presents an application of a model-based framework to quantify environmental impacts and fuel efficiency of road traffic, and to evaluate optimal signal plans with respect not only to traffic mobility performance but also other important measures for sustainability. Microscopic traffic simulator is integrated with micro-scale emission model for estimation of emissions and fuel consumption at high resolution. A stochastic optimization engine is implemented to facilitate optimal signal planning for different policy goals, including delay, stop-and-goes, fuel economy etc. In order to enhance the validity of the modeling framework, both traffic and emission models are fine-tuned using data collected in a Chinese city. In addition, two microscopic traffic models are applied, and lead to consistent results for signal optimization. Two control schemes, fixed time and vehicle actuated, are optimized while multiple performance indexes are analyzed and compared for corresponding objectives. Solutions, representing compromise between different policies, are also obtained in the case study by optimizing an integrated performance index.     

Integrating a simplified emission estimation model and mesoscopic dynamic traffic simulator to efficiently evaluate emission impacts of traffic management strategies

This paper presents a computationally efficient and theoretically rigorous dynamic traffic assignment (DTA) model and its solution algorithm for a number of emerging emissions and fuel consumption related applications that require both effective microscopic and macroscopic traffic stream representations. The proposed model embeds a consistent cross-resolution traffic state representation based on Newell’s simplified kinematic wave and linear car following models. Tightly coupled with a computationally efficient emission estimation package MOVES Lite, a mesoscopic simulation-based dynamic network loading framework DTALite is adapted to evaluate traffic dynamics and vehicle emission/fuel consumption impact of different traffic management strategies.     

Estimation of road traffic noise emissions: The influence of speed and acceleration

This paper relies on vehicle trajectory collection on a corridor, to compare different traffic representations used for the estimation of the sound power of light vehicles and the resulting sound pressure levels. Four noise emission models are tested. The error introduced when the emissions are calculated based on speeds measured at regular intervals along the road network are quantified and explained. The current noise emission models might in particular misestimate noise levels under congestion. This bias can be reduced by introducing additional traffic variables in the modeling. In addition, significant differences within the models are highlighted, especially concerning their accounting of vehicle accelerations. Models that rely on a binary representation of acceleration regimes (a vehicle or a road segment is accelerating or not) can lead to errors in practice. Models under use in Europe have a very low sensitivity to acceleration values. These results help underlying the further required improvements of dynamic road traffic noise models.     

Adaptive traffic signal control with actor-critic methods in a real-world traffic network with different traffic disruption events

The transportation demand is rapidly growing in metropolises, resulting in chronic traffic congestions in dense downtown areas. Adaptive traffic signal control as the principle part of intelligent transportation systems has a primary role to effectively reduce traffic congestion by making a real-time adaptation in response to the changing traffic network dynamics. Reinforcement learning (RL) is an effective approach in machine learning that has been applied for designing adaptive traffic signal controllers. One of the most efficient and robust type of RL algorithms are continuous state actor-critic algorithms that have the advantage of fast learning and the ability to generalize to new and unseen traffic conditions. These algorithms are utilized in this paper to design adaptive traffic signal controllers called actor-critic adaptive traffic signal controllers (A-CATs controllers).The contribution of the present work rests on the integration of three threads: (a) showing performance comparisons of both discrete and continuous A-CATs controllers in a traffic network with recurring congestion (24-h traffic demand) in the upper downtown core of Tehran city, (b) analyzing the effects of different traffic disruptions including opportunistic pedestrians crossing, parking lane, non-recurring congestion, and different levels of sensor noise on the performance of A-CATS controllers, and (c) comparing the performance of different function approximators (tile coding and radial basis function) on the learning of A-CATs controllers. To this end, first an agent-based traffic simulation of the study area is carried out. Then six different scenarios are conducted to find the best A-CATs controller that is robust enough against different traffic disruptions. We observe that the A-CATs controller based on radial basis function networks (RBF (5)) outperforms others. This controller is benchmarked against controllers of discrete state Q-learning, Bayesian Q-learning, fixed time and actuated controllers; and the results reveal that it consistently outperforms them.     

Norm approximation method for handling traffic count inconsistencies in path flow estimator

Path flow estimator (PFE) is a one-stage network observer proposed to estimate path flows and hence origin–destination (O–D) flows from traffic counts in a transportation network. Although PFE does not require traffic counts to be collected on all network links when inferring unmeasured traffic conditions, it does require all available counts to be reasonably consistent. This requirement is difficult to fulfill in practice due to errors inherited in data collection and processing. The original PFE model handles this issue by relaxing the requirement of perfect replication of traffic counts through the specification of error bounds. This method enhances the flexibility of PFE by allowing the incorporation of local knowledge, regarding the traffic conditions and the nature of traffic data, into the estimation process. However, specifying appropriate error bounds for all observed links in real networks turns out to be a difficult and time-consuming task. In addition, improper specification of the error bounds could lead to a biased estimation of total travel demand in the network. This paper therefore proposes the norm approximation method capable of internally handling inconsistent traffic counts in PFE. Specifically, three norm approximation criteria are adopted to formulate three L_p-PFE models for estimating consistent path flows and O–D flows that simultaneously minimize the deviation between the estimated and observed link volumes. A partial linearization algorithm embedded with an iterative balancing scheme and a column generation procedure is developed to solve the three L_p-PFE models. In addition, the proposed L_p-PFE models are illustrated with numerical examples and the characteristics of solutions obtained by these models are discussed.     

Spatial and temporal characterization of travel patterns in a traffic network using vehicle trajectories

This paper presents a trajectory clustering method to discover spatial and temporal travel patterns in a traffic network. The study focuses on identifying spatially distinct traffic flow groups using trajectory clustering and investigating temporal traffic patterns of each spatial group. The main contribution of this paper is the development of a systematic framework for clustering and classifying vehicle trajectory data, which does not require a pre-processing step known as map-matching and directly applies to trajectory data without requiring the information on the underlying road network. The framework consists of four steps: similarity measurement, trajectory clustering, generation of cluster representative subsequences, and trajectory classification. First, we propose the use of the Longest Common Subsequence (LCS) between two vehicle trajectories as their similarity measure, assuming that the extent to which vehicles’ routes overlap indicates the level of closeness and relatedness as well as potential interactions between these vehicles. We then extend a density-based clustering algorithm, DBSCAN, to incorporate the LCS-based distance in our trajectory clustering problem. The output of the proposed clustering approach is a few spatially distinct traffic stream clusters, which together provide an informative and succinct representation of major network traffic streams. Next, we introduce the notion of Cluster Representative Subsequence (CRS), which reflects dense road segments shared by trajectories belonging to a given traffic stream cluster, and present the procedure of generating a set of CRSs by merging the pairwise LCSs via hierarchical agglomerative clustering. The CRSs are then used in the trajectory classification step to measure the similarity between a new trajectory and a cluster. The proposed framework is demonstrated using actual vehicle trajectory data collected from New York City, USA. A simple experiment was performed to illustrate the use of the proposed spatial traffic stream clustering in application areas such as network-level traffic flow pattern analysis and travel time reliability analysis.     

Modelling the effects of road pricing on traffic using ERP traffic data

Singapore’s Electronic Road Pricing (ERP) system involves time-variable charges which are intended to spread the morning traffic peak. The charges are revised every three months and thus induce regular motorists to re-think their travel decisions. ERP traffic data, captured by the system, provides a valuable source of information for studying motorists’ travel behaviour. This paper proposes a new modelling methodology for using these data to forecast short-term impacts of rate adjustment on peak period traffic volumes. Separate models are developed for different categories of vehicles which are segmented according to their demand elasticity with respect to road pricing. A method is proposed for estimating the maximum likelihood value of preferred arrival time (PAT) for each vehicle’s arrivals at a particular ERP gantry under different charging conditions. Iterative procedures are used in both model calibration and application. The proposed approach was tested using traffic datasets recorded in 2003 at a gantry located on Singapore’s Central Expressway (CTE). The model calibration and validation show satisfactory results.     

Capturing value of reliability through road pricing in congested traffic under uncertainty

Empirical studies showed that travel time reliability, usually measured by travel time variance, is strongly correlated with travel time itself. Travel time is highly volatile when the demand approaches or exceeds the capacity. Travel time variability is associated with the level of congestion, and could represent additional costs for travelers who prefer punctual arrivals. Although many studies propose to use road pricing as a tool to capture the value of travel time (VOT) savings and to induce better road usage patterns, the role of the value of reliability (VOR) in designing road pricing schemes has rarely been studied. By using road pricing as a tool to spread out the peak demand, traffic management agencies could improve the utility of travelers who prefer punctual arrivals under traffic congestion and stochastic network conditions. Therefore, we could capture the value of travel time reliability using road pricing, which is rarely discussed in the literature. To quantify the value of travel time reliability (or reliability improvement), we need to integrate trip scheduling, endogenous traffic congestion, travel time uncertainty, and pricing strategies in one modeling framework. This paper developed such a model to capture the impact of pricing on various costs components that affect travel choices, and the role of travel time reliability in shaping departure patterns, queuing process, and the choice of optimal pricing. The model also shows the benefits of improving travel time reliability in various ways. Findings from this paper could help to expand the scope of road pricing, and to develop more comprehensive travel demand management schemes.     

Modelling lane changing and merging in microscopic traffic simulation

This paper introduces Simulation of Intelligent TRAnsport Systems (SITRAS), a massive multi-agent simulation system in which driver-vehicle objects are modelled as autonomous agents. The simulation outputs can be used for the evaluation of Intelligent Transport Systems applications such as congestion and incident management, public transport priority and dynamic route guidance. The model concepts and specifications, and the first applications of the model in the area of incident modelling in urban arterial networks were described in previous publications. This paper presents the details of the lane changing and merging algorithms developed for the SITRAS model. These models incorporate procedures for ‘forced’ and ‘co-operative’ lane changing which are essential for lane changing under congested (and incident-affected) traffic conditions. The paper describes the algorithms and presents simulation examples to demonstrate the effects of the implemented models. The results indicate that only the forced and cooperative lane changing models can produce realistic flow-speed relationships during congested conditions.     

A traffic flow simulator for network reliability assessment

This paper investigates the transportation network reliability based on the information provided by detectors installed on some links. A traffic flow simulator (TFS) model is formulated for assessing the network reliability (in terms of travel time reliability), in which the variation of perceived travel time error and the fluctuations of origin-destination (OD) demand are explicitly considered. On the basis of prior OD demand and partial updated detector data, the TFS can estimate the link flows for the whole network together with link/path travel times, and their variance and covariance. The travel time reliability by OD pair can also be assessed and the OD matrix can be updated simultaneously. A Monte Carlo based algorithm is developed to solve the TFS model. The application of the proposed TFS model is illustrated by a numerical example.     

Urban traffic flow prediction using a fuzzy-neural approach

This paper develops a fuzzy-neural model (FNM) to predict the traffic flows in an urban street network, which has long been considered a major element in the responsive urban traffic control systems. The FNM consists of two modules: a gate network (GN) and an expert network (EN). The GN classifies the input data into a number of clusters using a fuzzy approach, and the EN specifies the input–output relationship as in a conventional neural network approach. While the GN groups traffic patterns of similar characteristics into clusters, the EN models the specific relationship within each cluster. An online rolling training procedure is proposed to train the FNM, which enhances its predictive power through adaptive adjustments of the model coefficients in response to the real-time traffic conditions. Both simulation and real observation data are used to demonstrative the effectiveness of the method.     

The principles of calibrating traffic microsimulation models

Traffic microsimulation models normally include a large number of parameters that must be calibrated before the model can be used as a tool for prediction. A wave of methodologies for calibrating such models has been recently proposed in the literature, but there have been no attempts to identify general calibration principles based on their collective experience. The current paper attempts to guide traffic analysts through the basic requirements of the calibration of microsimulation models. Among the issues discussed here are underlying assumptions of the calibration process, the scope of the calibration problem, formulation and automation, measuring goodness-of-fit, and the need for repeated model runs.

Use of sequential learning for short-term traffic flow forecasting

Accurate short-term traffic flow forecasting has become a crucial step in the overall goal of better road network management. Previous research [H. Kirby, M. Dougherty, S. Watson, Should we use neural networks or statistical models for short term motorway traffic forecasting, International Journal of Forecasting 13 (1997) 43–50.] has demonstrated that a straightforward application of neural networks can be used to forecast traffic flows along a motorway link. The objective of this paper is to report on the application and performance of an alternative neural computing algorithm which involves ‘sequential or dynamic learning’ of the traffic flow process. Our initial work [H. Chen, S. Clark, M.S. Dougherty, S.M. Grant-Muller, Investigation of network performance prediction, Report on Dynamic Neural Network and Performance Indicator development, Institute for Transport Studies, University of Leeds Technical Note 418, 1998 (unpublished)] was based on simulated data (generated using a Hermite polynomial with random noise) that had a profile similar to that of traffic flows in real data. This indicated the potential suitability of dynamic neural networks with traffic flow data. Using the Kalman filter type network an initial application with M25 motorway flow data suggested that a percentage absolute error (PAE) of approximately 9.5% could be achieved for a network with five hidden units (compared with 11% for the static neural network model). Three different neural networks were trained with all the data (containing an unknown number of incidents) and secondly using data wholly obtained around incidents. Results showed that from the three different models, the ‘simple dynamic model’ with the first five units fixed (and subsequent hidden units distributed amongst these) had the best forecasting performance. Comparisons were also made of the networks’ performance on data obtained around incidents. More detailed analysis of how the performance of the three networks changed through a single day (including an incident) showed that the simple dynamic model again outperformed the other two networks in all time periods. The use of ‘piecewise’ models (i.e. where a different model is selected according to traffic flow conditions) for data obtained around incidents highlighted good performance again by the simple dynamic network. This outperformed the standard Kalman filter neural network for a medium-sized network and is our overall recommendation for any future application.