Related papers: Stable day-to-day dynamics for departure time choi…
This work presents a stochastic dynamic programming (SDP) algorithm that aims at minimizing an economic criteria based on the total energy consumption of a range extender electric vehicle (REEV). This algorithm integrates information from…
The dynamic pricing problem of a freeway corridor with high-occupancy toll (HOT) lanes was formulated and solved based on a point queue abstraction of the traffic system [Yin and Lou, 2009]. However, existing pricing strategies cannot…
In this paper we study a dynamic vehicle routing problem in which there are multiple vehicles and multiple classes of demands. Demands of each class arrive in the environment randomly over time and require a random amount of on-site service…
We study a dynamic traffic assignment model, where agents base their instantaneous routing decisions on real-time delay predictions. We formulate a mathematically concise model and define dynamic prediction equilibrium (DPE) in which no…
Estimation of origin-destination (OD) demand plays a key role in successful transportation studies. In this paper, we consider the estimation of time-varying day-to-day OD flows given data on traffic volumes in a transportation network for…
As one of the most fundamental concepts in transportation science, Wardrop equilibrium (WE) has always had a relatively weak behavioral underpinning. To strengthen this foundation, one must reckon with bounded rationality in human…
Modelling passenger assignments in public transport networks is a fundamental task for city planners, especially when deliberating network infrastructure decisions. A key aspect of a realistic model is to integrate passengers' selfish…
We study the distribution of traffic in networks whose users try to minimise their delays by adhering to a simple learning scheme inspired by the replicator dynamics of evolutionary game theory. The stable steady states of these dynamics…
Moving and fixed bottlenecks are moving or fixed capacity restrictions that affect the propagation of traffic flow. They are a very important modeling approach to describe the effects of slow vehicles and traffic signals in transportation…
A Wardrop equilibrium for multiple routes requires equal travel time on each path used. With real-time traffic data regarding travel times, it is important to analyze how to use the information provided. In particular, can a Wardrop…
Single-occupancy vehicles (SOVs) are charged to use the highoccupancy-toll (HOT) lanes, while high-occupancy-vehicles (HOVs) can drive in them at no cost. The pricing scheme for HOT lanes has been extensively studied at local bottlenecks or…
Up-to-date information wirelessly communicated among vehicles can be used to select the optimal route between a given origin and destination. To elucidate how to make use of such information, simulations are performed for autonomous…
To help mitigate road congestion caused by the unrelenting growth of traffic demand, many transportation authorities have implemented managed lane policies, which restrict certain freeway lanes to certain types of vehicles. It was…
This paper presents a numerical demonstration of the real-time application of two dynamic stall onset criteria for identifying and mitigating stall. These criteria - based on the leading-edge suction parameter (LESP) and boundary enstrophy…
This paper analyzes the time-dependent relationship between the mean and variance of travel time on a single corridor under rush hour like congestion patterns. To model this phenomenon, we apply the LWR ((Lighthill & Whitham, 1955),…
Same-day delivery for e-commerce has become a popular service. Companies usually offer several time delivery options with the earliest one being next hour delivery. Due to tight delivery deadlines and thin margins, companies often find it…
We consider a stochastic, dynamic job scheduling problem, formulated as a queueing control problem, in which a single server processes jobs of different types that arrive according to independent Poisson processes. The problem is defined on…
This paper proposes a general equilibrium model for multi-passenger ridesharing systems, in which interactions between ridesharing drivers, passengers, platforms, and transportation networks are endogenously captured. Stable matching is…
We consider learning-based adaptive dynamic routing for a single-origin-single-destination queuing network with stability guarantees. Specifically, we study a class of generalized shortest path policies that can be parameterized by only two…
We propose a ridesharing strategy with integrated transit in which a private on-demand mobility service operator may drop off a passenger directly door-to-door, commit to dropping them at a transit station or picking up from a transit…