Related papers: Dynamic traffic assignment in a corridor network: …
This study investigates the theoretical properties of a departure time choice problem considering commuters' heterogeneity with respect to the value of schedule delay in corridor networks. Specifically, we develop an analytical method to…
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…
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…
In this study, we analyse the convergence and stability of dynamic system optimal (DSO) traffic assignment with fixed departure times. We first formulate the DSO traffic assignment problem as a strategic game wherein atomic users select…
In this paper, we consider a dynamic equilibrium transportation problem. There is a fixed number of cars moving from origin to destination areas. Preferences for arrival times are expressed as a cost of arriving before or after the…
User equilibrium is a central concept for studying transportation networks, and one can view it as the result of a dynamical process of drivers' route choice behavior. In this paper, based on a definition of O-D First-In-First-Out…
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…
The residual queue during a given study period (e.g., peak hour) is an important feature that should be considered when solving a traffic assignment problem under equilibrium for strategic traffic planning. Although studies have focused…
This paper is concerned with a dynamic traffic network performance model, known as dynamic network loading (DNL), that is frequently employed in the modeling and computation of analytical dynamic user equilibrium (DUE). As a key component…
The increasing global spread of electric vehicles (EVs) has introduced significant interdependence between transportation and power networks. Most of the previous studies on coupled networks focus on the formation of equilibrium states…
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…
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…
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 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,…
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…
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…
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…
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…
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…
Stochastic User Equilibrium (SUE) models depict the perception differences in traffic assignment problems. According to the assumption of an unbounded perceived travel time distribution, the conventional SUE problems result in a positive…