Maximum throughput flow-based contraflow evacuation routing algorithm

With the combination of vehicular networks and a scalable algorithm, we can expect an effective real-time contraflow evacuation routing. In this paper we define the maximum throughput flow and propose a contraflow evacuation routing algorithm based on reverse shortest paths and maximum throughput flows that can be used for the real-time contraflow evacuation routing. The proposed algorithm computes the contraflow scheme by finding minimal number of shortest paths and hence its computation is highly efficient and scalable. In addition, the evacuation time for the computed contraflow scheme is better than or same as that of CCRP++ with the help of maximum (or at least higher) throughput flows. The computational results confirm the efficiency of the computation and the effectiveness of the computed contraflow schemes.