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 language | English (US) |
|---|---|
| Article number | 102102 |
| Journal | Transportation Research Part E: Logistics and Transportation Review |
| Volume | 143 |
| DOIs | |
| State | Published - Nov 2020 |
Funding
We are grateful to the two anonymous reviewers for their valuable comments and suggestion. This research is jointly funded by National Nature Science Foundation of China (Grant No. 71971178 ), the Sichuan Provincial Science and Technology Department, China (Grant No. 202010 ) and the Fundamental Research Funds for the Central Universities of China . We are grateful to the two anonymous reviewers for their valuable comments and suggestion. This research is jointly funded by National Nature Science Foundation of China (Grant No. 71971178), the Sichuan Provincial Science and Technology Department, China (Grant No. 202010) and the Fundamental Research Funds for the Central Universities of China.
Keywords
- Algorithm
- Frequency-based
- Hyperpath
- Transit assignment
- User equilibrium
ASJC Scopus subject areas
- Business and International Management
- Civil and Structural Engineering
- Transportation
