Exploring Pareto Routes in 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%2F14%3A00223713" target="_blank" >RIV/68407700:21230/14:00223713 - isvavai.cz</a>

Výsledek na webu

<a href="http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=6957951" target="_blank" >http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=6957951</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Exploring Pareto Routes in Multi-Criteria Urban Bicycle Routing

Popis výsledku v původním jazyce

To properly account for a broad range of routechoice factors in bicycle route planning, a multi-criteria optimization framework is needed. Unfortunately, in contrast to other categories of routing problems, optimal multi-criteria search has not yet beendeveloped for bicycle routing. In this paper, we address this gap and provide a multi-criteria formulation of the bicycle routing problem and an optimum multi-label correcting algorithm for finding a full set of Pareto routes. To reduce the potentially very large number of Pareto solutions, we introduce a route selection algorithm, based on hierarchical clustering, for extracting a small representative subset of Pareto routes. We empirically evaluate our approach on a real-world cycleway network. We explore the size and structure of the set of Pareto routes and demonstrate the capability of our method to generate a practical set of bicycle routes in realistic conditions.

Název v anglickém jazyce

Exploring Pareto Routes in Multi-Criteria Urban Bicycle Routing

Popis výsledku anglicky

To properly account for a broad range of routechoice factors in bicycle route planning, a multi-criteria optimization framework is needed. Unfortunately, in contrast to other categories of routing problems, optimal multi-criteria search has not yet beendeveloped for bicycle routing. In this paper, we address this gap and provide a multi-criteria formulation of the bicycle routing problem and an optimum multi-label correcting algorithm for finding a full set of Pareto routes. To reduce the potentially very large number of Pareto solutions, we introduce a route selection algorithm, based on hierarchical clustering, for extracting a small representative subset of Pareto routes. We empirically evaluate our approach on a real-world cycleway network. We explore the size and structure of the set of Pareto routes and demonstrate the capability of our method to generate a practical set of bicycle routes in realistic conditions.

Druh

D - Stať ve sborníku

CEP obor

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

OECD FORD obor

—

Projekt

<a href="/cs/project/7E12065" target="_blank" >7E12065: SUstainable and PERsuasive Human Users moBility in future cities</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2014

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

Proceedings of the 17th International Conference on Intelligent Transportation Systems

ISBN

978-1-4799-6078-1

ISSN

—

e-ISSN

—

Počet stran výsledku

7

Strana od-do

1781-1787

Název nakladatele

IEEE

Místo vydání

Piscataway

Místo konání akce

Qingdao

Datum konání akce

8. 10. 2014

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

WRD - Celosvětová akce

Kód UT WoS článku

—