Shortest paths in time-dependent FIFO networks using edge load forecasts.
Frank K. H. A. DehneMasoud T. OmranJörg-Rüdiger SackPublished in: GIS-IWCTS (2009)
Keyphrases
- shortest path
- edge weights
- weighted graph
- travel time
- path length
- transportation networks
- shortest path algorithm
- road network
- betweenness centrality
- shortest path problem
- routing algorithm
- spatial networks
- network design
- source node
- finding the shortest path
- strongly connected components
- load balancing
- short term
- edge detection
- minimal surface
- geodesic distance
- flow graph
- graph partitioning
- minimum length
- dynamic programming
- social networks