Λεπτομέρειες βιβλιογραφικής εγγραφής
| Τίτλος: |
Perturbed Utility Stochastic Traffic Assignment. |
| Συγγραφείς: |
Yao, Rui1 (AUTHOR) rui.yao@epfl.ch, Fosgerau, Mogens2,3 (AUTHOR) mogens.fosgerau@econ.ku.dk, Paulsen, Mads2 (AUTHOR) Madsp@dtu.dk, Rasmussen, Thomas Kjær2 (AUTHOR) tkra@dtu.dk |
| Πηγή: |
Transportation Science (INFORMS). Jul/Aug2024, Vol. 58 Issue 4, p876-895. 20p. |
| Θεματικοί όροι: |
*Problem solving, *Algorithms, Assignment problems (Programming), Traffic assignment, Route choice, Quasi-Newton methods |
| Περίληψη: |
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. [ABSTRACT FROM AUTHOR] |
|
Copyright of Transportation Science (INFORMS) is the property of INFORMS: Institute for Operations Research & the Management Sciences and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Βάση Δεδομένων: |
Business Source Index |