Derivation of delays based on improved macroscopic traffic models

Recent improved and rigorous mathematical models describing the formation and dissipation of queues at signalized intersections are employed for deriving delay and effective queue size. Analytical and numerical solutions are presented that are applicable for both isolated and coordinated intersections. Comparisons against results obtained from conventional models reveals significant differences. Further, it is demonstrated that the current practice of calculating delays from input-output analysis results in substantial overestimation of delays. Numerical examples supporting this finding are presented.     

Simplified transport models based on traffic counts

Having accepted the need for the development of simpler and less cumbersome transport demand models, the paper concentrates on one possible line for simplification: estimation of trip matrices from link volume counts. Traffic counts are particularly attractive as a data basis for modelling because of their availability, low cost and nondisruptive character. It is first established that in normal conditions it may be possible to find more than one trip matrix which, when loaded onto a network, reproduces the observed link volumes. The paper then identifies three approaches to reduce this underspecification problem and produce a unique trip matrix consistent with the counts. The first approach consists of assuming that trip-making behaviour can be explained by a gravity model whose parameters can be calibrated from the traffic counts. Several forms of this gravity model have been put forward and they are discussed in Section 3. The second approach uses mathematical programming techniques associated to equilibrium assignment problems to estimate a trip matrix in congested areas. This method can also be supplemented by a special distribution model developed for small areas. The third approach relies on entropy and information theory considerations to estimate the most likely trip matrix consistent with the observed flows. A particular feature of this group is that they can include prior, perhaps outdated, information about the matrix.These three approaches are then compared and their likely areas for application identified. Problems for further research are discussed and finally an assessment is made of the possible role of these models vis-a-vis recent developments in transport planning.     

Modal split models based on car availability: the application of such models in studies of medium sized towns

This paper discusses the need for a new approach to urban transportation modelling in recognition that at least in medium sized towns the choice of model is largely dominated by car availability.     

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.     

Some developments in equilibrium traffic assignment

A network optimization problem is formulated which yields a probabilistic equilibrated traffic assignment incorporating congestion effects and which as a special case, reduces to a user optimized equilibrium solution. In the resulting model, path choice is determined by a logit formula in which path costs are functions of the assigned flows. The article also demonstrates the similarity between some fixed demand incremental methods of traffic assignment and the minimization problem associated with computing the user equilibrium assignment.     

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.     

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.     

Vehicle scheduling for on-demand vehicle fleets in macroscopic travel demand models

Transportation - The planning of on-demand services requires the formation of vehicle schedules consisting of service trips and empty trips. This paper presents an algorithm for building vehicle...     

Spillback congestion in dynamic traffic assignment: A macroscopic flow model with time-varying bottlenecks

In this paper, we propose a new model for the within-day Dynamic Traffic Assignment (DTA) on road networks where the simulation of queue spillovers is explicitly addressed, and a user equilibrium is expressed as a fixed-point problem in terms of arc flow temporal profiles, i.e., in the infinite dimension space of time’s functions. The model integrates spillback congestion into an existing formulation of the DTA based on continuous-time variables and implicit path enumeration, which is capable of explicitly representing the formation and dispersion of vehicle queues on road links, but allows them to exceed the arc length. The propagation of congestion among adjacent arcs will be achieved through the introduction of time-varying exit and entry capacities that limit the inflow on downstream arcs in such a way that their storage capacities are never exceeded. Determining the temporal profile of these capacity constraints requires solving a system of spatially non-separable macroscopic flow models on the supply side of the DTA based on the theory of kinematic waves, which describe the dynamic of the spillback phenomenon and yield consistent network performances for given arc flows. We also devise a numerical solution algorithm of the proposed continuous-time formulation allowing for “long time intervals” of several minutes, and give an empirical evidence of its convergence. Finally, we carry out a thorough experimentation in order to estimate the relevance of spillback modeling in the context of the DTA, compare the proposed model in terms of effectiveness with the Cell Transmission Model, and assess the efficiency of the proposed algorithm and its applicability to real instances with large networks.     

Short‐term travel speed prediction models in car navigation systems

The objective of this study is the development of the short‐term prediction models to predict average spot speeds of the subject location in the short‐term periods of 5, 10 and 15 minutes respectively. In this study, field data were used to see the comparison of the predictability of Regression Analysis, ARIMA, Kalman Filtering and Neural Network models. These field data were collected from image processing detectors at the urban expressway for 17 hours including both peak and non‐peak hours. Most of the results were reliable, but the results of models using Kalman Filtering and Neural Networks are more accurate and realistic than those of the others.     

An empirical study on aggregation of alternatives and its influence on prediction in car type choice models

Transportation - Assessing and predicting car type choices are important for policy analysis. Car type choice models are often based on aggregate alternatives. This is due to the fact that analysts...     

基于3DSMAX的交通事故演示程序

利用3DSMAX创建交通事故中所用的三维模型,再现事故发生的场景,把模型导入VC++的窗口程序中来显示,调用OpenGL库函数来控制模型运动,实现交通事故三维再现。     

Control of traffic in residential neighborhoods: Some considerations for implementation

