Related papers: Exact solution of a cellular automaton for traffic
We introduce a new rule of motion for a totally asymmetric exclusion process (TASEP) representing pedestrian traffic on a lattice. Its characteristic feature is that the positions of the pedestrians, modeled as hard-core particles, are…
We propose and study a new one-dimensional traffic flow cellular automaton (CA) model of high speed vehicles with the Fukui-Ishibashi-type acceleration for all cars and the Nagel-Schreckenberg-type (NS) stochastic delay only for the cars…
Cellular automaton (CA) approach is an important theoretical framework for studying complex system behavior and has been widely applied in various research field. CA traffic flow models have the advantage of flexible evolution rules and…
In this paper we obtain general integral formulas for probabilities in the asymmetric simple exclusion process (ASEP) on the integer lattice with nearest neighbor hopping rates p to the right and q=1-p to the left. For the most part we…
We consider the asymmetric simple exclusion process (ASEP) with open boundary condition at the left boundary, where particles exit at rate {\gamma} and enter at rate {\alpha} = {\gamma}{\tau}^2, and where {\tau} is the asymmetry parameter…
We investigate the totally asymmetric simple exclusion process (TASEP) in the presence of a bottleneck, i.e. a sequence of consecutive defect sites with reduced hopping rate. The influence of such a bottleneck on the phase diagram is…
Effects of large value assigned to the maximal car velocity on the fundamental diagrams in the Nagel-Schreckenberg model are studied by extended simulations. The function relating the flow in the congested traffic phase with the car density…
We present a rigorous derivation of the flow at arbitrary time in a deterministic cellular automaton model of traffic flow. The derivation employs regularities in preimages of blocks of zeros, reducing the problem of preimage enumeration to…
We present a rigorous derivation of the flow at arbitrary time in a deterministic cellular automaton model of traffic flow. The derivation employs regularities in preimages of blocks of zeros, reducing the problem of preimage enumeration to…
We present a rigorous derivation of the flow at arbitrary time in a deterministic cellular automaton model of traffic flow. The derivation employs regularities in preimages of blocks of zeros, reducing the problem of preimage enumeration to…
By the use of computer simulations we investigate, in the cellular automaton of two-dimensional traffic flow, the anisotropic effect of the probabilities of the change of the move directions of cars, from up to right ($p_{ur}$) and from…
We consider steady-state current activity statistics for the one-dimensional totally asymmetric simple exclusion process (TASEP). With the help of the known operator algebra (for general open boundary conditions), as well as general…
The totally asymmetric simple exclusion process (TASEP) is a well studied example of far-from-equilibrium dynamics. Here, we consider a TASEP with open boundaries but impose a global constraint on the total number of particles. In other…
A set of exact solutions for a cellular automaton, which is a hybrid of the optimal velocity and the slow-to-start models, is presented. The solutions allow coexistence of free flows and jamming or slow clusters, which is observed in…
Based on a detailed microscopic test scenario motivated by recent empirical studies of single-vehicle data, several cellular automaton models for traffic flow are compared. We find three levels of agreement with the empirical data: 1)…
The statistics of velocities in the cellular automaton model of Nagel and Schreckenberg for traffic are studied. From numerical simulations, we obtain the probability distribution function (PDF) for vehicle velocities and the…
The totally asymmetric simple exclusion process in discrete time is considered on finite rings with fixed number of particles. A translation-invariant version of the backward-ordered sequential update is defined for periodic boundary…
In this paper, a cellular automaton model of vehicular traffic in Manhattan-like urban system is proposed. In this model, the origin-destination trips and traffic lights have been considered. The system exhibits three different states,…
We systematically investigate the effect of blockage sites in a cellular automaton model for traffic flow. Different scheduling schemes for the blockage sites are considered. None of them returns a linear relationship between the fraction…
We modify the Nagel-Schreckenberg (NaSch) cellular automata model to study mixed-traffic dynamics. We focus on the interplay between passenger availability and bus-stopping constraints. Buses stop next to occupied cells of a discretized…