Simulation studies of information propagation in a self-organizing distributed traffic information system

This paper investigates the feasibility of a self-organizing, completely distributed traffic information system based upon vehicle-to-vehicle communication technologies. Unlike centralized traffic information systems, the proposed system does not need public infrastructure investment as a prerequisite for implementation. Due to the complexity of the proposed system, simulation is selected as the primary approach in the feasibility studies. A simulation framework is built based on an existing microscopic traffic simulation model for the simulation studies. The critical questions for building the proposed market-driven system are examined both from communication requirements and traffic engineering points of view. Traffic information propagation both in freeway and arterial networks via information exchange among IVC-equipped vehicles is tested within the simulation framework. Results on the probability of successful IVC and traffic information propagation distance obtained from the simulation studies are generated and analyzed under incident-free and incident conditions for various roadway formats and parameter combinations. Comparisons between the speed of the incident information wave and the speed of the corresponding traffic shock wave due to the incident are analyzed for different scenarios as the most crucial aspect of the information propagation as a potential foundation for application in such a decentralized traffic information system.     

Vehicle headway modeling and its inferences in macroscopic/microscopic traffic flow theory: A survey

Vehicle headway distribution models are widely used in traffic engineering fields, since they reflect the fundamental uncertainty in drivers' car-following maneuvers and meanwhile provide a concise way to describe the stochastic feature of traffic flows. This paper presents a systematic review of vehicle headway distribution studies in the last few decades. Since it is impossible to enumerate the merits and drawbacks of all of existing distribution models, we emphasize four advances of headway distribution modeling in this paper. First, we highlight the chronicle of key assumptions on the existing distribution models and explain why this evolution occurs. Second, we show that departure headways measured for interrupted flows on urban streets and headways measured for uninterrupted flows on freeways have common features and can be simulated by a unified microscopic car-following model. The interesting finding helps gather two kinds of headway distribution models under one umbrella. Third, we review different approaches that aim to link microscopic car-following models and mesoscopic vehicle headway distribution models. Fourth, we show that both the point scattering on the density-flow plot and the shape of traffic flow breakdown curve implicitly depend on the vehicular headway distribution. These findings reveal pervasive connections between macroscopic traffic flow models and mesoscopic headway distribution. All these new insights bring new vigor into vehicle headway studies and open research frontiers in this field.     

A flexible traffic stream model and its three representations of traffic flow

To connect microscopic driving behaviors with the macro-correspondence (i.e., the fundamental diagram), this study proposes a flexible traffic stream model, which is derived from a novel car-following model under steady-state conditions. Its four driving behavior-related parameters, i.e., reaction time, calmness parameter, speed- and spacing-related sensitivities, have an apparent effect in shaping the fundamental diagram. Its boundary conditions and homogenous case are also analyzed in detail and compared with other two models (i.e., Longitudinal Control Model and Intelligent Driver Model). Especially, these model formulations and properties under Lagrangian coordinates provide a new perspective to revisit the traffic flow and complement with those under Eulerian coordinate. One calibration methodology that incorporates the monkey algorithm with dynamic adaptation is employed to calibrate this model, based on real-field data from a wide range of locations. Results show that this model exhibits the well flexibility to fit these traffic data and performs better than other nine models. Finally, a concrete example of transportation application is designed, in which the impact of three critical parameters on vehicle trajectories and shock waves with three representations (i.e., respectively defined in x-t, n-t and x-n coordinates) is tested, and macro- and micro-solutions on shock waves well agree with each other. In summary, this traffic stream model with the advantages of flexibility and efficiency has the good potential in level of service analysis and transportation planning.     

Neural network modeling of vehicle discharge headway at signalized intersection: model descriptions and results

Vehicle discharge headway at signalized intersections is of great importance in junction analysis. However, it is very difficult to simulate the discharge headway of individual queued vehicle because of the great variations in the driver behaviors, vehicle characteristics and traffic environment. The current study proposes a neural network (NN) approach to simulate the queued vehicle discharge headway. A computer-based three-layered (NN) model was developed for the estimation of discharge headway. The widely used backpropagation algorithm has been utilized in training the NN model. The NN model was trained, validated with field data and then compared with other headway models. It was found that the NN model performed better. Model sensitivity analysis was conducted to further validate the applicability of the model. Results showed that the NN model could produce reasonable discharge headway estimates for individual vehicles.     

A note on a graphical interpretation of wave and shockwave velocities of a traffic stream

This note gives simple equations for wave and shockwave velocities, using a graphical interpretation of speed-intercepts on the speed-concentration and speed-flow curves.     

Modeling and simulation of vehicle projection arrival–discharge process in adaptive traffic signal controls

