Related papers: Conjectures about Traffic Light Queues
Exact mean field equations are derived analytically to give the fundamental diagrams, i.e., the average speed - car density relations, for the Fukui-Ishibashi one-dimensional traffic flow cellular automaton model of high speed vehicles…
A widely used approach to solve the synchronization of traffic lights on transport networks is the maximization of the time during which cars start at one end of a street and can go to the other without stopping for a red light (bandwidth…
The continuous limit of large systems of particles of finite size on the line is described. The particles are assumed to move freely and stick under collision, to form compound particles whose mass and size is the sum of the masses and…
We present a flow-control technique in traffic-light intersections, aiming at regulating queue lengths to given reference setpoints. The technique is based on multivariable integrators with adaptive gains, computed at each control cycle by…
Motivated by an analogy with traffic, we simulate two species of particles (`vehicles'), moving stochastically in opposite directions on a two-lane ring road. Each species prefers one lane over the other, controlled by a parameter $0 \leq b…
Explicit results are derived using simple and exact methods for the joint and marginal queue-length distributions for the M/M/c queue with two non-preemptive priority levels. Equal service rates are assumed. Two approaches are considered.…
We carry out a delay stability analysis (i.e., determine conditions under which expected steady-state delays at a queue are finite) for a simple 3-queue system operated under the Max-Weight scheduling policy, for the case where one of the…
We have developed a modified Nagel-Schreckenberg cellular automata model for describing a conflicting vehicular traffic flow at the intersection of two streets. No traffic lights control the traffic flow. The approaching cars to the…
This paper studies steady-state traffic flow on a ring road with up- and down- slopes using a semi-discrete model. By exploiting the relations between the semi-discrete and the continuum models, a steady-state solution is uniquely…
We consider a one-dimensional traffic model with a slow-to-start rule. The initial position of the cars in $\mathbb R$ is a Poisson process of parameter $\lambda$. Cars have speed 0 or 1 and travel in the same direction. At time zero the…
We study the dynamics of three elastic particles in a finite interval where two light particles are separated by a heavy ``piston''. The piston undergoes surprisingly complex motion that is oscillatory at short time scales but seemingly…
This thesis proposes mathematical traffic models and control laws for metro lines with one junction. The models are based on the ones developed for linear metro lines (without junction) in [12, 14]. The train dynamics are described with a…
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…
The position of the various tired light theories is reviewed briefly and it is noted that one of the biggest objections to them concerns the mechanism by which light might lose energy as it travels through space. Here some new work relating…
The effect of mixture lengths of vehicles on the asymmetric exclusion model is studied using numerical simulations for both open and periodic boundaries in parallel dynamics. Densities are calculated as a function of the injecting rates…
A problem that arises in drawings of transportation networks is to minimize the number of crossings between different transportation lines. While this can be done efficiently under specific constraints, not all solutions are visually…
In this paper we analyze a single server queue with batch arrivals and semi-Markovian service times. We also include the feature that the first service of each busy period might have a different distribution than subsequent service times.…
This paper considers a population process on a dynamically evolving graph, which can be alternatively interpreted as a queueing network. The queues are of infinite-server type, entailing that at each node all customers present are served in…
This work considers a many-server queueing system in which customers with i.i.d., generally distributed service times enter service in the order of arrival. The dynamics of the system is represented in terms of a process that describes the…
When selfish users share a road network and minimize their individual travel costs, the equilibrium they reach can be worse than the socially optimal routing. Tolls are often used to mitigate this effect in traditional congestion games,…