Related papers: A Note on Walking Versus Waiting
We investigate the hitting times of random walks on graphs, where a hitting time is defined as the number of steps required for a random walker to move from one node to another. While much of the existing literature focuses on calculating…
In one-dimensional random walks, the waiting time for each direction transitions is the same, even in the presence of bias, as a consequence of the microscopic-reversibility. We study the symmetry breaking of forward/ backward transition…
This paper presents a model of pedestrian crossing decisions, based on the theory of computational rationality. It is assumed that crossing decisions are boundedly optimal, with bounds on optimality arising from human cognitive limitations.…
Spurred by the growth of transportation network companies and increasing data capabilities, vehicle routing and ride-matching algorithms can improve the efficiency of private transportation services. However, existing routing solutions do…
The paper introduces and evaluates the concept of the dynamic interlining of buses. Dynamic interlining is an operational strategy for routes that have a terminal station at a common hub, that allows a portion of (or all) the fleet to be…
In an increasingly interconnected world, understanding congestion-related phenomena in transportation and their underlying mechanisms is crucial for improving efficiency. As the transportation system becomes denser, different modes of…
This contribution provides a microscopic experimental study of pedestrian motion in front of the bottleneck. Identification of individual pedestrians in conducted experiments enables to explain the high variance of travel time by…
In a temporal graph, each edge is available at specific points in time. Such an availability point is often represented by a ''temporal edge'' that can be traversed from its tail only at a specific departure time, for arriving in its head…
The objective of this paper is to study the effect of travel time information on day-to-day driver route choice behavior. A real-world experimental study is designed to have participants repeatedly choose between two alternative routes for…
In the present work, we study random walks on complex networks subject to stochastic resetting when the resetting probability is node-dependent. Using a renewal approach, we derive the exact expressions of the stationary occupation…
For all line-based transit systems like bus, metro and tram, the routes of the lines and the frequencies at which they are operated are determining for the operational performance of the system. However, as transit line planning happens…
An analysis of the characteristics and behavior of individual bus stops can reveal clusters of similar stops, which can be of use in making routing and scheduling decisions, as well as determining what facilities to provide at each stop.…
Route choice models in public transport have been discussed for a long time. The main factor why a passenger chooses a specific path is usually based on its length or travel time. However, also the ticket price that passengers have to pay…
Understanding human mobility is critical for decision support in areas from urban planning to infectious diseases control. Prior work has focused on tracking daily logs of outdoor mobility without considering relevant context, which contain…
We study how $N$ intelligent buses serving a loop of $M$ bus stops learn a \emph{no-boarding strategy} and a \emph{holding strategy} by reinforcement learning. The high level no-boarding and holding strategies emerge from the low level…
We consider stopping problems in which a decision maker (DM) faces an unknown state of nature and decides sequentially whether to stop and take an irreversible action; pay a fee and obtain additional information; or wait without acquiring…
We study the problem of planning routes in road networks when certain streets or areas are closed at certain times. For heavy vehicles, such areas may be very large since many European countries impose temporary driving bans during the…
We study exploration properties of a random walk on a network. For a fully connected network we find that the problem can be mapped to the well known coupon collector problem, thus allowing us to estimate form of $P(S,t)$: the distribution…
An analytic effective medium theory is constructed to study the mean access times for random walks on hybrid disordered structures formed by embedding complex networks into regular lattices, considering transition rates $F$ that are…
Random walks on graphs can be slow. To speed them up, imagine that at each step instead of choosing the neighbor at random, there is a small probability $\varepsilon>0$ that we can choose it. We show that in this case, at least for graphs…