On the Existence of Solutions to the Dynamic User Equilibrium Problem

  title={On the Existence of Solutions to the Dynamic User Equilibrium Problem},
  author={Daoli Zhu and Patrice Marcotte},
  journal={Transp. Sci.},
This paper is concerned with the existence of solutions to a dynamic network equilibrium problem modeled as an infinite dimensional variational inequality. Our results are based on properties of operators that map path flow departure rates to consistent time-dependent path flows and other link performance functions. The existence result requires the introduction of a novel concept that strengthens the familiar concept of First-In-First-Out (FIFO). 
An Infinite-Dimensional Variational Inequality Formulation and Existence Result for Dynamic User Equilibrium with Elastic Demands
This paper is concerned with dynamic user equilibrium (DUE) with elastic travel demand (E-DUE). We present and prove a variational inequality (VI) formulation of E-DUE using measure-theoretic
Existence of simultaneous route and departure choice dynamic user equilibrium
The mathematical foundations of dynamic user equilibrium
  • T. Friesz, Ke Han
  • Economics
    Transportation Research Part B: Methodological
  • 2019
Computing Dual Time-scale Dynamic User Equilibria
This chapter presents a dual time-scale model of dynamic network traffic flows that integrates a day-to-day demand growth model with a differential variational inequality formulation of within-day
Dynamic Network User Equilibrium with State-Dependent Time Lags
This paper recasts the Friesz et al. (1993) measure theoretic model of dynamic network user equibrium as a controlled variational inequality problem involving Riemann integrals. This restatement is
Computing Dynamic User Equilibrium on Large-Scale Networks Without Knowing Global Parameters
New strongly convergent algorithms designed to compute a DUE directly in the infinite-dimensional space of path flows are provided, which give provable convergence guarantees without knowledge of global parameters.


A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem
It is shown for the first time that there is a variational inequality formulation of dynamic user equilibrium with simultaneous route choice and departure time decisions which, when appropriate regularity conditions hold, preserves the first in, first out queue discipline.
A Discrete Time, Nested Cost Operator Approach to the Dynamic Network User Equilibrium Problem
This paper shows how arc exit flow functions and nested cost operators can be used to calculate unit path costs given the departure time and route choices of network users, and demonstrates that a discrete time dynamic network user equilibrium is guaranteed to exist.
Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem
It is established that a constraint qualification and convexity requirements for the Hamiltonian, which together ensure that the necessary conditions are also sufficient, are satisfied under commonly encountered regularity conditions.
Advances in the Continuous Dynamic Network Loading Problem
The authors show, under a boundedness condition, that there exists a unique solution to the CDNLP problem and propose for its solution a finite-step algorithm.
A Model and an Algorithm for the Dynamic Traffic Assignment Problems
A discrete time model is presented for dynamic traffice assignment with a single destination and can be solved for a global optimum using a one-pass simplex algorithm---branch-and-bound is not required.
Dynamic User Equilibrium Departure Time and Route Choice on Idealized Traffic Arterials
An extension of a recent framework for analyzing the time-dependent departure pattern arising in an idealized situation of a pool of commuters going from a single origin to a single destination along