Related papers: Guarded by Gamora: How Access Control Balances Out…
We analyze a boarding solution for a transport system in which the number of passengers allowed to enter a transport cabin is automatically controlled. Expressions charac- terizing the stochastic properties of the passenger queue length,…
We propose an equilibrium model of ski resorts where users are assigned to cycles in a closed network. As queues form on lifts with limited capacity, we derive an efficient way to find waiting times via convex optimization. The equilibrium…
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…
We consider a discrete population of users with homogeneous service demand who need to decide when to arrive to a system in which the service rate deteriorates linearly with the number of users in the system. The users have heterogeneous…
Passengers' experience is becoming a key metric to evaluate the air transportation system's performance. Efficient and robust tools to handle airport operations are needed along with a better understanding of passengers' interests and…
The emerging connected-vehicle technology provides a new dimension in developing more intelligent traffic control algorithms for signalized intersections in networked transportation systems. An important challenge for the scheduling problem…
Gate holding reduces congestion by reducing the number of aircraft present on the airport surface at any time, while not starving the runway. Because some departing flights are held at gates, there is a possibility that arriving flights…
A system manager makes dynamic pricing and dispatch control decisions in a queueing network model motivated by ride-hailing applications. A novel feature of the model is that it incorporates travel times. Unfortunately, this renders the…
We consider a single server queueing system with admission control and the possibility to switch dynamically between a low and a high service rate, and examine the benefit of this service rate flexibility. We formulate a discounted Markov…
This article considers the stochastic on-time arrival problem in transit networks where both the travel time and the waiting time for transit services are stochastic. A specific challenge of this problem is the combinatorial solution space…
The long waiting time at airport security has become an emergent issue as demand for air travel continues to grow. Not only does queuing at security cause passengers to miss their flights, but also reduce the amount of time passengers spend…
The culture of sharing instead of ownership is sharply increasing in individuals behaviors. Particularly in transportation, concepts of sharing a ride in either carpooling or ridesharing have been recently adopted. An efficient optimization…
In this paper, we study a controllable tandem queueing system consisting of two nodes and a controller, in which customers arrive according to a Poisson process and must receive service at both nodes before leaving the system. A decision…
In this paper, we study a variant of the dynamic ridesharing problem with a specific focus on peak hours: Given a set of drivers and rider requests, we aim to match drivers to each rider request by achieving two objectives: maximizing the…
We consider the problem of customer equilibrium behavior of a single server Markovian queue with dynamic control of the service rate. Customers arrive according a Poisson procedure and the system administrator makes a service rate choice…
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…
Group elevator scheduling is an NP-hard sequential decision-making problem with unbounded state spaces and substantial uncertainty. Decision-theoretic reasoning plays a surprisingly limited role in fielded systems. A new opportunity for…
We consider a Markovian clearing queueing system, where the customers are accumulated according to a Poisson arrival process and the server removes all present customers at the completion epochs of exponential service cycles. This system…
Consider a terminal in which users arrive continuously over a finite period of time at a variable rate known in advance. A fleet of shuttles has to carry the users over a fixed trip. What is the shuttle schedule that minimizes their waiting…
In this paper, we consider a mobility system of travelers and providers, and propose a "mobility game" to study when a traveler is matched to a provider. Each traveler seeks to travel using the services of only one provider, who manages one…