DYNAMIC USER EQUILIBRIUM ASSIGNMENT BY MARKOV CHAIN INCLUDING QUEUE SPILLBACK

Solving the Dynamic User Optimal Assignment Problem Considering Queue Spillback

This paper studies the dynamic user optimal (DUO) traffic assignment problem considering simultaneous route and departure time choice. The DUO problem is formulated as a discrete variational inequality (DVI), with an embeded LWR-consistent mesoscopic dynamic network loading (DNL) model to encapsulate traffic dynamics. The presented DNL model is capable of capturing realistic traffic phenomena s...

Spillback modelling in dynamic traffic assignment using implicit path enumeration

User-Equilibrium Properties of Fixed Points in Dynamic Traffic Assignment∗

This paper considers the problem of dynamic traffic assignment under the principle that individual drivers will choose fastest paths, in the dynamic situation where path durations consist of time-dependent link travel times. Rather than constructing a unified model encompassing traffic dynamics and route choice, we decompose the model into an assignment mapping, which identifies the link travel...

Wardrop’s User Equilibrium Assignment under Stochastic Environment

Various models of traffic assignment under stochastic environment have been proposed recently, mainly by assuming different travelers’ behavior against uncertainties. This paper focuses on the expected residual minimization (ERM) model to provide a robust traffic assignment with an emphasis on the planner’s perspective. The model is further extended to obtain a stochastic prediction of the traf...

B-Dynamic: An Efficient Algorithm for Dynamic User Equilibrium Assignment in Activity-Travel Networks

Multi-dimensional choice in DTA for example, a combined model of activity location, time of participation, duration, and route choice decisions results in exponentially increasing choice alternatives. Any efficient algorithm for solving the multi-dimensional DTA problem must avoid enumeration of alternatives. In this paper an algorithm that does not enumerate paths is presented. The algorithm i...