Long short-term memory neural network for traffic speed prediction using remote microwave sensor data

Neural networks have been extensively applied to short-term traffic prediction in the past years. This study proposes a novel architecture of neural networks, Long Short-Term Neural Network (LSTM NN), to capture nonlinear traffic dynamic in an effective manner. The LSTM NN can overcome the issue of back-propagated error decay through memory blocks, and thus exhibits the superior capability for time series prediction with long temporal dependency. In addition, the LSTM NN can automatically determine the optimal time lags. To validate the effectiveness of LSTM NN, travel speed data from traffic microwave detectors in Beijing are used for model training and testing. A comparison with different topologies of dynamic neural networks as well as other prevailing parametric and nonparametric algorithms suggests that LSTM NN can achieve the best prediction performance in terms of both accuracy and stability.     

Development and evaluation of a knowledge-based system for traffic congestion management and control

This paper describes a real-time knowledge-based system (KBS) for decision support to Traffic Operation Center personnel in the selection of integrated traffic control plans after the occurrence of non-recurring congestion, on freeway and arterial networks. The uniqueness of the system, called TCM, lies in its ability to cooperate with the operator, by handling different sources of input data and inferred knowledge, and providing an explanation of its reasoning process. A data fusion algorithm for the analysis of congestion allows to represent and interpret different types of data, with various levels of reliability and uncertainty, to provide a clear assessment of traffic conditions. An efficient algorithm for the selection of control plans determines alternative traffic control responses. These are proposed to an operator, along with an explanation of the reasoning process that led to their development and an estimation of their expected effect on traffic. The validation of the system, which is one of only few examples of validation of a KBS in transportation, demonstrates the validity of the approach. The evaluation results, in a simulated environment demonstrate the ability of TCM to reduce congestion, through the formulation of traffic diversion and control schemes.     

Reliable sensor deployment for network traffic surveillance

New sensor technologies enable synthesis of disaggregated vehicle information from multiple locations. This paper proposes a reliable facility location model to optimize traffic surveillance benefit from synthesized sensor pairs (e.g., for travel time estimation) in addition to individual sensor flow coverage (e.g., for traffic volume statistics), while considering probabilistic sensor failures. Customized greedy and Lagrangian relaxation algorithms are proposed to solve this problem, and their performance is discussed. Numerical results show that the proposed algorithms solve the problem efficiently. We also discuss managerial insights on how optimal sensor deployment and surveillance benefits vary with surveillance objective and system parameters (such as sensor failure probabilities).     

Cellpath: Fusion of cellular and traffic sensor data for route flow estimation via convex optimization

A new convex optimization framework is developed for the route flow estimation problem from the fusion of vehicle count and cellular network data. The issue of highly underdetermined link flow based methods in transportation networks is investigated, then solved using the proposed concept of cellpaths for cellular network data. With this data-driven approach, our proposed approach is versatile: it is compatible with other data sources, and it is model agnostic and thus compatible with user equilibrium, system-optimum, Stackelberg concepts, and other models. Using a dimensionality reduction scheme, we design a projected gradient algorithm suitable for the proposed route flow estimation problem. The algorithm solves a block isotonic regression problem in the projection step in linear time. The accuracy, computational efficiency, and versatility of the proposed approach are validated on the I-210 corridor near Los Angeles, where we achieve 90% route flow accuracy with 1033 traffic sensors and 1000 cellular towers covering a large network of highways and arterials with more than 20,000 links. In contrast to long-term land use planning applications, we demonstrate the first system to our knowledge that can produce route-level flow estimates suitable for short time horizon prediction and control applications in traffic management. Our system is open source and available for validation and extension.     

GPS-based speed collection method for road traffic noise mapping

One of the most difficult and expensive tasks in making noise pollution maps is the collection and processing of the data needed to create acoustic models. In the case of road traffic noise maps, obtaining speed data for light and heavy vehicles a problem that has usually been avoided by using a road’s speed limit or by making assumptions based on experience from similar road types. Here global positioning systems-based techniques are applied for acquiring vehicle speed data and adapted to fulfill the requirements of noise prediction models.     

