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.
@InProceedings{delling_et_al:OASIcs.ATMOS.2008.1582, author = {Delling, Daniel and Pajor, Thomas and Wagner, Dorothea}, title = {{Engineering Time-Expanded Graphs for Faster Timetable Information}}, booktitle = {8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08)}, pages = {1--20}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-07-1}, ISSN = {2190-6807}, year = {2008}, volume = {9}, editor = {Fischetti, Matteo and Widmayer, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2008.1582}, URN = {urn:nbn:de:0030-drops-15826}, doi = {10.4230/OASIcs.ATMOS.2008.1582}, annote = {Keywords: Timetable information, shortest path, modeling} }
Feedback for Dagstuhl Publishing