@inproceedings{47aeb4dd8cf24f7aa5bb0e93cc278443,
title = "Fast computation of point-to-point paths on time-dependent road networks",
abstract = "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.",
author = "Giacomo Nannicini and Philippe Baptiste and Daniel Krob and Leo Liberti",
year = "2008",
month = jan,
day = "1",
doi = "10.1007/978-3-540-85097-7\_21",
language = "English",
isbn = "3540850961",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "225--234",
booktitle = "Combinatorial Optimization and Applications - Second International Conference, COCOA 2008, Proceedings",
note = "2nd International Conference on Combinatorial Optimization and Applications, COCOA 2008 ; Conference date: 21-08-2008 Through 24-08-2008",
}