## Shortest Paths in Time-Dependent FIFO Networks Using Edge Load Forecasts (2009)

Citations: | 2 - 0 self |

### BibTeX

@MISC{Dehne09shortestpaths,

author = {Frank Dehne and Masoud T. Omran and Jörg-Rüdiger Sack},

title = {Shortest Paths in Time-Dependent FIFO Networks Using Edge Load Forecasts },

year = {2009}

}

### OpenURL

### Abstract

We study the problem of finding shortest paths in timedependent networks with edge load forecasts where the behavior of each edge is modeled as a time-dependent arrival function with FIFO property. Here, we present a new algorithm that computes for a given start node s and destination node d, the shortest paths and earliest arrival times for all possible starting times. Our algorithm runs in time O((Fd + λ)(|E | + |V |log |V |)) where Fd is the output size (number of linear pieces needed to represent the earliest arrival time function) and λ is the input size (number of linear pieces needed to represent the local earliest arrival time functions for all edges in the network). Our method improves significantly on the best previously known algorithm which requires time O(Fmax|V ||E|) where Fmax ≥ Fd is the maximum number of linear pieces needed to represent the earliest arrival time function between the start node s to any node in the network. It has been conjectured that there are cases where Fmax is of super-polynomial size; however, even in such cases, Fd might still be of linear size. In such cases, our algorithm would take polynomial time to find the solution, while other methods require super-polynomial time. Both of the above methods are not useful in practice for graphs where Fd is of super-polynomial size. For such graphs, we present the first approximation method to compute for all possible starting times at s, the earliest arrival times at d within error at most ǫ. Our algorithm runs in time O ( ∆ (|E | + |V |log |V |)) where ∆ is the difference be-ǫ tween the earliest arrival times at d for the latest and earliest starting times at s.