Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning

In this paper we combine two modeling tools to predict and evaluate evacuation plans: (dynamic) network flows and locational analysis. We present three exact algorithms to solve the single facility version 1‐FlowLoc of this problem and compare their running times. After proving the $\mathrm{𝒩𝒫}$ ‐completeness of the multi facility q‐FlowLoc problem, a mixed integer programming formulation and a heuristic for q‐FlowLoc are proposed. The paper is concluded by discussing some generalizations of the FlowLoc problem, such as the multi‐terminal problem, interdiction problem, the parametric problem and the generalization of the FlowLoc problem to matroids.