Personalized route planning in road networks

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

FUNKE, Stefan, Sabine STORANDT, 2015. Personalized route planning in road networks. 23rd SIGSPATIAL International Conference. Seattle, Washington, Nov 3, 2015 - Nov 6, 2015. In: ALI, Mohamed, ed.. Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems. New York, NY:ACM Press, 45. ISBN 978-1-4503-3967-4. Available under: doi: 10.1145/2820783.2820830

@inproceedings{Funke2015Perso-43829, title={Personalized route planning in road networks}, year={2015}, doi={10.1145/2820783.2820830}, isbn={978-1-4503-3967-4}, address={New York, NY}, publisher={ACM Press}, booktitle={Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems}, editor={Ali, Mohamed}, author={Funke, Stefan and Storandt, Sabine}, note={Article Number: 45} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dcterms:issued>2015</dcterms:issued> <dc:creator>Storandt, Sabine</dc:creator> <dc:contributor>Funke, Stefan</dc:contributor> <bibo:uri rdf:resource=""/> <dc:creator>Funke, Stefan</dc:creator> <dcterms:title>Personalized route planning in road networks</dcterms:title> <dc:contributor>Storandt, Sabine</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:language>eng</dc:language> <dcterms:available rdf:datatype="">2018-11-15T10:40:52Z</dcterms:available> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:date rdf:datatype="">2018-11-15T10:40:52Z</dc:date> <dcterms:isPartOf rdf:resource=""/> <dcterms:abstract xml:lang="eng">Computing shortest paths in road networks with millions of nodes and edges is challenging on its own. In the last few years, several preprocessing-based acceleration techniques have been developed to enable query answering orders of magnitudes faster than a plain Dijkstra computation. But most of these techniques work only if the metric which determines the optimal path is static or rarely changes. In contrast to that, we aim at answering personalized route planning queries. Here, every single query comes with a specification of its very own metric. This increases the combinatorial complexity of the problem significantly. We develop new preprocessing schemes that allow for real-time personalized route planning in huge road networks while keeping the memory footprint of the preprocessed data and subsequent queries small.</dcterms:abstract> <dspace:isPartOfCollection rdf:resource=""/> </rdf:Description> </rdf:RDF>

This item appears in the following Collection(s)

Search KOPS


My Account