Re: Time Dependent Shortest Path

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....

chenyan wrote: 
What's the best known algorithm for time dependent shortest path
problems?
The difference compared to normal shortest path problem is the weight
of each edge can be dynamically changing according to time.

.

Relevant Pages

  • Re: suggestions on good steel frame...
    ... The Cross Check is a bit of a pig when the road goes up. ... >> How much weight difference is there then between the two? ... >> on people I can usually ride away from on climbs. ... want to replace it with a cross bike. ...
    (rec.bicycles.tech)
  • Re: Hyd disc question
    ... that suits this cross between XC and Freeride. ... Weight is not the ...
    (alt.mountain-bike)
  • Re: Cheap power 5 cents per unit from the jet stream could supply all world needs
    ... If a 100,000 psi tensile strength steel cable was of uniform cross ... section 7 miles would be too high even assuming the only force was the ... weight of the cable and the cable was vertical. ... Fy at the rotor = weight of the cable + weight of the rotor ...
    (sci.energy)
  • Re: Sat Nav directed me into path of train
    ... But I don't really grant it the weight that some people ... I have managed to cross the line at these sort of crossings ...
    (uk.railway)