Free access
Proceedings
2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX)

Connection Scan Accelerated

Abstract

We study the problem of efficiently computing journeys in timetable networks. Our algorithm optimally answers profile queries, computing all journeys given a time interval. Our study demonstrates that queries can be answered optimally on large country-scale timetable networks within several milliseconds and fast delay integration is possible. Previous work either had to drop optimality or only considered comparatively small timetable networks. Our technique is a combination of the Connection Scan Algorithm and multilevel overlay graphs.

Formats available

You can view the full content in the following formats:

Information & Authors

Information

Published In

cover image Proceedings
2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX)
Pages: 125 - 137
Editors: Catherine C. McGeoch, Amherst College, Amherst, MA, USA and Ulrich Meyer, Goethe University Frankfurt am Main, Frankfurt, Germany
ISBN (Online): 978-1-61197-319-8

History

Published online: 18 December 2013

Authors

Affiliations

Notes

*
Partial support by DFG grant WA654/16-2 and EU grant 288094 (eCOMPASS) and Google Focused Research Award.

Metrics & Citations

Metrics

Citations

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited By

There are no citations for this item

View Options

View options

PDF

View PDF

Get Access

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share on social media