Time-dependent shortest paths with discounted waits.
Jérémy OmerMichael PossPublished in: Networks (2019)
Keyphrases
- shortest path
- travel time
- road network
- markov decision processes
- dynamic programming
- shortest path algorithm
- shortest path problem
- finding the shortest path
- infinite horizon
- routing algorithm
- weighted graph
- geodesic distance
- minimum cost flow
- optimal policy
- edge weights
- optimal path
- path length
- flow graph
- shortest distance
- strongly connected components
- average cost