I am considering the following problem. We are given a connected undirected graph. Each edge has a length and a waiting time before becoming active. We would like to find the shortest path in expectation.
I would like to now if there has been any work on related problems, that is, shortest path problem in dynamically evolving graphs.