The contraflow techniques have widely been effective in evacuation planning research. We present effcient algorithms to solve the evacuation network flow problems, namely, the maximum, earliest arrival, quickest and lex-maximum dynamic contraflow problems having constant attributes and their generalizations with partial contraflow reconguration. Moreover, the contraflow models with inflow dependent and load dependent transit times are introduced and presented strongly polynomial time algorithms to compute approximation solutions of the corresponding quickest contraflow problems on two terminal networks with partial reversals of arc capacities. Our results on partial lane reversals should be quite relevant for reducing evacuation time and supporting logistics in emergencies.
Preprint No. 07/2018, TU Bergakademie Freiberg, Department of Mathematics and Computer Science