Dynamic vehicle routing in road evacuation: A model for route design

Abstract

In this paper the shortest path and route problem in time-dependent networks are treated. The system can be in ordinary or emergency conditions. Path design formulation is based on dynamic programming and its solution is found through a modification of Dijkstra's algorithm. Route design, starting from the designed paths, is formulated as an optimum problem. In emergency conditions the main objective is to optimize emergency vehicle tour to reduce the intervention time or maximize the number of people rescued in a fixed time. © WIT Press.