SP-TAG: a routing algorithm in non-stationary transportation networks
Betsy George, Shashi Shekhar · 2008
In a transportation network, the network topology and parameters can change with time, resulting in non-stationarity and time-dependent route preferences. Finding shortest routes is one of the most common queries on these time dependent networks. Developing efficient algorithms for computing shortes