arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2302.11660math.OC
收藏

对对称交通分配及其算法收敛性的新认识

A fresh look at symmetric traffic assignment and algorithm convergence

Priyadarshan N. Patil

摘要:

过去,人们广泛地研究了具有路段相互作用的静态交通分配问题的扩展。许多网络建模社区已经转向动态交通分配,包括这些相互作用。我们相信有几个原因需要重新检查带有链接交互的静态分配。首先,如果链路交互可以以对称、单调的方式捕获,则平衡总是存在且是唯一的,并且存在可证明正确的算法。我们发现,几个最有效的算法可分离的交通分配问题可以很容易地应用于对称的相互作用。我们讨论了如何(非对称)Daganzo合并模型可以近似对称线性费用函数。其次,我们提出的计算证据表明,收敛到平衡是更快的对称,单调的链接相互作用时。即使当相互作用是不对称的,这也是正确的,尽管缺乏可证明的收敛结果。最后,我们提出了常用的网络和链路度量的收敛行为分析。由于这些原因,我们认为静态分配与链接的相互作用值得在研究和实践中更多的关注。

英文摘要:

Extensions of the static traffic assignment problem with link interactions were studied extensively in the past. Much of the network modeling community has since shifted to dynamic traffic assignment incorporating these interactions. We believe there are several reasons to re-examine static assignment with link interactions. First, if link interactions can be captured in a symmetric, monotone manner, equilibrium always exists and is unique, and provably-correct algorithms exist. We show that several of the most efficient algorithms for the separable traffic assignment problem can be readily applied with symmetric interactions. We discuss how the (asymmetric) Daganzo merge model can be approximated by symmetric linear cost functions. Second, we present computational evidence suggesting that convergence to equilibrium is faster when symmetric, monotone link interactions are present. This is true even when interactions are asymmetric, despite the lack of a provable convergence result. Lastly, we present convergence behavior analysis for commonly used network and link metrics. For these reasons, we think static assignment with link interactions deserves additional attention in research and practice.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