[{"type":"paper-conference","title":"Engineering Time-Dependent Many-to-Many Shortest Paths Computation","issued":{"date-parts":[["2010"]]},"page":"74\u201387","container-title":"10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS\u201910)\r\nHrsg.: Thomas Erlebach; Marco L\u00fcbbecke","DOI":"10.4230\/OASIcs.ATMOS.2010.74","author":[{"family":"Geisberger","given":"Robert"},{"family":"Sanders","given":"Peter"}],"publisher":"Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik","publisher-place":"Dagstuhl","ISBN":"978-3-939897-20-0","ISSN":"2190-6807","collection-title":"OpenAccess Series in Informatics","abstract":"Computing distance tables is important for many logistics problems like the vehicle routing problem (VRP). While shortest distances from all source nodes in S to all target nodes in T are time-independent, travel times are not. We present the first efficient algorithms to compute time-dependent travel time tables in large time-dependent road networks. Our algorithms are based on time-dependent contraction hierarchies (TCH), currently the fastest time-dependent speed-up technique. The computation of a table is inherently in Theta(|S|*|T|), and therefore inefficient for large tables. We provide one particular algorithm using only Theta(|S|+|T|) time and space, being able to answer queries two orders of magnitude faster than the basic TCH implementation. If small errors are acceptable, approximate versions of our algorithms are further orders of magnitude faster.","kit-publication-id":"1000097650"}]