Hybridization of a class of "second order" models of traffic flow

Despite the simultaneous progress of traffic modelling both on the macroscopic and microscopic front, recent works [E. Bourrel, J.B. Lessort, Mixing micro and macro representation of traffic flow: a hybrid model based on the LWR theory, Transport. Res. Rec. 1852 (2003) 193–200; D. Helbing, M. Treiber, Critical discussion of “synchronized flow”, Coop. Transport. Dyn. 1 (2002) 2.1–2.24; A. Hennecke, M. Treiber, D. Helbing, Macroscopic simulations of open systems and micro–macro link, in: D. Helbing, H.J. Herrmann, M. Schreckenberg, D.E. Wolf (Eds.), Traffic and Granular Flow ’99, Springer, Berlin, 2000, pp. 383–388] highlighted that one of the most promising way to simulate efficiently traffic flow on large road networks is a clever combination of both traffic representations: the hybrid modelling. Our focus in this paper is to propose two hybrid models for which the macroscopic (resp. mesoscopic) part is based on a class of second order model [A. Aw, M. Rascle, Resurection of second order models of traffic flow?, SIAM J. Appl. Math. 60 (2000) 916–938] whereas the microscopic part is a Follow-the Leader type model [D.C. Gazis, R. Herman, R.W. Rothery, Nonlinear follow-the-leader models of traffic flow, Oper. Res. 9 (1961) 545–567; R. Herman, I. Prigogine, Kinetic Theory of Vehicular Traffic, American Elsevier, New York, 1971]. For the first hybrid model, we define precisely the translation of boundary conditions at interfaces and for the second one we explain the synchronization processes. Furthermore, through some numerical simulations we show that the waves propagation is not disturbed and the mass is accurately conserved when passing from one traffic representation to another.

Modelling road traffic accidents using macroscopic second-order models of traffic flow

In this paper, we introduce a macroscopic model for road traffic accidents along highway sections. We discuss the motivation and the derivation of such a model, and we present its mathematical properties. The results are presented by means of examples where a section of a crowded one-way highway contains in the middle a cluster of drivers whose dynamics are prone to road traffic accidents. We discuss the coupling conditions and present some existence results of weak solutions to the associated Riemann Problems. Furthermore, we illustrate some features of the proposed model through some numerical simulations. © The authors 2012.

A Lagrangian approach for modeling road collisions using second-order models of traffic flow

In [M. Herty, A. Klein, S. Moutari, V. Schleper, and G. Steinaur, IMA J. Appl. Math., 78(5), 1087–1108, 2013] and [M. Herty and V. Schleper, ZAMM J. Appl. Math. Mech., 91, 763–776, 2011], a macroscopic approach, derived from fluid-dynamics models, has been introduced to infer traffic conditions prone to road traffic collisions along highways’ sections. In these studies, the governing equations are coupled within an Eulerian framework, which assumes fixed interfaces between the models. A coupling in Lagrangian coordinates would enable us to get rid of this (not very realistic) assumption. In this paper, we investigate the well-posedness and the suitability of the coupling of the governing equations within the Lagrangian framework. Further, we illustrate some features of the proposed approach through some numerical simulations.

Shocks in unmagnetized plasma with a shear flow: Stability and magnetic field generation

A pair of curved shocks in a collisionless plasma is examined with a two-dimensional particle-in-cell simulation. The shocks are created by the collision of two electron-ion clouds at a speed that exceeds everywhere the threshold speed for shock formation. A variation of the collision speed along the initially planar collision boundary, which is comparable to the ion acoustic speed, yields a curvature of the shock that increases with time. The spatially varying Mach number of the shocks results in a variation of the downstream density in the direction along the shock boundary. This variation is eventually equilibrated by the thermal diffusion of ions. The pair of shocks is stable for tens of inverse ion plasma frequencies. The angle between the mean flow velocity vector of the inflowing upstream plasma and the shock's electrostatic field increases steadily during this time. The disalignment of both vectors gives rise to a rotational electron flow, which yields the growth of magnetic field patches that are coherent over tens of electron skin depths.

Traffic flow breakdown prediction using feature reduction through Rough-Neuro fuzzy Networks

The prediction of the traffic behavior could help to make decision about the routing process, as well as enables gains on effectiveness and productivity on the physical distribution. This need motivated the search for technological improvements in the Routing performance in metropolitan areas. The purpose of this paper is to present computational evidences that Artificial Neural Network ANN could be use to predict the traffic behavior in a metropolitan area such So Paulo (around 16 million inhabitants). The proposed methodology involves the application of Rough-Fuzzy Sets to define inference morphology for insertion of the behavior of Dynamic Routing into a structured rule basis, without human expert aid. The dynamics of the traffic parameters are described through membership functions. Rough Sets Theory identifies the attributes that are important, and suggest Fuzzy relations to be inserted on a Rough Neuro Fuzzy Network (RNFN) type Multilayer Perceptron (MLP) and type Radial Basis Function (RBF), in order to get an optimal surface response. To measure the performance of the proposed RNFN, the responses of the unreduced rule basis are compared with the reduced rule one. The results show that by making use of the Feature Reduction through RNFN, it is possible to reduce the need for human expert in the construction of the Fuzzy inference mechanism in such flow process like traffic breakdown. © 2011 IEEE.

Optimizing urban traffic flow using genetic algorithm with petri net analysis as fitness function

This paper describes a new methodology adopted for urban traffic stream optimization. By using Petri net analysis as fitness function of a Genetic Algorithm, an entire urban road network is controlled in real time. With the advent of new technologies that have been published, particularly focusing on communications among vehicles and roads infrastructures, we consider that vehicles can provide their positions and their destinations to a central server so that it is able to calculate the best route for one of them. Our tests concentrate on comparisons between the proposed approach and other algorithms that are currently used for the same purpose, being possible to conclude that our algorithm optimizes traffic in a relevant manner.

A novel map-matching procedure for low-sampling GPS data with applications to traffic flow analysis

An extensive sample (2%) of private vehicles in Italy are equipped with a GPS device that periodically measures their position and dynamical state for insurance purposes. Having access to this type of data allows to develop theoretical and practical applications of great interest: the real-time reconstruction of traffic state in a certain region, the development of accurate models of vehicle dynamics, the study of the cognitive dynamics of drivers. In order for these applications to be possible, we first need to develop the ability to reconstruct the paths taken by vehicles on the road network from the raw GPS data. In fact, these data are affected by positioning errors and they are often very distanced from each other (~2 Km). For these reasons, the task of path identification is not straightforward. This thesis describes the approach we followed to reliably identify vehicle paths from this kind of low-sampling data. The problem of matching data with roads is solved with a bayesian approach of maximum likelihood. While the identification of the path taken between two consecutive GPS measures is performed with a specifically developed optimal routing algorithm, based on A* algorithm. The procedure was applied on an off-line urban data sample and proved to be robust and accurate. Future developments will extend the procedure to real-time execution and nation-wide coverage.