Hyperbush Algorithm for Strategy-Based Equilibrium Traffic Assignment Problems

Zhandong Xu (), Jun Xie (), Xiaobo Liu () and Yu (Marco) Nie ()
Additional contact information
Zhandong Xu: School of Transportation and Logistics, Southwest Jiaotong University, Chengdu, Sichuan 610031 China; National Engineering Laboratory of Integrated Transportation Big Data Application Technology, Southwest Jiaotong University, Chengdu, Sichuan 610031, China
Jun Xie: School of Transportation and Logistics, Southwest Jiaotong University, Chengdu, Sichuan 610031 China; National Engineering Laboratory of Integrated Transportation Big Data Application Technology, Southwest Jiaotong University, Chengdu, Sichuan 610031, China
Xiaobo Liu: School of Transportation and Logistics, Southwest Jiaotong University, Chengdu, Sichuan 610031 China; National Engineering Laboratory of Integrated Transportation Big Data Application Technology, Southwest Jiaotong University, Chengdu, Sichuan 610031, China
Yu (Marco) Nie: Department of Civil and Environmental Engineering, Northwestern University, Evanston, Illinois 60208

Transportation Science, 2022, vol. 56, issue 4, 877-903

Abstract: Strategy-based equilibrium traffic assignment (SETA) problems define travel choice broadly as a strategy rather than a simple path. Travelers navigating through a network based on a strategy end up following a hyperpath. SETA is well suited to represent a rich set of travel choices that take place en route at nodes, such as transit passengers’ transfer decisions, truckers’ bidding decisions, and taxi drivers’ reposition decisions. This paper recognizes and highlights the commonalities among classical and emerging SETA problems and proposes to unify them within the same modeling framework, built on the concept of a hypergraph. A generic hyperbush algorithm (HBA) is developed by decomposing a hypergraph into destination-based hyperbushes. By constructing hyperbushes and limiting traffic assignments to them, HBA promises to obtain more precise solutions to larger instances of SETA problems at a lower computational cost, both in terms of CPU time and memory consumption. To demonstrate its generality and efficiency, we tailor HBA to solve two SETA problems. The results confirm that HBA consistently outperforms the benchmark algorithms in the literature, including two state-of-the-art hyperpath-based algorithms. To obtain high-quality equilibrium solutions for SETA instances of practical size, HBA runs up to five times faster than the best competitor with a fraction of its memory consumption.

Keywords: strategy-based equilibrium; traffic assignment; hyperpath; hyperbush (search for similar items in EconPapers)
Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.2021.1113 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:56:y:2022:i:4:p:877-903

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().