Point-to-point shortest paths on dynamic time-dependent road networks

4OR

Volumn 8, Issue 3, 2010, Pages 327-330

  Nannicini, Giacomo ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Integer programming; Shortest paths; Time dependent graphs

Indexed keywords

EID: 77957313220     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-010-0121-0     Document Type: Article

References (7)

1. Delling D, Sanders P, Schultes D, Wagner D (2009) Engineering route planning algorithms. In: Algorithmics of large and complex networks, vol 5515 of lecture notes in computer science, pp 117-139. Springer.
2. Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1: 269-271.
3. Fischetti M, Lodi A (2003) Local branching. Math Program 98: 23-37.
4. Hansen P, Mladenović N (2001) Variable neighbourhood search: principles and applications. Eur J Oper Res 130: 449-467.
5. Hart EP, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern SSC 4(2): 100-107.
6. Kaufman DE, Smith RL (1993) Fastest paths in time-dependent networks for intelligent vehicle-highway systems application. J Intell Transp Syst 1(1): 1-11.
7. Orda A, Rom R (1990) Shortest-path and minimum delay algorithms in networks with time-dependent edge-length. J ACM 37(3): 607-625.