Related papers: Queue replacement principle for corridor problems …
This study investigates dynamic system-optimal (DSO) and dynamic user equilibrium (DUE) traffic assignment of departure/arrival-time choices in a corridor network. The morning commute problems with a many-to-one pattern of…
This study develops a hybrid analytical and numerical approach for dynamic user equilibrium (DUE) assignment with simultaneous route and departure time choice (RDTC) for homogeneous users. The core concept of the proposed approach is the…
This paper presents a systematic approach for analyzing the departure-time choice equilibrium (DTCE) problem of a single bottleneck with heterogeneous commuters. The approach is based on the fact that the DTCE is equivalently represented as…
This study proves the non-existence of queues for a dynamic system optimal (DSO) departure pattern in a directed rooted tree network with a single destination. First, considering queueing conditions explicitly, we formulate the DSO problem…
This paper analyzes simultaneous route-and-departure-time (SRDT) dynamic user equilibrium (DUE) that incorporates the notion of boundedly rational (BR) user behavior in the selection of departure time and route choices. Intrinsically, the…
Dynamic user equilibrium (DUE) is the most widely studied form of dynamic traffic assignment, in which road travelers engage in a non-cooperative Nash-like game with departure time and route choices. DUE models describe and predict the…
Departure time management is an efficient way in addressing the peak-hour crowding in public transport by reducing the temporal imbalance between service supply and travel demand. From the demand management perspective, the problem is to…
Departure time choice models play a crucial role in determining the traffic load in transportation systems. This paper introduces a new framework to model and analyze the departure time user equilibrium (DTUE) problem based on the so-called…
In this paper we present a stable day-to-day dynamical system for drivers' departure time choice at a single bottleneck. We first define within-day traffic dynamics with the point queue model, costs, the departure time user equilibrium…
In this paper, we study the stability of light traffic achieved by a scheduling algorithm which is suitable for heterogeneous traffic networks. Since analyzing a scheduling algorithm is intractable using the conventional mathematical tool,…
Traffic management by applying congestion pricing is a measure for mitigating congestion in protected city corridors. As a promising tool, pricing improves the level of service in a network and reduces travel delays. However, real-world…
Quantum annealing (QA) is a quantum computing algorithm that works on the principle of Adiabatic Quantum Computation (AQC), and it has shown significant computational advantages in solving combinatorial optimization problems such as vehicle…
We consider a spatially distributed demand for electrical vehicle recharging, that must be covered by a fixed set of charging stations. Arriving EVs receive feedback on transport times to each station, and waiting times at congested ones,…
In heterogeneous networks, achieving congestion avoidance is difficult because the congestion feedback from one subnetwork may have no meaning to source on other other subnetworks. We propose using changes in round-trip delay as an implicit…
The lack of a unique user equilibrium (UE) route flow in traffic assignment has posed a significant challenge to many transportation applications. The maximum-entropy principle, which advocates for the consistent selection of the most…
This paper is concerned with the existence of the simultaneous route-and-departure choice dynamic user equilibrium (SRDC-DUE) in continuous time, first formulated as an infinite-dimensional variational inequality in Friesz et al. (1993). In…
Mass transit systems are experiencing increasing congestion in many cities. The schedule-based transit assignment problem (STAP) involves a joint choice model for departure times and routes, defining a space-time path in which passengers…
We consider optimal control of a stochastic network,where service is controlled to prevent buffer overflow. We use a risk-sensitive escape time criterion, which in comparison to the ordinary escape time criteria heavily penalizes exits…
Dynamic user equilibrium (DUE) is a Nash-like solution concept describing an equilibrium in dynamic traffic systems over a fixed planning period. DUE is a challenging class of equilibrium problems, connecting network loading models and…
We consider optimizing average queueing delay and average power consumption in a nonpreemptive multi-class M/G/1 queue with dynamic power control that affects instantaneous service rates. Four problems are studied: (1) satisfying per-class…