Dynamic routing on transit networks with both schedule-based and frequency-based services

Abstract

This article introduces a unified framework for the computation of dynamic shortest paths and hyperpaths on transit networks, where passengers optimize their route choice based on the available information about service performances and reliability. The proposed methodology can be applied in the context of dynamic transit assignment, as well as in the context of point-to-point navigation for passenger trips. In particular, the algorithm implemented in the journey planner HyperPath (www.sistemaits.com) is presented as a convenient specification which allows to address the case of mixed transit services with both schedule-based and frequency-based lines.