Optimal Bicycle Routes with Few Signal Stops

Authors Ekkehard Köhler, Markus Rogge, Robert Scheffler , Martin Strehler

Thumbnail PDF


  • Filesize: 0.62 MB
  • 14 pages

Document Identifiers

Author Details

Ekkehard Köhler
  • Institute of Mathematics, Brandenburg University of Technology, Cottbus, Germany
Markus Rogge
  • Institute of Mathematics, Brandenburg University of Technology, Cottbus, Germany
Robert Scheffler
  • Institute of Mathematics, Brandenburg University of Technology, Cottbus, Germany
Martin Strehler
  • Department of Mathematics, Westsächsische Hochschule Zwickau, Germany

Cite AsGet BibTex

Ekkehard Köhler, Markus Rogge, Robert Scheffler, and Martin Strehler. Optimal Bicycle Routes with Few Signal Stops. In 23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023). Open Access Series in Informatics (OASIcs), Volume 115, pp. 1:1-1:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)


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.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Graph algorithms
  • Mathematics of computing → Paths and connectivity problems
  • Applied computing → Transportation
  • Constrained shortest path
  • traffic signals
  • bicycle routes


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, and Maria Grazia Scutellà. Minimum time and minimum cost-path problems in street networks with periodic traffic lights. Transportation Science, 36(3):326-336, 2002. URL: https://doi.org/10.1287/trsc.36.3.326.7827.
  2. Yen-Liang Chen and Hsu-Hao Yang. Minimization of travel time and weighted number of stops in a traffic-light network. European Journal of Operational Research, 144(3):565-580, 2003. URL: https://doi.org/10.1016/S0377-2217(02)00148-0.
  3. Stuart E. Dreyfus. An appraisal of some shortest-path algorithms. Operations Research, 17(3):395-412, 1969. URL: https://doi.org/10.1287/opre.17.3.395.
  4. Michael R. Garey and David S. Johnson. Computers and Intractability. W. H. Freeman, 29th edition, 2002. Google Scholar
  5. Refael Hassin. Approximation schemes for the restricted shortest path problem. Mathematics of Operations research, 17(1):36-42, 1992. URL: https://doi.org/10.1287/moor.17.1.36.
  6. P. B. Hunt, D. I. Robertson, R. D. Bretherton, and R. I. Winton. SCOOT - A traffic responsive method of coordinating signals. Technical Report Report No. LR 1014, Transport and Road Research Lab, Crowthorne, Berkshire, UK, 1981. Google Scholar
  7. Alexander Kleff, Frank Schulz, Jakob Wagenblatt, and Tim Zeitz. Efficient Route Planning with Temporary Driving Bans, Road Closures, and Rated Parking Areas. In Simone Faro and Domenico Cantone, editors, 18th International Symposium on Experimental Algorithms (SEA 2020), volume 160 of LIPIcs, pages 17:1-17:13, Dagstuhl, Germany, 2020. Schloss Dagstuhl-Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.SEA.2020.17.
  8. Ekkehard Köhler and Martin Strehler. Traffic signal optimization: Combining static and dynamic models. Transportation Science, 53(1):21-41, 2019. URL: https://doi.org/10.1287/trsc.2017.0760.
  9. Ekkehard Köhler, Rolf Möhring, Klaus Nökel, and Gregor Wünsch. Optimization of signalized traffic networks. In Mathematics - Key Technology for the Future, pages 179-188. Springer, 2008. URL: https://doi.org/10.1007/978-3-540-77203-3_13.
  10. Ariel Orda and Raphael Rom. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. Journal of the ACM, 37(3):607-625, 1990. URL: https://doi.org/10.1145/79147.214078.
  11. Ariel Orda and Raphael Rom. Minimum weight paths in time-dependent networks. Networks, 21(3):295-319, 1991. URL: https://doi.org/10.1002/net.3230210304.
  12. Dennis I. Robertson. TRANSYT: A traffic network study tool. Technical Report Report No. LR 253, Transport and Road Research Lab, Crowthorne, Berkshire, UK, 1969. Google Scholar
  13. Markus Rogge. Berechnung kürzester Wege unter Berücksichtigung periodischer Ampelschaltungen für FahrradfahrerInnen. Master’s thesis, Brandenburg University of Technology, Cottbus, Germany, 2021. In German. Google Scholar
  14. Robert Scheffler and Martin Strehler. Optimizing traffic signal settings for public transport priority. In Gianlorenzo D'Angelo and Twan Dollevoet, editors, 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017), volume 59 of OASIcs, pages 9:1-9:15, Dagstuhl, Germany, 2017. Schloss Dagstuhl-Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/OASIcs.ATMOS.2017.9.
  15. Ipek N. Sener, Naveen Eluru, and Chandra R. Bhat. An analysis of bicycle route choice preferences in Texas, US. Transportation, 36:511-539, 2009. URL: https://doi.org/10.1007/s11116-009-9201-4.
  16. Liang Shen, Hu Shao, Ting Wu, Emily Zhu Fainman, and William H.K. Lam. Finding the reliable shortest path with correlated link travel times in signalized traffic networks under uncertainty. Transportation Research Part E: Logistics and Transportation Review, 144:102159, 2020. URL: https://doi.org/10.1016/j.tre.2020.102159.
  17. Martin Strehler, Sören Merting, and Christian Schwan. Energy-efficient shortest routes for electric and hybrid vehicles. Transportation Research Part B: Methodological, 103:111-135, 2017. URL: https://doi.org/10.1016/j.trb.2017.03.007.
  18. Dean B. Taylor and Hani S. Mahmassani. Coordinating traffic signals for bicycle progression. Transportation Research Record, 1705(1):85-92, 2000. URL: https://doi.org/10.3141/1705-13.
  19. Tim Zeitz. NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times. Information Processing Letters, 179:106287, 2023. URL: https://doi.org/10.1016/j.ipl.2022.106287.
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail