相关论文: Parking in the city

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…

We apply the random-matrix theory to the car-parking problem. For this purpose, we adopt a Coulomb gas model that associates the coordinates of the gas particles with the eigenvalues of a random matrix. The nature of interaction between the…

Modeling of headway/spacing between two consecutive vehicles has many applications in traffic flow theory and transport practice. Most known approaches only study the vehicles running on freeways. In this paper, we propose a model to…

Using measured data we demonstrate that there is an amazing correspondence among the statistical properties of spacings between parked cars and the distances between birds perching on a power line. We show that this observation is easily…

There are so many vehicles in the world and the number of vehicles is increasing rapidly. To alleviate the parking problems caused by that, the smart parking system has been developed. The parking planning is one of the most important parts…

Models of parking in which cars are placed randomly and then move according to a deterministic rule have been studied since the work of Konheim and Weiss in the 1960s. Recently, Damron, Gravner, Junge, Lyu, and Sivakoff introduced a model…

Parking has been a painful problem for urban drivers. The parking pain exacerbates as more people tend to live in cities in the context of global urbanization. Thus, it is demanding to find a solution to mitigate d rivers' parking…

Many studies suggest that searching for parking is associated with significant direct and indirect costs. Therefore, it is appealing to reduce the time which car drivers spend on finding an available parking lot, especially in urban areas…

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 investigate the behavior of extended urban traffic networks within the framework of percolation theory by using real and synthetic traffic data. Our main focus shifts from the statistical properties of the cluster size distribution…

During the attempt to line up into a dense traffic people have necessarily to share a limited space under turbulent conditions. From the statistical point view it generally leads to a probability distribution of the distances between the…

In this paper, we consider a dynamic equilibrium transportation problem. There is a fixed number of cars moving from origin to destination areas. Preferences for arrival times are expressed as a cost of arriving before or after the…

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…

In this paper, we explore parking distributions on caterpillar trees, focusing on two primary statistics: the number of lucky cars and the frequency with which cars prefer specific parking spaces. We use first-return decomposition to reveal…

We study the kinetics of competitive random sequential adsorption (RSA) of particles of binary mixture of points and fixed-sized particles within the mean-field approach. The present work is a generalization of the random car parking…

We study the asymptotic behavior of cycles of uniformly random parking functions. Our results are multifold: we obtain an explicit formula for the number of parking functions with a prescribed number of cyclic points and show that the…

The problem of reservation in a large distributed system is analyzed via a new mathematical model. A typical application is a station-based car-sharing system which can be described as a closed stochastic network where the nodes are the…

In a parking function, a lucky car is a car that parks in its preferred parking spot and the parking outcome is the permutation encoding the order in which the cars park on the street. We give a characterization for the set of parking…

We consider several special cases of iterations of random i.i.d. linear functions with beta distributed fixed points that generate nested interval schemes when iterated in a backward direction, and ergodic Markov chains in the forward…

We introduce a new approach to model and analyze \emph{Mobility}. It is fully based on discrete mathematics and yields a class of mobility models, called the \emph{Markov Trace} Model. This model can be seen as the discrete version of the…