Single-vehicle data of highway traffic - a statistical analysis

In the present paper single-vehicle data of highway traffic are analyzed in great detail. By using the single-vehicle data directly empirical time-headway distributions and speed-distance relations can be established. Both quantities yield relevant information about the microscopic states. Several fundamental diagrams are also presented, which are based on time-averaged quantities and compared with earlier empirical investigations. In the remaining part time-series analyses of the averaged as well as the single-vehicle data are carried out. The results will be used in order to propose objective criteria for an identification of the different traffic states, e.g. synchronized traffic.Comment: 12 pages, 19 figures, RevTe

Congested Traffic States in Empirical Observations and Microscopic Simulations

We present data from several German freeways showing different kinds of congested traffic forming near road inhomogeneities, specifically lane closings, intersections, or uphill gradients. The states are localized or extended, homogeneous or oscillating. Combined states are observed as well, like the coexistence of moving localized clusters and clusters pinned at road inhomogeneities, or regions of oscillating congested traffic upstream of nearly homogeneous congested traffic. The experimental findings are consistent with a recently proposed theoretical phase diagram for traffic near on-ramps [D. Helbing, A. Hennecke, and M. Treiber, Phys. Rev. Lett. {\bf 82}, 4360 (1999)]. We simulate these situations with a novel continuous microscopic single-lane model, the ``intelligent driver model'' (IDM), using the empirical boundary conditions. All observations, including the coexistence of states, are qualitatively reproduced by describing inhomogeneities with local variations of one model parameter. We show that the results of the microscopic model can be understood by formulating the theoretical phase diagram for bottlenecks in a more general way. In particular, a local drop of the road capacity induced by parameter variations has practically the same effect as an on-ramp.Comment: Now published in Phys. Rev. E. Minor changes suggested by a referee are incorporated; full bibliographic info added. For related work see http://www.mtreiber.de/ and http://www.helbing.org

Datatype−Generic Programming

Generic programming aims to increase the flexibility of programming languages, by expanding the possibilities for parametrization — ideally, without also expanding the possibilities for uncaught errors. The term means different things to different people: parametric polymorphism, data abstraction, meta-programming, and so on. We use it to mean polytypism, that is, parametrization by the shape of data structures rather than their contents. To avoid confusion with other uses, we have coined the qualified term datatype-generic programming for this purpose. In these lecture notes, we expand on the definition of datatype-generic programming, and present some examples of datatype-generic programs. We also explore the connection with design patterns in object-oriented programming; in particular, we argue that certain design patterns are just higher-order datatype-generic programs