Hyperpath-based algorithms for the transit equilibrium assignment problem

Zhandong Xu, Jun Xie*, Xiaobo Liu, Yu (Marco) Nie

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

The transit equilibrium assignment problem (TEAP) aims to predict the distributions of passenger flows on lines or line segments in a transit network. Compared to the traffic assignment problem (TAP) for highway networks, the TEAP is much less studied, especially in terms of solution algorithms. This paper proposes two Newton-type hyperpath-based algorithms for a frequency-based TEAP formulation that considers both the congestion effect related to crowding and the queuing effect related to boarding. These newly developed algorithms, as well as two benchmark algorithms from the literature, are tested and compared on a number of transit networks, including two constructed using real-world data. The results show the proposed hyperpath-based algorithms significantly outperform the benchmark algorithms in large networks.

Original languageEnglish (US)
Article number102102
JournalTransportation Research Part E: Logistics and Transportation Review
Volume143
DOIs
StatePublished - Nov 2020

Keywords

  • Algorithm
  • Frequency-based
  • Hyperpath
  • Transit assignment
  • User equilibrium

ASJC Scopus subject areas

  • Business and International Management
  • Civil and Structural Engineering
  • Transportation

Fingerprint Dive into the research topics of 'Hyperpath-based algorithms for the transit equilibrium assignment problem'. Together they form a unique fingerprint.

Cite this