Convergence of fixed-point algorithms for elastic demand dynamic user equilibrium

Terry L. Friesz, Ke Han, Amir Bagherzadeh

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper we present sufficient conditions for convergence of projection and fixed-point algorithms used to compute dynamic user equilibrium with elastic travel demand (E-DUE). The assumption of strongly monotone increasing path delay operators is not needed. In its place, we assume path delay operators are merely weakly monotone increasing, a property assured by Lipschitz continuity, while inverse demand functions are strongly monotone decreasing. Lipschitz continuity of path delay is a very mild regularity condition. As such, nonmonotone delay operators may be weakly monotone increasing and satisfy our convergence criteria, provided inverse demand functions are strongly monotone decreasing. We illustrate convergence for nonmonotone path delays via a numerical example.

Original languageEnglish (US)
Pages (from-to)336-352
Number of pages17
JournalTransportation Research Part B: Methodological
Volume150
DOIs
StatePublished - Aug 2021

All Science Journal Classification (ASJC) codes

  • Civil and Structural Engineering
  • Transportation

Fingerprint

Dive into the research topics of 'Convergence of fixed-point algorithms for elastic demand dynamic user equilibrium'. Together they form a unique fingerprint.

Cite this