Practical Multicriteria Urban Bicycle Routing

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F17%3A00307168" target="_blank" >RIV/68407700:21230/17:00307168 - isvavai.cz</a>

Výsledek na webu

<a href="http://ieeexplore.ieee.org/document/7519077/" target="_blank" >http://ieeexplore.ieee.org/document/7519077/</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/TITS.2016.2577047" target="_blank" >10.1109/TITS.2016.2577047</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Practical Multicriteria Urban Bicycle Routing

Popis výsledku v původním jazyce

Increasing the adoption of cycling is crucial for achieving more sustainable urban mobility. Navigating larger cities on a bike is, however, often challenging due to the 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 a multicriteria route search is vital for properly accounting for cyclists' route-choice criteria. A direct application of optimal multicriteria route search algorithms is, however, not feasible due to their prohibitive computational complexity. In this paper, we formalize a multicriteria bicycle routing problem and propose several heuristics for speeding up the multicriteria route search. We evaluate our method on a real-world cycleway network and show that speedups of up to four orders of magnitude over the standard multicriteria label-setting algorithm are possible with a reasonable loss of solution quality. Our results make it possible to practically deploy bicycle route planners capable of producing diverse high-quality route suggestions respecting multiple real-world route-choice criteria.

Název v anglickém jazyce

Practical Multicriteria Urban Bicycle Routing

Popis výsledku anglicky

Increasing the adoption of cycling is crucial for achieving more sustainable urban mobility. Navigating larger cities on a bike is, however, often challenging due to the 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 a multicriteria route search is vital for properly accounting for cyclists' route-choice criteria. A direct application of optimal multicriteria route search algorithms is, however, not feasible due to their prohibitive computational complexity. In this paper, we formalize a multicriteria bicycle routing problem and propose several heuristics for speeding up the multicriteria route search. We evaluate our method on a real-world cycleway network and show that speedups of up to four orders of magnitude over the standard multicriteria label-setting algorithm are possible with a reasonable loss of solution quality. Our results make it possible to practically deploy bicycle route planners capable of producing diverse high-quality route suggestions respecting multiple real-world route-choice criteria.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

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í

2017

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 periodika

IEEE Transactions on Intelligent Transportation Systems

ISSN

1524-9050

e-ISSN

1558-0016

Svazek periodika

18

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

12

Strana od-do

493-504

Kód UT WoS článku

000396143200003

EID výsledku v databázi Scopus

2-s2.0-84979255897