Reply: Time dependent shortest path

Shaddin Doghmi wrote:
>you probably need to specify the problem more formally... for
example,
>one way to interpret the problem would be:
>
>time is discrete, and indexed using the natural numbers (starts at
0),
>and the weight of an edge is given by a function f(e,k) where e is
the
>edge and k is the time. Given that it takes 1 time step to cross an
>edge, and one can stand still at a node, what is the shortest
distance
>between two nodes.
>
>different interpretation: it takes f(e,k) timesteps to cross an edge
>starting at time k
>
>can you stand still at a node?
>
>basically, there are different possible formalizations of this....

yes, time is discrete and indexed using the natural numbers, and the
weight of an edge is given by f(e,k). And it takes f(e,k) timesteps to
cross an edge starting at time k, we can stand still at a node. The
goal is to find the minimal time to travel from node s to all the
other nodes starting at time k, one can also wait at node s.

Could you give me some survey about this problems? thanks.
.