Real‐time signal control operates as a function of the vehicular arrival and discharge process to satisfy a pre‐specified operational performance. This process is often predicted based on loop detectors placed upstream of the signal. In our newly developed signal control for diamond interchanges, a microscopic model is proposed to estimate traffic flows at the stop‐line. The model considers the traffic dynamics of vehicular detection, arrivals, and departures, by taking into account varying speeds, length of queues, and signal control. As the signal control is optimized over a rolling horizon that is divided into intervals, the vehicular detection for and projection into the corresponding horizon intervals are also modeled. The signal control algorithm is based on dynamic programming and the optimization of signal policy is performed using a certain performance measure involving delays, queue lengths, and queue storage ratios. The arrival–discharge model is embedded in the optimization algorithm and both are programmed into AIMSUN, a microscopic stochastic simulation program. AIMSUN is then used to simulate the traffic flow and implement the optimal signal control by accessing internal data including detected traffic demand and vehicle speeds. Sensitivity analysis is conducted to study the effect of selecting different optimization criteria on the signal control performance. It is concluded that the queue length and queue storage ratio are the most appropriate performance measures in real‐time signal control of interchanges. Copyright © 2010 John Wiley & Sons, Ltd.     

On dynamics of traffic queues in a road network with route choice based on real time traffic information

Introducing real time traffic information into transportation network makes it necessary to consider development of queues and traffic flows as a dynamic process. This paper initiates a theoretical study of conditions under which this process is stable. A model is presented that describes within-one-day development of queues when drivers affected by real-time traffic information choose their paths en route. The model is reduced to a system of differential equations with delay. Equilibrium points of the system correspond to constant queue lengths. Stability of the system is investigated using characteristic values of the linearised minimal face flow. A traffic network example illustrating the method is provided.     

The marginal social cost of headway for a scheduled service

This brief paper derives the marginal social cost of headway for a scheduled service, i.e. the cost for users of marginal increases to the time interval between departures. In brief we may call it the value of headway in analogy with the value of travel time and the value of reliability. Users have waiting time costs as well as schedule delay costs measured relative to their desired time of arrival at the destination. They may either arrive at the station to choose just the next departure or they may plan for a specific departure in which case they incur also a planning cost. Then planning for a specific departure is costly but becomes more attractive at longer headways. Simple expressions for the user cost result. In particular, the marginal cost of headway is large at short headways and smaller at long headways. The difference in marginal costs is the value of time multiplied by half the headway.     

RFID车辆信息管理框架研究

随着智能交通和计算机技术的发展,RFID技术越来越广泛地应用在交通系统中。然而这些系统多采用集中方式进行管理,不利用车辆数量扩展和RFID技术的大规模应用。并且各系统之间兼容性较差,难以实现信息共享。对RFID车辆信息管理框架进行了研究,以EPC和ONS为基础,提出了一种适合车辆信息管理的分布式框架及相应查询机制,并对其进行了分析。     

Investigating the impact of stochastic vehicle arrivals to optimal stop spacing and headway for a feeder bus route

Stop spacing and service frequency (i.e., the inverse of headway) are key elements in transit service planning. The trade‐offs between increasing accessibility and reducing travel time, which affect transit system performance, need to be carefully evaluated. The objective of this study is to optimize stop spacing and headway for a feeder bus route, considering the relationship between the variance of inter‐arrival time (VIAT), which yields the minimum total cost (including user and operator costs). A solution algorithm, called successive substitution, is adapted to efficiently search for the optimal solutions. In a numerical example, the developed model is applied to planning a feeder bus route in Newark, New Jersey. The results indicate that the optimal stop spacing should be longer that those suggested by previous studies where the impact of VIAT was ignored. Reducing VIAT via certain operational control strategies (i.e., holding/stop‐skipping, transit signal priority) may shorten stop spacing and improve accessibility. Copyright © 2014 John Wiley & Sons, Ltd.     

The dynamics of traffic assignment and traffic control: A theoretical study

The paper considers traffic assignment, with traffic controls, in an increasingly dynamic way. First, a natural way of introducing the responsive policy, P_o, into steady state traffic assignment is presented. Then it is shown that natural stability results follow within a dynamical version of this static equilibrium model (still with a constant demand). We are able to obtain similar stability results when queues are explicitly allowed for, provided demand is constant. Finally we allow demand to vary with time; we consider the dynamic assignment problem with signal-settings now fixed. Here we assume that vehicles are very short and that deterministic queueing theory applies, and show that the time-dependent queueing delay at the bottleneck at the end of a link is a monotone function of the time-dependent input profile to the bottleneck. We have been unable to obtain results when dynamic demand and responsive signal control are combined.     

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.     

Incorporating an information acquisition process into a route choice model with multiple information sources

This study aims at analyzing drivers' behavior in acquiring and using traffic information in an environment with multiple information sources. Accordingly, information acquisition and reference models are developed in an effort to show the empirical relationship between drivers' reaction to multiple information sources, causal factors latent psychological ones, traffic conditions at the time of traveling and the accuracy of traffic information available. A route choice model is proposed that takes into account the information acquisition and reference process. Model validity is investigated using data collected on the Tokyo Metropolitan Expressway, which has four different types of information sources.     

Extracting accurate location information from a highly inaccurate traffic accident dataset: A methodology based on a string matching technique

