Hyperpath-based algorithms for the transit equilibrium assignment problem

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