Speedups for Multi-Criteria Urban Bicycle Routing

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Speedups for Multi-Criteria Urban Bicycle Routing

Popis výsledku v původním jazyce

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

Název v anglickém jazyce

Speedups for Multi-Criteria Urban Bicycle Routing

Popis výsledku anglicky

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

Druh

D - Stať ve sborníku

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

<a href="/cs/project/EE2.3.30.0034" target="_blank" >EE2.3.30.0034: Podpora zkvalitnění týmů výzkumu a vývoje a rozvoj intersektorální mobility na ČVUT v Praze</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2015

Kód důvěrnosti údajů

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

Název statě ve sborníku

15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems

ISBN

978-3-939897-99-6

ISSN

2190-6807

e-ISSN

—

Počet stran výsledku

13

Strana od-do

16-28

Název nakladatele

Dagstuhl Publishing,

Místo vydání

Saarbrücken

Místo konání akce

Patras

Datum konání akce

17. 9. 2015

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—