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

In this paper the authors 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, the authors 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 the authors' convergence criteria, provided inverse demand functions are strongly monotone decreasing. The authors illustrate convergence for nonmonotone path delays via a numerical example.


  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01783641
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Sep 29 2021 9:30AM