Optimal Paths on Urban Networks Using Travelling Times Prevision.

We deal with an algorithm that, once origin and destination are fixed, individuates the route that permits to reach the destination in the shortest time, respecting an assigned maximal travel time, and with risks measure below a given threshold. A fluid dynamic model for road networks, according to initial car densities on roads and traffic coefficients at junctions, forecasts the future traffic evolution, giving dynamical weights to a constrained K shortest path algorithm. Simulations are performed on a case study to test the efficiency of the proposed procedure. [ABSTRACT FROM AUTHOR]