We propose an algorithm for the point-to-point time-dependent shortest path problem, using which good solutions may be found in a short time; our method provides an upper bound to the number of settled nodes for each shortest path computation, which is highly desirable in some industrial applications. In particular, we address a typical server scenario, where we have to compute point-to-point shortest paths in road networks where arc costs (travelling times) are time-dependent, and where each request has to be provided within an allotted time frame. © Springer-Verlag Berlin Heidelberg 2008.
CITATION STYLE
Nannicini, G., Baptiste, P., Krob, D., & Liberti, L. (2008). Fast computation of point-to-point paths on time-dependent road networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5165 LNCS, pp. 225–234). Springer Verlag. https://doi.org/10.1007/978-3-540-85097-7_21
Mendeley helps you to discover research relevant for your work.