Highway voting system: Embracing a possible paradigm shift in traffic data acquisition

The integration of internet and mobile phones has opened the door to a new wave of utilizing private vehicles as probes not only for performance evaluation but for traffic control as well, gradually replacing the role of traffic surveillance systems as the dominant source of traffic data. To prepare for such a paradigm shift, one needs to overcome some key institutional barriers, in particular, the privacy issue. A Highway Voting System (HVS) is proposed to address this issue in which drivers provide link- and/or path-based vehicle data to the traffic management system in the form of “votes” in order to receive favorable service from traffic control. The proposed HVS offers a platform that links data from individual vehicles directly with traffic control. In the system, traffic control responds to voting vehicles in a way similar to the current system responding to prioritized vehicles and providing the requested services accordingly. We show in the paper that the proposed “voting” system can effectively resolve the privacy issue which often hampers traffic engineers from getting detailed data from drivers. Strategies to entice drivers into “voting” so as to increase the market penetration level under all traffic conditions are discussed. Though the focus of the paper is on addressing the institutional issues associated with data acquisition from individual vehicles, other research topics associated with the proposed system are identified. Two examples are given to demonstrate the impact of the proposed system on algorithm development and traffic control.     

Identification of vehicle sensor locations for link-based network traffic applications

Information on link flows in a vehicular traffic network is critical for developing long-term planning and/or short-term operational management strategies. In the literature, most studies to develop such strategies typically assume the availability of measured link traffic information on all network links, either through manual survey or advanced traffic sensor technologies. In practical applications, the assumption of installed sensors on all links is generally unrealistic due to budgetary constraints. It motivates the need to estimate flows on all links of a traffic network based on the measurement of link flows on a subset of links with suitably equipped sensors. This study, addressed from a budgetary planning perspective, seeks to identify the smallest subset of links in a network on which to locate sensors that enables the accurate estimation of traffic flows on all links of the network under steady-state conditions. Here, steady-state implies that the path flows are static. A “basis link” method is proposed to determine the locations of vehicle sensors, by using the link-path incidence matrix to express the network structure and then identifying its “basis” in a matrix algebra context. The theoretical background and mathematical properties of the proposed method are elaborated. The approach is useful for deploying long-term planning and link-based applications in traffic networks.     

Mining and correlating traffic events from human sensor observations with official transport data using self-organizing-maps

Cities are complex systems, where related Human activities are increasingly difficult to explore within. In order to understand urban processes and to gain deeper knowledge about cities, the potential of location-based social networks like Twitter could be used a promising example to explore latent relationships of underlying mobility patterns. In this paper, we therefore present an approach using a geographic self-organizing map (Geo-SOM) to uncover and compare previously unseen patterns from social media and authoritative data. The results, which we validated with Live Traffic Disruption (TIMS) feeds from Transport for London, show that the observed geospatial and temporal patterns between special events (r = 0.73), traffic incidents (r = 0.59) and hazard disruptions (r = 0.41) from TIMS, are strongly correlated with traffic-related, georeferenced tweets. Hence, we conclude that tweets can be used as a proxy indicator to detect collective mobility events and may help to provide stakeholders and decision makers with complementary information on complex mobility processes.     

A dynamic traffic assignment model for a continuum transportation system

A predictive continuum dynamic user-optimal (PDUO-C) model is formulated in this study to investigate the dynamic characteristics of traffic flow and the corresponding route-choice behavior of travelers within a region with a dense urban road network. The modeled region is arbitrary in shape with a single central business district (CBD) and travelers continuously distributed over the region. Within this region, the road network is represented as a continuum and travelers patronize a two-dimensional continuum transportation system to travel to the CBD. The PDUO-C model is solved by a promising solution algorithm that includes elements of the finite volume method (FVM), the finite element method (FEM), and the explicit total variation diminishing Runge-Kutta (TVD-RK) time-stepping method. A numerical example is given to demonstrate the utility of the proposed model and the effectiveness of the solution algorithm in solving this PDUO-C problem.     

