Related papers: Conjectures about Traffic Light Queues
A discrete-time batch service queue with batch renewal input and random serving capacity rule under the late arrival delayed access system (LAS-DA), has recently appeared in the literature [2]. In this paper, we consider the same model…
This article presents a derivation of analytical predictions for steady-state distributions of netto time gaps among clusters of vehicles moving inside a traffic stream. Using the thermodynamic socio-physical traffic model with short-ranged…
When a new vehicle joins a lane, those behind may have to temporarily slow to accommodate them. Changing lane can be forced due to lane drops or junctions, but may also take place spontaneously at discretion of drivers, and recent studies…
For integers $k, \ell \geq 3$, let $\mathrm{ex}(n, \overrightarrow{C_k}, \overrightarrow{C_\ell})$ denote the maximum number of directed cycles of length $k$ in any oriented graph on $n$ vertices which does not contain a directed cycle of…
For many power-limited networks, such as wireless sensor networks and mobile ad hoc networks, maximizing the network lifetime is the first concern in the related designing and maintaining activities. We study the network lifetime from the…
Recognizing a traffic signal, determining if the signal is green or red, and figuring out the time left to cross the crosswalk are significant challenges to visually impaired people. Previous research has focused on recognizing only two…
We consider a queueing system with $n$ parallel queues operating according to the so-called "supermarket model" in which arriving customers join the shortest of $d$ randomly selected queues. Assuming rate $n\lambda_{n}$ Poisson arrivals and…
Generalized Tur\'an problems have been a central topic of study in extremal combinatorics throughout the last few decades. One such problem, maximizing the number of cliques of a fixed order in a graph with fixed number of vertices and…
Finding an optimal solution of signal traffic control durations is a computationally intensive task. It is typically O(T3) in time, and O(T2) in space, where T is the length of the control interval in discrete time steps. In this paper, we…
Given two random finite sequences from $[k]^n$ such that a prefix of the first sequence is a suffix of the second, we examine the length of their longest common subsequence. If $\ell$ is the length of the overlap, we prove that the expected…
For a GI/GI/1 queue, we show that the average sojourn time under the (blind) Randomized Multilevel Feedback algorithm is no worse than that under the Shortest Remaining Processing Time algorithm times a logarithmic function of the system…
We consider $M/G/\infty$ queues with gated service and obtain results on the distribution of the stage length and the number of customers served in a stage when the system is stationary. The stage length density is expressed as an infinite…
We propose a discrete traffic flow model with discrete time. Continuum limit of this model is equivalent to the optimal velocity model. It has also an ultradiscrete limit and a piecewise-linear type of traffic flow model is obtained. Both…
Electric vehicles may dominate motorized transport in the next decade, yet the impact of the collective dynamics of electric mobility on long-range traffic flow is still largely unknown. We demonstrate a type of congestion that arises if…
We have previously shown in an abstract simulation (Gershenson, 2005) that self-organizing traffic lights can improve greatly traffic flow for any density. In this paper, we extend these results to a realistic setting, implementing…
Many-particle simulations of vehicle interactions have been quite successful in the qualitative reproduction of observed traffic patterns. However, the assumed interactions could not be measured, as human interactions are hard to quantify…
Based on fluid-dynamic and many-particle (car-following) simulations of traffic flows in (urban) networks, we study the problem of coordinating incompatible traffic flows at intersections. Inspired by the observation of self-organized…
In this first paper of a series of two we are going to show that, on the ground of few reasonable hypotheses, an equation linking the number of vehicle N($\tau_i$), that run from (i-1)-th to the i-th hour, to the ground-level hourly average…
In the Biham-Middleton-Levine traffic model cars are placed with some density p on a two dimensional torus, and move according to a (simple) set of predefined rules. Computer simulations show this system exhibits many interesting phenomena:…
We study three non-equivalent queueing models in continuous time that each generalise the classical M/M/1 queue in a different way. Inter-event times in all models are Mittag-Leffler distributed, which is a heavy tail distribution with no…