Related papers: Marginalizing Out Future Passengers in Group Eleva…
In this paper, we address the vehicle scheduling problem for improving passenger safety in bus rapid transit systems. Our focus is on passengers waiting at street stops to enter terminal stations. To enhance their safety, we minimize…
In the elevator industry, reducing passenger journey time in an elevator system is a major aim. The key obstacle to optimising elevator dispatching is the unpredictable traffic flow of passengers. To address this difficulty, two main…
Ride-sharing is a modern urban-mobility paradigm with tremendous potential in reducing congestion and pollution. Demand-aware design is a promising avenue for addressing a critical challenge in ride-sharing systems, namely joint…
Reducing the aircraft boarding time is a common problem not only for airlines, but also for passengers and airports. Group boarding is a popular boarding strategy that separates the passengers into several groups and those groups, which are…
A transport system with passengers traveling between stations in periodically arriving cabins is considered. We propose and evaluate an access control algorithm that dynamically limits the number of passengers who are allowed to board the…
This paper examines a single-server queueing system that serves both scheduled and strategic walk-in customers. The service discipline follows a first-come, first-served policy, with scheduled customers granted non-preemptive priority. Each…
Hospital choice models often employ random utility theory and include waiting time as a choice determinant. When applied to evaluate health system improvement interventions, these models disregard that hospital choice in turn is a…
This paper proposes a totally asymmetric simple exclusion process on a traveling lane, which is equipped with a queueing system and functions of site assignments along the parking lane. In the proposed system, new particles arrive at the…
This paper studies a scheduling control problem for a single-server multiclass queueing network in heavy traffic, operating in a changing environment. The changing environment is modeled as a finite state Markov process that modulates the…
This paper presents a new method for deriving the waiting time distribution of the lowest class in an accumulating priority (AP) queue with positive L\'evy input. The priority of a non-atomic customer (particle) is a function of their class…
In this work we present a model for the evacuation of pedestrians from an enclosure considering a continuous space substrate and discrete time. We analyze the influence of behavioral features that affect the use of the empty space, that can…
Airport public transport systems are plagued by passenger queue congestion, imposing a substandard travel experience and unexpected delays. To address this issue, this paper proposes a bi-level programming for optimizing queueing network in…
Crowd movement guidance has been a fascinating problem in various fields, such as easing traffic congestion in unusual events and evacuating people from an emergency-affected area. To grab the reins of crowds, there has been considerable…
When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to solve the nondeterminism. It has been observed that for certain…
This paper considers the problem of steering a vast group of agents of which the dynamics are governed by a discrete-time first-order linear system. The group of agents are characterized as a probability density function and an occupation…
Understanding passengers' path choice behavior in urban rail systems is a prerequisite for effective operations and planning. This paper attempts bridging the gap by proposing a probabilistic approach to infer passengers' path choice…
In this paper we consider a single-server, cyclic polling system with switch-over times and Poisson arrivals. The service disciplines that are discussed, are exhaustive and gated service. The novel contribution of the present paper is that…
We consider the processor sharing $M/M/1$-PS queue which also models balking. A customer that arrives and sees $n$ others in the system "balks" (i.e., decides not to enter) with probability $1-b_n$. If $b_n$ is inversely proportional to…
Diagnostic clinics are among healthcare facilities that suffer from long waiting times which can cause medical issues and lead to increases in patient no-shows. Reducing waiting times without significant capital investments is a challenging…
We consider a service system with an infinite number of exponential servers sharing a finite service capacity. The servers are ordered according to their speed, and arriving customers join the fastest idle server. A capacity allocation is…