Evacuation planning by earliest arrival contraflow

Abstract

The very challenging emergency issues because of large scale natural or man-created disasters promote the research on evacuation planning. The earliest arrival contraflow is an important model for evacuation planning that rescue as many evacuees as possible at any point in time by reversing the direction of arcs towards the safe destinations with increased outbound arc capacity. We present efficient algorithms to solve the earliest arrival contraflow problem on multiple sources and on multiple sinks networks separately. We also introduce an approximate-earliest arrival contraflow solution on multi-terminal networks.