Congestion Pricing for Schedule-Based Transit Networks
Transportation Science
A simulation approach of fare integration in regional transit services
ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
Finding the K shortest paths in a schedule-based transit network
Computers and Operations Research
| Hi-index | 0.00 |
This paper presents a new graph theoretic framework for the passenger assignment problem that encompasses simultaneously the departure time and the route choice. The implicit FIFO access to transit lines is taken into account by the concept of available capacity. This notion of flow priority has not been considered explicitly in previous models. A traffic equilibrium model is described and a computational procedure based on asymmetric boarding penalty functions is suggested.