A robust possibilistic programming approach to multiperiod hospital evacuation planning problem under uncertainty

Abstract

Abstract In this paper, a biobjective programming model is developed to address the hospital evacuation problem under uncertainty. It aims to concurrently minimize the total evacuation time and the total weighted number of unevacuated patients in each period. The presented model considers two types of patients and three transportation modes. Moreover, the evacuating hospitals are divided into two groups. In the first group, it is not possible to send vehicles to the evacuating hospitals due to the poor road condition or congestion, whereas there is no such limitation in the second group. A robust possibilistic programming approach is adopted to deal with the inherent uncertainty in the input data. To cope with the computational complexity of the problem, two well‐known metaheuristic algorithms are developed to solve the large‐sized problems. Finally, several computational experiments and sensitivity analyses are conducted and the results are analyzed.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 41 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.