Skip to main content
Springer Nature Link
Log in

Time-Dependent Route Planning for Truck Drivers

  • Conference paper
  • First Online:
Computational Logistics (ICCL 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10572))

Included in the following conference series:

  • 3859 Accesses

Abstract

We study the problem of computing time-dependent shortest routes for truck drivers. In contrast to conventional route planning, truck drivers have to obey government regulations that impose limits on non-stop driving times. Therefore, route planners must plan break periods in advance and select suitable parking lots. To ensure that maximum driving times are not exceeded, predictable congestion due to, e. g., peak hours should also be taken into account. Therefore, we introduce the truck driver routing problem in time-dependent road networks. It turns out that the combination of time-dependent driving times with constraints imposed by drivers’ working hours requires computation of multiple time-dependent profiles for optimal solutions. Although conceptually simple, profile search is expensive. We greatly reduce (empirical) running times by calculating bounds on arrival and departure times during additional search phases to only query partial profiles and only to a fraction of the parking lots. Carefully integrating this approach with a one-to-many extension of time-dependent contraction hierarchies makes our approach practical. For even faster queries, we also propose a heuristic variant that works very well in practice. Excellent performance of our algorithms is demonstrated on a recent real-world instance of Germany that is much harder than time-dependent instances considered in previous works.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Truck Parking Europe. https://truckparkingeurope.com/

  2. Bast, H., Delling, D., Goldberg, A., Müller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., Werneck, R.F.: Route Planning in transportation networks. In: Kliemann, L., Sanders, P. (eds.) Algorithm Engineering. LNCS, vol. 9220, pp. 19–80. Springer, Cham (2016). doi:10.1007/978-3-319-49487-6_2

    Chapter  Google Scholar 

  3. Batz, G.V., Geisberger, R., Sanders, P., Vetter, C.: Minimum Time-Dependent Travel Times with Contraction Hierarchies. ACM J. Exp. Algorithmics 18, 1.4:1–1.4:43 (2013)

    MathSciNet  MATH  Google Scholar 

  4. Batz, G.V.: KaTCH. https://github.com/GVeitBatz/KaTCH/

  5. Baum, M., Dibbelt, J., Gemsa, A., Wagner, D., Zündorf, T.: Shortest feasible paths with charging stops for battery electric vehicles. In: ACM SIGSPATIAL 2015, pp. 44:1–44:10. ACM (2015)

    Google Scholar 

  6. Baum, M., Dibbelt, J., Pajor, T., Wagner, D.: Dynamic time-dependent route planning in road networks with user preferences. In: Goldberg, A.V., Kulikov, A.S. (eds.) SEA 2016. LNCS, vol. 9685, pp. 33–49. Springer, Cham (2016). doi:10.1007/978-3-319-38851-9_3

    Google Scholar 

  7. Cooke, K.L., Halsey, E.: The Shortest Route Through a Network with Time-Dependent Internodal Transit Times. J. Math. Anal. Appl. 14(3), 493–498 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  8. Dean, B.C.: Algorithms for Minimum-Cost Paths in Time-Dependent Networks with Waiting Policies. Networks 44(1), 41–46 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  9. Delling, D.: Time-Dependent SHARC-Routing. Algorithmica 60(1), 60–94 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  10. Delling, D., Nannicini, G.: Core Routing on Dynamic Time-Dependent Road Networks. Informs J. Comput. 24(2), 187–201 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  11. Delling, D., Wagner, D.: Time-dependent route planning. In: Ahuja, R.K., Möhring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol. 5868, pp. 207–230. Springer, Heidelberg (2009). doi:10.1007/978-3-642-05465-5_8

    Chapter  Google Scholar 

  12. Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numer. Math. 1(1), 269–271 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  13. Drexl, M., Prescott-Gagnon, E.: Labelling Algorithms for the Elementary Shortest Path Problem with Resource Constraints Considering EU Drivers’ Rules. Logistics Research 2(2), 79–96 (2010)

    Article  Google Scholar 

  14. Dreyfus, S.E.: An Appraisal of Some Shortest-Path Algorithms. Oper. Res. 17(3), 395–412 (1969)

    Article  MATH  Google Scholar 

  15. European Parliament, Council of the European Union: Regulation (EC) No. 561/2006 of the European Parliament and of the Council of 15 March 2006 on the harmonisation of certain social legislation relating to road transport and amending Council Regulations (EEC) No. 3821/85 and (EC) No. 2135/98 and repealing Council Regulation (EEC) No. 3820/85. OJ L 102(1), 1–13 (2006)

    Google Scholar 

  16. Federal Motor Carrier Safety Administration: Hours of Service of Drivers. Fed. Reg. 76(248), 81133–81188 (2011)

    Google Scholar 

  17. Foschini, L., Hershberger, J., Suri, S.: On the Complexity of Time-Dependent Shortest Paths. Algorithmica 68(4), 1075–1097 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  18. Franceschetti, A., Honhon, D., Van Woensel, T., Bektaş, T., Laporte, G.: The Time-Dependent Pollution-Routing Problem. Transportation Res. B - Meth. 56, 265–293 (2013)

    Article  Google Scholar 

  19. Geisberger, R., Sanders, P.: Engineering time-dependent many-to-many shortest paths computation. In: ATMOS 2010, OASIcs, vol. 14, pp. 74–87 (2010)

    Google Scholar 

  20. Geisberger, R., Sanders, P., Schultes, D., Vetter, C.: Exact Routing in Large Road Networks Using Contraction Hierarchies. Transport. Sci. 46(3), 388–404 (2012)

    Article  Google Scholar 

  21. Goel, A.: Truck Driver Scheduling in the European Union. Transport. Sci. 44(4), 429–441 (2010)

    Article  Google Scholar 

  22. Goel, A.: Hours of Service Regulations in the United States and the 2013 Rule Change. Transp. Policy 33, 48–55 (2014)

    Article  Google Scholar 

  23. Imai, H., Iri, M.: An Optimal Algorithm for Approximating a Piecewise Linear Function. Journal of Information Processing 9(3), 159–162 (1987)

    MathSciNet  MATH  Google Scholar 

  24. Koç, C., Bektaş, T., Jabali, O., Laporte, G.: A Comparison of Three Idling Options in Long-Haul Truck Scheduling. Transportation Res. B - Meth. 93, 631–647 (2016). Part A

    Article  Google Scholar 

  25. Koç, Ç., Jabali, O., Laporte, G.: Long-Haul Vehicle Routing and Scheduling with Idling Options. J. Oper. Res. Soc. (forthcoming)

    Google Scholar 

  26. Kok, A., Hans, E., Schutten, J.: Optimizing Departure Times in Vehicle Routes. Eur. J. Oper. Res. 210(3), 579–587 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  27. Shah, V.D.: Time Dependent Truck Routing and Driver Scheduling Problem with Hours of Service Regulations. Master’s thesis, Northeastern University (2008)

    Google Scholar 

  28. Sherali, H.D., Ozbay, K., Subramanian, S.: The Time-Dependent Shortest Pair of Disjoint Paths Problem: Complexity, Models, and Algorithms. Networks 31(4), 259–272 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  29. Smith, O.J., Boland, N., Waterer, H.: Solving Shortest Path Problems with a Weight Constraint and Replenishment Arcs. Comput. Oper. Res. 39(5), 964–984 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  30. Strasser, B.: Intriguingly Simple and Efficient Time-Dependent Routing in Road Networks. CoRR abs/1606.06636 (2016)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. PTV Group, Karlsruhe, Germany

    Alexander Kleff, Christian Bräuer & Frank Schulz

  2. Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany

    Alexander Kleff, Christian Bräuer, Valentin Buchhold, Moritz Baum & Dorothea Wagner

Authors
  1. Alexander Kleff
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christian Bräuer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Frank Schulz
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Valentin Buchhold
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Moritz Baum
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Dorothea Wagner
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alexander Kleff .

Editor information

Editors and Affiliations

  1. University of Southampton , Southampton, United Kingdom

    Tolga Bektaş

  2. University of Southampton , Southampton, United Kingdom

    Stefano Coniglio

  3. University of Southampton , Southampton, United Kingdom

    Antonio Martinez-Sykora

  4. University of Hamburg , Hamburg, Germany

    Stefan Voß

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Kleff, A., Bräuer, C., Schulz, F., Buchhold, V., Baum, M., Wagner, D. (2017). Time-Dependent Route Planning for Truck Drivers. In: Bektaş, T., Coniglio, S., Martinez-Sykora, A., Voß, S. (eds) Computational Logistics. ICCL 2017. Lecture Notes in Computer Science(), vol 10572. Springer, Cham. https://doi.org/10.1007/978-3-319-68496-3_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-68496-3_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-68495-6

  • Online ISBN: 978-3-319-68496-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics