Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge
The paper introduces two new heuristics for finding the least cost path in a time-varying road network. The performances of the heuristics are compared with a previously published algorithm. The heuristics are tested using real-world traffic data and road networks where a congestion charge scheme is in operation.
minimum cost path time-varying congestion charge heuristic