Engineering Time-Expanded Graphs for Faster Timetable Information

Authors:
Daniel Delling;Thomas Pajor;Dorothea Wagner
Affiliations:
Department of Computer Science, University of Karlsruhe, Karlsruhe, Germany 76128;Department of Computer Science, University of Karlsruhe, Karlsruhe, Germany 76128;Department of Computer Science, University of Karlsruhe, Karlsruhe, Germany 76128
Venue:
Robust and Online Large-Scale Optimization
Year:
2009

Citing 0
Cited 2

Algorithm engineering for route planning: an update

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Parallel computation of best connections in public transportation networks

Journal of Experimental Algorithmics (JEA)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an extension of the well-known time-expanded approach for timetable information. By remodeling unimportant stations, we are able to obtain faster query times with less space consumption than the original model. Moreover, we show that our extensions harmonize well with speed-up techniques whose adaption to timetable networks is more challenging than one might expect.