Convergence of fixed-point algorithms for elastic demand dynamic user equilibrium. (August 2021)

• Record Type: Journal Article
• Authors: Friesz, Terry L.; Han, Ke; Bagherzadeh, Amir
• Is Part Of: Transportation research. Volume 150(2021)
• Page Start: 336
• Page End: 352
• Publication Date: 2021-08
• Subjects: Dynamic traffic assignment -- Dynamic user equilibrium -- Convergence -- Differential variational inequalities; Transportation -- Research -- Periodicals; Transportation -- Mathematical models -- Periodicals
• DOI: 10.1016/j.trb.2021.01.007
• Languages: English
• ISSNs: 0191-2615

Abstract

Highlights: Dynamic user equilibrium (DUE) path delays may be realistically described as weakly monotone increasing (WMI), and inverse travel demand functions may be realistically described as strongly monotone decreasing (SMD). We establish convergence of fixed-point DUE algorithms under the conditions of Lipschitz continuity, WMI path delays, and SMD inverse travel demand functions. We provide a detailed numerical example showing that the assumptions of Lipschitz continuity, WMI path delays, and SMD inverse travel demand functions hold along the feasible trajectory of fixed-point iterates en route to a DUE solution. 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.