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 been developed 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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Exploring pareto routes in multi-criteria urban bicycle routing


    Contributors:
    Song, Qing (author) / Zilecky, Pavol (author) / Jakob, Michal (author) / Hrncir, Jan (author)


    Publication date :

    2014-10-01


    Size :

    2799252 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Highway Route Designation Criteria for Bicycle Routes: Handbook

    W. C. Wilkinson / C. G. Moran | NTIS | 1986


    Practical Multicriteria Urban Bicycle Routing

    Hrncir, Jan | Online Contents | 2016


    Practical Multicriteria Urban Bicycle Routing

    Hrncir, Jan / Zilecky, Pavol / Song, Qing et al. | IEEE | 2017


    Practical Multicriteria Urban Bicycle Routing

    Hrncir, Jan | Online Contents | 2017