An intersection control strategy for a short‐headway P.R.T. network

Much PRT development and research is currently being undertaken assuming quasi‐synchronous longitudinal control of guideway vehicles. This method of control has the characteristic that intersection performance has a substantial influence on the efficiency of trip demand processing. An algorithm for the control of a PRT intersection is discussed here, which would appear to have significant advantages over all other known existing stratagems. The stratagem is not only efficient but its flexibility facilitates tailoring to diverse local conditions; furthermore, the algorithm does not require intractable computations or excessive computer memory requirements. The algorithm is described and simulation results are presented. A comparative study is also made between this algorithm and its fore‐runner.     

A real time forecasting tool for dynamic travel time from clustered time series

This paper addresses the problem of dynamic travel time (DTT) forecasting within highway traffic networks using speed measurements. Definitions, computational details and properties in the construction of DTT are provided. DTT is dynamically clustered using a K-means algorithm and then information on the level and the trend of the centroid of the clusters is used to devise a predictor computationally simple to be implemented. To take into account the lack of information in the cluster assignment for the new predicted values, a weighted average fusion based on a similarity measurement is proposed to combine the predictions of each model. The algorithm is deployed in a real time application and the performance is evaluated using real traffic data from the South Ring of the Grenoble city in France.     

Short‐term travel time forecasts for transport information system in hong kong

In this paper, a case study is carried out in Hong Kong for demonstration of the Transport Information System (TIS) prototype. A traffic flow simulator (TFS) is presented to forecast the short‐term travel times that can be served as a predicted travel time database for the TIS in Hong Kong. In the TFS, a stochastic deviation coefficient is incorporated to simulate the minute‐by‐minute fluctuation of traffic flows within the peak hour period. The purposes of the case study are: 1) to show the applicability of the TFS for larger‐scale road network; and 2) to illustrate the short‐term forecasting of path travel times in practice. The results of the case study show that the TFS can be applied to real network effectively. The predicted travel times are compared with the observed travel times on the selected paths for an OD pair. The results show that the observed path travel times fall in the 90% confidence interval of the predicted path travel times.     

Real-time freeway traffic state estimation based on extended Kalman filter: Adaptive capabilities and real data testing

This paper reports on real data testing of a real-time freeway traffic state estimator, with a particular focus on its adaptive capabilities. The pursued general approach to the real-time adaptive estimation of complete traffic state in freeway stretches or networks is based on stochastic macroscopic traffic flow modeling and extended Kalman filtering. One major innovative feature of the traffic state estimator is the online joint estimation of important model parameters (free speed, critical density, and capacity) and traffic flow variables (flows, mean speeds, and densities), which leads to three significant advantages of the estimator: (1) avoidance of prior model calibration; (2) automatic adaptation to changing external conditions (e.g. weather and lighting conditions, traffic composition, control measures); (3) enabling of incident alarms. These three advantages are demonstrated via suitable real data testing. The achieved testing results are satisfactory and promising for subsequent applications.     

Heterogeneous traffic flow modelling for an arterial using grid based approach

A grid based modelling approach akin to cellular automata (CA) is adopted for heterogeneous traffic flow simulation. The road space is divided into a grid of equally sized cells. Moreover, each vehicle type occupies one or more cell as per its size unlike CA traffic flow model where each vehicle is represented by a single cell. Model needs inputs such as vehicle size, its maximum speed, acceleration, deceleration, probability constants, and arrival pattern. The position and speed of the vehicles are assumed to be discrete. The speed of each vehicle changes according to its interactions with other vehicles, following some stochastic rules depending on the circumstances. The model is calibrated and validated using real data and VISSIM. The results indicate that grid based model can reasonably well simulate complex heterogeneous traffic as well as offers higher computational efficiency needed for real time application.     

An alternative model in traffic flow equations

The kinetic theory for traffic flow equations can be approached using the Grad’s method. This method, which is derived from the kinetic gas theory, was developed for the Paveri-Fontana equation when a special desired velocity model is assumed. A closure relation for the set of macroscopic equations is found when the density, the average velocity and the velocity variance are the relevant variables chosen to describe the system. Simulation results are also shown and a qualitative comparison with other models in the literature is presented.     

Short-term traffic flow rate forecasting based on identifying similar traffic patterns

