Scalable Transfer Patterns

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

BAST, Hannah, Matthias HERTEL, Sabine STORANDT, 2016. Scalable Transfer Patterns. ALENEX 2016. Arlington, Virginia, USA, Jan 10, 2016 - Jan 10, 2016. In: GOODRICH, Michael, ed., Michael MITZENMACHER, ed.. Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10, 2016. Philadelphia:Siam, pp. 15-29. ISBN 978-1-61197-431-7. Available under: doi: 10.1137/1.9781611974317.2

@inproceedings{Bast2016Scala-43756, title={Scalable Transfer Patterns}, year={2016}, doi={10.1137/1.9781611974317.2}, isbn={978-1-61197-431-7}, address={Philadelphia}, publisher={Siam}, booktitle={Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10, 2016}, pages={15--29}, editor={Goodrich, Michael and Mitzenmacher, Michael}, author={Bast, Hannah and Hertel, Matthias and Storandt, Sabine} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:contributor>Hertel, Matthias</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:date rdf:datatype="">2018-11-09T10:44:20Z</dc:date> <dcterms:available rdf:datatype="">2018-11-09T10:44:20Z</dcterms:available> <dc:creator>Hertel, Matthias</dc:creator> <bibo:uri rdf:resource=""/> <dc:creator>Storandt, Sabine</dc:creator> <dc:creator>Bast, Hannah</dc:creator> <dcterms:isPartOf rdf:resource=""/> <dc:contributor>Bast, Hannah</dc:contributor> <dspace:isPartOfCollection rdf:resource=""/> <dc:contributor>Storandt, Sabine</dc:contributor> <dcterms:issued>2016</dcterms:issued> <dcterms:title>Scalable Transfer Patterns</dcterms:title> <dc:language>eng</dc:language> <dcterms:abstract xml:lang="eng">We consider the problem of Pareto-optimal route planning in public-transit networks of a whole country, a whole continent, or even the whole world. On such large networks, existing approaches suffer from either a very large space consumption, a very long preprocessing time or slow query processing. Transfer Patterns, a state-of-the-art technique for route planning in transit networks, achieves excellent query times, but the space consumption is large and the preprocessing time is huge. In this paper, we introduce a new scheme for the Transfer Pattern precomputation and query graph construction that reduces both the necessary preprocessing time and space consumption by an order of magnitude and more. Average query times are below 1 ms for local queries, independent of the size of the network, around 30 ms for non-local queries on the complete transit network of Germany, and an estimated 200 ms for a fictitious transit network covering the currently available data of the whole world.</dcterms:abstract> </rdf:Description> </rdf:RDF>

This item appears in the following Collection(s)

Search KOPS


My Account