Dynamic routing using maximal road capacity

Current routing devices route an individual car driver from start to destination in the shortest time. In this paper we propose a routing algorithm, routing the whole population of car drivers in the shortest time. The algorithm is an adapted dynamic version of the shortest path algorithm of Dijkstra, taking care of current and future changing traffic loads on the highways. To use the maximal road capacity car drivers will be routed not only via the shortest individual route but also via routes with a small variation in traveling time. The algorithm has been tested in real life and simulation studies using a historic dataset of tracked cars.