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

扰动效用随机交通分配

Perturbed utility stochastic traffic assignment

Rui Yao, Mogens Fosgerau, Mads Paulsen, Thomas Kjær Rasmussen

AI总结:

本文针对扰动效用路径选择模型提出拟牛顿加速梯度下降算法 qN-AGD*,通过凸对偶重构实现快速均衡分配,运行时间近似线性扩展,适用于大规模网络。

摘要:

本文开发了一种快速算法,用于计算扰动效用路径选择(PURC)模型下的均衡分配。在不做任何折中的情况下,这使得 PURC 模型的显著优势能够在大规模应用中得到利用。我们将 PURC 均衡分配问题表述为一个凸最小化问题,并找到一个闭式随机网络加载表达式,该表达式使我们能够将分配问题的拉格朗日对偶表述为一个无约束优化问题。为了求解该对偶问题,我们构建了一种拟牛顿加速梯度下降算法(qN-AGD*)。数值实验表明,qN-AGD* 明显优于传统的原始算法以及普通的加速梯度下降算法。qN-AGD* 速度快,运行时间随问题规模近似线性增长,表明即使在非常大的网络中求解扰动效用分配问题也是可行的。

英文摘要:

This paper develops a fast algorithm for computing the equilibrium assignment with the perturbed utility route choice (PURC) model. Without compromise, this allows the significant advantages of the PURC model to be used in large-scale applications. We formulate the PURC equilibrium assignment problem as a convex minimization problem and find a closed-form stochastic network loading expression that allows us to formulate the Lagrangian dual of the assignment problem as an unconstrained optimization problem. To solve this dual problem, we formulate a quasi-Newton accelerated gradient descent algorithm (qN-AGD*). Our numerical evidence shows that qN-AGD* clearly outperforms a conventional primal algorithm as well as a plain accelerated gradient descent algorithm. qN-AGD* is fast with a runtime that scales about linearly with the problem size, indicating that solving the perturbed utility assignment problem is feasible also with very large networks.

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

↑