Finding Multi-criteria Optimal Paths in Multi-modal Public Transportation Networks using the Transit Algorithm

This paper presents an algorithm to find optimal routes in a multi-modal public transportation network. The model takes into account many realistic features such as walking between multi-modal stations, transfer times, traffic days, multiple objectives and finding connections between geographical locations rather than just source and destination stations. In order to provide useful routing directions, the authors consider the robustness of the provided solutions. In addition the authors present numerous speed up techniques that reduce both the preprocessing time and storage. The preliminary experiments on the Sydney transit network are promising.