当前位置: X-MOL 学术Transp. Res. Part B Methodol. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Convergence of fixed-point algorithms for elastic demand dynamic user equilibrium
Transportation Research Part B: Methodological ( IF 5.8 ) Pub Date : 2021-07-09 , DOI: 10.1016/j.trb.2021.01.007
Terry L. Friesz 1 , Ke Han 2 , Amir Bagherzadeh 1
Affiliation  

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.



中文翻译:

弹性需求动态用户均衡的定点算法收敛性

在本文中,我们提出了用于计算具有弹性旅行需求(E-DUE)的动态用户平衡的投影和定点算法收敛的充分条件。不需要强单调增加路径延迟算子的假设。取而代之的是,我们假设路径延迟算子只是弱单调递增,这是由 Lipschitz 连续性保证的属性,而逆需求函数是强单调递减。路径延迟的 Lipschitz 连续性是一个非常温和的规律性条件。因此,非单调延迟算子可能是弱单调递增并满足我们的收敛标准,前提是逆需求函数是单调递减的。我们通过一个数值例子来说明非单调路径延迟的收敛。

更新日期:2021-07-09
down
wechat
bug