Related papers: The Page-R{\'e}nyi parking process
This article proposes two different approaches to automatically create a map for valid on-street car parking spaces. For this, we use car sharing park-out events data. The first one uses spatial aggregation and the second a machine learning…
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…
The setting for the online transportation problem is a metric space $M$, populated by $m$ parking garages of varying capacities. Over time cars arrive in $M$, and must be irrevocably assigned to a parking garage upon arrival in a way that…
In discrete time, $\ell$-blocks of red lights are separated by $\ell$-blocks of green lights. Cars arrive at random. \ We seek the distribution of maximum line length of idle cars, and justify conjectured probabilistic asymptotics…
During the attempt to park a car in the city the drivers have to share limited resources (the available roadside). We show that this fact leads to a predictable distribution of the distances between the cars that depends on the length of…
As an example of the concept of rulial space, we explore the case of simple Turing machines. We construct the rulial multiway graph which represents the behavior of all possible Turing machines with a certain class of rules. This graph…
As urban populations continue to grow, cities face numerous challenges in managing parking and determining occupancy. This issue is particularly pronounced in university campuses, where students need to find vacant parking spots quickly and…
Kinetics of dilute heterogeneous traffic on a two lane road is formulated in the framework of the Ben-Naim Krapivsky model and stationary state properties are analytically derived in the asymptotic limit. The heterogeneity is introduced as…
Forecasting is challenging since uncertainty resulted from exogenous factors exists. This work investigates the rank position forecasting problem in car racing, which predicts the rank positions at the future laps for cars. Among the many…
The increasing availability and adoption of shared vehicles as an alternative to personally-owned cars presents ample opportunities for achieving more efficient transportation in cities. With private cars spending on the average over 95\%…
Suppose that $m$ drivers each choose a preferred parking space in a linear car park with $n$ spots. In order, each driver goes to their chosen spot and parks there if possible, and otherwise takes the next available spot if it exists. If…
The method of approximate automodel solution for the Green's function of the time-dependent superdiffusive (nonlocal) transport equations (J. Phys. A: Math. Theor. 49 (2016) 255002) is extended to the case of a finite velocity of carriers.…
It's a situation everyone dreads. A road is down to one lane for repairs. Traffic is let through one way until the backlog clears and then traffic is let through the other way to clear that backlog and so on. When stuck in a very long queue…
This paper examines the traffic flows on a two-dimensional stochastic lattice model that comprises a junction of two traveling routes: the domestic route and the international route each of which has parking sites. In our model, the system…
Parking is a necessary component of traditional last-mile delivery practices, but finding parking can be difficult. Yet, the routing literature largely does not account for the need to find parking. In this paper, we address this challenge…
The random sequential adsorption (RSA) of identical elongated particles (discorectangles) on a line ("Paris car parking problem") was studied numerically. An off-lattice model with continuous positional and orientational degrees of freedom…
Piecewise affine maps (PAMs) are frequently used as a reference model to show the openness of the reachability questions in other systems. The reachability problem for one-dimentional PAM is still open even if we define it with only two…
We consider a generalized version in continuous time of the parking problem of Knuth. Files arrive following a Poisson point process and are stored on a hardware identified with the real line. We specify the distribution of the space of…
We consider Palm distributions arising in a Markov process with time homogeneous transitions which is jointly stationary with multiple point processes. Motivated by a BAR approach studied in the recent paper Braverman, Dai and Miyazawa…
The parking issue is central in transport policies and drivers' concerns, but the determinants of the parking search time remain relatively poorly understood. The question is often handled in a fairly ad hoc way, or by resorting to crude…