Applying activity-travel data for the assessment of vehicle exhaust emissions: Application of a GPS-enhanced data collection tool

This paper describes the development of a global positioning system, enhanced data collection tool for the assessment of vehicle exhaust emissions. This involves the collection of activity and travel data on a personal digital assistant with built-in global positioning system receiver. By converting the second-by-second global positioning system based travel data into emissions, estimates are made of the exhausts produced by individual vehicle trips. Differences in travel behaviour and vehicle emissions were examined by gender and trip purpose.     

Development of a differential route share model for railroad freight traffic

This paper summarizes work undertaken towards development and calibration of a model to predict the distribution of rail freight traffic among competing routes. The model is designed for use in analyzing the traffic effects of changes in the level-of-service on selected rail lines. The model predicts route shares based on the overall network configuration of each railroad participating in a given market. The model selects feasible routes, discards those routes which appear to be too circuitous or costly, and then assigns traffic to the remaining routes in accordance with several network characteristics. It is designed to be sensitive to level-of-service changes, and to simulate the response of shippers and railroads to a competitive environment. A multiple route-finding algorithm was used to find possible routes based on the number of railroads operating at the originating and terminating end of a market. Multiple routes were determined and matched with observed traffic flows from the ICC One-Percent Waybill Sample. Physical network characteristics for each route, including distance, junction frequency, and “impedance,” were calculated from the network model and were correlated with the traffic share observed on each route in the market. A two-stage model was developed to find feasible routes from the set of possible routes and to allocate traffic to feasible routes based on levels-of-service. The model was calibrated on 9,793 routes from 1,199 markets with twenty or more carloads from the 1977 One-Percent Carload Waybill Sample. Model calibration supported the hypothesis that network route characteristics did indeed influence shipper choice of route, and that a normative model could be used to assess relative attractiveness of routes under various railroad corporate ownership restructuring scenarios.     

Coordination of last train transfers using automated fare collection (AFC) system data

This paper studies last train coordination problem for metro networks, aiming to maximize the total number of passengers who can reach their destinations by metro prior to the end of operation. The concept of last boarding time is defined as the latest time that passengers can board the last trains and reach final destinations. The corresponding method for calculating last boarding time is also put forward. With automatic fare collection system data, an optimization model for coordinating last trains is proposed. The objective function optimizes the number of passengers who can reach their final destinations during the train period using departure times and headways of last trains for each line as decision variables. Afterwards, an adaptive genetic algorithm is put forward to solve this model and is applied to a case study of the Shanghai metro system. Copyright © 2017 John Wiley & Sons, Ltd.     

A hierarchical control system for freeway traffic

A hierarchical control system consisting of three control layers is developed for the freeway traffic control problem. A simplified optimization problem for the overall freeway system is solved on-line in an optimization layer. Optimization results are used as reference values for an inferior decentralized direct control layer. Prediction of slowly varying variables like on-ramp demands and origin-destination rates as well as of particular model parameters are provided by a supremal adaption layer. The overall control structure is shown to be robust even in the case of strong unexpected disturbances like incidents.     

Development of a delay model for unsignalized intersections applicable to traffic assignment

Abstract

This paper develops a model for estimating unsignalized intersection delays which can be applied to traffic assignment (TA) models. Current unsignalized intersection delay models have been developed mostly for operational purposes, and demand detailed geometric data and complicated procedures to estimate delay. These difficulties result in unsignalized intersection delays being ignored or assumed as a constant in TA models.

Video and vehicle license plate number recognition methods are used to collect traffic volume data and to measure delays during peak and off-peak traffic periods at four unsignalized intersections in the city of Tehran, Iran. Data on geometric design elements are measured through field surveys. An empirical approach is used to develop a delay model as a function of influencing factors based on 5- and 15-min time intervals. The proposed model estimates delays on each approach based on total traffic volumes, rights-of-way of the subject approach and the intersection friction factor. The effect of conflicting traffic flows is considered implicitly by using the intersection friction factor. As a result, the developed delay model guarantees the convergence of TA solution methods.

