Related papers: Flow improvement caused by agents who ignore traff…
A two--dimensional cellular automaton is introduced to model the flow and jamming of vehicular traffic in cities. Each site of the automaton represents a crossing where a finite number of cars can wait approaching the crossing from each of…
A two-dimensional cellular automaton is introduced to model the flow and jamming of vehicular traffic in cities. Each site of the automaton represents a crossing where a finite number of cars can wait approaching the crossing from each of…
We investigate dynamical properties of traffic flow using the stochastic car-following model with modified optimal velocity on circular road. The safety distance following the two-second rule and autonomous vehicles, acting as agents,…
We examine various realistic generalizations of the basic cellular automaton model describing traffic flow along a highway. In particular, we introduce a {\em slow-to-start} rule which simulates a possible delay before a car pulls away from…
In this paper a cellular automata model for one-lane traffic flow is presented. A new set of rules is proposed to better capture driver reactions to traffic that are intended to preserve safety on the highway. As a result, drivers behavior…
We introduce a simple lattice model of traffic flow in a city where drivers optimize their route-selection in time in order to avoid traffic jams, and study its phase structure as a function of the density of vehicles and of the drivers'…
A two-dimensional cellular automaton model of traffic flow with open boundaries are investigated by computer simulations. The outflow of cars from the system and the average velocity are investigated. The time sequences of the outflow and…
We study completely asymmetric 2-channel exclusion processes in 1 dimension. It describes a two-way traffic flow with cars moving in opposite directions. The interchannel interaction makes cars slow down in the vicinity of approaching cars…
A recently introduced cellular automaton model for the description of traffic flow is investigated. It generalises asymmetric exclusion models which have attracted a lot of interest in the past. We calculate the so-called fundamental…
It is shown that a variety of deterministic cellular automaton models of highway traffic flow obey a variational principle which states that, for a given car density, the average car flow is a non-decreasing function of time. This result is…
In recent years the modelling of traffic flow using methods from statistical physics, especially cellular automata models have allowed simulations of large traffic networks faster than real time. In this paper, we study a probabilistic…
In this article, we propose a traffic rule inspired from nature, that facilitates an elite agent to move efficiently through a crowd of inert agents. When an object swims in a fluid medium or an intruder is forced through granular matter,…
In this paper computer simulation results of higher order density correlation for cellular automaton models of traffic flow are presented. The examinations show the jamming transition as a function of both the density and the magnitude of…
We construct a stochastic cellular automata model for the description of vehicular traffic at a roundabout designed at the intersection of two perpendicular streets. The vehicular traffic is controlled by a self-organized scheme in which…
We study a model of traffic where drivers adopt different behavioral strategies. These can be cooperative or defective according to a driver abiding or not by a traffic rule. Drivers can change their strategy by imitating the majority, with…
We investigate a probabilistic cellular automaton model which has been introduced recently. This model describes single-lane traffic flow on a ring and generalizes the asymmetric exclusion process models. We study the equilibrium properties…
The modelling of traffic flow using methods and models from physics has a long history. In recent years especially cellular automata models have allowed for large-scale simulations of large traffic networks faster than real time. On the…
A model for 1D traffic flow is developed, which is discrete in space and time. Like the cellular automaton model by Nagel and Schreckenberg [J. Phys. I France 2, 2221 (1992)], it is simple, fast, and can describe stop-and-go traffic. Due to…
This paper focuses on two commonly used path assignment policies for agents traversing a congested network: self-interested routing, and system-optimum routing. In the self-interested routing policy each agent selects a path that optimizes…
We present a model of traffic flow on generic urban road networks based on cellular automata. We apply this model to an existing road network in the Australian city of Melbourne, using empirical data as input. For comparison, we also apply…