Table of Contents Author Guidelines Submit a Manuscript
Modelling and Simulation in Engineering
Volume 2012, Article ID 564168, 9 pages
Research Article

Optimal Paths on Urban Networks Using Travelling Times Prevision

Università degli Studi di Salerno, Via Ponte Don Melillo, 84084 Fisciano, Italy

Received 5 October 2011; Accepted 17 November 2011

Academic Editor: A. Mohamed

Copyright © 2012 Alfredo Cutolo et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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 𝐾 shortest path algorithm. Simulations are performed on a case study to test the efficiency of the proposed procedure.