A comparison between delay models performed using different time intervals shows that the coefficients of determination, R ², increases from 43.2% to 63.1% as the time interval increases from 5- to 15-min. The US Highway Capacity Manual (HCM) delay model (which is widely used in Iran) is validated using the field data and it is found that it overestimates delay, especially in the high delay ranges.     

An efficient realization of deep learning for traffic data imputation

Traffic data provide the basis for both research and applications in transportation control, management, and evaluation, but real-world traffic data collected from loop detectors or other sensors often contain corrupted or missing data points which need to be imputed for traffic analysis. For this end, here we propose a deep learning model named denoising stacked autoencoders for traffic data imputation. We tested and evaluated the model performance with consideration of both temporal and spatial factors. Through these experiments and evaluation results, we developed an algorithm for efficient realization of deep learning for traffic data imputation by training the model hierarchically using the full set of data from all vehicle detector stations. Using data provided by Caltrans PeMS, we have shown that the mean absolute error of the proposed realization is under 10 veh/5-min, a better performance compared with other popular models: the history model, ARIMA model and BP neural network model. We further investigated why the deep leaning model works well for traffic data imputation by visualizing the features extracted by the first hidden layer. Clearly, this work has demonstrated the effectiveness as well as efficiency of deep learning in the field of traffic data imputation and analysis.     

Real-time traffic estimation using data expansion

This paper presents a method for estimating missing real-time traffic volumes on a road network using both historical and real-time traffic data. The method was developed to address urban transportation networks where a non-negligible subset of the network links do not have real-time link volumes, and where that data is needed to populate other real-time traffic analytics. Computation is split between an offline calibration and a real-time estimation phase. The offline phase determines link-to-link splitting probabilities for traffic flow propagation that are subsequently used in real-time estimation. The real-time procedure uses current traffic data and is efficient enough to scale to full city-wide deployments. Simulation results on a medium-sized test network demonstrate the accuracy of the method and its robustness to missing data and variability in the data that is available. For traffic demands with a coefficient of variation as high as 40%, and a real-time feed in which as much as 60% of links lack data, we find the percentage root mean square error of link volume estimates ranges from 3.9% to 18.6%. We observe that the use of real-time data can reduce this error by as much as 20%.     

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.     

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.     

An expert system for air traffic flow management

An expert system for the air traffic flow management (ATFM) problem is presented. Two main prototypes have been constructed, one for timetable rescheduling that attempts to modify airline timetables to smooth traffic peaks at airports during rush-hours and another for centralized flow control that works to forecast the place, time and magnitude of the congestion and to propose mitigative actions. Simulations for the Brazilian ATFM, including the principal 14 airports, show the potential usefulness of the expert system.     

A block queueing system for slow moving traffic

A common cause of pollution and waste in urban areas is facilities which provide a continuous slow service for motor vehicles. As demand approaches supply, queues can develop and large numbers of engines can often be idling. Typical examples are car park entrances and drive through fast food outlets. This paper proposes a block queueing system to alleviate the problem without using excessive road space and with a minimum of extra infrastructure. The queue is divided into an active section at the front (with engines running) and a passive section at the rear (where drivers switch their engines off). Periodically, as the active queue becomes depleted, the passive queue is momentarily activated and a block of vehicles advances into the active queue. A visual cue can be provided to the drivers using a vehicle actuated traffic signal. It is readily apparent that drivers in the passive queue have to switch their engines on and off at regular intervals. Since this operation has an inherent cost in itself, this argues in favour of a large block size. However, large blocks mean more engines idling in the active queue. A compromise must be therefore reached for the likely range of queue lengths which the system under consideration exhibits. An expression is derived for the optimum block size in steady state conditions. It is shown that the potential benefits of the regime are considerable.