Dynamic vehicle routing in road evacuation: Route design experimentation

Abstract

In this paper, a shortest paths algorithm to find the paths in a time-dependent network is implemented and tested both on test and real networks. In the application on the real network, the data (obtained with real-time observations) are integrated with forecast data (to define the costs on non-observed network elements) obtained from a dynamic traffic simulation. The real case application is performed in emergency conditions; the aim is to optimize emergency vehicle routes (defined as a path succession) to reduce intervention times. © 2011 WIT Press.