Efficient Route Planning with Temporary Driving Bans, Road Closures, and Rated Parking Areas

Authors Alexander Kleff , Frank Schulz , Jakob Wagenblatt , Tim Zeitz

Thumbnail PDF


  • Filesize: 0.72 MB
  • 13 pages

Document Identifiers

Author Details

Alexander Kleff
  • PTV Group, Karlsruhe, Germany
Frank Schulz
  • PTV Group, Karlsruhe, Germany
Jakob Wagenblatt
  • Karlsruhe Institute of Technology, Germany
Tim Zeitz
  • Karlsruhe Institute of Technology, Germany

Cite AsGet BibTex

Alexander Kleff, Frank Schulz, Jakob Wagenblatt, and Tim Zeitz. Efficient Route Planning with Temporary Driving Bans, Road Closures, and Rated Parking Areas. In 18th International Symposium on Experimental Algorithms (SEA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 160, pp. 17:1-17:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)


We study the problem of planning routes in road networks when certain streets or areas are closed at certain times. For heavy vehicles, such areas may be very large since many European countries impose temporary driving bans during the night or on weekends. In this setting, feasible routes may require waiting at parking areas, and several feasible routes with different trade-offs between waiting and driving detours around closed areas may exist. We propose a novel model in which driving and waiting are assigned abstract costs, and waiting costs are location-dependent to reflect the different quality of the parking areas. Our goal is to find Pareto-optimal routes with regards to arrival time at the destination and total cost. We investigate the complexity of the model and determine a necessary constraint on the cost parameters such that the problem is solvable in polynomial time. We present a thoroughly engineered implementation and perform experiments on a production-grade real world data set. The experiments show that our implementation can answer realistic queries in around a second or less which makes it feasible for practical application.

Subject Classification

ACM Subject Classification
  • Theory of computation → Shortest paths
  • Mathematics of computing → Graph algorithms
  • Applied computing → Transportation
  • driving bans
  • realistic road networks
  • route planning
  • shortest paths


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


  1. Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, and Renato F. Werneck. Route Planning in Transportation Networks. In Lasse Kliemann and Peter Sanders, editors, Algorithm Engineering - Selected Results and Surveys, volume 9220 of Lecture Notes in Computer Science, pages 19-80. Springer, 2016. URL: http://www.springer.com/gp/book/9783319494869.
  2. Gernot Veit Batz, Robert Geisberger, Peter Sanders, and Christian Vetter. Minimum Time-Dependent Travel Times with Contraction Hierarchies. ACM Journal of Experimental Algorithmics, 18(1.4):1-43, April 2013. Google Scholar
  3. Moritz Baum, Julian Dibbelt, Thomas Pajor, and Dorothea Wagner. Dynamic Time-Dependent Route Planning in Road Networks with User Preferences. In Proceedings of the 15th International Symposium on Experimental Algorithms (SEA'16), volume 9685 of Lecture Notes in Computer Science, pages 33-49. Springer, 2016. URL: http://link.springer.com/chapter/10.1007/978-3-319-38851-9_3.
  4. Christian Bräuer. Route Planning with Temporary Road Closures. Master’s thesis, Karlsruhe Institute of Technology, 2018. Google Scholar
  5. Daniel Delling. Time-Dependent SHARC-Routing. Algorithmica, 60(1):60-94, May 2011. URL: https://doi.org/10.1007/s00453-009-9341-0.
  6. Daniel Delling and Giacomo Nannicini. Core Routing on Dynamic Time-Dependent Road Networks. Informs Journal on Computing, 24(2):187-201, 2012. Google Scholar
  7. Guy Desaulniers and Daniel Villeneuve. The shortest path problem with time windows and linear waiting costs. Transportation Science, 34(3):312-319, 2000. Google Scholar
  8. Julian Dibbelt, Ben Strasser, and Dorothea Wagner. Customizable Contraction Hierarchies. ACM Journal of Experimental Algorithmics, 21(1):1.5:1-1.5:49, April 2016. URL: https://doi.org/10.1145/2886843.
  9. Edsger W. Dijkstra. A Note on Two Problems in Connexion with Graphs. Numerische Mathematik, 1(1):269-271, 1959. Google Scholar
  10. Stuart E. Dreyfus. An Appraisal of Some Shortest-Path Algorithms. Operations Research, 17(3):395-412, 1969. Google Scholar
  11. Robert Geisberger, Peter Sanders, Dominik Schultes, and Christian Vetter. Exact Routing in Large Road Networks Using Contraction Hierarchies. Transportation Science, 46(3):388-404, August 2012. Google Scholar
  12. Peter E. Hart, Nils Nilsson, and Bertram Raphael. A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics, 4:100-107, 1968. Google Scholar
  13. Giacomo Nannicini, Daniel Delling, Leo Liberti, and Dominik Schultes. Bidirectional A* Search on Time-Dependent Road Networks. Networks, 59:240-251, 2012. Best Paper Award. Google Scholar
  14. Ariel Orda and Raphael Rom. Traveling without waiting in time-dependent networks is NP-hard. Technical report, Dept. Electrical Engineering, Technion-Israel Institute of Technology, 1989. Google Scholar
  15. Luigi Di Puglia Pugliese and Francesca Guerriero. A survey of resource constrained shortest path problems: Exact solution approaches. Networks, 62(3):183-200, 2013. Google Scholar
  16. Ben Strasser and Tim Zeitz. A* with perfect potentials, 2019. URL: http://arxiv.org/abs/1910.12526.
  17. Marieke van der Tuin, Mathijs de Weerdt, and Gernot Veit Batz. Route Planning with Breaks and Truck Driving Bans Using Time-Dependent Contraction Hierarchies. In Proceedings of the Twenty-Eigth International Conference on Automated Planning and Scheduling. AAAI Press, 2018. URL: https://www.semanticscholar.org/paper/Route-Planning-with-Breaks-and-Truck-Driving-Bans-Tuin-Weerdt/85c067c0a033f11166d114fcfde093d3250bb8fd.
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