.png){kind=icon}
返回
Perturbed Utility Stochastic Traffic Assignment
.png){kind=icon}
OA
AI
DOI：10.1287/trsc.2023.0449.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 and 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.
Keyword:
perturbed utility
stochastic traffic assignment
dual algorithm
closed-form network loading
network route choice
期刊
IF:
4.8
论文数:
1.9K
被引数:
8.4K
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容