The objective of this research was to develop a model for validating traffic accident locations that would be applicable worldwide, regardless of linguistic or cultural differences. In order to achieve this, a Volunteered Geographic Information (VGI) dataset was used, the OpenStreetMap (OSM) project. To test the developed model, a total of 8550 accidents with fatal or non-fatal injuries that occurred in the City of Zagreb from 2010 to 2014 were evaluated. Traffic accident data was collected using the pen-and-paper method while the traffic accident locations were determined using Global Positioning System (GPS) receivers embedded within police vehicles. This form of data entry invariably introduces errors in both geometric and contextual attributes. To fully counteract these errors, the developed model consists of two key concepts: the Jaro–Winkler string matching technique and the Inverse Distance Weighting method. Over 66% of traffic accident locations were validated, which is an increase of 15% when compared to the classical approach. The model outlined in this paper shows a significant improvement in estimating the correct location of traffic accidents. This in turn results in a drastic decrease in resources needed to estimate the quality of accident locations.     

A linear programming formulation for autonomous intersection control within a dynamic traffic assignment and connected vehicle environment

This paper develops a novel linear programming formulation for autonomous intersection control (LPAIC) accounting for traffic dynamics within a connected vehicle environment. Firstly, a lane based bi-level optimization model is introduced to propagate traffic flows in the network, accounting for dynamic departure time, dynamic route choice, and autonomous intersection control in the context of system optimum network model. Then the bi-level optimization model is transformed to the linear programming formulation by relaxing the nonlinear constraints with a set of linear inequalities. One special feature of the LPAIC formulation is that the entries of the constraint matrix has only {−1, 0, 1} values. Moreover, it is proved that the constraint matrix is totally unimodular, the optimal solution exists and contains only integer values. It is also shown that the traffic flows from different lanes pass through the conflict points of the intersection safely and there are no holding flows in the solution. Three numerical case studies are conducted to demonstrate the properties and effectiveness of the LPAIC formulation to solve autonomous intersection control.     

Real-time identification of probe vehicle trajectories in the mixed traffic corridor

This paper proposes three enhanced semi-supervised clustering algorithms, namely the Constrained-K-Means (CKM), the Seeded-K-Means (SKM), and the Semi-Supervised Fuzzy c-Means (SFCM), to identify probe vehicle trajectories in the mixed traffic corridor. The proposed algorithms are able to take advantage of the strengthens of topological relation judgment and the semi-supervised learning technique by optimizing the selection of pre-labeling samples and initial clustering centers of the original semi-supervised learning technique based on horizontal Global Positioning System data. The proposed algorithms were validated and evaluated based on the probe vehicle data collected at two mixed corridors on Shanghai’s urban expressways. Results indicate that the enhanced SFCM algorithm could achieve the best performance in terms of clustering purity and Normalized Mutual Information, followed by the CKM algorithm and the SKM algorithm. It may reach a nearly 100% clustering purity for the uncongested conditions and a clustering purity greater than 80% for the congested conditions. Meanwhile, it could improve clustering purity averagely by 21% and 14% for the congested conditions and 6.5% and 6% for the uncongested conditions, as compared with the traditional K-Means algorithm and the basic SFCM. The proposed algorithms can be applied for both on-line and off-line purposes, without the need of historical data. Clustering accuracies under different traffic conditions and possible improvements with the use of historical data are also discussed.     

The future for in‐vehicle information systems: The technology and its impacts

In‐vehicle information has an important social role to play in improving the efficiency and safety of travel by all modes. In this review, three generations of system are identified. The first generation consists of simple in‐vehicle units relying heavily on external data. The second generation has more sophisticated in‐vehicle units with colour TFT screens and DVD players for maps and entertainment. The third generation again makes use of external data, using the mobile phone network to download map sections and other data as and when required, thereby obviating the need for beacons and map CDs. For locationing, GPS (and/or Galileo, the European version of GPS) remains the favoured technology. Portable devices offering multi‐modal information could improve inter‐modal transport efficiency.     

Numerical simulation of transient bulk queues with general vehicle dispatching strategies

Relatively simple iterative procedures are developed for simulating the queue length distribution for transient bulk arrival, bulk service queues. The method allows the study of holding strategies where the length of time a vehicle is held can depend on both the length ofthe queue and how long the vehicle has been held. The system is modeled in discrete time, and a series of numerical experiments are presented that examine the errors introduced by this discretization.     

Effect of providing traffic information estimated by a stochastic network equilibrium model with stochastic demand

To estimate travel times through road networks, in this study, we assume a stochastic demand and formulate a stochastic network equilibrium model whose travel times, flows, and demands are stochastic. This model enables us to examine network reliability under stochastic circumstances and to evaluate the effect of providing traffic information on travel times. For traffic information, we focus on travel time information and propose methods to evaluate the effect of providing that information. To examine the feasibility and validity of the proposed model and methods, we apply them to a simple network and the real road network of Kanazawa, Japan. The results indicate that providing ambulance drivers in Kanazawa with travel time information leads to an average reduction in travel time of approximately three minutes.