With the increasing popularity of cycling as a mode of transportation, there is a growing need for efficient routing algorithms that consider the specific requirements of cyclists. This paper studies the optimization of bicycle routes while minimizing the number of stops at traffic signals. In particular, we consider three different types of stopping strategies and three types of routes, namely paths, trails, and walks. We present hardness results as well as a pseudo-polynomial algorithm for the problem of computing an optimal route with respect to a pre-defined stop bound.


    Access

    Download


    Export, share and cite



    Title :

    Optimal Bicycle Routes with Few Signal Stops


    Contributors:


    Publication date :

    2023-08-31


    Size :

    14 pages , 659083 byte


    Remarks:

    OASIcs, Vol. 115, 23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023), pages 1:1-1:14





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English





    Transit stops on main traffic routes

    Chadwick, C. R. | TIBKAT | 1972


    Walking and bicycle catchment areas of tram stops: factors and insights

    Rijsman, Lotte / van Oort, Niels / Ton, Danique et al. | IEEE | 2019



    Designing a bicycle routes network for Brussels

    Schollaert, U. / IG Velo beider Basel | British Library Conference Proceedings | 1995