Route Planning with Breaks and Truck Driving Bans Using Time-Dependent Contraction Hierarchies

Mandatory breaks for truck drivers are nowadays scheduled after the route has been decided. However, in some cases it is beneficial to plan these breaks during waiting time caused by truck driving bans. Optimally planning a single break considering driving bans can be done using Dijkstra’s algorithm with multiple labels. This has large effects on predicted travel times: 17% of the analysed routes having a night rest obtain an earlier arrival time by 5 hours on average. However, the computation times of this algorithm are long. A novel heuristic version of time-dependent contraction hierarchies leads to significant reductions in computation times from several seconds to several milliseconds per route. Experiments show that the solutions are still optimal for a representative test set consisting of 10,000 route queries.

[1]  Daniel Delling,et al.  SHARC: Fast and robust unidirectional routing , 2008, JEAL.

[2]  Marieke van der Tuin.  Time-dependent earliest arrival routes with drivers legislation and preferences , 2017 .

[3]  E. Polak,et al.  On Multicriteria Optimization , 1976 .

[4]  Nesa L'abbe Wu,et al.  Linear programming and extensions , 1981 .

[5]  Peter Sanders,et al.  Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks , 2008, WEA.

[6]  Karsten Weihe,et al.  On the cardinality of the Pareto set in bicriteria shortest path problems , 2006, Ann. Oper. Res..

[7]  Peter Sanders,et al.  Minimum time-dependent travel times with contraction hierarchies , 2013, JEAL.

[8]  Christian Sommer,et al.  Shortest-path queries in static networks , 2014, ACM Comput. Surv..

[9]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[10]  Pierre Hansen,et al.  Bicriterion Path Problems , 1980 .

[11]  Michel Gendreau,et al.  Vehicle dispatching with time-dependent travel times , 2003, Eur. J. Oper. Res..

[12]  Leo Liberti,et al.  Bidirectional A* Search for Time-Dependent Fast Paths , 2008, WEA.

[13]  Peter Sanders,et al.  Time-Dependent Route Planning with Generalized Objective Functions , 2012, ESA.

[14]  OrdaAriel,et al.  Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990 .

[15]  Andrew V. Goldberg,et al.  Computing the shortest path: A search meets graph theory , 2005, SODA '05.

[16]  Frédéric Semet,et al.  Rich vehicle routing problems: From a taxonomy to a definition , 2015, Eur. J. Oper. Res..

[17]  Herbert Kopfer,et al.  A Dynamic Programming Heuristic for the Vehicle Routing Problem with Time Windows and European Community Social Legislation , 2010, Transp. Sci..