The ability to timely and accurately forecast the evolution of traffic is very important in traffic management and control applications. This paper proposes a non-parametric and data-driven methodology for short-term traffic forecasting based on identifying similar traffic patterns using an enhanced K-nearest neighbor (K-NN) algorithm. Weighted Euclidean distance, which gives more weight to recent measurements, is used as a similarity measure for K-NN. Moreover, winsorization of the neighbors is implemented to dampen the effects of dominant candidates, and rank exponent is used to aggregate the candidate values. Robustness of the proposed method is demonstrated by implementing it on large datasets collected from different regions and by comparing it with advanced time series models, such as SARIMA and adaptive Kalman Filter models proposed by others. It is demonstrated that the proposed method reduces the mean absolute percent error by more than 25%. In addition, the effectiveness of the proposed enhanced K-NN algorithm is evaluated for multiple forecast steps and also its performance is tested under data with missing values. This research provides strong evidence suggesting that the proposed non-parametric and data-driven approach for short-term traffic forecasting provides promising results. Given the simplicity, accuracy, and robustness of the proposed approach, it can be easily incorporated with real-time traffic control for proactive freeway traffic management.     

A novel forecasting approach inspired by human memory: The example of short-term traffic volume forecasting

Short-term traffic volume forecasting represents a critical need for Intelligent Transportation Systems. This paper develops a novel forecasting approach inspired by human memory, called the spinning network (SPN). The approach is then used for short-term traffic volume forecasting, utilizing a data set compiled from real-world traffic volume data obtained from the Hampton Roads traffic operations center in Virginia. To assess the accuracy of the SPN approach, its performance is compared to two other approaches, namely a back propagation neural network and a nearest neighbor approach. The transferability of the SPN approach and its ability to forecast for longer time periods into the future is also assessed. The results of the performance testing conducted in this paper demonstrates the superior predictive accuracy and drastically lower computational requirements of the SPN compared to either the neural network or the nearest neighbor approach. The tests also confirm the ability of the SPN to predict traffic volumes for longer time periods into the future, as well as the transferability of the approach to other sites.     

The effect of the London congestion charge on road casualties: an intervention analysis

The introduction of the congestion charge in central London on the 17th of February, 2003, led to a reduction in congestion. One factor that has not been fully analysed is the impact of the congestion charge on traffic casualties in London. Less car travel within the charging zone may result in fewer traffic collisions, however, as the number of pedestrians, cyclists, and motorcyclists increased after the introduction of the congestion charge, the number of traffic casualties associated with these groups may also have increased. Reductions in congestion can also lead to faster speeds. Therefore, there could be increases in injury severity for those crashes that do occur. An intervention analysis was conducted to investigate the effect of the congestion charge on traffic casualties for motorists, pedestrians, cyclists, and motorcyclists, both within the charging zone and in areas of London outside the zone. This was done for killed and serious injuries (known as KSI in British terminology) and for slight injuries to examine whether there were any shifts in severity outcomes. Our results suggest no statistically significant effect for total casualties in London, but within the charging zone there has been a statistically significant drop in motorist casualties, and possibly an increase in cyclist casualties. There is an associated effect of an increase in casualties of motorcyclists and cyclists in some areas outside the charging zone, suggesting that changes in the design of the congestion charge may be needed to achieve reductions in casualties.

Validation of traffic flow models with respect to the spatiotemporal evolution of congested traffic patterns

We propose a quantitative approach for calibrating and validating key features of traffic instabilities based on speed time series obtained from aggregated data of a series of neighboring stationary detectors. The approach can be used to validate models that are calibrated by other criteria with respect to their collective dynamics. We apply the proposed criteria to historic traffic databases of several freeways in Germany containing about 400 occurrences of congestions thereby providing a reference for model calibration and quality assessment with respect to the spatiotemporal dynamics. First tests with microscopic and macroscopic models indicate that the criteria are both robust and discriminative, i.e., clearly distinguishes between models of higher and lower predictive power.     

Statistical characteristics of transitional queue conditions in signalized arterials

The performance of signalized arterials is related to queuing phenomena. The paper investigates the effect of transitional traffic flow conditions imposed by the formation and dissipation of queues. A cross-recurrence quantification analysis combined with Bayesian augmented networks are implemented to reveal the prevailing statistical characteristics of the short-term traffic flow patterns under the effect of transitional queue conditions. Results indicate that transitions between free-flow conditions, critical queue conditions that exceed the detector’s length, as well as the occurrence of spillovers impose a set of prevailing traffic flow patterns with different statistical characteristics with respect to determinism, nonlinearity, non-stationarity and laminarity. The complexity in critical queue conditions is further investigated by introducing two supplementary regions in the critical area before spillover occurrence. Results indicate that the supplementary information on the transitional conditions in the critical area increases the accuracy of the predictive relations between the statistical characteristics of traffic flow evolution and the occurrence of transitions.