Finding the K shortest paths in a schedule-based transit network
Computers and Operations Research
| Hi-index | 0.00 |
In order to improve the performances of transit modeling and in particular to assess the effects of the introduction of ITS technologies, which imply substantial changes in user behavior, in the last 10 years transit path choice and assignment models that use a schedule-based approach, instead of the traditional frequency-based one, have been developed. This paper presents a schedule-based path choice model for high-frequency transit networks, which allows us to consider the evolution in time of transit services, both within-day and day-to-day, as well as the day-to-day learning process of attributes by which users choose. On the basis of this path choice model a dynamic process assignment model, both within-day and day-to-day (from which the term "doubly dynamic" derives), was developed and tested on a realistically sized network to verify its applicability for operations planning.