数学优化
运输工程
计算机科学
数学模型
运筹学
数学
统计
工程类
作者
Rui Yao,Mogens Fosgerau,Mads Paulsen,Thomas Kjær Rasmussen
出处
期刊:Transportation Science
[Institute for Operations Research and the Management Sciences]
日期:2024-06-11
卷期号:58 (4): 876-895
被引量:23
标识
DOI:10.1287/trsc.2023.0449
摘要
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. Funding: This work has been financed by the European Union—NextGenerationEU.
科研通智能强力驱动
Strongly Powered by AbleSci AI