Engineering Time-Expanded Graphs for Faster Timetable Information

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.

• Type: Conference
• Year: 2008
• Where: ATMOS
• Authors: Daniel Delling, Thomas Pajor, Dorothea Wagner
• Keywords: ATMOS 2008, Faster Query Times, Optimization, Unimportant Stations, Well-known Time-expanded Approach