Algorithms to find shortest and alternative paths in free flow and congested traffic regimes

•Two novel algorithms speed up the solution of the All Pair Shortest Paths problem.•These algorithms can be parallelized.•A fast recalculation of the shortest paths is done if travel times change suddenly.•Alternative routes to avoid remaining trapped in the traffic jams are computed.