Modeling and optimizing the evacuation of hospitals based on the MRCPSP with resource transfers

In this paper, we consider the problem of hospital evacuation and model it as a multi-mode resource-constrained project scheduling problem (MRCPSP) with additional resource transfers and blockings. Based on this model two heuristic decomposition approaches are proposed. The first uses a tabu search algorithm for the mode assignment problem, the scheduling subproblem is solved by adapted serial and parallel schedule generation schemes using priority rules. The second is based on a decomposition into an evacuation and a routing subproblem where solutions are represented by resource flows. Computational experiments were performed for both approaches using randomly generated instances based on real-world scenarios.

Abstract licence: CC BY-NC-ND

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.