Speedups for Multi-Criteria Urban Bicycle Routing

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00232964" target="_blank" >RIV/68407700:21230/15:00232964 - isvavai.cz</a>
Result on the web
<a href="http://drops.dagstuhl.de/opus/volltexte/oasics-complete/oasics-vol48-atmos2015-complete.pdf" target="_blank" >http://drops.dagstuhl.de/opus/volltexte/oasics-complete/oasics-vol48-atmos2015-complete.pdf</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4230/OASIcs.ATMOS.2015.16" target="_blank" >10.4230/OASIcs.ATMOS.2015.16</a>

Result language
angličtina
Original language name
Speedups for Multi-Criteria Urban Bicycle Routing
Original language description
Increasing the adoption of cycling is crucial for achieving more sustainable urban mobility. Nav- igating larger cities on a bike is, however, often challenging due to cities? fragmented cycling infrastructure and/or complex terrain topology. Cyclists would thus benefit from intelligent route planning that would help them discover routes that best suit their transport needs and preferences. Because of the many factors cyclists consider in deciding their routes, employing multi-criteria route search is vital for properly accounting for cyclists? route-choice criteria. Dir- ect application of optimal multi-criteria route search algorithms is, however, not feasible due to their prohibitive computational complexity. In this paper, we therefore propose several heuristice for speeding up multi-criteria route search. We evaluate our method on a real-world cycleway net- work and show that speedups of up to four orders of magnitude over the standard multi-criteria label-setting algorithm are po
Czech name
—
Czech description
—

Project
<a href="/en/project/EE2.3.30.0034" target="_blank" >EE2.3.30.0034: Support of inter-sectoral mobility and quality enhancement of research teams at Czech Technical University in Prague</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems
ISBN
978-3-939897-99-6
ISSN
2190-6807
e-ISSN
—
Number of pages
13
Pages from-to
16-28
Publisher name
Dagstuhl Publishing,
Place of publication
Saarbrücken
Event location
Patras
Event date
Sep 17, 2015
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)