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

We present an algorithm to find optimal routes in a multi-modal public transportation network. Our 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, we consider the robustness of the provided solutions. In addition we present numerous speed up techniques that reduce both the preprocessing time and storage. Our preliminary experiments on the Sydney transit network are promising.