The University of Southampton
University of Southampton Institutional Repository
Warning ePrints Soton is experiencing an issue with some file downloads not being available. We are working hard to fix this. Please bear with us.

Computing dynamic user equilibrium on large-scale networks without knowing global parameters

Computing dynamic user equilibrium on large-scale networks without knowing global parameters
Computing dynamic user equilibrium on large-scale networks without knowing global parameters
Dynamic user equilibrium (DUE) is a Nash-like solution concept describing an equilibrium in dynamic traffic systems over a fixed planning period. DUE is a challenging class of equilibrium problems, connecting network loading models and notions of system equilibrium in one concise mathematical framework. Recently, Friesz and Han introduced an integrated framework for DUE computation on large-scale networks, featuring a basic fixed-point algorithm for the effective computation of DUE. In the same work, they present an open-source MATLAB toolbox which allows researchers to test and validate new numerical solvers. This paper builds on this seminal contribution, and extends it in several important ways. At a conceptual level, we provide new strongly convergent algorithms designed to compute a DUE directly in the infinite-dimensional space of path flows. An important feature of our algorithms is that they give provable convergence guarantees without knowledge of global parameters. In fact, the algorithms we propose are adaptive, in the sense that they do not need a priori knowledge of global parameters of the delay operator, and which are provable convergent even for delay operators which are non-monotone. We implement our numerical schemes on standard test instances, and compare them with the numerical solution strategy employed by Friesz and Han.
Dynamic Traffic Assignment, Fixed Point Iteration, Strong Convergence
1566-113X
735-768
Thong, Duong Viet
fd3a43aa-7d60-453e-a7e7-2f2fcd9d3823
Gibali, Aviv
3e4f6225-8c98-42de-821a-cba3a069ea50
Staudigl, Mathias
29741423-e83a-47c6-907e-0edbb2a7c9b7
Vuong, Phan Tu
52577e5d-ebe9-4a43-b5e7-68aa06cfdcaf
Thong, Duong Viet
fd3a43aa-7d60-453e-a7e7-2f2fcd9d3823
Gibali, Aviv
3e4f6225-8c98-42de-821a-cba3a069ea50
Staudigl, Mathias
29741423-e83a-47c6-907e-0edbb2a7c9b7
Vuong, Phan Tu
52577e5d-ebe9-4a43-b5e7-68aa06cfdcaf

Thong, Duong Viet, Gibali, Aviv, Staudigl, Mathias and Vuong, Phan Tu (2021) Computing dynamic user equilibrium on large-scale networks without knowing global parameters. Networks and Spatial Economics, 21 (3), 735-768. (doi:10.1007/s11067-021-09548-3).

Record type: Article

Abstract

Dynamic user equilibrium (DUE) is a Nash-like solution concept describing an equilibrium in dynamic traffic systems over a fixed planning period. DUE is a challenging class of equilibrium problems, connecting network loading models and notions of system equilibrium in one concise mathematical framework. Recently, Friesz and Han introduced an integrated framework for DUE computation on large-scale networks, featuring a basic fixed-point algorithm for the effective computation of DUE. In the same work, they present an open-source MATLAB toolbox which allows researchers to test and validate new numerical solvers. This paper builds on this seminal contribution, and extends it in several important ways. At a conceptual level, we provide new strongly convergent algorithms designed to compute a DUE directly in the infinite-dimensional space of path flows. An important feature of our algorithms is that they give provable convergence guarantees without knowledge of global parameters. In fact, the algorithms we propose are adaptive, in the sense that they do not need a priori knowledge of global parameters of the delay operator, and which are provable convergent even for delay operators which are non-monotone. We implement our numerical schemes on standard test instances, and compare them with the numerical solution strategy employed by Friesz and Han.

Text
Thong2021_Article_ComputingDynamicUserEquilibriu - Version of Record
Available under License Creative Commons Attribution.
Download (1MB)

More information

Accepted/In Press date: 11 June 2021
e-pub ahead of print date: 14 July 2021
Keywords: Dynamic Traffic Assignment, Fixed Point Iteration, Strong Convergence

Identifiers

Local EPrints ID: 450345
URI: http://eprints.soton.ac.uk/id/eprint/450345
ISSN: 1566-113X
PURE UUID: efa489c7-82ac-4b5e-9b55-6cda98f3011c
ORCID for Phan Tu Vuong: ORCID iD orcid.org/0000-0002-1474-994X

Catalogue record

Date deposited: 23 Jul 2021 18:13
Last modified: 26 Nov 2021 03:20

Export record

Altmetrics

Contributors

Author: Duong Viet Thong
Author: Aviv Gibali
Author: Mathias Staudigl
Author: Phan Tu Vuong ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×