The effect of motor vehicles upon older neighborhoods has received increasing attention as residents of these areas seek to preserve the quality of life in their neighborhoods. In order to reduce through traffic in residential neighborhoods, numerous techniques have been developed, ranging from turn prohibitions to physical barriers. Since these measures have negative impacts on previous users of the streets, there has been substantial opposition to them. This paper reviews the major areas of conflict as revealed through court challenges.Nine court cases were identified by the researchers. In four, the court decision supported the control measures; in five, the courts decided against the actions. Six of the nine cases are reviewed in this paper. Major legal issues which are identified include the appropriate use of municipal police power, reasonableness in the exercise of police power, the integration of control measures into an overall transportation plan, appropriate consideration of emergency vehicle needs and the rights of access to property, and public participation in the decision. The authors conclude that properly planned and executed diversion strategies can be implemented and can withstand challenges by negatively affected parties.The opinions, findings, and conclusions expressed or implied in this paper are those of the authors only. They are not necessarily those of the Federal Highway Administration.     

A marginal utility day-to-day traffic evolution model based on one-step strategic thinking

Most deterministic day-to-day traffic evolution models, either in continuous-time or discrete-time space, have been formulated based on a fundamental assumption on driver route choice rationality where a driver seeks to maximize her/his marginal benefit defined as the difference between the perceived route costs. The notion of rationality entails the exploration of the marginal decision rule from economic theory, which states that a rational individual evaluates his/her marginal utility, defined as the difference between the marginal benefit and the marginal cost, of each incremental decision. Seeking to analyze the marginal decision rule in the modeling of deterministic day-to-day traffic evolution, this paper proposes a modeling framework which introduces a term to capture the marginal cost to the driver induced by route switching. The proposed framework enables to capture both benefit and cost associated with route changes. The marginal cost is then formulated upon the assumption that drivers are able to predict other drivers’ responses to the current traffic conditions, which is adopted based on the notion of strategic thinking of rational players developed in behavior game theory. The marginal cost based on 1-step strategic thinking also describes the “shadow price” of shifting routes, which helps to explain the behavioral tendency of the driver perceiving the cost-sensitivity to link/route flows. After developing a formulation of the marginal utility day-to-day model, its theoretical properties are analyzed, including the invariance property, asymptotic stability, and relationship with the rational behavioral adjustment process.     

A new approach to time-of-day control based on a dynamic freeway traffic model

This paper presents a new approach to time-of-day control. While time-of-day control strategies presented up-to-now are only optimal under steady-state conditions, the control algorithm derived in this paper takes into account the evolution of traffic flow according to the time delay between a volume change at a ramp and its subsequent disturbance at a freeway point downstream. The new control strategy is based on the solution of a linear programming optimization problem and makes freeway volume hold the capacity constraints for the total time of control operation. In order to reduce the computational effort a simplified version of the new algorithm is also discussed. Simulation results obtained by use of two different traffic flow models show that control derived through the new algorithm can avoid congestion and ensure operation with peak performance even if a steady-state condition is never attained.     

A traffic accident morphology diagnostic model based on a rough set decision tree

ABSTRACT

To build a traffic safety feature model and to quantify accident influences caused by some traffic violation behaviors of drivers, an accident diagnostic decision-making model is established. For the purpose of diagnosing accident morphologies, rough set theory is applied and the influence of traffic factors of different accident morphologies is quantified through calculating the degree of attribute importance, selecting core traffic factors and adopting a C4.5 decision tree algorithm. In the paper, road traffic accident data from 2008 to 2013 in Anhui Province are used. Typical rules are selected, targeted strategy proposals are put forward, and then, a scientific and reasonable diagnostic basis is provided for the diagnosis of traffic safety risks and the prediction of potential traffic accidents.     

An integrated framework for embedding large-scale dynamic traffic assignment models in advanced traveler information systems

In recent years, increasing attention has been drawn to the development of various applications of intelligent transportation systems (ITS), which are credited with the amelioration of traffic conditions in urban and regional environments. Advanced traveler information systems (ATIS) constitute an important element of ITS by providing potential travelers with information on the network's current performance both en-route and pre-trip. In order to tackle the complexity of such systems, derived from the difficulty of providing real-time estimations of current as well as forecasts of future traffic conditions, a series of models and algorithms have been initiated. This paper proposes the development of an integrated framework for real-time ATIS and presents its application on a large-scale network, that of Thessaloniki, Greece, concluding with a discussion on development and implementation challenges as well as on the advantages and limitations of such an effort.     

Lane changing intention recognition based on speech recognition models

Poor driving habits such as not using turn signals when changing lanes present a major challenge to advanced driver assistance systems that rely on turn signals. To address this problem, we propose a novel algorithm combining the hidden Markov model (HMM) and Bayesian filtering (BF) techniques to recognize a driver’s lane changing intention. In the HMM component, the grammar definition is inspired by speech recognition models, and the output is a preliminary behavior classification. As for the BF component, the final behavior classification is produced based on the current and preceding outputs of the HMMs. A naturalistic data set is used to train and validate the proposed algorithm. The results reveal that the proposed HMM–BF framework can achieve a recognition accuracy of 93.5% and 90.3% for right and left lane changing, respectively, which is a significant improvement compared with the HMM-only algorithm. The recognition time results show that the proposed algorithm can recognize a behavior correctly at an early stage.