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

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.