Continuous Dynamic Contraflow Approach for Evacuation Planning

The research in evacuation planning has been very much motivated due to the rapidly increased number of disasters world‐wide. It is the process of shifting maximum number of evacuees from the disastrous areas to the safe destinations as quickly and efficiently as possible. The contraflow model allows the arc reversals that increase the outbound road capacities. In continuous time setting, the dynamic contraflow sends the maximum flow as a flow rate from the sources to the sinks in every moment of time unit. In this paper, we elaborate the mathematical model for the continuous dynamic contraflow problem. Moreover, we present computationally efficient algorithms to solve the different dynamic contraflow problems in continuous time model, for example, maximum dynamic, earliest arrival, lex‐maximum dynamic, earliest arrival transshipment and quickest transshipment contraflows on particulars networks. Here, we study the theoretical development of continuous contraflow approach for evacuation planning issues. The proposed newly presented algorithms with continuous contraflow reconfiguration approach increase the flow value for given time horizon and also decrease the evacuation time needed to transship the given flow value. Here most of the newly proposed methods make use of temporally repeated flows.