Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem.
Jean-François BérubéJean-Yves PotvinJean G. VaucherPublished in: Comput. Oper. Res. (2006)
Keyphrases
- shortest path
- travel time
- travel planning
- shortest path algorithm
- shortest path problem
- routing algorithm
- finding the shortest path
- travel information
- geodesic distance
- minimum cost flow
- shortest distance
- path length
- weighted graph
- road network
- information retrieval
- goal state
- betweenness centrality
- energy consumption