Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge.
Liang WenBülent ÇatayRichard W. EglesePublished in: Eur. J. Oper. Res. (2014)
Keyphrases
- road network
- shortest path
- travel time
- traffic congestion
- minimum cost path
- transportation networks
- moving objects
- minimum cost
- traffic data
- road segments
- optimum path forest
- trajectory data
- urban areas
- delay tolerant
- weight function
- three dimensional
- graph structure
- strongly connected
- pairwise
- lower bound
- video sequences
- traffic conditions
- path planning
- dynamic environments
- map matching