Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userExactly Solvable Single Lane Highway Traffic Model With Tollbooths
403
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Tolls are collected on many highways as a means of traffic control and revenue generation. However, the presence of tollbooths on highway surely slows down traffic flow. Here, we investigate how the presence of tollbooths affect the average car speed using a simple-minded single lane deterministic discrete traffic model. More importantly, the model is exactly solvable.
rate research
Read More
A two-lane extension of a recently proposed cellular automaton model for traffic flow is discussed. The analysis focuses on the reproduction of the lane usage inversion and the density dependence of the number of lane changes. It is shown that the single-lane dynamics can be extended to the two-lane case without changing the basic properties of the model which are known to be in good agreement with empirical single-vehicle data. Therefore it is possible to reproduce various empirically observed two-lane phenomena, like the synchronization of the lanes, without fine-tuning of the model parameters.
Within the formalism of matrix product ansatz, we study a two-species asymmetric exclusion process with backward and forward site-ordered sequential update. This model, which was originally introduced with the random sequential update, describes a two-way traffic flow with a dynamic impurity and shows a phase transition between the free flow and traffic jam. We investigate the characteristics of this jamming and examine similarities and differences between our results and those with random sequential update.
We show how to compute the exact partition function for lattice statistical-mechanical models whose Boltzmann weights obey a special crossing symmetry. The crossing symmetry equates partition functions on different trivalent graphs, allowing a transformation to a graph where the partition function is easily computed. The simplest example is counting the number of nets without ends on the honeycomb lattice, including a weight per branching. Other examples include an Ising model on the Kagome lattice with three-spin interactions, dimers on any graph of corner-sharing triangles, and non-crossing loops on the honeycomb lattice, where multiple loops on each edge are allowed. We give several methods for obtaining models with this crossing symmetry, one utilizing discrete groups and another anyon fusion rules. We also present results indicating that for models which deviate slightly from having crossing symmetry, a real-space decimation (renormalization-group-like) procedure restores the crossing symmetry.
A one-way {em street} of width M is modeled as a set of M parallel one-dimensional TASEPs. The intersection of two perpendicular streets is a square lattice of size M times M. We consider hard core particles entering each street with an injection probability alpha. On the intersection square the hard core exclusion creates a many-body problem of strongly interacting TASEPs and we study the collective dynamics that arises. We construct an efficient algorithm that allows for the simulation of streets of infinite length, which have sharply defined critical jamming points. The algorithm employs the `frozen shuffle update, in which the randomly arriving particles have fully deterministic bulk dynamics. High precision simulations for street widths up to M=24 show that when alpha increases, there occur jamming transitions at a sequence of M critical values alphaM,M < alphaM,M-1 < ... < alphaM,1. As M grows, the principal transition point alphaM,M decreases roughly as sim 1/(log M) in the range of M values studied. We show that a suitable order parameter is provided by a reflection coefficient associated with the particle current in each TASEP.
It is shown that solvable mixed spin ladder models can be constructed from su(N) permutators. Heisenberg rung interactions appear as chemical potential terms in the Bethe Ansatz solution. Explicit examples given are a mixed spin-1/2 spin-1 ladder, a mixed spin-1/2 spin-3/2 ladder and a spin-1 ladder with biquadratic interactions.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
